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-call1_true-termination.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2d08e6e [2018-10-15 12:55:21,360 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 12:55:21,362 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 12:55:21,382 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 12:55:21,382 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 12:55:21,384 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 12:55:21,387 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 12:55:21,390 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 12:55:21,392 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 12:55:21,393 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 12:55:21,396 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 12:55:21,396 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 12:55:21,397 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 12:55:21,398 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 12:55:21,399 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 12:55:21,409 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 12:55:21,410 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 12:55:21,414 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 12:55:21,416 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 12:55:21,417 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 12:55:21,419 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 12:55:21,420 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 12:55:21,422 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 12:55:21,422 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 12:55:21,422 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 12:55:21,423 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 12:55:21,424 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 12:55:21,425 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 12:55:21,426 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 12:55:21,427 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 12:55:21,427 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 12:55:21,428 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 12:55:21,428 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 12:55:21,428 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 12:55:21,429 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 12:55:21,430 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 12:55:21,430 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,447 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 12:55:21,447 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 12:55:21,449 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 12:55:21,449 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 12:55:21,449 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 12:55:21,449 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 12:55:21,451 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 12:55:21,451 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 12:55:21,452 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 12:55:21,454 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 12:55:21,454 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 12:55:21,454 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 12:55:21,454 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 12:55:21,455 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 12:55:21,456 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 12:55:21,531 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 12:55:21,543 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 12:55:21,547 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 12:55:21,548 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 12:55:21,549 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 12:55:21,549 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/array_true-unreach-call1_true-termination.i_3.bpl [2018-10-15 12:55:21,550 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/array_true-unreach-call1_true-termination.i_3.bpl' [2018-10-15 12:55:21,602 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 12:55:21,604 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-15 12:55:21,604 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 12:55:21,605 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 12:55:21,605 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 12:55:21,632 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:21" (1/1) ... [2018-10-15 12:55:21,634 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:21" (1/1) ... [2018-10-15 12:55:21,648 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:21" (1/1) ... [2018-10-15 12:55:21,649 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:21" (1/1) ... [2018-10-15 12:55:21,652 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:21" (1/1) ... [2018-10-15 12:55:21,654 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:21" (1/1) ... [2018-10-15 12:55:21,655 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:21" (1/1) ... [2018-10-15 12:55:21,657 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 12:55:21,658 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 12:55:21,658 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 12:55:21,659 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 12:55:21,660 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array_true-unreach-call1_true-termination.i_3.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,721 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-15 12:55:21,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 12:55:21,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 12:55:22,291 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 12:55:22,292 INFO L202 PluginConnector]: Adding new model array_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:55:22 BoogieIcfgContainer [2018-10-15 12:55:22,292 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 12:55:22,292 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-15 12:55:22,293 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-15 12:55:22,294 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-15 12:55:22,297 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "array_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:55:22" (1/1) ... [2018-10-15 12:55:22,304 INFO L137 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-10-15 12:55:22,305 INFO L138 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-10-15 12:55:22,339 INFO L191 apSepIcfgTransformer]: Heap separator: starting loc-array-style preprocessing [2018-10-15 12:55:22,381 INFO L219 apSepIcfgTransformer]: finished MemlocArrayUpdater [2018-10-15 12:55:22,396 INFO L282 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-10-15 12:55:22,466 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=1) [2018-10-15 12:55:25,265 INFO L315 AbstractInterpreter]: Visited 36 different actions 74 times. Merged at 18 different actions 36 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-10-15 12:55:25,270 INFO L306 apSepIcfgTransformer]: finished equality analysis [2018-10-15 12:55:25,274 INFO L318 apSepIcfgTransformer]: Finished detection of select terms ("array reads") [2018-10-15 12:55:25,285 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select |#loc_#memory_int_(Array-Int-#locsort1)| |v_ULTIMATE.start_read~int_#ptr.base_2|) at (assume read~int_#value == #memory_int[read~int_#ptr.base][read~int_#ptr.offset];) [2018-10-15 12:55:25,289 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,312 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select |v_#locv_ULTIMATE.start_write~int_old_#memory_int_2_1_1| |v_ULTIMATE.start_write~int_#ptr.base_2|) at (assume write~int_old_#memory_int[write~int_#ptr.base := write~int_old_#memory_int[write~int_#ptr.base][write~int_#ptr.offset := write~int_#value]] == #memory_int;) [2018-10-15 12:55:25,313 INFO L232 HeapPartitionManager]: partitioning result: [2018-10-15 12:55:25,314 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-15 12:55:25,314 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-15 12:55:25,315 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-15 12:55:25,315 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-15 12:55:25,315 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-15 12:55:25,316 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-15 12:55:25,316 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-15 12:55:25,316 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-15 12:55:25,316 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-15 12:55:25,316 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-15 12:55:25,317 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-15 12:55:25,317 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-15 12:55:25,317 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-15 12:55:25,319 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-15 12:55:25,321 INFO L145 ransitionTransformer]: executing heap partitioning transformation [2018-10-15 12:55:25,339 INFO L202 PluginConnector]: Adding new model array_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 12:55:25 BasicIcfg [2018-10-15 12:55:25,339 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-15 12:55:25,341 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 12:55:25,341 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 12:55:25,346 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 12:55:25,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:21" (1/3) ... [2018-10-15 12:55:25,347 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22a84a22 and model type array_true-unreach-call1_true-termination.i_3.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,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:55:22" (2/3) ... [2018-10-15 12:55:25,348 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22a84a22 and model type array_true-unreach-call1_true-termination.i_3.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,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array_true-unreach-call1_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 12:55:25" (3/3) ... [2018-10-15 12:55:25,350 INFO L112 eAbstractionObserver]: Analyzing ICFG memPartitionedIcfg [2018-10-15 12:55:25,363 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 12:55:25,372 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 12:55:25,392 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 12:55:25,422 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 12:55:25,423 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 12:55:25,423 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 12:55:25,423 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 12:55:25,425 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 12:55:25,425 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 12:55:25,425 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 12:55:25,425 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 12:55:25,425 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 12:55:25,441 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-10-15 12:55:25,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-15 12:55:25,454 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:25,455 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] [2018-10-15 12:55:25,457 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:25,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:25,466 INFO L82 PathProgramCache]: Analyzing trace with hash 84663218, now seen corresponding path program 1 times [2018-10-15 12:55:25,538 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:25,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:25,730 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:25,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 12:55:25,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 12:55:25,742 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 12:55:25,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 12:55:25,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 12:55:25,760 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 3 states. [2018-10-15 12:55:25,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:25,953 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-10-15 12:55:25,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 12:55:25,957 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-10-15 12:55:25,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:25,971 INFO L225 Difference]: With dead ends: 41 [2018-10-15 12:55:25,971 INFO L226 Difference]: Without dead ends: 41 [2018-10-15 12:55:25,973 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,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-15 12:55:26,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 35. [2018-10-15 12:55:26,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-15 12:55:26,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-10-15 12:55:26,076 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 26 [2018-10-15 12:55:26,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:26,076 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-10-15 12:55:26,076 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 12:55:26,077 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-10-15 12:55:26,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-15 12:55:26,078 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:26,078 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] [2018-10-15 12:55:26,078 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:26,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:26,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1103678138, now seen corresponding path program 1 times [2018-10-15 12:55:26,080 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:26,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:26,260 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,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:26,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-15 12:55:26,262 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 12:55:26,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 12:55:26,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-15 12:55:26,263 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 5 states. [2018-10-15 12:55:26,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:26,700 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-10-15 12:55:26,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-15 12:55:26,701 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-10-15 12:55:26,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:26,703 INFO L225 Difference]: With dead ends: 49 [2018-10-15 12:55:26,703 INFO L226 Difference]: Without dead ends: 49 [2018-10-15 12:55:26,704 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:26,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-15 12:55:26,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2018-10-15 12:55:26,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-15 12:55:26,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-10-15 12:55:26,711 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 34 [2018-10-15 12:55:26,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:26,711 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-10-15 12:55:26,711 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 12:55:26,712 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-10-15 12:55:26,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-15 12:55:26,713 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:26,713 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:26,713 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:26,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:26,714 INFO L82 PathProgramCache]: Analyzing trace with hash -2008403518, now seen corresponding path program 2 times [2018-10-15 12:55:26,715 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:26,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:26,997 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:26,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:26,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-15 12:55:26,998 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-15 12:55:26,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-15 12:55:26,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-15 12:55:26,999 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 7 states. [2018-10-15 12:55:27,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:27,156 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-10-15 12:55:27,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-15 12:55:27,156 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2018-10-15 12:55:27,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:27,158 INFO L225 Difference]: With dead ends: 57 [2018-10-15 12:55:27,158 INFO L226 Difference]: Without dead ends: 57 [2018-10-15 12:55:27,159 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-10-15 12:55:27,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-15 12:55:27,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2018-10-15 12:55:27,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-15 12:55:27,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-10-15 12:55:27,165 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 42 [2018-10-15 12:55:27,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:27,165 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-10-15 12:55:27,165 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-15 12:55:27,166 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-10-15 12:55:27,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-15 12:55:27,167 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:27,167 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:27,168 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:27,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:27,168 INFO L82 PathProgramCache]: Analyzing trace with hash -392687414, now seen corresponding path program 3 times [2018-10-15 12:55:27,169 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:27,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:27,418 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:27,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:27,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-15 12:55:27,419 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 12:55:27,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 12:55:27,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-10-15 12:55:27,420 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 9 states. [2018-10-15 12:55:27,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:27,771 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-10-15 12:55:27,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-15 12:55:27,772 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2018-10-15 12:55:27,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:27,774 INFO L225 Difference]: With dead ends: 65 [2018-10-15 12:55:27,774 INFO L226 Difference]: Without dead ends: 65 [2018-10-15 12:55:27,776 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:27,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-10-15 12:55:27,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 59. [2018-10-15 12:55:27,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-15 12:55:27,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-10-15 12:55:27,782 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 50 [2018-10-15 12:55:27,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:27,783 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-10-15 12:55:27,783 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 12:55:27,783 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-10-15 12:55:27,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-15 12:55:27,784 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:27,785 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:27,785 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:27,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:27,785 INFO L82 PathProgramCache]: Analyzing trace with hash -356882478, now seen corresponding path program 4 times [2018-10-15 12:55:27,786 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:27,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:28,302 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:28,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:28,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 12:55:28,304 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 12:55:28,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 12:55:28,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-10-15 12:55:28,304 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 11 states. [2018-10-15 12:55:28,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:28,682 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-10-15 12:55:28,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-15 12:55:28,683 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2018-10-15 12:55:28,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:28,685 INFO L225 Difference]: With dead ends: 73 [2018-10-15 12:55:28,685 INFO L226 Difference]: Without dead ends: 73 [2018-10-15 12:55:28,686 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=123, Invalid=219, Unknown=0, NotChecked=0, Total=342 [2018-10-15 12:55:28,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-10-15 12:55:28,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 67. [2018-10-15 12:55:28,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-15 12:55:28,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-10-15 12:55:28,692 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 58 [2018-10-15 12:55:28,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:28,692 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-10-15 12:55:28,692 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 12:55:28,693 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-10-15 12:55:28,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-15 12:55:28,694 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:28,694 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:28,694 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:28,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:28,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1900464422, now seen corresponding path program 5 times [2018-10-15 12:55:28,696 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:28,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:28,934 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:28,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:28,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-15 12:55:28,935 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-15 12:55:28,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-15 12:55:28,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-10-15 12:55:28,936 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 13 states. [2018-10-15 12:55:29,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:29,399 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-10-15 12:55:29,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-15 12:55:29,399 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 66 [2018-10-15 12:55:29,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:29,401 INFO L225 Difference]: With dead ends: 81 [2018-10-15 12:55:29,402 INFO L226 Difference]: Without dead ends: 81 [2018-10-15 12:55:29,404 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:29,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-10-15 12:55:29,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 75. [2018-10-15 12:55:29,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-15 12:55:29,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-10-15 12:55:29,409 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 66 [2018-10-15 12:55:29,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:29,410 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-10-15 12:55:29,410 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-15 12:55:29,410 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-10-15 12:55:29,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-15 12:55:29,411 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:29,411 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:29,412 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:29,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:29,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1285324258, now seen corresponding path program 6 times [2018-10-15 12:55:29,413 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:29,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:29,617 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:29,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:29,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 12:55:29,618 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 12:55:29,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 12:55:29,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-10-15 12:55:29,619 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 15 states. [2018-10-15 12:55:29,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:29,892 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-10-15 12:55:29,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-15 12:55:29,893 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 74 [2018-10-15 12:55:29,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:29,894 INFO L225 Difference]: With dead ends: 89 [2018-10-15 12:55:29,895 INFO L226 Difference]: Without dead ends: 89 [2018-10-15 12:55:29,896 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:29,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-10-15 12:55:29,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2018-10-15 12:55:29,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-10-15 12:55:29,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-10-15 12:55:29,903 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 74 [2018-10-15 12:55:29,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:29,903 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-10-15 12:55:29,903 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 12:55:29,903 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-10-15 12:55:29,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-15 12:55:29,905 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:29,907 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:29,907 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:29,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:29,908 INFO L82 PathProgramCache]: Analyzing trace with hash 342637802, now seen corresponding path program 7 times [2018-10-15 12:55:29,908 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:29,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:30,150 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 0 proven. 175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:30,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:30,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-15 12:55:30,151 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-15 12:55:30,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-15 12:55:30,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2018-10-15 12:55:30,151 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 17 states. [2018-10-15 12:55:30,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:30,440 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-10-15 12:55:30,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-15 12:55:30,441 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 82 [2018-10-15 12:55:30,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:30,442 INFO L225 Difference]: With dead ends: 97 [2018-10-15 12:55:30,442 INFO L226 Difference]: Without dead ends: 97 [2018-10-15 12:55:30,443 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=318, Invalid=612, Unknown=0, NotChecked=0, Total=930 [2018-10-15 12:55:30,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-10-15 12:55:30,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 91. [2018-10-15 12:55:30,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-10-15 12:55:30,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-10-15 12:55:30,449 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 82 [2018-10-15 12:55:30,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:30,449 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-10-15 12:55:30,449 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-15 12:55:30,450 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-10-15 12:55:30,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-15 12:55:30,451 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:30,451 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:30,452 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:30,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:30,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1311798258, now seen corresponding path program 8 times [2018-10-15 12:55:30,453 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:30,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:30,713 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 0 proven. 232 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:30,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:30,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-15 12:55:30,714 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-15 12:55:30,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-15 12:55:30,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2018-10-15 12:55:30,714 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 19 states. [2018-10-15 12:55:31,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:31,400 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-10-15 12:55:31,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-15 12:55:31,400 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 90 [2018-10-15 12:55:31,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:31,401 INFO L225 Difference]: With dead ends: 105 [2018-10-15 12:55:31,402 INFO L226 Difference]: Without dead ends: 105 [2018-10-15 12:55:31,403 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:31,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-10-15 12:55:31,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 99. [2018-10-15 12:55:31,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-10-15 12:55:31,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-10-15 12:55:31,409 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 90 [2018-10-15 12:55:31,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:31,409 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-10-15 12:55:31,409 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-15 12:55:31,409 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-10-15 12:55:31,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-10-15 12:55:31,411 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:31,411 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:31,411 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:31,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:31,412 INFO L82 PathProgramCache]: Analyzing trace with hash -638508294, now seen corresponding path program 9 times [2018-10-15 12:55:31,412 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:31,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:31,897 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:31,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:31,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 12:55:31,898 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 12:55:31,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 12:55:31,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2018-10-15 12:55:31,898 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 21 states. [2018-10-15 12:55:32,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:32,331 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-10-15 12:55:32,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-15 12:55:32,332 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 98 [2018-10-15 12:55:32,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:32,333 INFO L225 Difference]: With dead ends: 113 [2018-10-15 12:55:32,333 INFO L226 Difference]: Without dead ends: 113 [2018-10-15 12:55:32,335 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=498, Invalid=984, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 12:55:32,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-10-15 12:55:32,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 107. [2018-10-15 12:55:32,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-10-15 12:55:32,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-10-15 12:55:32,340 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 98 [2018-10-15 12:55:32,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:32,341 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-10-15 12:55:32,341 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 12:55:32,341 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-10-15 12:55:32,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-15 12:55:32,342 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:32,343 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:32,343 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:32,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:32,343 INFO L82 PathProgramCache]: Analyzing trace with hash 263604738, now seen corresponding path program 10 times [2018-10-15 12:55:32,344 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:32,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:32,686 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 0 proven. 370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:32,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:32,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-15 12:55:32,687 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-15 12:55:32,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-15 12:55:32,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2018-10-15 12:55:32,688 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 23 states. [2018-10-15 12:55:33,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:33,177 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-10-15 12:55:33,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-15 12:55:33,178 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 106 [2018-10-15 12:55:33,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:33,179 INFO L225 Difference]: With dead ends: 121 [2018-10-15 12:55:33,179 INFO L226 Difference]: Without dead ends: 121 [2018-10-15 12:55:33,181 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=603, Invalid=1203, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 12:55:33,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-10-15 12:55:33,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 115. [2018-10-15 12:55:33,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-10-15 12:55:33,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-10-15 12:55:33,186 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 106 [2018-10-15 12:55:33,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:33,186 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-10-15 12:55:33,186 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-15 12:55:33,187 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-10-15 12:55:33,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-10-15 12:55:33,188 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:33,189 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:33,189 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:33,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:33,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1081612022, now seen corresponding path program 11 times [2018-10-15 12:55:33,190 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:33,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:33,569 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 0 proven. 451 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:33,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:33,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-15 12:55:33,570 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-15 12:55:33,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-15 12:55:33,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2018-10-15 12:55:33,571 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 25 states. [2018-10-15 12:55:34,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:34,198 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-10-15 12:55:34,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-15 12:55:34,199 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 114 [2018-10-15 12:55:34,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:34,201 INFO L225 Difference]: With dead ends: 129 [2018-10-15 12:55:34,201 INFO L226 Difference]: Without dead ends: 129 [2018-10-15 12:55:34,202 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=718, Invalid=1444, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 12:55:34,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-10-15 12:55:34,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 123. [2018-10-15 12:55:34,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-10-15 12:55:34,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-10-15 12:55:34,208 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 114 [2018-10-15 12:55:34,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:34,209 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-10-15 12:55:34,209 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-15 12:55:34,209 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-10-15 12:55:34,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-15 12:55:34,211 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:34,211 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:34,211 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:34,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:34,212 INFO L82 PathProgramCache]: Analyzing trace with hash 829292562, now seen corresponding path program 12 times [2018-10-15 12:55:34,213 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:34,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:34,728 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 0 proven. 540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:34,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:34,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 12:55:34,729 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 12:55:34,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 12:55:34,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2018-10-15 12:55:34,730 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 27 states. [2018-10-15 12:55:35,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:35,496 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2018-10-15 12:55:35,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-15 12:55:35,496 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 122 [2018-10-15 12:55:35,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:35,498 INFO L225 Difference]: With dead ends: 137 [2018-10-15 12:55:35,498 INFO L226 Difference]: Without dead ends: 137 [2018-10-15 12:55:35,499 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=843, Invalid=1707, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 12:55:35,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-10-15 12:55:35,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 131. [2018-10-15 12:55:35,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-10-15 12:55:35,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-10-15 12:55:35,504 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 122 [2018-10-15 12:55:35,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:35,504 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-10-15 12:55:35,504 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 12:55:35,504 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-10-15 12:55:35,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-15 12:55:35,506 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:35,506 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:35,506 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:35,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:35,507 INFO L82 PathProgramCache]: Analyzing trace with hash 628133658, now seen corresponding path program 13 times [2018-10-15 12:55:35,508 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:35,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:36,638 INFO L134 CoverageAnalysis]: Checked inductivity of 637 backedges. 0 proven. 637 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:36,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:36,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 12:55:36,639 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 12:55:36,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 12:55:36,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=588, Unknown=0, NotChecked=0, Total=812 [2018-10-15 12:55:36,640 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 29 states. [2018-10-15 12:55:37,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:37,707 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2018-10-15 12:55:37,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-15 12:55:37,707 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 130 [2018-10-15 12:55:37,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:37,709 INFO L225 Difference]: With dead ends: 145 [2018-10-15 12:55:37,709 INFO L226 Difference]: Without dead ends: 145 [2018-10-15 12:55:37,711 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=978, Invalid=1992, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 12:55:37,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-10-15 12:55:37,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 139. [2018-10-15 12:55:37,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-10-15 12:55:37,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2018-10-15 12:55:37,714 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 130 [2018-10-15 12:55:37,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:37,714 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2018-10-15 12:55:37,715 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 12:55:37,715 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2018-10-15 12:55:37,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-10-15 12:55:37,716 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:37,716 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:37,716 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:37,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:37,717 INFO L82 PathProgramCache]: Analyzing trace with hash -745040350, now seen corresponding path program 14 times [2018-10-15 12:55:37,717 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:37,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:38,125 INFO L134 CoverageAnalysis]: Checked inductivity of 742 backedges. 0 proven. 742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:38,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:38,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 12:55:38,126 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 12:55:38,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 12:55:38,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2018-10-15 12:55:38,127 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 31 states. [2018-10-15 12:55:38,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:38,753 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-10-15 12:55:38,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-15 12:55:38,753 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 138 [2018-10-15 12:55:38,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:38,755 INFO L225 Difference]: With dead ends: 153 [2018-10-15 12:55:38,755 INFO L226 Difference]: Without dead ends: 153 [2018-10-15 12:55:38,757 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1123, Invalid=2299, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 12:55:38,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-10-15 12:55:38,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 147. [2018-10-15 12:55:38,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-10-15 12:55:38,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-10-15 12:55:38,761 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 138 [2018-10-15 12:55:38,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:38,761 INFO L481 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-10-15 12:55:38,761 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 12:55:38,762 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-10-15 12:55:38,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-10-15 12:55:38,762 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:38,763 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:38,763 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:38,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:38,763 INFO L82 PathProgramCache]: Analyzing trace with hash -336915158, now seen corresponding path program 15 times [2018-10-15 12:55:38,764 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:38,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:39,275 INFO L134 CoverageAnalysis]: Checked inductivity of 855 backedges. 0 proven. 855 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:39,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:39,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 12:55:39,276 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 12:55:39,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 12:55:39,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 12:55:39,277 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 33 states. [2018-10-15 12:55:39,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:39,993 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2018-10-15 12:55:39,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-15 12:55:39,994 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 146 [2018-10-15 12:55:39,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:39,996 INFO L225 Difference]: With dead ends: 161 [2018-10-15 12:55:39,996 INFO L226 Difference]: Without dead ends: 161 [2018-10-15 12:55:39,997 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1278, Invalid=2628, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 12:55:39,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-10-15 12:55:40,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 155. [2018-10-15 12:55:40,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-10-15 12:55:40,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2018-10-15 12:55:40,001 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 146 [2018-10-15 12:55:40,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:40,001 INFO L481 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2018-10-15 12:55:40,001 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 12:55:40,001 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2018-10-15 12:55:40,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-15 12:55:40,002 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:40,002 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:40,002 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:40,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:40,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1770845134, now seen corresponding path program 16 times [2018-10-15 12:55:40,003 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:40,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:40,586 INFO L134 CoverageAnalysis]: Checked inductivity of 976 backedges. 0 proven. 976 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:40,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:40,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 12:55:40,587 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 12:55:40,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 12:55:40,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 12:55:40,588 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 35 states. [2018-10-15 12:55:41,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:41,396 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2018-10-15 12:55:41,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-15 12:55:41,403 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 154 [2018-10-15 12:55:41,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:41,404 INFO L225 Difference]: With dead ends: 169 [2018-10-15 12:55:41,404 INFO L226 Difference]: Without dead ends: 169 [2018-10-15 12:55:41,408 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1443, Invalid=2979, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 12:55:41,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-10-15 12:55:41,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 163. [2018-10-15 12:55:41,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-10-15 12:55:41,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2018-10-15 12:55:41,411 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 154 [2018-10-15 12:55:41,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:41,412 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2018-10-15 12:55:41,412 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 12:55:41,412 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2018-10-15 12:55:41,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-10-15 12:55:41,413 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:41,413 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:41,413 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:41,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:41,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1933015866, now seen corresponding path program 17 times [2018-10-15 12:55:41,414 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:41,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:42,590 INFO L134 CoverageAnalysis]: Checked inductivity of 1105 backedges. 0 proven. 1105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:42,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:42,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 12:55:42,591 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 12:55:42,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 12:55:42,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 12:55:42,592 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 37 states. [2018-10-15 12:55:43,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:43,611 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2018-10-15 12:55:43,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-15 12:55:43,612 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 162 [2018-10-15 12:55:43,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:43,613 INFO L225 Difference]: With dead ends: 177 [2018-10-15 12:55:43,613 INFO L226 Difference]: Without dead ends: 177 [2018-10-15 12:55:43,615 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 833 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1618, Invalid=3352, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 12:55:43,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-10-15 12:55:43,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 171. [2018-10-15 12:55:43,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-10-15 12:55:43,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-10-15 12:55:43,619 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 162 [2018-10-15 12:55:43,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:43,619 INFO L481 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-10-15 12:55:43,619 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 12:55:43,619 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-10-15 12:55:43,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-15 12:55:43,620 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:43,621 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:43,621 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:43,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:43,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1707056574, now seen corresponding path program 18 times [2018-10-15 12:55:43,622 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:43,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:44,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1242 backedges. 0 proven. 1242 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:44,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:44,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 12:55:44,234 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 12:55:44,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 12:55:44,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 12:55:44,235 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 39 states. [2018-10-15 12:55:45,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:45,107 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2018-10-15 12:55:45,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-15 12:55:45,108 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 170 [2018-10-15 12:55:45,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:45,109 INFO L225 Difference]: With dead ends: 185 [2018-10-15 12:55:45,109 INFO L226 Difference]: Without dead ends: 185 [2018-10-15 12:55:45,112 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:45,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-10-15 12:55:45,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 179. [2018-10-15 12:55:45,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-10-15 12:55:45,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2018-10-15 12:55:45,116 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 179 transitions. Word has length 170 [2018-10-15 12:55:45,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:45,116 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 179 transitions. [2018-10-15 12:55:45,117 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 12:55:45,117 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 179 transitions. [2018-10-15 12:55:45,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-15 12:55:45,117 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:45,117 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:45,118 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:45,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:45,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1684684470, now seen corresponding path program 19 times [2018-10-15 12:55:45,119 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:45,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:46,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1387 backedges. 0 proven. 1387 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:46,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:46,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 12:55:46,180 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 12:55:46,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 12:55:46,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=1200, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 12:55:46,181 INFO L87 Difference]: Start difference. First operand 179 states and 179 transitions. Second operand 41 states. [2018-10-15 12:55:47,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:47,419 INFO L93 Difference]: Finished difference Result 193 states and 193 transitions. [2018-10-15 12:55:47,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-15 12:55:47,420 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 178 [2018-10-15 12:55:47,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:47,421 INFO L225 Difference]: With dead ends: 193 [2018-10-15 12:55:47,421 INFO L226 Difference]: Without dead ends: 193 [2018-10-15 12:55:47,424 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1045 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1998, Invalid=4164, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 12:55:47,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-10-15 12:55:47,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 187. [2018-10-15 12:55:47,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-10-15 12:55:47,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2018-10-15 12:55:47,427 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 178 [2018-10-15 12:55:47,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:47,427 INFO L481 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2018-10-15 12:55:47,427 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 12:55:47,427 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2018-10-15 12:55:47,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-10-15 12:55:47,428 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:47,428 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:47,428 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:47,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:47,429 INFO L82 PathProgramCache]: Analyzing trace with hash 2134874194, now seen corresponding path program 20 times [2018-10-15 12:55:47,429 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:47,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:48,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:48,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:48,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 12:55:48,081 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 12:55:48,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 12:55:48,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 12:55:48,082 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 43 states. [2018-10-15 12:55:49,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:49,135 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2018-10-15 12:55:49,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-15 12:55:49,135 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 186 [2018-10-15 12:55:49,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:49,137 INFO L225 Difference]: With dead ends: 201 [2018-10-15 12:55:49,138 INFO L226 Difference]: Without dead ends: 201 [2018-10-15 12:55:49,141 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1160 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2203, Invalid=4603, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 12:55:49,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-10-15 12:55:49,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 195. [2018-10-15 12:55:49,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-10-15 12:55:49,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 195 transitions. [2018-10-15 12:55:49,144 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 195 transitions. Word has length 186 [2018-10-15 12:55:49,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:49,145 INFO L481 AbstractCegarLoop]: Abstraction has 195 states and 195 transitions. [2018-10-15 12:55:49,145 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 12:55:49,145 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 195 transitions. [2018-10-15 12:55:49,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-10-15 12:55:49,146 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:49,146 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:49,146 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:49,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:49,147 INFO L82 PathProgramCache]: Analyzing trace with hash -985274534, now seen corresponding path program 21 times [2018-10-15 12:55:49,148 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:49,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:49,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1701 backedges. 0 proven. 1701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:49,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:49,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 12:55:49,993 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 12:55:49,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 12:55:49,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=1452, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 12:55:49,994 INFO L87 Difference]: Start difference. First operand 195 states and 195 transitions. Second operand 45 states. [2018-10-15 12:55:51,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:51,255 INFO L93 Difference]: Finished difference Result 209 states and 209 transitions. [2018-10-15 12:55:51,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-15 12:55:51,258 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 194 [2018-10-15 12:55:51,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:51,260 INFO L225 Difference]: With dead ends: 209 [2018-10-15 12:55:51,260 INFO L226 Difference]: Without dead ends: 209 [2018-10-15 12:55:51,261 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1281 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2418, Invalid=5064, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 12:55:51,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-10-15 12:55:51,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 203. [2018-10-15 12:55:51,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-10-15 12:55:51,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 203 transitions. [2018-10-15 12:55:51,265 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 203 transitions. Word has length 194 [2018-10-15 12:55:51,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:51,266 INFO L481 AbstractCegarLoop]: Abstraction has 203 states and 203 transitions. [2018-10-15 12:55:51,266 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 12:55:51,266 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 203 transitions. [2018-10-15 12:55:51,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-10-15 12:55:51,267 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:51,267 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:51,267 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:51,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:51,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1706077794, now seen corresponding path program 22 times [2018-10-15 12:55:51,268 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:51,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:52,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1870 backedges. 0 proven. 1870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:52,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:52,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 12:55:52,624 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 12:55:52,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 12:55:52,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=1587, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 12:55:52,624 INFO L87 Difference]: Start difference. First operand 203 states and 203 transitions. Second operand 47 states. [2018-10-15 12:55:54,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:54,036 INFO L93 Difference]: Finished difference Result 217 states and 217 transitions. [2018-10-15 12:55:54,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-15 12:55:54,037 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 202 [2018-10-15 12:55:54,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:54,039 INFO L225 Difference]: With dead ends: 217 [2018-10-15 12:55:54,039 INFO L226 Difference]: Without dead ends: 217 [2018-10-15 12:55:54,040 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1408 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2643, Invalid=5547, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 12:55:54,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-10-15 12:55:54,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 211. [2018-10-15 12:55:54,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-10-15 12:55:54,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2018-10-15 12:55:54,044 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 202 [2018-10-15 12:55:54,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:54,045 INFO L481 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2018-10-15 12:55:54,045 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 12:55:54,045 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2018-10-15 12:55:54,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-10-15 12:55:54,046 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:54,046 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:54,046 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:54,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:54,047 INFO L82 PathProgramCache]: Analyzing trace with hash -796398230, now seen corresponding path program 23 times [2018-10-15 12:55:54,047 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:54,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:54,955 INFO L134 CoverageAnalysis]: Checked inductivity of 2047 backedges. 0 proven. 2047 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:54,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:54,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 12:55:54,956 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 12:55:54,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 12:55:54,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=624, Invalid=1728, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 12:55:54,957 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 49 states. [2018-10-15 12:55:56,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:56,407 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2018-10-15 12:55:56,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-15 12:55:56,407 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 210 [2018-10-15 12:55:56,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:56,409 INFO L225 Difference]: With dead ends: 225 [2018-10-15 12:55:56,409 INFO L226 Difference]: Without dead ends: 225 [2018-10-15 12:55:56,411 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1541 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2878, Invalid=6052, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 12:55:56,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-10-15 12:55:56,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 219. [2018-10-15 12:55:56,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-10-15 12:55:56,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 219 transitions. [2018-10-15 12:55:56,415 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 219 transitions. Word has length 210 [2018-10-15 12:55:56,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:56,415 INFO L481 AbstractCegarLoop]: Abstraction has 219 states and 219 transitions. [2018-10-15 12:55:56,415 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 12:55:56,415 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 219 transitions. [2018-10-15 12:55:56,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-10-15 12:55:56,416 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:56,417 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:56,417 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:56,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:56,417 INFO L82 PathProgramCache]: Analyzing trace with hash -304896910, now seen corresponding path program 24 times [2018-10-15 12:55:56,418 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:56,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:58,259 INFO L134 CoverageAnalysis]: Checked inductivity of 2232 backedges. 0 proven. 2232 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:58,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:58,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 12:55:58,260 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 12:55:58,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 12:55:58,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 12:55:58,260 INFO L87 Difference]: Start difference. First operand 219 states and 219 transitions. Second operand 51 states. [2018-10-15 12:55:59,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:59,712 INFO L93 Difference]: Finished difference Result 233 states and 233 transitions. [2018-10-15 12:55:59,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-15 12:55:59,713 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 218 [2018-10-15 12:55:59,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:59,715 INFO L225 Difference]: With dead ends: 233 [2018-10-15 12:55:59,715 INFO L226 Difference]: Without dead ends: 233 [2018-10-15 12:55:59,717 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1680 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3123, Invalid=6579, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 12:55:59,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-10-15 12:55:59,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 227. [2018-10-15 12:55:59,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-10-15 12:55:59,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2018-10-15 12:55:59,721 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 218 [2018-10-15 12:55:59,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:59,721 INFO L481 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2018-10-15 12:55:59,721 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 12:55:59,722 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2018-10-15 12:55:59,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-10-15 12:55:59,723 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:59,723 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:59,723 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:59,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:59,724 INFO L82 PathProgramCache]: Analyzing trace with hash 496751482, now seen corresponding path program 25 times [2018-10-15 12:55:59,724 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:59,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:00,668 INFO L134 CoverageAnalysis]: Checked inductivity of 2425 backedges. 0 proven. 2425 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:00,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:00,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 12:56:00,668 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 12:56:00,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 12:56:00,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=728, Invalid=2028, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 12:56:00,669 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 53 states. [2018-10-15 12:56:02,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:02,454 INFO L93 Difference]: Finished difference Result 241 states and 241 transitions. [2018-10-15 12:56:02,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-15 12:56:02,455 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 226 [2018-10-15 12:56:02,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:02,457 INFO L225 Difference]: With dead ends: 241 [2018-10-15 12:56:02,457 INFO L226 Difference]: Without dead ends: 241 [2018-10-15 12:56:02,459 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1825 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3378, Invalid=7128, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 12:56:02,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-10-15 12:56:02,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 235. [2018-10-15 12:56:02,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-10-15 12:56:02,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 235 transitions. [2018-10-15 12:56:02,463 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 235 transitions. Word has length 226 [2018-10-15 12:56:02,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:02,463 INFO L481 AbstractCegarLoop]: Abstraction has 235 states and 235 transitions. [2018-10-15 12:56:02,463 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 12:56:02,463 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 235 transitions. [2018-10-15 12:56:02,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-10-15 12:56:02,464 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:02,465 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:02,465 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:02,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:02,465 INFO L82 PathProgramCache]: Analyzing trace with hash 937982594, now seen corresponding path program 26 times [2018-10-15 12:56:02,466 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:02,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:03,582 INFO L134 CoverageAnalysis]: Checked inductivity of 2626 backedges. 0 proven. 2626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:03,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:03,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-15 12:56:03,583 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-15 12:56:03,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-15 12:56:03,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=783, Invalid=2187, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 12:56:03,584 INFO L87 Difference]: Start difference. First operand 235 states and 235 transitions. Second operand 55 states. [2018-10-15 12:56:05,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:05,546 INFO L93 Difference]: Finished difference Result 249 states and 249 transitions. [2018-10-15 12:56:05,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-15 12:56:05,547 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 234 [2018-10-15 12:56:05,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:05,549 INFO L225 Difference]: With dead ends: 249 [2018-10-15 12:56:05,549 INFO L226 Difference]: Without dead ends: 249 [2018-10-15 12:56:05,550 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1976 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3643, Invalid=7699, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 12:56:05,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-10-15 12:56:05,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 243. [2018-10-15 12:56:05,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-10-15 12:56:05,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 243 transitions. [2018-10-15 12:56:05,554 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 243 transitions. Word has length 234 [2018-10-15 12:56:05,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:05,555 INFO L481 AbstractCegarLoop]: Abstraction has 243 states and 243 transitions. [2018-10-15 12:56:05,555 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-15 12:56:05,555 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 243 transitions. [2018-10-15 12:56:05,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-10-15 12:56:05,556 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:05,556 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:05,556 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:05,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:05,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1933469302, now seen corresponding path program 27 times [2018-10-15 12:56:05,557 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:05,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:06,792 INFO L134 CoverageAnalysis]: Checked inductivity of 2835 backedges. 0 proven. 2835 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:06,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:06,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-15 12:56:06,793 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-15 12:56:06,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-15 12:56:06,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=840, Invalid=2352, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 12:56:06,794 INFO L87 Difference]: Start difference. First operand 243 states and 243 transitions. Second operand 57 states. [2018-10-15 12:56:09,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:09,023 INFO L93 Difference]: Finished difference Result 257 states and 257 transitions. [2018-10-15 12:56:09,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-15 12:56:09,024 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 242 [2018-10-15 12:56:09,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:09,026 INFO L225 Difference]: With dead ends: 257 [2018-10-15 12:56:09,026 INFO L226 Difference]: Without dead ends: 257 [2018-10-15 12:56:09,027 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2133 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3918, Invalid=8292, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 12:56:09,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-10-15 12:56:09,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 251. [2018-10-15 12:56:09,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-10-15 12:56:09,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 251 transitions. [2018-10-15 12:56:09,030 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 251 transitions. Word has length 242 [2018-10-15 12:56:09,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:09,031 INFO L481 AbstractCegarLoop]: Abstraction has 251 states and 251 transitions. [2018-10-15 12:56:09,031 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-15 12:56:09,031 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 251 transitions. [2018-10-15 12:56:09,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-10-15 12:56:09,032 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:09,032 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:09,033 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:09,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:09,033 INFO L82 PathProgramCache]: Analyzing trace with hash -466669422, now seen corresponding path program 28 times [2018-10-15 12:56:09,033 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:09,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:10,593 INFO L134 CoverageAnalysis]: Checked inductivity of 3052 backedges. 0 proven. 3052 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:10,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:10,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-15 12:56:10,594 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-15 12:56:10,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-15 12:56:10,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=899, Invalid=2523, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 12:56:10,595 INFO L87 Difference]: Start difference. First operand 251 states and 251 transitions. Second operand 59 states. [2018-10-15 12:56:13,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:13,522 INFO L93 Difference]: Finished difference Result 265 states and 265 transitions. [2018-10-15 12:56:13,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-15 12:56:13,523 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 250 [2018-10-15 12:56:13,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:13,524 INFO L225 Difference]: With dead ends: 265 [2018-10-15 12:56:13,524 INFO L226 Difference]: Without dead ends: 265 [2018-10-15 12:56:13,525 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2296 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4203, Invalid=8907, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 12:56:13,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-10-15 12:56:13,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 259. [2018-10-15 12:56:13,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-10-15 12:56:13,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 259 transitions. [2018-10-15 12:56:13,529 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 259 transitions. Word has length 250 [2018-10-15 12:56:13,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:13,530 INFO L481 AbstractCegarLoop]: Abstraction has 259 states and 259 transitions. [2018-10-15 12:56:13,530 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-15 12:56:13,530 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 259 transitions. [2018-10-15 12:56:13,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-10-15 12:56:13,531 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:13,531 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:13,532 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:13,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:13,532 INFO L82 PathProgramCache]: Analyzing trace with hash 2117681050, now seen corresponding path program 29 times [2018-10-15 12:56:13,533 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:13,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:14,751 INFO L134 CoverageAnalysis]: Checked inductivity of 3277 backedges. 0 proven. 3277 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:14,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:14,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-15 12:56:14,752 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-15 12:56:14,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-15 12:56:14,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=960, Invalid=2700, Unknown=0, NotChecked=0, Total=3660 [2018-10-15 12:56:14,753 INFO L87 Difference]: Start difference. First operand 259 states and 259 transitions. Second operand 61 states. [2018-10-15 12:56:16,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:16,810 INFO L93 Difference]: Finished difference Result 273 states and 273 transitions. [2018-10-15 12:56:16,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-15 12:56:16,810 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 258 [2018-10-15 12:56:16,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:16,812 INFO L225 Difference]: With dead ends: 273 [2018-10-15 12:56:16,812 INFO L226 Difference]: Without dead ends: 273 [2018-10-15 12:56:16,814 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2465 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4498, Invalid=9544, Unknown=0, NotChecked=0, Total=14042 [2018-10-15 12:56:16,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-10-15 12:56:16,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 267. [2018-10-15 12:56:16,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-10-15 12:56:16,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 267 transitions. [2018-10-15 12:56:16,818 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 267 transitions. Word has length 258 [2018-10-15 12:56:16,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:16,818 INFO L481 AbstractCegarLoop]: Abstraction has 267 states and 267 transitions. [2018-10-15 12:56:16,818 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-15 12:56:16,818 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 267 transitions. [2018-10-15 12:56:16,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-10-15 12:56:16,819 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:16,820 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:16,820 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:16,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:16,820 INFO L82 PathProgramCache]: Analyzing trace with hash 317179554, now seen corresponding path program 30 times [2018-10-15 12:56:16,821 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:16,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:19,477 INFO L134 CoverageAnalysis]: Checked inductivity of 3510 backedges. 0 proven. 3510 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:19,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:19,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-15 12:56:19,478 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-15 12:56:19,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-15 12:56:19,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 12:56:19,479 INFO L87 Difference]: Start difference. First operand 267 states and 267 transitions. Second operand 63 states. [2018-10-15 12:56:21,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:21,621 INFO L93 Difference]: Finished difference Result 281 states and 281 transitions. [2018-10-15 12:56:21,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-15 12:56:21,622 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 266 [2018-10-15 12:56:21,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:21,624 INFO L225 Difference]: With dead ends: 281 [2018-10-15 12:56:21,624 INFO L226 Difference]: Without dead ends: 281 [2018-10-15 12:56:21,625 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2640 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=4803, Invalid=10203, Unknown=0, NotChecked=0, Total=15006 [2018-10-15 12:56:21,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-10-15 12:56:21,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 275. [2018-10-15 12:56:21,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-10-15 12:56:21,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 275 transitions. [2018-10-15 12:56:21,629 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 275 transitions. Word has length 266 [2018-10-15 12:56:21,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:21,629 INFO L481 AbstractCegarLoop]: Abstraction has 275 states and 275 transitions. [2018-10-15 12:56:21,629 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-15 12:56:21,629 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 275 transitions. [2018-10-15 12:56:21,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-10-15 12:56:21,630 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:21,630 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:21,630 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:21,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:21,631 INFO L82 PathProgramCache]: Analyzing trace with hash -767375958, now seen corresponding path program 31 times [2018-10-15 12:56:21,631 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:21,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:23,492 INFO L134 CoverageAnalysis]: Checked inductivity of 3751 backedges. 0 proven. 3751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:23,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:23,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-15 12:56:23,493 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-15 12:56:23,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-15 12:56:23,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1088, Invalid=3072, Unknown=0, NotChecked=0, Total=4160 [2018-10-15 12:56:23,494 INFO L87 Difference]: Start difference. First operand 275 states and 275 transitions. Second operand 65 states. [2018-10-15 12:56:25,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:25,925 INFO L93 Difference]: Finished difference Result 289 states and 289 transitions. [2018-10-15 12:56:25,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-15 12:56:25,926 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 274 [2018-10-15 12:56:25,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:25,927 INFO L225 Difference]: With dead ends: 289 [2018-10-15 12:56:25,927 INFO L226 Difference]: Without dead ends: 289 [2018-10-15 12:56:25,929 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2821 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5118, Invalid=10884, Unknown=0, NotChecked=0, Total=16002 [2018-10-15 12:56:25,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-10-15 12:56:25,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 283. [2018-10-15 12:56:25,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-10-15 12:56:25,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 283 transitions. [2018-10-15 12:56:25,933 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 283 transitions. Word has length 274 [2018-10-15 12:56:25,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:25,934 INFO L481 AbstractCegarLoop]: Abstraction has 283 states and 283 transitions. [2018-10-15 12:56:25,934 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-15 12:56:25,934 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 283 transitions. [2018-10-15 12:56:25,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-10-15 12:56:25,935 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:25,936 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:25,936 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:25,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:25,936 INFO L82 PathProgramCache]: Analyzing trace with hash 1683111090, now seen corresponding path program 32 times [2018-10-15 12:56:25,937 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:25,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:28,188 INFO L134 CoverageAnalysis]: Checked inductivity of 4000 backedges. 0 proven. 4000 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:28,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:28,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-15 12:56:28,189 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-15 12:56:28,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-15 12:56:28,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1155, Invalid=3267, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 12:56:28,190 INFO L87 Difference]: Start difference. First operand 283 states and 283 transitions. Second operand 67 states. [2018-10-15 12:56:30,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:30,686 INFO L93 Difference]: Finished difference Result 297 states and 297 transitions. [2018-10-15 12:56:30,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-10-15 12:56:30,687 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 282 [2018-10-15 12:56:30,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:30,688 INFO L225 Difference]: With dead ends: 297 [2018-10-15 12:56:30,688 INFO L226 Difference]: Without dead ends: 297 [2018-10-15 12:56:30,690 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3008 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5443, Invalid=11587, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 12:56:30,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-10-15 12:56:30,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 291. [2018-10-15 12:56:30,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-10-15 12:56:30,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 291 transitions. [2018-10-15 12:56:30,694 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 291 transitions. Word has length 282 [2018-10-15 12:56:30,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:30,694 INFO L481 AbstractCegarLoop]: Abstraction has 291 states and 291 transitions. [2018-10-15 12:56:30,694 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-15 12:56:30,695 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 291 transitions. [2018-10-15 12:56:30,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2018-10-15 12:56:30,696 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:30,696 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:30,696 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:30,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:30,697 INFO L82 PathProgramCache]: Analyzing trace with hash -383898694, now seen corresponding path program 33 times [2018-10-15 12:56:30,697 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:30,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:32,275 INFO L134 CoverageAnalysis]: Checked inductivity of 4257 backedges. 0 proven. 4257 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:32,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:32,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-15 12:56:32,276 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-15 12:56:32,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-15 12:56:32,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1224, Invalid=3468, Unknown=0, NotChecked=0, Total=4692 [2018-10-15 12:56:32,277 INFO L87 Difference]: Start difference. First operand 291 states and 291 transitions. Second operand 69 states. [2018-10-15 12:56:35,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:35,195 INFO L93 Difference]: Finished difference Result 305 states and 305 transitions. [2018-10-15 12:56:35,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-10-15 12:56:35,196 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 290 [2018-10-15 12:56:35,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:35,197 INFO L225 Difference]: With dead ends: 305 [2018-10-15 12:56:35,197 INFO L226 Difference]: Without dead ends: 305 [2018-10-15 12:56:35,198 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:35,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-10-15 12:56:35,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 299. [2018-10-15 12:56:35,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-10-15 12:56:35,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 299 transitions. [2018-10-15 12:56:35,202 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 299 transitions. Word has length 290 [2018-10-15 12:56:35,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:35,202 INFO L481 AbstractCegarLoop]: Abstraction has 299 states and 299 transitions. [2018-10-15 12:56:35,202 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-15 12:56:35,202 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 299 transitions. [2018-10-15 12:56:35,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-10-15 12:56:35,204 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:35,204 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:35,204 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:35,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:35,204 INFO L82 PathProgramCache]: Analyzing trace with hash -122776894, now seen corresponding path program 34 times [2018-10-15 12:56:35,205 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:35,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:36,814 INFO L134 CoverageAnalysis]: Checked inductivity of 4522 backedges. 0 proven. 4522 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:36,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:36,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-15 12:56:36,814 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-15 12:56:36,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-15 12:56:36,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1295, Invalid=3675, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 12:56:36,815 INFO L87 Difference]: Start difference. First operand 299 states and 299 transitions. Second operand 71 states. [2018-10-15 12:56:39,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:39,678 INFO L93 Difference]: Finished difference Result 313 states and 313 transitions. [2018-10-15 12:56:39,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-10-15 12:56:39,685 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 298 [2018-10-15 12:56:39,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:39,686 INFO L225 Difference]: With dead ends: 313 [2018-10-15 12:56:39,687 INFO L226 Difference]: Without dead ends: 313 [2018-10-15 12:56:39,688 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3400 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=6123, Invalid=13059, Unknown=0, NotChecked=0, Total=19182 [2018-10-15 12:56:39,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-10-15 12:56:39,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 307. [2018-10-15 12:56:39,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-10-15 12:56:39,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 307 transitions. [2018-10-15 12:56:39,691 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 307 transitions. Word has length 298 [2018-10-15 12:56:39,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:39,691 INFO L481 AbstractCegarLoop]: Abstraction has 307 states and 307 transitions. [2018-10-15 12:56:39,691 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-15 12:56:39,691 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 307 transitions. [2018-10-15 12:56:39,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-10-15 12:56:39,692 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:39,693 INFO L375 BasicCegarLoop]: trace histogram [35, 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] [2018-10-15 12:56:39,693 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:39,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:39,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1559531062, now seen corresponding path program 35 times [2018-10-15 12:56:39,694 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:39,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:41,356 INFO L134 CoverageAnalysis]: Checked inductivity of 4795 backedges. 0 proven. 4795 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:41,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:41,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-15 12:56:41,357 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-15 12:56:41,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-15 12:56:41,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1368, Invalid=3888, Unknown=0, NotChecked=0, Total=5256 [2018-10-15 12:56:41,358 INFO L87 Difference]: Start difference. First operand 307 states and 307 transitions. Second operand 73 states. [2018-10-15 12:56:44,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:44,359 INFO L93 Difference]: Finished difference Result 321 states and 321 transitions. [2018-10-15 12:56:44,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-10-15 12:56:44,360 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 306 [2018-10-15 12:56:44,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:44,361 INFO L225 Difference]: With dead ends: 321 [2018-10-15 12:56:44,362 INFO L226 Difference]: Without dead ends: 321 [2018-10-15 12:56:44,363 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:44,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-10-15 12:56:44,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 315. [2018-10-15 12:56:44,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-10-15 12:56:44,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 315 transitions. [2018-10-15 12:56:44,367 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 315 transitions. Word has length 306 [2018-10-15 12:56:44,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:44,367 INFO L481 AbstractCegarLoop]: Abstraction has 315 states and 315 transitions. [2018-10-15 12:56:44,367 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-15 12:56:44,368 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 315 transitions. [2018-10-15 12:56:44,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-10-15 12:56:44,369 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:44,369 INFO L375 BasicCegarLoop]: trace histogram [36, 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] [2018-10-15 12:56:44,370 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:44,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:44,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1883031762, now seen corresponding path program 36 times [2018-10-15 12:56:44,371 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:44,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:46,196 INFO L134 CoverageAnalysis]: Checked inductivity of 5076 backedges. 0 proven. 5076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:46,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:46,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-15 12:56:46,197 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-15 12:56:46,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-15 12:56:46,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1443, Invalid=4107, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 12:56:46,198 INFO L87 Difference]: Start difference. First operand 315 states and 315 transitions. Second operand 75 states. [2018-10-15 12:56:49,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:49,421 INFO L93 Difference]: Finished difference Result 329 states and 329 transitions. [2018-10-15 12:56:49,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-10-15 12:56:49,426 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 314 [2018-10-15 12:56:49,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:49,428 INFO L225 Difference]: With dead ends: 329 [2018-10-15 12:56:49,428 INFO L226 Difference]: Without dead ends: 329 [2018-10-15 12:56:49,429 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3816 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6843, Invalid=14619, Unknown=0, NotChecked=0, Total=21462 [2018-10-15 12:56:49,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-10-15 12:56:49,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 323. [2018-10-15 12:56:49,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-10-15 12:56:49,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 323 transitions. [2018-10-15 12:56:49,433 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 323 transitions. Word has length 314 [2018-10-15 12:56:49,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:49,433 INFO L481 AbstractCegarLoop]: Abstraction has 323 states and 323 transitions. [2018-10-15 12:56:49,434 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-15 12:56:49,434 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 323 transitions. [2018-10-15 12:56:49,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-10-15 12:56:49,437 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:49,437 INFO L375 BasicCegarLoop]: trace histogram [37, 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] [2018-10-15 12:56:49,438 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:49,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:49,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1615501274, now seen corresponding path program 37 times [2018-10-15 12:56:49,439 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:49,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:51,436 INFO L134 CoverageAnalysis]: Checked inductivity of 5365 backedges. 0 proven. 5365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:51,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:51,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-10-15 12:56:51,437 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-15 12:56:51,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-15 12:56:51,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1520, Invalid=4332, Unknown=0, NotChecked=0, Total=5852 [2018-10-15 12:56:51,438 INFO L87 Difference]: Start difference. First operand 323 states and 323 transitions. Second operand 77 states. [2018-10-15 12:56:54,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:54,868 INFO L93 Difference]: Finished difference Result 337 states and 337 transitions. [2018-10-15 12:56:54,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-10-15 12:56:54,869 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 322 [2018-10-15 12:56:54,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:54,871 INFO L225 Difference]: With dead ends: 337 [2018-10-15 12:56:54,871 INFO L226 Difference]: Without dead ends: 337 [2018-10-15 12:56:54,872 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4033 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=7218, Invalid=15432, Unknown=0, NotChecked=0, Total=22650 [2018-10-15 12:56:54,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-10-15 12:56:54,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 331. [2018-10-15 12:56:54,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-10-15 12:56:54,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 331 transitions. [2018-10-15 12:56:54,876 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 331 transitions. Word has length 322 [2018-10-15 12:56:54,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:54,877 INFO L481 AbstractCegarLoop]: Abstraction has 331 states and 331 transitions. [2018-10-15 12:56:54,877 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-15 12:56:54,877 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 331 transitions. [2018-10-15 12:56:54,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-10-15 12:56:54,878 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:54,879 INFO L375 BasicCegarLoop]: trace histogram [38, 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] [2018-10-15 12:56:54,879 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:54,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:54,879 INFO L82 PathProgramCache]: Analyzing trace with hash -348332318, now seen corresponding path program 38 times [2018-10-15 12:56:54,880 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:54,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:57,008 INFO L134 CoverageAnalysis]: Checked inductivity of 5662 backedges. 0 proven. 5662 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:57,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:57,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-10-15 12:56:57,009 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-15 12:56:57,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-15 12:56:57,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1599, Invalid=4563, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 12:56:57,010 INFO L87 Difference]: Start difference. First operand 331 states and 331 transitions. Second operand 79 states. [2018-10-15 12:57:00,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:00,380 INFO L93 Difference]: Finished difference Result 345 states and 345 transitions. [2018-10-15 12:57:00,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-10-15 12:57:00,381 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 330 [2018-10-15 12:57:00,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:00,382 INFO L225 Difference]: With dead ends: 345 [2018-10-15 12:57:00,383 INFO L226 Difference]: Without dead ends: 345 [2018-10-15 12:57:00,384 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4256 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=7603, Invalid=16267, Unknown=0, NotChecked=0, Total=23870 [2018-10-15 12:57:00,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2018-10-15 12:57:00,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 339. [2018-10-15 12:57:00,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-10-15 12:57:00,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 339 transitions. [2018-10-15 12:57:00,387 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 339 transitions. Word has length 330 [2018-10-15 12:57:00,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:00,388 INFO L481 AbstractCegarLoop]: Abstraction has 339 states and 339 transitions. [2018-10-15 12:57:00,388 INFO L482 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-15 12:57:00,388 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 339 transitions. [2018-10-15 12:57:00,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2018-10-15 12:57:00,389 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:00,390 INFO L375 BasicCegarLoop]: trace histogram [39, 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] [2018-10-15 12:57:00,390 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:00,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:00,390 INFO L82 PathProgramCache]: Analyzing trace with hash 18587114, now seen corresponding path program 39 times [2018-10-15 12:57:00,391 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:00,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:02,478 INFO L134 CoverageAnalysis]: Checked inductivity of 5967 backedges. 0 proven. 5967 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:02,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:02,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-15 12:57:02,479 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-15 12:57:02,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-15 12:57:02,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1680, Invalid=4800, Unknown=0, NotChecked=0, Total=6480 [2018-10-15 12:57:02,480 INFO L87 Difference]: Start difference. First operand 339 states and 339 transitions. Second operand 81 states. [2018-10-15 12:57:06,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:06,063 INFO L93 Difference]: Finished difference Result 353 states and 353 transitions. [2018-10-15 12:57:06,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-10-15 12:57:06,064 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 338 [2018-10-15 12:57:06,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:06,066 INFO L225 Difference]: With dead ends: 353 [2018-10-15 12:57:06,066 INFO L226 Difference]: Without dead ends: 353 [2018-10-15 12:57:06,067 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4485 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7998, Invalid=17124, Unknown=0, NotChecked=0, Total=25122 [2018-10-15 12:57:06,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2018-10-15 12:57:06,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 347. [2018-10-15 12:57:06,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-10-15 12:57:06,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 347 transitions. [2018-10-15 12:57:06,072 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 347 transitions. Word has length 338 [2018-10-15 12:57:06,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:06,072 INFO L481 AbstractCegarLoop]: Abstraction has 347 states and 347 transitions. [2018-10-15 12:57:06,072 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-15 12:57:06,072 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 347 transitions. [2018-10-15 12:57:06,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2018-10-15 12:57:06,074 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:06,074 INFO L375 BasicCegarLoop]: trace histogram [40, 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] [2018-10-15 12:57:06,074 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:06,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:06,075 INFO L82 PathProgramCache]: Analyzing trace with hash 166647026, now seen corresponding path program 40 times [2018-10-15 12:57:06,075 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:06,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:08,323 INFO L134 CoverageAnalysis]: Checked inductivity of 6280 backedges. 0 proven. 6280 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:08,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:08,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-15 12:57:08,324 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-15 12:57:08,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-15 12:57:08,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1763, Invalid=5043, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 12:57:08,324 INFO L87 Difference]: Start difference. First operand 347 states and 347 transitions. Second operand 83 states. [2018-10-15 12:57:12,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:12,126 INFO L93 Difference]: Finished difference Result 361 states and 361 transitions. [2018-10-15 12:57:12,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-10-15 12:57:12,127 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 346 [2018-10-15 12:57:12,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:12,129 INFO L225 Difference]: With dead ends: 361 [2018-10-15 12:57:12,129 INFO L226 Difference]: Without dead ends: 361 [2018-10-15 12:57:12,130 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4720 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=8403, Invalid=18003, Unknown=0, NotChecked=0, Total=26406 [2018-10-15 12:57:12,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2018-10-15 12:57:12,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 355. [2018-10-15 12:57:12,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2018-10-15 12:57:12,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 355 transitions. [2018-10-15 12:57:12,134 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 355 transitions. Word has length 346 [2018-10-15 12:57:12,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:12,134 INFO L481 AbstractCegarLoop]: Abstraction has 355 states and 355 transitions. [2018-10-15 12:57:12,134 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-15 12:57:12,134 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 355 transitions. [2018-10-15 12:57:12,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2018-10-15 12:57:12,136 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:12,136 INFO L375 BasicCegarLoop]: trace histogram [41, 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] [2018-10-15 12:57:12,137 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:12,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:12,137 INFO L82 PathProgramCache]: Analyzing trace with hash -440499206, now seen corresponding path program 41 times [2018-10-15 12:57:12,137 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:12,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:14,808 INFO L134 CoverageAnalysis]: Checked inductivity of 6601 backedges. 0 proven. 6601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:14,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:14,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-10-15 12:57:14,809 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-15 12:57:14,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-15 12:57:14,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1848, Invalid=5292, Unknown=0, NotChecked=0, Total=7140 [2018-10-15 12:57:14,810 INFO L87 Difference]: Start difference. First operand 355 states and 355 transitions. Second operand 85 states. [2018-10-15 12:57:18,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:18,619 INFO L93 Difference]: Finished difference Result 369 states and 369 transitions. [2018-10-15 12:57:18,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-10-15 12:57:18,619 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 354 [2018-10-15 12:57:18,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:18,621 INFO L225 Difference]: With dead ends: 369 [2018-10-15 12:57:18,621 INFO L226 Difference]: Without dead ends: 369 [2018-10-15 12:57:18,622 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4961 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=8818, Invalid=18904, Unknown=0, NotChecked=0, Total=27722 [2018-10-15 12:57:18,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-10-15 12:57:18,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 363. [2018-10-15 12:57:18,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-10-15 12:57:18,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 363 transitions. [2018-10-15 12:57:18,626 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 363 transitions. Word has length 354 [2018-10-15 12:57:18,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:18,627 INFO L481 AbstractCegarLoop]: Abstraction has 363 states and 363 transitions. [2018-10-15 12:57:18,627 INFO L482 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-15 12:57:18,627 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 363 transitions. [2018-10-15 12:57:18,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2018-10-15 12:57:18,628 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:18,628 INFO L375 BasicCegarLoop]: trace histogram [42, 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] [2018-10-15 12:57:18,629 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:18,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:18,629 INFO L82 PathProgramCache]: Analyzing trace with hash -325932286, now seen corresponding path program 42 times [2018-10-15 12:57:18,629 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:18,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:21,203 INFO L134 CoverageAnalysis]: Checked inductivity of 6930 backedges. 0 proven. 6930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:21,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:21,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-15 12:57:21,204 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-15 12:57:21,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-15 12:57:21,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1935, Invalid=5547, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 12:57:21,205 INFO L87 Difference]: Start difference. First operand 363 states and 363 transitions. Second operand 87 states. [2018-10-15 12:57:25,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:25,569 INFO L93 Difference]: Finished difference Result 377 states and 377 transitions. [2018-10-15 12:57:25,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-10-15 12:57:25,570 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 362 [2018-10-15 12:57:25,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:25,572 INFO L225 Difference]: With dead ends: 377 [2018-10-15 12:57:25,573 INFO L226 Difference]: Without dead ends: 377 [2018-10-15 12:57:25,575 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5208 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=9243, Invalid=19827, Unknown=0, NotChecked=0, Total=29070 [2018-10-15 12:57:25,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2018-10-15 12:57:25,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 371. [2018-10-15 12:57:25,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-10-15 12:57:25,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 371 transitions. [2018-10-15 12:57:25,579 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 371 transitions. Word has length 362 [2018-10-15 12:57:25,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:25,580 INFO L481 AbstractCegarLoop]: Abstraction has 371 states and 371 transitions. [2018-10-15 12:57:25,580 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-15 12:57:25,580 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 371 transitions. [2018-10-15 12:57:25,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2018-10-15 12:57:25,582 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:25,582 INFO L375 BasicCegarLoop]: trace histogram [43, 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] [2018-10-15 12:57:25,582 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:25,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:25,583 INFO L82 PathProgramCache]: Analyzing trace with hash -294434294, now seen corresponding path program 43 times [2018-10-15 12:57:25,583 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:25,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:28,021 INFO L134 CoverageAnalysis]: Checked inductivity of 7267 backedges. 0 proven. 7267 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:28,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:28,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-10-15 12:57:28,022 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-15 12:57:28,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-15 12:57:28,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2024, Invalid=5808, Unknown=0, NotChecked=0, Total=7832 [2018-10-15 12:57:28,022 INFO L87 Difference]: Start difference. First operand 371 states and 371 transitions. Second operand 89 states. [2018-10-15 12:57:32,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:32,453 INFO L93 Difference]: Finished difference Result 385 states and 385 transitions. [2018-10-15 12:57:32,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-10-15 12:57:32,453 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 370 [2018-10-15 12:57:32,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:32,455 INFO L225 Difference]: With dead ends: 385 [2018-10-15 12:57:32,455 INFO L226 Difference]: Without dead ends: 385 [2018-10-15 12:57:32,456 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5461 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=9678, Invalid=20772, Unknown=0, NotChecked=0, Total=30450 [2018-10-15 12:57:32,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2018-10-15 12:57:32,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 379. [2018-10-15 12:57:32,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2018-10-15 12:57:32,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 379 transitions. [2018-10-15 12:57:32,460 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 379 transitions. Word has length 370 [2018-10-15 12:57:32,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:32,461 INFO L481 AbstractCegarLoop]: Abstraction has 379 states and 379 transitions. [2018-10-15 12:57:32,461 INFO L482 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-15 12:57:32,461 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 379 transitions. [2018-10-15 12:57:32,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2018-10-15 12:57:32,463 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:32,463 INFO L375 BasicCegarLoop]: trace histogram [44, 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] [2018-10-15 12:57:32,463 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:32,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:32,464 INFO L82 PathProgramCache]: Analyzing trace with hash 862478610, now seen corresponding path program 44 times [2018-10-15 12:57:32,464 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:32,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:35,243 INFO L134 CoverageAnalysis]: Checked inductivity of 7612 backedges. 0 proven. 7612 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:35,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:35,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-10-15 12:57:35,244 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-15 12:57:35,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-15 12:57:35,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2115, Invalid=6075, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 12:57:35,245 INFO L87 Difference]: Start difference. First operand 379 states and 379 transitions. Second operand 91 states. [2018-10-15 12:57:39,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:39,702 INFO L93 Difference]: Finished difference Result 393 states and 393 transitions. [2018-10-15 12:57:39,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-10-15 12:57:39,702 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 378 [2018-10-15 12:57:39,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:39,704 INFO L225 Difference]: With dead ends: 393 [2018-10-15 12:57:39,704 INFO L226 Difference]: Without dead ends: 393 [2018-10-15 12:57:39,705 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5720 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=10123, Invalid=21739, Unknown=0, NotChecked=0, Total=31862 [2018-10-15 12:57:39,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2018-10-15 12:57:39,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 387. [2018-10-15 12:57:39,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-10-15 12:57:39,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 387 transitions. [2018-10-15 12:57:39,709 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 387 transitions. Word has length 378 [2018-10-15 12:57:39,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:39,710 INFO L481 AbstractCegarLoop]: Abstraction has 387 states and 387 transitions. [2018-10-15 12:57:39,710 INFO L482 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-15 12:57:39,710 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 387 transitions. [2018-10-15 12:57:39,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2018-10-15 12:57:39,712 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:39,712 INFO L375 BasicCegarLoop]: trace histogram [45, 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] [2018-10-15 12:57:39,712 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:39,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:39,713 INFO L82 PathProgramCache]: Analyzing trace with hash 2071588890, now seen corresponding path program 45 times [2018-10-15 12:57:39,713 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:39,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:42,329 INFO L134 CoverageAnalysis]: Checked inductivity of 7965 backedges. 0 proven. 7965 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:42,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:42,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-15 12:57:42,330 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-15 12:57:42,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-15 12:57:42,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2208, Invalid=6348, Unknown=0, NotChecked=0, Total=8556 [2018-10-15 12:57:42,331 INFO L87 Difference]: Start difference. First operand 387 states and 387 transitions. Second operand 93 states. [2018-10-15 12:57:47,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:47,188 INFO L93 Difference]: Finished difference Result 401 states and 401 transitions. [2018-10-15 12:57:47,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-10-15 12:57:47,189 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 386 [2018-10-15 12:57:47,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:47,190 INFO L225 Difference]: With dead ends: 401 [2018-10-15 12:57:47,190 INFO L226 Difference]: Without dead ends: 401 [2018-10-15 12:57:47,192 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5985 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=10578, Invalid=22728, Unknown=0, NotChecked=0, Total=33306 [2018-10-15 12:57:47,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2018-10-15 12:57:47,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 395. [2018-10-15 12:57:47,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-10-15 12:57:47,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 395 transitions. [2018-10-15 12:57:47,196 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 395 transitions. Word has length 386 [2018-10-15 12:57:47,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:47,196 INFO L481 AbstractCegarLoop]: Abstraction has 395 states and 395 transitions. [2018-10-15 12:57:47,196 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-15 12:57:47,196 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 395 transitions. [2018-10-15 12:57:47,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2018-10-15 12:57:47,198 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:47,199 INFO L375 BasicCegarLoop]: trace histogram [46, 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] [2018-10-15 12:57:47,199 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:47,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:47,199 INFO L82 PathProgramCache]: Analyzing trace with hash -22022366, now seen corresponding path program 46 times [2018-10-15 12:57:47,200 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:47,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:49,975 INFO L134 CoverageAnalysis]: Checked inductivity of 8326 backedges. 0 proven. 8326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:49,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:49,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-10-15 12:57:49,976 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-15 12:57:49,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-15 12:57:49,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2303, Invalid=6627, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 12:57:49,977 INFO L87 Difference]: Start difference. First operand 395 states and 395 transitions. Second operand 95 states. [2018-10-15 12:57:54,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:54,817 INFO L93 Difference]: Finished difference Result 409 states and 409 transitions. [2018-10-15 12:57:54,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-10-15 12:57:54,817 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 394 [2018-10-15 12:57:54,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:54,820 INFO L225 Difference]: With dead ends: 409 [2018-10-15 12:57:54,820 INFO L226 Difference]: Without dead ends: 409 [2018-10-15 12:57:54,821 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6256 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=11043, Invalid=23739, Unknown=0, NotChecked=0, Total=34782 [2018-10-15 12:57:54,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2018-10-15 12:57:54,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 403. [2018-10-15 12:57:54,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-10-15 12:57:54,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 403 transitions. [2018-10-15 12:57:54,824 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 403 transitions. Word has length 394 [2018-10-15 12:57:54,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:54,825 INFO L481 AbstractCegarLoop]: Abstraction has 403 states and 403 transitions. [2018-10-15 12:57:54,825 INFO L482 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-15 12:57:54,825 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 403 transitions. [2018-10-15 12:57:54,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2018-10-15 12:57:54,826 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:54,826 INFO L375 BasicCegarLoop]: trace histogram [47, 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] [2018-10-15 12:57:54,827 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:54,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:54,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1829926442, now seen corresponding path program 47 times [2018-10-15 12:57:54,827 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:54,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:57,755 INFO L134 CoverageAnalysis]: Checked inductivity of 8695 backedges. 0 proven. 8695 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:57,755 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:57,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-10-15 12:57:57,756 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-10-15 12:57:57,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-10-15 12:57:57,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2400, Invalid=6912, Unknown=0, NotChecked=0, Total=9312 [2018-10-15 12:57:57,757 INFO L87 Difference]: Start difference. First operand 403 states and 403 transitions. Second operand 97 states. [2018-10-15 12:58:03,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:03,255 INFO L93 Difference]: Finished difference Result 417 states and 417 transitions. [2018-10-15 12:58:03,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-10-15 12:58:03,255 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 402 [2018-10-15 12:58:03,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:03,257 INFO L225 Difference]: With dead ends: 417 [2018-10-15 12:58:03,257 INFO L226 Difference]: Without dead ends: 417 [2018-10-15 12:58:03,259 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6533 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=11518, Invalid=24772, Unknown=0, NotChecked=0, Total=36290 [2018-10-15 12:58:03,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2018-10-15 12:58:03,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 411. [2018-10-15 12:58:03,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-10-15 12:58:03,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 411 transitions. [2018-10-15 12:58:03,263 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 411 transitions. Word has length 402 [2018-10-15 12:58:03,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:03,264 INFO L481 AbstractCegarLoop]: Abstraction has 411 states and 411 transitions. [2018-10-15 12:58:03,264 INFO L482 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-10-15 12:58:03,264 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 411 transitions. [2018-10-15 12:58:03,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2018-10-15 12:58:03,266 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:03,266 INFO L375 BasicCegarLoop]: trace histogram [48, 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] [2018-10-15 12:58:03,266 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:03,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:03,267 INFO L82 PathProgramCache]: Analyzing trace with hash -290886350, now seen corresponding path program 48 times [2018-10-15 12:58:03,267 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:03,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:06,540 INFO L134 CoverageAnalysis]: Checked inductivity of 9072 backedges. 0 proven. 9072 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:58:06,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:06,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-10-15 12:58:06,541 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-10-15 12:58:06,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-10-15 12:58:06,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2499, Invalid=7203, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 12:58:06,542 INFO L87 Difference]: Start difference. First operand 411 states and 411 transitions. Second operand 99 states. [2018-10-15 12:58:11,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:11,840 INFO L93 Difference]: Finished difference Result 425 states and 425 transitions. [2018-10-15 12:58:11,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-10-15 12:58:11,840 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 410 [2018-10-15 12:58:11,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:11,841 INFO L225 Difference]: With dead ends: 425 [2018-10-15 12:58:11,842 INFO L226 Difference]: Without dead ends: 425 [2018-10-15 12:58:11,844 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6816 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=12003, Invalid=25827, Unknown=0, NotChecked=0, Total=37830 [2018-10-15 12:58:11,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2018-10-15 12:58:11,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 419. [2018-10-15 12:58:11,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-10-15 12:58:11,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 419 transitions. [2018-10-15 12:58:11,848 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 419 transitions. Word has length 410 [2018-10-15 12:58:11,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:11,848 INFO L481 AbstractCegarLoop]: Abstraction has 419 states and 419 transitions. [2018-10-15 12:58:11,848 INFO L482 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-10-15 12:58:11,848 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 419 transitions. [2018-10-15 12:58:11,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2018-10-15 12:58:11,851 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:11,851 INFO L375 BasicCegarLoop]: trace histogram [49, 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] [2018-10-15 12:58:11,851 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:11,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:11,852 INFO L82 PathProgramCache]: Analyzing trace with hash 595385402, now seen corresponding path program 49 times [2018-10-15 12:58:11,852 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:11,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:14,905 INFO L134 CoverageAnalysis]: Checked inductivity of 9457 backedges. 0 proven. 9457 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:58:14,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:14,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-10-15 12:58:14,906 INFO L460 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-10-15 12:58:14,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-10-15 12:58:14,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2600, Invalid=7500, Unknown=0, NotChecked=0, Total=10100 [2018-10-15 12:58:14,907 INFO L87 Difference]: Start difference. First operand 419 states and 419 transitions. Second operand 101 states. [2018-10-15 12:58:20,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:20,436 INFO L93 Difference]: Finished difference Result 433 states and 433 transitions. [2018-10-15 12:58:20,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-10-15 12:58:20,437 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 418 [2018-10-15 12:58:20,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:20,438 INFO L225 Difference]: With dead ends: 433 [2018-10-15 12:58:20,438 INFO L226 Difference]: Without dead ends: 433 [2018-10-15 12:58:20,440 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7105 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=12498, Invalid=26904, Unknown=0, NotChecked=0, Total=39402 [2018-10-15 12:58:20,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2018-10-15 12:58:20,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 427. [2018-10-15 12:58:20,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2018-10-15 12:58:20,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 427 transitions. [2018-10-15 12:58:20,445 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 427 transitions. Word has length 418 [2018-10-15 12:58:20,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:20,445 INFO L481 AbstractCegarLoop]: Abstraction has 427 states and 427 transitions. [2018-10-15 12:58:20,445 INFO L482 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-10-15 12:58:20,446 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 427 transitions. [2018-10-15 12:58:20,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2018-10-15 12:58:20,448 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:20,448 INFO L375 BasicCegarLoop]: trace histogram [50, 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] [2018-10-15 12:58:20,448 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:20,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:20,449 INFO L82 PathProgramCache]: Analyzing trace with hash 596951874, now seen corresponding path program 50 times [2018-10-15 12:58:20,449 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:20,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:23,851 INFO L134 CoverageAnalysis]: Checked inductivity of 9850 backedges. 0 proven. 9850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:58:23,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:23,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-10-15 12:58:23,852 INFO L460 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-10-15 12:58:23,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-10-15 12:58:23,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2703, Invalid=7803, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 12:58:23,853 INFO L87 Difference]: Start difference. First operand 427 states and 427 transitions. Second operand 103 states. [2018-10-15 12:58:29,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:29,506 INFO L93 Difference]: Finished difference Result 441 states and 441 transitions. [2018-10-15 12:58:29,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2018-10-15 12:58:29,506 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 426 [2018-10-15 12:58:29,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:29,508 INFO L225 Difference]: With dead ends: 441 [2018-10-15 12:58:29,508 INFO L226 Difference]: Without dead ends: 441 [2018-10-15 12:58:29,510 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7400 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=13003, Invalid=28003, Unknown=0, NotChecked=0, Total=41006 [2018-10-15 12:58:29,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2018-10-15 12:58:29,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 435. [2018-10-15 12:58:29,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-10-15 12:58:29,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 435 transitions. [2018-10-15 12:58:29,513 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 435 transitions. Word has length 426 [2018-10-15 12:58:29,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:29,514 INFO L481 AbstractCegarLoop]: Abstraction has 435 states and 435 transitions. [2018-10-15 12:58:29,514 INFO L482 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-10-15 12:58:29,514 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 435 transitions. [2018-10-15 12:58:29,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2018-10-15 12:58:29,516 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:29,517 INFO L375 BasicCegarLoop]: trace histogram [51, 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] [2018-10-15 12:58:29,517 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:29,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:29,517 INFO L82 PathProgramCache]: Analyzing trace with hash 2130256458, now seen corresponding path program 51 times [2018-10-15 12:58:29,518 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:29,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:33,883 INFO L134 CoverageAnalysis]: Checked inductivity of 10251 backedges. 0 proven. 10251 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:58:33,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:33,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-10-15 12:58:33,884 INFO L460 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-10-15 12:58:33,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-10-15 12:58:33,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2808, Invalid=8112, Unknown=0, NotChecked=0, Total=10920 [2018-10-15 12:58:33,885 INFO L87 Difference]: Start difference. First operand 435 states and 435 transitions. Second operand 105 states. [2018-10-15 12:58:39,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:39,831 INFO L93 Difference]: Finished difference Result 449 states and 449 transitions. [2018-10-15 12:58:39,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2018-10-15 12:58:39,831 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 434 [2018-10-15 12:58:39,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:39,833 INFO L225 Difference]: With dead ends: 449 [2018-10-15 12:58:39,833 INFO L226 Difference]: Without dead ends: 449 [2018-10-15 12:58:39,834 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7701 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=13518, Invalid=29124, Unknown=0, NotChecked=0, Total=42642 [2018-10-15 12:58:39,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2018-10-15 12:58:39,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 443. [2018-10-15 12:58:39,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2018-10-15 12:58:39,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 443 transitions. [2018-10-15 12:58:39,838 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 443 transitions. Word has length 434 [2018-10-15 12:58:39,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:39,838 INFO L481 AbstractCegarLoop]: Abstraction has 443 states and 443 transitions. [2018-10-15 12:58:39,838 INFO L482 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-10-15 12:58:39,838 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 443 transitions. [2018-10-15 12:58:39,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2018-10-15 12:58:39,840 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:39,840 INFO L375 BasicCegarLoop]: trace histogram [52, 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] [2018-10-15 12:58:39,840 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:39,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:39,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1035073874, now seen corresponding path program 52 times [2018-10-15 12:58:39,841 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:39,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:43,533 INFO L134 CoverageAnalysis]: Checked inductivity of 10660 backedges. 0 proven. 10660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:58:43,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:43,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-10-15 12:58:43,534 INFO L460 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-10-15 12:58:43,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-10-15 12:58:43,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2915, Invalid=8427, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 12:58:43,535 INFO L87 Difference]: Start difference. First operand 443 states and 443 transitions. Second operand 107 states. [2018-10-15 12:58:49,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:49,710 INFO L93 Difference]: Finished difference Result 457 states and 457 transitions. [2018-10-15 12:58:49,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2018-10-15 12:58:49,711 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 442 [2018-10-15 12:58:49,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:49,713 INFO L225 Difference]: With dead ends: 457 [2018-10-15 12:58:49,713 INFO L226 Difference]: Without dead ends: 457 [2018-10-15 12:58:49,714 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8008 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=14043, Invalid=30267, Unknown=0, NotChecked=0, Total=44310 [2018-10-15 12:58:49,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-10-15 12:58:49,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 451. [2018-10-15 12:58:49,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2018-10-15 12:58:49,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 451 transitions. [2018-10-15 12:58:49,719 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 451 transitions. Word has length 442 [2018-10-15 12:58:49,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:49,719 INFO L481 AbstractCegarLoop]: Abstraction has 451 states and 451 transitions. [2018-10-15 12:58:49,719 INFO L482 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-10-15 12:58:49,719 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 451 transitions. [2018-10-15 12:58:49,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2018-10-15 12:58:49,721 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:49,722 INFO L375 BasicCegarLoop]: trace histogram [53, 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] [2018-10-15 12:58:49,722 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:49,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:49,722 INFO L82 PathProgramCache]: Analyzing trace with hash -540587942, now seen corresponding path program 53 times [2018-10-15 12:58:49,723 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:49,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:53,431 INFO L134 CoverageAnalysis]: Checked inductivity of 11077 backedges. 0 proven. 11077 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:58:53,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:53,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-10-15 12:58:53,433 INFO L460 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-10-15 12:58:53,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-10-15 12:58:53,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3024, Invalid=8748, Unknown=0, NotChecked=0, Total=11772 [2018-10-15 12:58:53,434 INFO L87 Difference]: Start difference. First operand 451 states and 451 transitions. Second operand 109 states. [2018-10-15 12:58:59,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:59,882 INFO L93 Difference]: Finished difference Result 465 states and 465 transitions. [2018-10-15 12:58:59,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2018-10-15 12:58:59,882 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 450 [2018-10-15 12:58:59,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:59,883 INFO L225 Difference]: With dead ends: 465 [2018-10-15 12:58:59,884 INFO L226 Difference]: Without dead ends: 465 [2018-10-15 12:58:59,886 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8321 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=14578, Invalid=31432, Unknown=0, NotChecked=0, Total=46010 [2018-10-15 12:58:59,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2018-10-15 12:58:59,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 459. [2018-10-15 12:58:59,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2018-10-15 12:58:59,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 459 transitions. [2018-10-15 12:58:59,889 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 459 transitions. Word has length 450 [2018-10-15 12:58:59,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:59,890 INFO L481 AbstractCegarLoop]: Abstraction has 459 states and 459 transitions. [2018-10-15 12:58:59,890 INFO L482 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-10-15 12:58:59,890 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 459 transitions. [2018-10-15 12:58:59,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2018-10-15 12:58:59,891 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:59,892 INFO L375 BasicCegarLoop]: trace histogram [54, 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] [2018-10-15 12:58:59,892 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:59,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:59,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1564544866, now seen corresponding path program 54 times [2018-10-15 12:58:59,893 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:59,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:59:03,754 INFO L134 CoverageAnalysis]: Checked inductivity of 11502 backedges. 0 proven. 11502 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:59:03,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:59:03,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-10-15 12:59:03,755 INFO L460 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-10-15 12:59:03,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-10-15 12:59:03,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3135, Invalid=9075, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 12:59:03,756 INFO L87 Difference]: Start difference. First operand 459 states and 459 transitions. Second operand 111 states. [2018-10-15 12:59:10,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:59:10,143 INFO L93 Difference]: Finished difference Result 473 states and 473 transitions. [2018-10-15 12:59:10,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2018-10-15 12:59:10,144 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 458 [2018-10-15 12:59:10,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:59:10,145 INFO L225 Difference]: With dead ends: 473 [2018-10-15 12:59:10,145 INFO L226 Difference]: Without dead ends: 473 [2018-10-15 12:59:10,148 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8640 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=15123, Invalid=32619, Unknown=0, NotChecked=0, Total=47742 [2018-10-15 12:59:10,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2018-10-15 12:59:10,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 467. [2018-10-15 12:59:10,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2018-10-15 12:59:10,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 467 transitions. [2018-10-15 12:59:10,151 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 467 transitions. Word has length 458 [2018-10-15 12:59:10,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:59:10,152 INFO L481 AbstractCegarLoop]: Abstraction has 467 states and 467 transitions. [2018-10-15 12:59:10,152 INFO L482 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-10-15 12:59:10,152 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 467 transitions. [2018-10-15 12:59:10,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2018-10-15 12:59:10,153 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:59:10,154 INFO L375 BasicCegarLoop]: trace histogram [55, 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] [2018-10-15 12:59:10,154 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:59:10,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:59:10,154 INFO L82 PathProgramCache]: Analyzing trace with hash 640110186, now seen corresponding path program 55 times [2018-10-15 12:59:10,155 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:59:10,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:59:14,300 INFO L134 CoverageAnalysis]: Checked inductivity of 11935 backedges. 0 proven. 11935 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:59:14,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:59:14,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-10-15 12:59:14,301 INFO L460 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-10-15 12:59:14,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-10-15 12:59:14,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3248, Invalid=9408, Unknown=0, NotChecked=0, Total=12656 [2018-10-15 12:59:14,302 INFO L87 Difference]: Start difference. First operand 467 states and 467 transitions. Second operand 113 states. [2018-10-15 12:59:21,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:59:21,047 INFO L93 Difference]: Finished difference Result 481 states and 481 transitions. [2018-10-15 12:59:21,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2018-10-15 12:59:21,047 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 466 [2018-10-15 12:59:21,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:59:21,050 INFO L225 Difference]: With dead ends: 481 [2018-10-15 12:59:21,050 INFO L226 Difference]: Without dead ends: 481 [2018-10-15 12:59:21,053 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:21,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2018-10-15 12:59:21,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 475. [2018-10-15 12:59:21,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 475 states. [2018-10-15 12:59:21,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 475 transitions. [2018-10-15 12:59:21,056 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 475 transitions. Word has length 466 [2018-10-15 12:59:21,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:59:21,056 INFO L481 AbstractCegarLoop]: Abstraction has 475 states and 475 transitions. [2018-10-15 12:59:21,056 INFO L482 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-10-15 12:59:21,057 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 475 transitions. [2018-10-15 12:59:21,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2018-10-15 12:59:21,058 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:59:21,058 INFO L375 BasicCegarLoop]: trace histogram [56, 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] [2018-10-15 12:59:21,059 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:59:21,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:59:21,059 INFO L82 PathProgramCache]: Analyzing trace with hash 578946418, now seen corresponding path program 56 times [2018-10-15 12:59:21,059 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:59:21,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:59:25,236 INFO L134 CoverageAnalysis]: Checked inductivity of 12376 backedges. 0 proven. 12376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:59:25,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:59:25,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-10-15 12:59:25,237 INFO L460 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-10-15 12:59:25,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-10-15 12:59:25,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3363, Invalid=9747, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 12:59:25,238 INFO L87 Difference]: Start difference. First operand 475 states and 475 transitions. Second operand 115 states. [2018-10-15 12:59:32,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:59:32,179 INFO L93 Difference]: Finished difference Result 489 states and 489 transitions. [2018-10-15 12:59:32,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2018-10-15 12:59:32,179 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 474 [2018-10-15 12:59:32,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:59:32,181 INFO L225 Difference]: With dead ends: 489 [2018-10-15 12:59:32,181 INFO L226 Difference]: Without dead ends: 489 [2018-10-15 12:59:32,183 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9296 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=16243, Invalid=35059, Unknown=0, NotChecked=0, Total=51302 [2018-10-15 12:59:32,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2018-10-15 12:59:32,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 483. [2018-10-15 12:59:32,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2018-10-15 12:59:32,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 483 transitions. [2018-10-15 12:59:32,187 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 483 transitions. Word has length 474 [2018-10-15 12:59:32,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:59:32,187 INFO L481 AbstractCegarLoop]: Abstraction has 483 states and 483 transitions. [2018-10-15 12:59:32,187 INFO L482 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-10-15 12:59:32,187 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 483 transitions. [2018-10-15 12:59:32,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2018-10-15 12:59:32,189 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:59:32,189 INFO L375 BasicCegarLoop]: trace histogram [57, 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] [2018-10-15 12:59:32,189 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:59:32,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:59:32,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1302776710, now seen corresponding path program 57 times [2018-10-15 12:59:32,190 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:59:32,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:59:36,480 INFO L134 CoverageAnalysis]: Checked inductivity of 12825 backedges. 0 proven. 12825 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:59:36,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:59:36,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-10-15 12:59:36,481 INFO L460 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-10-15 12:59:36,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-10-15 12:59:36,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3480, Invalid=10092, Unknown=0, NotChecked=0, Total=13572 [2018-10-15 12:59:36,482 INFO L87 Difference]: Start difference. First operand 483 states and 483 transitions. Second operand 117 states. [2018-10-15 12:59:43,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:59:43,869 INFO L93 Difference]: Finished difference Result 497 states and 497 transitions. [2018-10-15 12:59:43,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2018-10-15 12:59:43,869 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 482 [2018-10-15 12:59:43,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:59:43,871 INFO L225 Difference]: With dead ends: 497 [2018-10-15 12:59:43,871 INFO L226 Difference]: Without dead ends: 497 [2018-10-15 12:59:43,874 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:43,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2018-10-15 12:59:43,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 491. [2018-10-15 12:59:43,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2018-10-15 12:59:43,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 491 transitions. [2018-10-15 12:59:43,878 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 491 transitions. Word has length 482 [2018-10-15 12:59:43,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:59:43,879 INFO L481 AbstractCegarLoop]: Abstraction has 491 states and 491 transitions. [2018-10-15 12:59:43,879 INFO L482 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-10-15 12:59:43,879 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 491 transitions. [2018-10-15 12:59:43,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 491 [2018-10-15 12:59:43,881 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:59:43,882 INFO L375 BasicCegarLoop]: trace histogram [58, 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] [2018-10-15 12:59:43,882 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:59:43,882 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:59:43,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1380656254, now seen corresponding path program 58 times [2018-10-15 12:59:43,883 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:59:43,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:59:48,264 INFO L134 CoverageAnalysis]: Checked inductivity of 13282 backedges. 0 proven. 13282 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:59:48,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:59:48,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-10-15 12:59:48,265 INFO L460 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-10-15 12:59:48,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-10-15 12:59:48,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3599, Invalid=10443, Unknown=0, NotChecked=0, Total=14042 [2018-10-15 12:59:48,266 INFO L87 Difference]: Start difference. First operand 491 states and 491 transitions. Second operand 119 states. [2018-10-15 12:59:55,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:59:55,806 INFO L93 Difference]: Finished difference Result 505 states and 505 transitions. [2018-10-15 12:59:55,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2018-10-15 12:59:55,806 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 490 [2018-10-15 12:59:55,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:59:55,808 INFO L225 Difference]: With dead ends: 505 [2018-10-15 12:59:55,808 INFO L226 Difference]: Without dead ends: 505 [2018-10-15 12:59:55,809 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9976 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=17403, Invalid=37587, Unknown=0, NotChecked=0, Total=54990 [2018-10-15 12:59:55,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2018-10-15 12:59:55,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 499. [2018-10-15 12:59:55,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2018-10-15 12:59:55,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 499 transitions. [2018-10-15 12:59:55,813 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 499 transitions. Word has length 490 [2018-10-15 12:59:55,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:59:55,813 INFO L481 AbstractCegarLoop]: Abstraction has 499 states and 499 transitions. [2018-10-15 12:59:55,813 INFO L482 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-10-15 12:59:55,813 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 499 transitions. [2018-10-15 12:59:55,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 499 [2018-10-15 12:59:55,815 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:59:55,815 INFO L375 BasicCegarLoop]: trace histogram [59, 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] [2018-10-15 12:59:55,816 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:59:55,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:59:55,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1688009354, now seen corresponding path program 59 times [2018-10-15 12:59:55,817 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:59:55,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:00:00,435 INFO L134 CoverageAnalysis]: Checked inductivity of 13747 backedges. 0 proven. 13747 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:00:00,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:00:00,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-10-15 13:00:00,436 INFO L460 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-10-15 13:00:00,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-10-15 13:00:00,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3720, Invalid=10800, Unknown=0, NotChecked=0, Total=14520 [2018-10-15 13:00:00,437 INFO L87 Difference]: Start difference. First operand 499 states and 499 transitions. Second operand 121 states. [2018-10-15 13:00:08,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:00:08,218 INFO L93 Difference]: Finished difference Result 513 states and 513 transitions. [2018-10-15 13:00:08,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2018-10-15 13:00:08,218 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 498 [2018-10-15 13:00:08,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:00:08,220 INFO L225 Difference]: With dead ends: 513 [2018-10-15 13:00:08,220 INFO L226 Difference]: Without dead ends: 513 [2018-10-15 13:00:08,222 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:08,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2018-10-15 13:00:08,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 507. [2018-10-15 13:00:08,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2018-10-15 13:00:08,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 507 transitions. [2018-10-15 13:00:08,225 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 507 transitions. Word has length 498 [2018-10-15 13:00:08,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:00:08,225 INFO L481 AbstractCegarLoop]: Abstraction has 507 states and 507 transitions. [2018-10-15 13:00:08,225 INFO L482 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-10-15 13:00:08,226 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 507 transitions. [2018-10-15 13:00:08,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2018-10-15 13:00:08,227 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:00:08,228 INFO L375 BasicCegarLoop]: trace histogram [60, 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] [2018-10-15 13:00:08,228 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:00:08,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:00:08,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1625714286, now seen corresponding path program 60 times [2018-10-15 13:00:08,229 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:00:08,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:00:12,823 INFO L134 CoverageAnalysis]: Checked inductivity of 14220 backedges. 0 proven. 14220 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:00:12,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:00:12,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-10-15 13:00:12,824 INFO L460 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-10-15 13:00:12,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-10-15 13:00:12,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3843, Invalid=11163, Unknown=0, NotChecked=0, Total=15006 [2018-10-15 13:00:12,825 INFO L87 Difference]: Start difference. First operand 507 states and 507 transitions. Second operand 123 states. [2018-10-15 13:00:20,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:00:20,816 INFO L93 Difference]: Finished difference Result 521 states and 521 transitions. [2018-10-15 13:00:20,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2018-10-15 13:00:20,816 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 506 [2018-10-15 13:00:20,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:00:20,818 INFO L225 Difference]: With dead ends: 521 [2018-10-15 13:00:20,818 INFO L226 Difference]: Without dead ends: 521 [2018-10-15 13:00:20,820 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10680 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=18603, Invalid=40203, Unknown=0, NotChecked=0, Total=58806 [2018-10-15 13:00:20,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2018-10-15 13:00:20,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 515. [2018-10-15 13:00:20,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2018-10-15 13:00:20,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 515 transitions. [2018-10-15 13:00:20,824 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 515 transitions. Word has length 506 [2018-10-15 13:00:20,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:00:20,824 INFO L481 AbstractCegarLoop]: Abstraction has 515 states and 515 transitions. [2018-10-15 13:00:20,824 INFO L482 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-10-15 13:00:20,824 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 515 transitions. [2018-10-15 13:00:20,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2018-10-15 13:00:20,826 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:00:20,826 INFO L375 BasicCegarLoop]: trace histogram [61, 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] [2018-10-15 13:00:20,826 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:00:20,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:00:20,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1657626470, now seen corresponding path program 61 times [2018-10-15 13:00:20,827 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:00:20,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:00:25,594 INFO L134 CoverageAnalysis]: Checked inductivity of 14701 backedges. 0 proven. 14701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:00:25,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:00:25,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-10-15 13:00:25,595 INFO L460 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-10-15 13:00:25,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-10-15 13:00:25,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3968, Invalid=11532, Unknown=0, NotChecked=0, Total=15500 [2018-10-15 13:00:25,596 INFO L87 Difference]: Start difference. First operand 515 states and 515 transitions. Second operand 125 states. [2018-10-15 13:00:33,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:00:33,819 INFO L93 Difference]: Finished difference Result 529 states and 529 transitions. [2018-10-15 13:00:33,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 186 states. [2018-10-15 13:00:33,819 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 514 [2018-10-15 13:00:33,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:00:33,821 INFO L225 Difference]: With dead ends: 529 [2018-10-15 13:00:33,821 INFO L226 Difference]: Without dead ends: 529 [2018-10-15 13:00:33,823 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11041 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=19218, Invalid=41544, Unknown=0, NotChecked=0, Total=60762 [2018-10-15 13:00:33,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2018-10-15 13:00:33,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 523. [2018-10-15 13:00:33,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2018-10-15 13:00:33,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 523 transitions. [2018-10-15 13:00:33,827 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 523 transitions. Word has length 514 [2018-10-15 13:00:33,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:00:33,827 INFO L481 AbstractCegarLoop]: Abstraction has 523 states and 523 transitions. [2018-10-15 13:00:33,827 INFO L482 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-10-15 13:00:33,827 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 523 transitions. [2018-10-15 13:00:33,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 523 [2018-10-15 13:00:33,829 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:00:33,829 INFO L375 BasicCegarLoop]: trace histogram [62, 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] [2018-10-15 13:00:33,829 INFO L424 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:00:33,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:00:33,830 INFO L82 PathProgramCache]: Analyzing trace with hash 384837538, now seen corresponding path program 62 times [2018-10-15 13:00:33,830 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:00:33,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:00:38,651 INFO L134 CoverageAnalysis]: Checked inductivity of 15190 backedges. 0 proven. 15190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:00:38,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:00:38,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-10-15 13:00:38,652 INFO L460 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-10-15 13:00:38,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-10-15 13:00:38,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=11907, Unknown=0, NotChecked=0, Total=16002 [2018-10-15 13:00:38,653 INFO L87 Difference]: Start difference. First operand 523 states and 523 transitions. Second operand 127 states. [2018-10-15 13:00:47,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:00:47,271 INFO L93 Difference]: Finished difference Result 537 states and 537 transitions. [2018-10-15 13:00:47,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 189 states. [2018-10-15 13:00:47,271 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 522 [2018-10-15 13:00:47,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:00:47,273 INFO L225 Difference]: With dead ends: 537 [2018-10-15 13:00:47,273 INFO L226 Difference]: Without dead ends: 537 [2018-10-15 13:00:47,275 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11408 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=19843, Invalid=42907, Unknown=0, NotChecked=0, Total=62750 [2018-10-15 13:00:47,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2018-10-15 13:00:47,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 531. [2018-10-15 13:00:47,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 531 states. [2018-10-15 13:00:47,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 531 transitions. [2018-10-15 13:00:47,279 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 531 transitions. Word has length 522 [2018-10-15 13:00:47,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:00:47,279 INFO L481 AbstractCegarLoop]: Abstraction has 531 states and 531 transitions. [2018-10-15 13:00:47,279 INFO L482 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-10-15 13:00:47,280 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 531 transitions. [2018-10-15 13:00:47,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2018-10-15 13:00:47,281 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:00:47,282 INFO L375 BasicCegarLoop]: trace histogram [63, 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] [2018-10-15 13:00:47,282 INFO L424 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:00:47,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:00:47,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1012541098, now seen corresponding path program 63 times [2018-10-15 13:00:47,283 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:00:47,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:00:52,470 INFO L134 CoverageAnalysis]: Checked inductivity of 15687 backedges. 0 proven. 15687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:00:52,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:00:52,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-10-15 13:00:52,472 INFO L460 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-10-15 13:00:52,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-10-15 13:00:52,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4224, Invalid=12288, Unknown=0, NotChecked=0, Total=16512 [2018-10-15 13:00:52,473 INFO L87 Difference]: Start difference. First operand 531 states and 531 transitions. Second operand 129 states. [2018-10-15 13:01:01,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:01:01,379 INFO L93 Difference]: Finished difference Result 545 states and 545 transitions. [2018-10-15 13:01:01,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2018-10-15 13:01:01,379 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 530 [2018-10-15 13:01:01,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:01:01,381 INFO L225 Difference]: With dead ends: 545 [2018-10-15 13:01:01,381 INFO L226 Difference]: Without dead ends: 545 [2018-10-15 13:01:01,383 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11781 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=20478, Invalid=44292, Unknown=0, NotChecked=0, Total=64770 [2018-10-15 13:01:01,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2018-10-15 13:01:01,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 539. [2018-10-15 13:01:01,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-10-15 13:01:01,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 539 transitions. [2018-10-15 13:01:01,387 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 539 transitions. Word has length 530 [2018-10-15 13:01:01,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:01:01,388 INFO L481 AbstractCegarLoop]: Abstraction has 539 states and 539 transitions. [2018-10-15 13:01:01,388 INFO L482 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-10-15 13:01:01,388 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 539 transitions. [2018-10-15 13:01:01,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2018-10-15 13:01:01,390 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:01:01,390 INFO L375 BasicCegarLoop]: trace histogram [64, 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] [2018-10-15 13:01:01,391 INFO L424 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:01:01,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:01:01,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1250386510, now seen corresponding path program 64 times [2018-10-15 13:01:01,391 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:01:01,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:01:06,623 INFO L134 CoverageAnalysis]: Checked inductivity of 16192 backedges. 0 proven. 16192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:01:06,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:01:06,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-10-15 13:01:06,624 INFO L460 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-10-15 13:01:06,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-10-15 13:01:06,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4355, Invalid=12675, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 13:01:06,625 INFO L87 Difference]: Start difference. First operand 539 states and 539 transitions. Second operand 131 states. [2018-10-15 13:01:15,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:01:15,729 INFO L93 Difference]: Finished difference Result 553 states and 553 transitions. [2018-10-15 13:01:15,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2018-10-15 13:01:15,729 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 538 [2018-10-15 13:01:15,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:01:15,731 INFO L225 Difference]: With dead ends: 553 [2018-10-15 13:01:15,731 INFO L226 Difference]: Without dead ends: 553 [2018-10-15 13:01:15,733 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 257 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12160 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=21123, Invalid=45699, Unknown=0, NotChecked=0, Total=66822 [2018-10-15 13:01:15,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 553 states. [2018-10-15 13:01:15,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 553 to 547. [2018-10-15 13:01:15,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2018-10-15 13:01:15,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 547 transitions. [2018-10-15 13:01:15,737 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 547 transitions. Word has length 538 [2018-10-15 13:01:15,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:01:15,738 INFO L481 AbstractCegarLoop]: Abstraction has 547 states and 547 transitions. [2018-10-15 13:01:15,738 INFO L482 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-10-15 13:01:15,738 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 547 transitions. [2018-10-15 13:01:15,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 547 [2018-10-15 13:01:15,740 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:01:15,740 INFO L375 BasicCegarLoop]: trace histogram [65, 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] [2018-10-15 13:01:15,740 INFO L424 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:01:15,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:01:15,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1571582790, now seen corresponding path program 65 times [2018-10-15 13:01:15,741 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:01:15,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:01:21,078 INFO L134 CoverageAnalysis]: Checked inductivity of 16705 backedges. 0 proven. 16705 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:01:21,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:01:21,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-10-15 13:01:21,079 INFO L460 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-10-15 13:01:21,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-10-15 13:01:21,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4488, Invalid=13068, Unknown=0, NotChecked=0, Total=17556 [2018-10-15 13:01:21,081 INFO L87 Difference]: Start difference. First operand 547 states and 547 transitions. Second operand 133 states. [2018-10-15 13:01:30,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:01:30,559 INFO L93 Difference]: Finished difference Result 561 states and 561 transitions. [2018-10-15 13:01:30,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 198 states. [2018-10-15 13:01:30,559 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 546 [2018-10-15 13:01:30,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:01:30,562 INFO L225 Difference]: With dead ends: 561 [2018-10-15 13:01:30,562 INFO L226 Difference]: Without dead ends: 561 [2018-10-15 13:01:30,563 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12545 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=21778, Invalid=47128, Unknown=0, NotChecked=0, Total=68906 [2018-10-15 13:01:30,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2018-10-15 13:01:30,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 555. [2018-10-15 13:01:30,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2018-10-15 13:01:30,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 555 transitions. [2018-10-15 13:01:30,567 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 555 transitions. Word has length 546 [2018-10-15 13:01:30,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:01:30,567 INFO L481 AbstractCegarLoop]: Abstraction has 555 states and 555 transitions. [2018-10-15 13:01:30,567 INFO L482 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-10-15 13:01:30,567 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 555 transitions. [2018-10-15 13:01:30,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 555 [2018-10-15 13:01:30,569 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:01:30,570 INFO L375 BasicCegarLoop]: trace histogram [66, 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] [2018-10-15 13:01:30,570 INFO L424 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:01:30,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:01:30,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1695353918, now seen corresponding path program 66 times [2018-10-15 13:01:30,571 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:01:30,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:01:36,140 INFO L134 CoverageAnalysis]: Checked inductivity of 17226 backedges. 0 proven. 17226 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:01:36,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:01:36,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-10-15 13:01:36,141 INFO L460 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-10-15 13:01:36,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-10-15 13:01:36,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4623, Invalid=13467, Unknown=0, NotChecked=0, Total=18090 [2018-10-15 13:01:36,142 INFO L87 Difference]: Start difference. First operand 555 states and 555 transitions. Second operand 135 states. [2018-10-15 13:01:45,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:01:45,776 INFO L93 Difference]: Finished difference Result 569 states and 569 transitions. [2018-10-15 13:01:45,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2018-10-15 13:01:45,777 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 554 [2018-10-15 13:01:45,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:01:45,778 INFO L225 Difference]: With dead ends: 569 [2018-10-15 13:01:45,779 INFO L226 Difference]: Without dead ends: 569 [2018-10-15 13:01:45,781 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12936 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=22443, Invalid=48579, Unknown=0, NotChecked=0, Total=71022 [2018-10-15 13:01:45,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2018-10-15 13:01:45,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 563. [2018-10-15 13:01:45,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2018-10-15 13:01:45,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 563 transitions. [2018-10-15 13:01:45,784 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 563 transitions. Word has length 554 [2018-10-15 13:01:45,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:01:45,785 INFO L481 AbstractCegarLoop]: Abstraction has 563 states and 563 transitions. [2018-10-15 13:01:45,785 INFO L482 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-10-15 13:01:45,785 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 563 transitions. [2018-10-15 13:01:45,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 563 [2018-10-15 13:01:45,787 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:01:45,787 INFO L375 BasicCegarLoop]: trace histogram [67, 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] [2018-10-15 13:01:45,788 INFO L424 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:01:45,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:01:45,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1352740150, now seen corresponding path program 67 times [2018-10-15 13:01:45,788 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:01:45,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:01:51,489 INFO L134 CoverageAnalysis]: Checked inductivity of 17755 backedges. 0 proven. 17755 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:01:51,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:01:51,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2018-10-15 13:01:51,490 INFO L460 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-10-15 13:01:51,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-10-15 13:01:51,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4760, Invalid=13872, Unknown=0, NotChecked=0, Total=18632 [2018-10-15 13:01:51,492 INFO L87 Difference]: Start difference. First operand 563 states and 563 transitions. Second operand 137 states. [2018-10-15 13:02:01,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:02:01,431 INFO L93 Difference]: Finished difference Result 577 states and 577 transitions. [2018-10-15 13:02:01,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 204 states. [2018-10-15 13:02:01,432 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 562 [2018-10-15 13:02:01,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:02:01,434 INFO L225 Difference]: With dead ends: 577 [2018-10-15 13:02:01,434 INFO L226 Difference]: Without dead ends: 577 [2018-10-15 13:02:01,435 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13333 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=23118, Invalid=50052, Unknown=0, NotChecked=0, Total=73170 [2018-10-15 13:02:01,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2018-10-15 13:02:01,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 571. [2018-10-15 13:02:01,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2018-10-15 13:02:01,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 571 transitions. [2018-10-15 13:02:01,439 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 571 transitions. Word has length 562 [2018-10-15 13:02:01,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:02:01,439 INFO L481 AbstractCegarLoop]: Abstraction has 571 states and 571 transitions. [2018-10-15 13:02:01,440 INFO L482 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-10-15 13:02:01,440 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 571 transitions. [2018-10-15 13:02:01,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 571 [2018-10-15 13:02:01,442 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:02:01,442 INFO L375 BasicCegarLoop]: trace histogram [68, 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] [2018-10-15 13:02:01,442 INFO L424 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:02:01,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:02:01,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1738484178, now seen corresponding path program 68 times [2018-10-15 13:02:01,443 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:02:01,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:02:07,489 INFO L134 CoverageAnalysis]: Checked inductivity of 18292 backedges. 0 proven. 18292 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:02:07,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:02:07,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2018-10-15 13:02:07,490 INFO L460 AbstractCegarLoop]: Interpolant automaton has 139 states [2018-10-15 13:02:07,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2018-10-15 13:02:07,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4899, Invalid=14283, Unknown=0, NotChecked=0, Total=19182 [2018-10-15 13:02:07,491 INFO L87 Difference]: Start difference. First operand 571 states and 571 transitions. Second operand 139 states. [2018-10-15 13:02:17,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:02:17,946 INFO L93 Difference]: Finished difference Result 585 states and 585 transitions. [2018-10-15 13:02:17,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 207 states. [2018-10-15 13:02:17,947 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 570 [2018-10-15 13:02:17,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:02:17,948 INFO L225 Difference]: With dead ends: 585 [2018-10-15 13:02:17,949 INFO L226 Difference]: Without dead ends: 585 [2018-10-15 13:02:17,950 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13736 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=23803, Invalid=51547, Unknown=0, NotChecked=0, Total=75350 [2018-10-15 13:02:17,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2018-10-15 13:02:17,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 579. [2018-10-15 13:02:17,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2018-10-15 13:02:17,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 579 transitions. [2018-10-15 13:02:17,954 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 579 transitions. Word has length 570 [2018-10-15 13:02:17,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:02:17,955 INFO L481 AbstractCegarLoop]: Abstraction has 579 states and 579 transitions. [2018-10-15 13:02:17,955 INFO L482 AbstractCegarLoop]: Interpolant automaton has 139 states. [2018-10-15 13:02:17,955 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 579 transitions. [2018-10-15 13:02:17,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 579 [2018-10-15 13:02:17,957 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:02:17,957 INFO L375 BasicCegarLoop]: trace histogram [69, 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] [2018-10-15 13:02:17,957 INFO L424 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:02:17,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:02:17,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1011091238, now seen corresponding path program 69 times [2018-10-15 13:02:17,958 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:02:18,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:02:24,077 INFO L134 CoverageAnalysis]: Checked inductivity of 18837 backedges. 0 proven. 18837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:02:24,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:02:24,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141] total 141 [2018-10-15 13:02:24,078 INFO L460 AbstractCegarLoop]: Interpolant automaton has 141 states [2018-10-15 13:02:24,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2018-10-15 13:02:24,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5040, Invalid=14700, Unknown=0, NotChecked=0, Total=19740 [2018-10-15 13:02:24,079 INFO L87 Difference]: Start difference. First operand 579 states and 579 transitions. Second operand 141 states. [2018-10-15 13:02:34,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:02:34,695 INFO L93 Difference]: Finished difference Result 593 states and 593 transitions. [2018-10-15 13:02:34,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 210 states. [2018-10-15 13:02:34,696 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 578 [2018-10-15 13:02:34,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:02:34,698 INFO L225 Difference]: With dead ends: 593 [2018-10-15 13:02:34,698 INFO L226 Difference]: Without dead ends: 593 [2018-10-15 13:02:34,700 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 277 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14145 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=24498, Invalid=53064, Unknown=0, NotChecked=0, Total=77562 [2018-10-15 13:02:34,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2018-10-15 13:02:34,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 587. [2018-10-15 13:02:34,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2018-10-15 13:02:34,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 587 transitions. [2018-10-15 13:02:34,704 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 587 transitions. Word has length 578 [2018-10-15 13:02:34,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:02:34,705 INFO L481 AbstractCegarLoop]: Abstraction has 587 states and 587 transitions. [2018-10-15 13:02:34,705 INFO L482 AbstractCegarLoop]: Interpolant automaton has 141 states. [2018-10-15 13:02:34,705 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 587 transitions. [2018-10-15 13:02:34,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 587 [2018-10-15 13:02:34,707 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:02:34,707 INFO L375 BasicCegarLoop]: trace histogram [70, 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] [2018-10-15 13:02:34,707 INFO L424 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:02:34,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:02:34,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1002258402, now seen corresponding path program 70 times [2018-10-15 13:02:34,708 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:02:34,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:02:41,048 INFO L134 CoverageAnalysis]: Checked inductivity of 19390 backedges. 0 proven. 19390 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:02:41,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:02:41,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143] total 143 [2018-10-15 13:02:41,049 INFO L460 AbstractCegarLoop]: Interpolant automaton has 143 states [2018-10-15 13:02:41,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2018-10-15 13:02:41,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5183, Invalid=15123, Unknown=0, NotChecked=0, Total=20306 [2018-10-15 13:02:41,051 INFO L87 Difference]: Start difference. First operand 587 states and 587 transitions. Second operand 143 states. [2018-10-15 13:02:51,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:02:51,855 INFO L93 Difference]: Finished difference Result 601 states and 601 transitions. [2018-10-15 13:02:51,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 213 states. [2018-10-15 13:02:51,855 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 586 [2018-10-15 13:02:51,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:02:51,857 INFO L225 Difference]: With dead ends: 601 [2018-10-15 13:02:51,857 INFO L226 Difference]: Without dead ends: 601 [2018-10-15 13:02:51,859 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:02:51,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2018-10-15 13:02:51,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 595. [2018-10-15 13:02:51,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2018-10-15 13:02:51,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 595 transitions. [2018-10-15 13:02:51,863 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 595 transitions. Word has length 586 [2018-10-15 13:02:51,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:02:51,863 INFO L481 AbstractCegarLoop]: Abstraction has 595 states and 595 transitions. [2018-10-15 13:02:51,863 INFO L482 AbstractCegarLoop]: Interpolant automaton has 143 states. [2018-10-15 13:02:51,863 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 595 transitions. [2018-10-15 13:02:51,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 595 [2018-10-15 13:02:51,866 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:02:51,866 INFO L375 BasicCegarLoop]: trace histogram [71, 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] [2018-10-15 13:02:51,866 INFO L424 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:02:51,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:02:51,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1079312662, now seen corresponding path program 71 times [2018-10-15 13:02:51,867 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:02:51,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:02:58,515 INFO L134 CoverageAnalysis]: Checked inductivity of 19951 backedges. 0 proven. 19951 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:02:58,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:02:58,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145] total 145 [2018-10-15 13:02:58,516 INFO L460 AbstractCegarLoop]: Interpolant automaton has 145 states [2018-10-15 13:02:58,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2018-10-15 13:02:58,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5328, Invalid=15552, Unknown=0, NotChecked=0, Total=20880 [2018-10-15 13:02:58,517 INFO L87 Difference]: Start difference. First operand 595 states and 595 transitions. Second operand 145 states. [2018-10-15 13:03:09,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:09,446 INFO L93 Difference]: Finished difference Result 609 states and 609 transitions. [2018-10-15 13:03:09,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 216 states. [2018-10-15 13:03:09,447 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 594 [2018-10-15 13:03:09,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:09,450 INFO L225 Difference]: With dead ends: 609 [2018-10-15 13:03:09,450 INFO L226 Difference]: Without dead ends: 609 [2018-10-15 13:03:09,453 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 285 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14981 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=25918, Invalid=56164, Unknown=0, NotChecked=0, Total=82082 [2018-10-15 13:03:09,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2018-10-15 13:03:09,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 603. [2018-10-15 13:03:09,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2018-10-15 13:03:09,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 603 transitions. [2018-10-15 13:03:09,457 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 603 transitions. Word has length 594 [2018-10-15 13:03:09,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:09,457 INFO L481 AbstractCegarLoop]: Abstraction has 603 states and 603 transitions. [2018-10-15 13:03:09,457 INFO L482 AbstractCegarLoop]: Interpolant automaton has 145 states. [2018-10-15 13:03:09,457 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 603 transitions. [2018-10-15 13:03:09,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 603 [2018-10-15 13:03:09,460 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:09,460 INFO L375 BasicCegarLoop]: trace histogram [72, 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] [2018-10-15 13:03:09,460 INFO L424 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:09,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:09,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1215482382, now seen corresponding path program 72 times [2018-10-15 13:03:09,461 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:09,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:16,029 INFO L134 CoverageAnalysis]: Checked inductivity of 20520 backedges. 0 proven. 20520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:16,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:16,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147] total 147 [2018-10-15 13:03:16,030 INFO L460 AbstractCegarLoop]: Interpolant automaton has 147 states [2018-10-15 13:03:16,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2018-10-15 13:03:16,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5475, Invalid=15987, Unknown=0, NotChecked=0, Total=21462 [2018-10-15 13:03:16,032 INFO L87 Difference]: Start difference. First operand 603 states and 603 transitions. Second operand 147 states. [2018-10-15 13:03:27,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:27,595 INFO L93 Difference]: Finished difference Result 617 states and 617 transitions. [2018-10-15 13:03:27,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 219 states. [2018-10-15 13:03:27,596 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 602 [2018-10-15 13:03:27,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:27,598 INFO L225 Difference]: With dead ends: 617 [2018-10-15 13:03:27,598 INFO L226 Difference]: Without dead ends: 617 [2018-10-15 13:03:27,599 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:27,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2018-10-15 13:03:27,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 611. [2018-10-15 13:03:27,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2018-10-15 13:03:27,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 611 transitions. [2018-10-15 13:03:27,603 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 611 transitions. Word has length 602 [2018-10-15 13:03:27,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:27,604 INFO L481 AbstractCegarLoop]: Abstraction has 611 states and 611 transitions. [2018-10-15 13:03:27,604 INFO L482 AbstractCegarLoop]: Interpolant automaton has 147 states. [2018-10-15 13:03:27,604 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 611 transitions. [2018-10-15 13:03:27,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 611 [2018-10-15 13:03:27,606 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:27,607 INFO L375 BasicCegarLoop]: trace histogram [73, 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] [2018-10-15 13:03:27,607 INFO L424 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:27,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:27,607 INFO L82 PathProgramCache]: Analyzing trace with hash 57402618, now seen corresponding path program 73 times [2018-10-15 13:03:27,608 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:27,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:34,509 INFO L134 CoverageAnalysis]: Checked inductivity of 21097 backedges. 0 proven. 21097 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:34,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:34,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [149] total 149 [2018-10-15 13:03:34,510 INFO L460 AbstractCegarLoop]: Interpolant automaton has 149 states [2018-10-15 13:03:34,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2018-10-15 13:03:34,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5624, Invalid=16428, Unknown=0, NotChecked=0, Total=22052 [2018-10-15 13:03:34,511 INFO L87 Difference]: Start difference. First operand 611 states and 611 transitions. Second operand 149 states.