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/20181010-MemSafetyPathprograms/ArraysOfVariableLength_true-valid-memsafety.c_13.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-093a8c0 [2018-10-14 18:10:30,589 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-14 18:10:30,592 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-14 18:10:30,605 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-14 18:10:30,605 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-14 18:10:30,606 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-14 18:10:30,608 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-14 18:10:30,609 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-14 18:10:30,611 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-14 18:10:30,612 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-14 18:10:30,613 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-14 18:10:30,613 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-14 18:10:30,614 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-14 18:10:30,615 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-14 18:10:30,617 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-14 18:10:30,617 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-14 18:10:30,618 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-14 18:10:30,620 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-14 18:10:30,622 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-14 18:10:30,624 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-14 18:10:30,625 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-14 18:10:30,626 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-14 18:10:30,629 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-14 18:10:30,629 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-14 18:10:30,630 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-14 18:10:30,631 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-14 18:10:30,632 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-14 18:10:30,632 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-14 18:10:30,633 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-14 18:10:30,634 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-14 18:10:30,635 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-14 18:10:30,635 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-14 18:10:30,636 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-14 18:10:30,636 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-14 18:10:30,637 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-14 18:10:30,638 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-14 18:10:30,638 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-14 18:10:30,648 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-14 18:10:30,648 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-14 18:10:30,649 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-14 18:10:30,649 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-14 18:10:30,650 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-14 18:10:30,650 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-14 18:10:30,651 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-14 18:10:30,651 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-14 18:10:30,651 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-14 18:10:30,651 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-14 18:10:30,651 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-14 18:10:30,652 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-14 18:10:30,652 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-14 18:10:30,653 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-14 18:10:30,653 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-14 18:10:30,714 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-14 18:10:30,730 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-14 18:10:30,737 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-14 18:10:30,739 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-14 18:10:30,739 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-14 18:10:30,740 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysOfVariableLength_true-valid-memsafety.c_13.bpl [2018-10-14 18:10:30,740 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysOfVariableLength_true-valid-memsafety.c_13.bpl' [2018-10-14 18:10:30,843 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-14 18:10:30,847 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-14 18:10:30,847 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-14 18:10:30,847 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-14 18:10:30,848 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-14 18:10:30,877 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 06:10:30" (1/1) ... [2018-10-14 18:10:30,880 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 06:10:30" (1/1) ... [2018-10-14 18:10:30,899 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 06:10:30" (1/1) ... [2018-10-14 18:10:30,899 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 06:10:30" (1/1) ... [2018-10-14 18:10:30,907 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 06:10:30" (1/1) ... [2018-10-14 18:10:30,916 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 06:10:30" (1/1) ... [2018-10-14 18:10:30,918 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 06:10:30" (1/1) ... [2018-10-14 18:10:30,925 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-14 18:10:30,929 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-14 18:10:30,929 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-14 18:10:30,929 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-14 18:10:30,931 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArraysOfVariableLength_true-valid-memsafety.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 06:10:30" (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-14 18:10:30,996 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-14 18:10:30,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-14 18:10:30,997 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-14 18:10:31,561 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-14 18:10:31,562 INFO L202 PluginConnector]: Adding new model ArraysOfVariableLength_true-valid-memsafety.c_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:10:31 BoogieIcfgContainer [2018-10-14 18:10:31,562 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-14 18:10:31,563 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-14 18:10:31,563 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-14 18:10:31,564 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-14 18:10:31,567 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "ArraysOfVariableLength_true-valid-memsafety.c_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:10:31" (1/1) ... [2018-10-14 18:10:31,576 INFO L137 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-10-14 18:10:31,576 INFO L138 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-10-14 18:10:31,616 INFO L191 apSepIcfgTransformer]: Heap separator: starting loc-array-style preprocessing [2018-10-14 18:10:31,663 INFO L219 apSepIcfgTransformer]: finished MemlocArrayUpdater [2018-10-14 18:10:31,681 INFO L282 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-10-14 18:10:31,747 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=1) [2018-10-14 18:10:38,549 INFO L315 AbstractInterpreter]: Visited 78 different actions 353 times. Merged at 59 different actions 261 times. Widened at 6 different actions 12 times. Found 11 fixpoints after 5 different actions. Largest state had 0 variables. [2018-10-14 18:10:38,552 INFO L306 apSepIcfgTransformer]: finished equality analysis [2018-10-14 18:10:38,556 INFO L318 apSepIcfgTransformer]: Finished detection of select terms ("array reads") [2018-10-14 18:10:38,564 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_13|) at (assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value;) [2018-10-14 18:10:38,567 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_13|) |v_ULTIMATE.start_read~int_#ptr.offset_9|) at (assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value;) [2018-10-14 18:10:38,569 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_7|) at (assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value;) [2018-10-14 18:10:38,569 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_7|) |v_ULTIMATE.start_read~int_#ptr.offset_5|) at (assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value;) [2018-10-14 18:10:38,591 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_6|) at (assume #memory_int == 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]];) [2018-10-14 18:10:38,593 INFO L232 HeapPartitionManager]: partitioning result: [2018-10-14 18:10:38,593 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-14 18:10:38,594 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-14 18:10:38,594 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-14 18:10:38,594 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-14 18:10:38,594 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-14 18:10:38,594 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-14 18:10:38,595 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-14 18:10:38,595 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-14 18:10:38,595 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-14 18:10:38,595 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-14 18:10:38,595 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-14 18:10:38,596 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-14 18:10:38,596 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-14 18:10:38,596 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-14 18:10:38,598 INFO L145 ransitionTransformer]: executing heap partitioning transformation [2018-10-14 18:10:38,619 INFO L202 PluginConnector]: Adding new model ArraysOfVariableLength_true-valid-memsafety.c_13.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.10 06:10:38 BasicIcfg [2018-10-14 18:10:38,619 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-14 18:10:38,621 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-14 18:10:38,621 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-14 18:10:38,625 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-14 18:10:38,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength_true-valid-memsafety.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 06:10:30" (1/3) ... [2018-10-14 18:10:38,627 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69c3f7e8 and model type ArraysOfVariableLength_true-valid-memsafety.c_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 06:10:38, skipping insertion in model container [2018-10-14 18:10:38,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength_true-valid-memsafety.c_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:10:31" (2/3) ... [2018-10-14 18:10:38,628 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69c3f7e8 and model type ArraysOfVariableLength_true-valid-memsafety.c_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 06:10:38, skipping insertion in model container [2018-10-14 18:10:38,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength_true-valid-memsafety.c_13.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.10 06:10:38" (3/3) ... [2018-10-14 18:10:38,630 INFO L112 eAbstractionObserver]: Analyzing ICFG memPartitionedIcfg [2018-10-14 18:10:38,641 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-14 18:10:38,650 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-14 18:10:38,669 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-14 18:10:38,702 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-14 18:10:38,703 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-14 18:10:38,704 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-14 18:10:38,704 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-14 18:10:38,704 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-14 18:10:38,704 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-14 18:10:38,704 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-14 18:10:38,705 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-14 18:10:38,705 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-14 18:10:38,721 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2018-10-14 18:10:38,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-14 18:10:38,733 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:10:38,734 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:10:38,736 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:10:38,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:10:38,743 INFO L82 PathProgramCache]: Analyzing trace with hash -320433679, now seen corresponding path program 1 times [2018-10-14 18:10:38,802 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:10:38,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:10:38,949 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-14 18:10:38,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 18:10:38,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-14 18:10:38,957 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-14 18:10:38,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-14 18:10:38,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 18:10:38,973 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 3 states. [2018-10-14 18:10:39,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:10:39,173 INFO L93 Difference]: Finished difference Result 128 states and 131 transitions. [2018-10-14 18:10:39,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-14 18:10:39,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-10-14 18:10:39,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:10:39,259 INFO L225 Difference]: With dead ends: 128 [2018-10-14 18:10:39,259 INFO L226 Difference]: Without dead ends: 128 [2018-10-14 18:10:39,261 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-14 18:10:39,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-10-14 18:10:39,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 75. [2018-10-14 18:10:39,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-14 18:10:39,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2018-10-14 18:10:39,310 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 24 [2018-10-14 18:10:39,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:10:39,311 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2018-10-14 18:10:39,311 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-14 18:10:39,311 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2018-10-14 18:10:39,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-14 18:10:39,313 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:10:39,313 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:10:39,314 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:10:39,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:10:39,315 INFO L82 PathProgramCache]: Analyzing trace with hash 2110640850, now seen corresponding path program 1 times [2018-10-14 18:10:39,319 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:10:39,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:10:39,602 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-14 18:10:39,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:10:39,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-14 18:10:39,605 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-14 18:10:39,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-14 18:10:39,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-14 18:10:39,607 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand 5 states. [2018-10-14 18:10:40,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:10:40,288 INFO L93 Difference]: Finished difference Result 168 states and 172 transitions. [2018-10-14 18:10:40,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-14 18:10:40,289 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-10-14 18:10:40,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:10:40,294 INFO L225 Difference]: With dead ends: 168 [2018-10-14 18:10:40,294 INFO L226 Difference]: Without dead ends: 168 [2018-10-14 18:10:40,296 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-14 18:10:40,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-10-14 18:10:40,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 115. [2018-10-14 18:10:40,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-10-14 18:10:40,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 118 transitions. [2018-10-14 18:10:40,319 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 118 transitions. Word has length 50 [2018-10-14 18:10:40,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:10:40,320 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 118 transitions. [2018-10-14 18:10:40,320 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-14 18:10:40,320 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 118 transitions. [2018-10-14 18:10:40,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-14 18:10:40,323 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:10:40,323 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:10:40,324 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:10:40,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:10:40,324 INFO L82 PathProgramCache]: Analyzing trace with hash -798700429, now seen corresponding path program 2 times [2018-10-14 18:10:40,325 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:10:40,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:10:40,786 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:10:40,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:10:40,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-14 18:10:40,787 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-14 18:10:40,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-14 18:10:40,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-14 18:10:40,788 INFO L87 Difference]: Start difference. First operand 115 states and 118 transitions. Second operand 7 states. [2018-10-14 18:10:41,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:10:41,091 INFO L93 Difference]: Finished difference Result 208 states and 213 transitions. [2018-10-14 18:10:41,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-14 18:10:41,092 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 76 [2018-10-14 18:10:41,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:10:41,095 INFO L225 Difference]: With dead ends: 208 [2018-10-14 18:10:41,095 INFO L226 Difference]: Without dead ends: 208 [2018-10-14 18:10:41,096 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-14 18:10:41,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-10-14 18:10:41,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 155. [2018-10-14 18:10:41,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-10-14 18:10:41,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 159 transitions. [2018-10-14 18:10:41,118 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 159 transitions. Word has length 76 [2018-10-14 18:10:41,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:10:41,118 INFO L481 AbstractCegarLoop]: Abstraction has 155 states and 159 transitions. [2018-10-14 18:10:41,118 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-14 18:10:41,118 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 159 transitions. [2018-10-14 18:10:41,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-14 18:10:41,121 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:10:41,121 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:10:41,122 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:10:41,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:10:41,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1489112788, now seen corresponding path program 3 times [2018-10-14 18:10:41,123 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:10:41,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:10:41,644 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:10:41,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:10:41,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-14 18:10:41,645 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-14 18:10:41,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-14 18:10:41,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-10-14 18:10:41,646 INFO L87 Difference]: Start difference. First operand 155 states and 159 transitions. Second operand 9 states. [2018-10-14 18:10:41,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:10:41,959 INFO L93 Difference]: Finished difference Result 248 states and 254 transitions. [2018-10-14 18:10:41,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-14 18:10:41,960 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2018-10-14 18:10:41,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:10:41,963 INFO L225 Difference]: With dead ends: 248 [2018-10-14 18:10:41,963 INFO L226 Difference]: Without dead ends: 248 [2018-10-14 18:10:41,964 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2018-10-14 18:10:41,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-10-14 18:10:41,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 195. [2018-10-14 18:10:41,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-10-14 18:10:41,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 200 transitions. [2018-10-14 18:10:41,987 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 200 transitions. Word has length 102 [2018-10-14 18:10:41,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:10:41,988 INFO L481 AbstractCegarLoop]: Abstraction has 195 states and 200 transitions. [2018-10-14 18:10:41,988 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-14 18:10:41,988 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 200 transitions. [2018-10-14 18:10:41,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-14 18:10:41,993 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:10:41,993 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:10:41,994 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:10:41,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:10:41,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1796724235, now seen corresponding path program 4 times [2018-10-14 18:10:41,995 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:10:42,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:10:42,222 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:10:42,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:10:42,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-14 18:10:42,223 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-14 18:10:42,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-14 18:10:42,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-10-14 18:10:42,224 INFO L87 Difference]: Start difference. First operand 195 states and 200 transitions. Second operand 11 states. [2018-10-14 18:10:42,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:10:42,751 INFO L93 Difference]: Finished difference Result 288 states and 295 transitions. [2018-10-14 18:10:42,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-14 18:10:42,751 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 128 [2018-10-14 18:10:42,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:10:42,753 INFO L225 Difference]: With dead ends: 288 [2018-10-14 18:10:42,754 INFO L226 Difference]: Without dead ends: 288 [2018-10-14 18:10:42,754 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=219, Unknown=0, NotChecked=0, Total=342 [2018-10-14 18:10:42,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-10-14 18:10:42,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 235. [2018-10-14 18:10:42,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-10-14 18:10:42,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 241 transitions. [2018-10-14 18:10:42,764 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 241 transitions. Word has length 128 [2018-10-14 18:10:42,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:10:42,765 INFO L481 AbstractCegarLoop]: Abstraction has 235 states and 241 transitions. [2018-10-14 18:10:42,765 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-14 18:10:42,765 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 241 transitions. [2018-10-14 18:10:42,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-14 18:10:42,768 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:10:42,768 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:10:42,768 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:10:42,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:10:42,769 INFO L82 PathProgramCache]: Analyzing trace with hash 1036365270, now seen corresponding path program 5 times [2018-10-14 18:10:42,770 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:10:42,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:10:43,042 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:10:43,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:10:43,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-14 18:10:43,043 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-14 18:10:43,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-14 18:10:43,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-10-14 18:10:43,044 INFO L87 Difference]: Start difference. First operand 235 states and 241 transitions. Second operand 13 states. [2018-10-14 18:10:43,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:10:43,336 INFO L93 Difference]: Finished difference Result 328 states and 336 transitions. [2018-10-14 18:10:43,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-14 18:10:43,336 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 154 [2018-10-14 18:10:43,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:10:43,339 INFO L225 Difference]: With dead ends: 328 [2018-10-14 18:10:43,340 INFO L226 Difference]: Without dead ends: 328 [2018-10-14 18:10:43,341 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=178, Invalid=328, Unknown=0, NotChecked=0, Total=506 [2018-10-14 18:10:43,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-10-14 18:10:43,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 275. [2018-10-14 18:10:43,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-10-14 18:10:43,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 282 transitions. [2018-10-14 18:10:43,349 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 282 transitions. Word has length 154 [2018-10-14 18:10:43,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:10:43,350 INFO L481 AbstractCegarLoop]: Abstraction has 275 states and 282 transitions. [2018-10-14 18:10:43,350 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-14 18:10:43,350 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 282 transitions. [2018-10-14 18:10:43,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-14 18:10:43,354 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:10:43,354 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:10:43,354 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:10:43,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:10:43,355 INFO L82 PathProgramCache]: Analyzing trace with hash 943008375, now seen corresponding path program 6 times [2018-10-14 18:10:43,355 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:10:43,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:10:44,288 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 0 proven. 396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:10:44,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:10:44,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-14 18:10:44,290 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-14 18:10:44,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-14 18:10:44,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-10-14 18:10:44,290 INFO L87 Difference]: Start difference. First operand 275 states and 282 transitions. Second operand 15 states. [2018-10-14 18:10:44,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:10:44,630 INFO L93 Difference]: Finished difference Result 368 states and 377 transitions. [2018-10-14 18:10:44,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-14 18:10:44,632 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 180 [2018-10-14 18:10:44,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:10:44,634 INFO L225 Difference]: With dead ends: 368 [2018-10-14 18:10:44,634 INFO L226 Difference]: Without dead ends: 368 [2018-10-14 18:10:44,635 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=243, Invalid=459, Unknown=0, NotChecked=0, Total=702 [2018-10-14 18:10:44,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-10-14 18:10:44,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 315. [2018-10-14 18:10:44,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-10-14 18:10:44,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 323 transitions. [2018-10-14 18:10:44,643 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 323 transitions. Word has length 180 [2018-10-14 18:10:44,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:10:44,643 INFO L481 AbstractCegarLoop]: Abstraction has 315 states and 323 transitions. [2018-10-14 18:10:44,643 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-14 18:10:44,644 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 323 transitions. [2018-10-14 18:10:44,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-10-14 18:10:44,646 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:10:44,646 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:10:44,647 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:10:44,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:10:44,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1174220760, now seen corresponding path program 7 times [2018-10-14 18:10:44,648 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:10:44,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:10:44,955 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 0 proven. 553 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:10:44,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:10:44,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-14 18:10:44,956 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-14 18:10:44,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-14 18:10:44,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2018-10-14 18:10:44,957 INFO L87 Difference]: Start difference. First operand 315 states and 323 transitions. Second operand 17 states. [2018-10-14 18:10:45,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:10:45,745 INFO L93 Difference]: Finished difference Result 408 states and 418 transitions. [2018-10-14 18:10:45,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-14 18:10:45,746 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 206 [2018-10-14 18:10:45,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:10:45,748 INFO L225 Difference]: With dead ends: 408 [2018-10-14 18:10:45,748 INFO L226 Difference]: Without dead ends: 408 [2018-10-14 18:10:45,749 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=318, Invalid=612, Unknown=0, NotChecked=0, Total=930 [2018-10-14 18:10:45,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2018-10-14 18:10:45,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 355. [2018-10-14 18:10:45,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2018-10-14 18:10:45,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 364 transitions. [2018-10-14 18:10:45,757 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 364 transitions. Word has length 206 [2018-10-14 18:10:45,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:10:45,757 INFO L481 AbstractCegarLoop]: Abstraction has 355 states and 364 transitions. [2018-10-14 18:10:45,758 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-14 18:10:45,758 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 364 transitions. [2018-10-14 18:10:45,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-10-14 18:10:45,761 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:10:45,761 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:10:45,761 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:10:45,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:10:45,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1993362937, now seen corresponding path program 8 times [2018-10-14 18:10:45,762 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:10:45,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:10:46,481 INFO L134 CoverageAnalysis]: Checked inductivity of 736 backedges. 0 proven. 736 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:10:46,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:10:46,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-14 18:10:46,482 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-14 18:10:46,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-14 18:10:46,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2018-10-14 18:10:46,483 INFO L87 Difference]: Start difference. First operand 355 states and 364 transitions. Second operand 19 states. [2018-10-14 18:10:46,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:10:46,915 INFO L93 Difference]: Finished difference Result 448 states and 459 transitions. [2018-10-14 18:10:46,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-14 18:10:46,915 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 232 [2018-10-14 18:10:46,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:10:46,919 INFO L225 Difference]: With dead ends: 448 [2018-10-14 18:10:46,919 INFO L226 Difference]: Without dead ends: 448 [2018-10-14 18:10:46,920 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=403, Invalid=787, Unknown=0, NotChecked=0, Total=1190 [2018-10-14 18:10:46,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2018-10-14 18:10:46,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 395. [2018-10-14 18:10:46,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-10-14 18:10:46,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 405 transitions. [2018-10-14 18:10:46,928 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 405 transitions. Word has length 232 [2018-10-14 18:10:46,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:10:46,929 INFO L481 AbstractCegarLoop]: Abstraction has 395 states and 405 transitions. [2018-10-14 18:10:46,929 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-14 18:10:46,929 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 405 transitions. [2018-10-14 18:10:46,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-10-14 18:10:46,932 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:10:46,932 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:10:46,932 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:10:46,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:10:46,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1498223834, now seen corresponding path program 9 times [2018-10-14 18:10:46,933 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:10:46,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:10:47,376 INFO L134 CoverageAnalysis]: Checked inductivity of 945 backedges. 0 proven. 945 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:10:47,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:10:47,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-14 18:10:47,377 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-14 18:10:47,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-14 18:10:47,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2018-10-14 18:10:47,378 INFO L87 Difference]: Start difference. First operand 395 states and 405 transitions. Second operand 21 states. [2018-10-14 18:10:47,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:10:47,944 INFO L93 Difference]: Finished difference Result 488 states and 500 transitions. [2018-10-14 18:10:47,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-14 18:10:47,944 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 258 [2018-10-14 18:10:47,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:10:47,948 INFO L225 Difference]: With dead ends: 488 [2018-10-14 18:10:47,949 INFO L226 Difference]: Without dead ends: 488 [2018-10-14 18:10:47,949 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-14 18:10:47,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2018-10-14 18:10:47,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 435. [2018-10-14 18:10:47,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-10-14 18:10:47,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 446 transitions. [2018-10-14 18:10:47,958 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 446 transitions. Word has length 258 [2018-10-14 18:10:47,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:10:47,959 INFO L481 AbstractCegarLoop]: Abstraction has 435 states and 446 transitions. [2018-10-14 18:10:47,959 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-14 18:10:47,959 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 446 transitions. [2018-10-14 18:10:47,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-10-14 18:10:47,961 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:10:47,962 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:10:47,962 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:10:47,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:10:47,963 INFO L82 PathProgramCache]: Analyzing trace with hash -335670149, now seen corresponding path program 10 times [2018-10-14 18:10:47,963 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:10:48,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:10:48,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1180 backedges. 0 proven. 1180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:10:48,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:10:48,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-14 18:10:48,406 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-14 18:10:48,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-14 18:10:48,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2018-10-14 18:10:48,407 INFO L87 Difference]: Start difference. First operand 435 states and 446 transitions. Second operand 23 states. [2018-10-14 18:10:49,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:10:49,825 INFO L93 Difference]: Finished difference Result 528 states and 541 transitions. [2018-10-14 18:10:49,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-14 18:10:49,826 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 284 [2018-10-14 18:10:49,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:10:49,829 INFO L225 Difference]: With dead ends: 528 [2018-10-14 18:10:49,830 INFO L226 Difference]: Without dead ends: 528 [2018-10-14 18:10:49,831 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=603, Invalid=1203, Unknown=0, NotChecked=0, Total=1806 [2018-10-14 18:10:49,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2018-10-14 18:10:49,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 475. [2018-10-14 18:10:49,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 475 states. [2018-10-14 18:10:49,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 487 transitions. [2018-10-14 18:10:49,839 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 487 transitions. Word has length 284 [2018-10-14 18:10:49,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:10:49,840 INFO L481 AbstractCegarLoop]: Abstraction has 475 states and 487 transitions. [2018-10-14 18:10:49,840 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-14 18:10:49,840 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 487 transitions. [2018-10-14 18:10:49,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-10-14 18:10:49,842 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:10:49,842 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:10:49,842 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:10:49,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:10:49,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1314512092, now seen corresponding path program 11 times [2018-10-14 18:10:49,844 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:10:49,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:10:50,597 INFO L134 CoverageAnalysis]: Checked inductivity of 1441 backedges. 0 proven. 1441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:10:50,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:10:50,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-14 18:10:50,599 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-14 18:10:50,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-14 18:10:50,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2018-10-14 18:10:50,600 INFO L87 Difference]: Start difference. First operand 475 states and 487 transitions. Second operand 25 states. [2018-10-14 18:10:51,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:10:51,212 INFO L93 Difference]: Finished difference Result 568 states and 582 transitions. [2018-10-14 18:10:51,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-14 18:10:51,214 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 310 [2018-10-14 18:10:51,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:10:51,218 INFO L225 Difference]: With dead ends: 568 [2018-10-14 18:10:51,218 INFO L226 Difference]: Without dead ends: 568 [2018-10-14 18:10:51,219 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=718, Invalid=1444, Unknown=0, NotChecked=0, Total=2162 [2018-10-14 18:10:51,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2018-10-14 18:10:51,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 515. [2018-10-14 18:10:51,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2018-10-14 18:10:51,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 528 transitions. [2018-10-14 18:10:51,228 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 528 transitions. Word has length 310 [2018-10-14 18:10:51,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:10:51,228 INFO L481 AbstractCegarLoop]: Abstraction has 515 states and 528 transitions. [2018-10-14 18:10:51,229 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-14 18:10:51,229 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 528 transitions. [2018-10-14 18:10:51,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2018-10-14 18:10:51,231 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:10:51,231 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:10:51,231 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:10:51,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:10:51,232 INFO L82 PathProgramCache]: Analyzing trace with hash 834862589, now seen corresponding path program 12 times [2018-10-14 18:10:51,233 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:10:51,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:10:55,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1728 backedges. 0 proven. 1728 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:10:55,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:10:55,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-14 18:10:55,354 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-14 18:10:55,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-14 18:10:55,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2018-10-14 18:10:55,355 INFO L87 Difference]: Start difference. First operand 515 states and 528 transitions. Second operand 27 states. [2018-10-14 18:10:56,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:10:56,073 INFO L93 Difference]: Finished difference Result 608 states and 623 transitions. [2018-10-14 18:10:56,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-14 18:10:56,073 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 336 [2018-10-14 18:10:56,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:10:56,078 INFO L225 Difference]: With dead ends: 608 [2018-10-14 18:10:56,078 INFO L226 Difference]: Without dead ends: 608 [2018-10-14 18:10:56,079 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=843, Invalid=1707, Unknown=0, NotChecked=0, Total=2550 [2018-10-14 18:10:56,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2018-10-14 18:10:56,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 555. [2018-10-14 18:10:56,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2018-10-14 18:10:56,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 569 transitions. [2018-10-14 18:10:56,088 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 569 transitions. Word has length 336 [2018-10-14 18:10:56,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:10:56,089 INFO L481 AbstractCegarLoop]: Abstraction has 555 states and 569 transitions. [2018-10-14 18:10:56,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-14 18:10:56,089 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 569 transitions. [2018-10-14 18:10:56,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2018-10-14 18:10:56,091 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:10:56,092 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:10:56,092 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:10:56,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:10:56,092 INFO L82 PathProgramCache]: Analyzing trace with hash 176687070, now seen corresponding path program 13 times [2018-10-14 18:10:56,093 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:10:56,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:10:57,698 INFO L134 CoverageAnalysis]: Checked inductivity of 2041 backedges. 0 proven. 2041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:10:57,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:10:57,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-14 18:10:57,700 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-14 18:10:57,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-14 18:10:57,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=588, Unknown=0, NotChecked=0, Total=812 [2018-10-14 18:10:57,701 INFO L87 Difference]: Start difference. First operand 555 states and 569 transitions. Second operand 29 states. [2018-10-14 18:10:58,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:10:58,810 INFO L93 Difference]: Finished difference Result 648 states and 664 transitions. [2018-10-14 18:10:58,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-14 18:10:58,811 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 362 [2018-10-14 18:10:58,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:10:58,814 INFO L225 Difference]: With dead ends: 648 [2018-10-14 18:10:58,814 INFO L226 Difference]: Without dead ends: 648 [2018-10-14 18:10:58,816 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=978, Invalid=1992, Unknown=0, NotChecked=0, Total=2970 [2018-10-14 18:10:58,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2018-10-14 18:10:58,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 595. [2018-10-14 18:10:58,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2018-10-14 18:10:58,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 610 transitions. [2018-10-14 18:10:58,824 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 610 transitions. Word has length 362 [2018-10-14 18:10:58,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:10:58,825 INFO L481 AbstractCegarLoop]: Abstraction has 595 states and 610 transitions. [2018-10-14 18:10:58,825 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-14 18:10:58,825 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 610 transitions. [2018-10-14 18:10:58,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2018-10-14 18:10:58,828 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:10:58,828 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:10:58,829 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:10:58,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:10:58,829 INFO L82 PathProgramCache]: Analyzing trace with hash 14912127, now seen corresponding path program 14 times [2018-10-14 18:10:58,830 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:10:58,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:10:59,365 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 2380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:10:59,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:10:59,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-14 18:10:59,366 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-14 18:10:59,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-14 18:10:59,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2018-10-14 18:10:59,367 INFO L87 Difference]: Start difference. First operand 595 states and 610 transitions. Second operand 31 states. [2018-10-14 18:11:00,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:11:00,065 INFO L93 Difference]: Finished difference Result 688 states and 705 transitions. [2018-10-14 18:11:00,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-14 18:11:00,066 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 388 [2018-10-14 18:11:00,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:11:00,070 INFO L225 Difference]: With dead ends: 688 [2018-10-14 18:11:00,071 INFO L226 Difference]: Without dead ends: 688 [2018-10-14 18:11:00,072 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-14 18:11:00,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2018-10-14 18:11:00,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 635. [2018-10-14 18:11:00,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2018-10-14 18:11:00,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 651 transitions. [2018-10-14 18:11:00,081 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 651 transitions. Word has length 388 [2018-10-14 18:11:00,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:11:00,082 INFO L481 AbstractCegarLoop]: Abstraction has 635 states and 651 transitions. [2018-10-14 18:11:00,082 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-14 18:11:00,082 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 651 transitions. [2018-10-14 18:11:00,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2018-10-14 18:11:00,085 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:11:00,085 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:11:00,086 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:11:00,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:11:00,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1577314848, now seen corresponding path program 15 times [2018-10-14 18:11:00,087 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:11:00,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:11:01,640 INFO L134 CoverageAnalysis]: Checked inductivity of 2745 backedges. 0 proven. 2745 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:11:01,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:11:01,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-14 18:11:01,641 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-14 18:11:01,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-14 18:11:01,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2018-10-14 18:11:01,642 INFO L87 Difference]: Start difference. First operand 635 states and 651 transitions. Second operand 33 states. [2018-10-14 18:11:02,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:11:02,566 INFO L93 Difference]: Finished difference Result 728 states and 746 transitions. [2018-10-14 18:11:02,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-14 18:11:02,568 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 414 [2018-10-14 18:11:02,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:11:02,574 INFO L225 Difference]: With dead ends: 728 [2018-10-14 18:11:02,574 INFO L226 Difference]: Without dead ends: 728 [2018-10-14 18:11:02,575 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1278, Invalid=2628, Unknown=0, NotChecked=0, Total=3906 [2018-10-14 18:11:02,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2018-10-14 18:11:02,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 675. [2018-10-14 18:11:02,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 675 states. [2018-10-14 18:11:02,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 692 transitions. [2018-10-14 18:11:02,584 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 692 transitions. Word has length 414 [2018-10-14 18:11:02,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:11:02,584 INFO L481 AbstractCegarLoop]: Abstraction has 675 states and 692 transitions. [2018-10-14 18:11:02,584 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-14 18:11:02,585 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 692 transitions. [2018-10-14 18:11:02,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2018-10-14 18:11:02,588 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:11:02,588 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:11:02,588 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:11:02,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:11:02,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1357134337, now seen corresponding path program 16 times [2018-10-14 18:11:02,589 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:11:02,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:11:06,194 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:11:06,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:11:06,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-14 18:11:06,195 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-14 18:11:06,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-14 18:11:06,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2018-10-14 18:11:06,196 INFO L87 Difference]: Start difference. First operand 675 states and 692 transitions. Second operand 35 states. [2018-10-14 18:11:07,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:11:07,184 INFO L93 Difference]: Finished difference Result 768 states and 787 transitions. [2018-10-14 18:11:07,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-14 18:11:07,185 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 440 [2018-10-14 18:11:07,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:11:07,189 INFO L225 Difference]: With dead ends: 768 [2018-10-14 18:11:07,189 INFO L226 Difference]: Without dead ends: 768 [2018-10-14 18:11:07,191 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1443, Invalid=2979, Unknown=0, NotChecked=0, Total=4422 [2018-10-14 18:11:07,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2018-10-14 18:11:07,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 715. [2018-10-14 18:11:07,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2018-10-14 18:11:07,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 733 transitions. [2018-10-14 18:11:07,200 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 733 transitions. Word has length 440 [2018-10-14 18:11:07,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:11:07,201 INFO L481 AbstractCegarLoop]: Abstraction has 715 states and 733 transitions. [2018-10-14 18:11:07,201 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-14 18:11:07,201 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 733 transitions. [2018-10-14 18:11:07,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2018-10-14 18:11:07,204 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:11:07,204 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:11:07,205 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:11:07,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:11:07,205 INFO L82 PathProgramCache]: Analyzing trace with hash 2006615778, now seen corresponding path program 17 times [2018-10-14 18:11:07,206 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:11:07,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:11:08,385 INFO L134 CoverageAnalysis]: Checked inductivity of 3553 backedges. 0 proven. 3553 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:11:08,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:11:08,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-14 18:11:08,387 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-14 18:11:08,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-14 18:11:08,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2018-10-14 18:11:08,387 INFO L87 Difference]: Start difference. First operand 715 states and 733 transitions. Second operand 37 states. [2018-10-14 18:11:09,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:11:09,352 INFO L93 Difference]: Finished difference Result 808 states and 828 transitions. [2018-10-14 18:11:09,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-14 18:11:09,353 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 466 [2018-10-14 18:11:09,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:11:09,358 INFO L225 Difference]: With dead ends: 808 [2018-10-14 18:11:09,358 INFO L226 Difference]: Without dead ends: 808 [2018-10-14 18:11:09,360 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 833 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1618, Invalid=3352, Unknown=0, NotChecked=0, Total=4970 [2018-10-14 18:11:09,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2018-10-14 18:11:09,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 755. [2018-10-14 18:11:09,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 755 states. [2018-10-14 18:11:09,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 774 transitions. [2018-10-14 18:11:09,369 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 774 transitions. Word has length 466 [2018-10-14 18:11:09,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:11:09,369 INFO L481 AbstractCegarLoop]: Abstraction has 755 states and 774 transitions. [2018-10-14 18:11:09,369 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-14 18:11:09,369 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 774 transitions. [2018-10-14 18:11:09,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2018-10-14 18:11:09,373 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:11:09,373 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:11:09,373 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:11:09,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:11:09,374 INFO L82 PathProgramCache]: Analyzing trace with hash 2013891715, now seen corresponding path program 18 times [2018-10-14 18:11:09,375 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:11:09,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:11:10,734 INFO L134 CoverageAnalysis]: Checked inductivity of 3996 backedges. 0 proven. 3996 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:11:10,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:11:10,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-14 18:11:10,735 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-14 18:11:10,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-14 18:11:10,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2018-10-14 18:11:10,736 INFO L87 Difference]: Start difference. First operand 755 states and 774 transitions. Second operand 39 states. [2018-10-14 18:11:11,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:11:11,845 INFO L93 Difference]: Finished difference Result 848 states and 869 transitions. [2018-10-14 18:11:11,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-14 18:11:11,845 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 492 [2018-10-14 18:11:11,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:11:11,850 INFO L225 Difference]: With dead ends: 848 [2018-10-14 18:11:11,850 INFO L226 Difference]: Without dead ends: 848 [2018-10-14 18:11:11,852 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1803, Invalid=3747, Unknown=0, NotChecked=0, Total=5550 [2018-10-14 18:11:11,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2018-10-14 18:11:11,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 795. [2018-10-14 18:11:11,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2018-10-14 18:11:11,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 815 transitions. [2018-10-14 18:11:11,861 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 815 transitions. Word has length 492 [2018-10-14 18:11:11,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:11:11,862 INFO L481 AbstractCegarLoop]: Abstraction has 795 states and 815 transitions. [2018-10-14 18:11:11,862 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-14 18:11:11,862 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 815 transitions. [2018-10-14 18:11:11,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2018-10-14 18:11:11,866 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:11:11,866 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:11:11,867 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:11:11,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:11:11,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1560795876, now seen corresponding path program 19 times [2018-10-14 18:11:11,868 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:11:11,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:11:13,354 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:11:13,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:11:13,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-14 18:11:13,355 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-14 18:11:13,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-14 18:11:13,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=1200, Unknown=0, NotChecked=0, Total=1640 [2018-10-14 18:11:13,356 INFO L87 Difference]: Start difference. First operand 795 states and 815 transitions. Second operand 41 states. [2018-10-14 18:11:14,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:11:14,589 INFO L93 Difference]: Finished difference Result 888 states and 910 transitions. [2018-10-14 18:11:14,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-14 18:11:14,589 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 518 [2018-10-14 18:11:14,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:11:14,595 INFO L225 Difference]: With dead ends: 888 [2018-10-14 18:11:14,595 INFO L226 Difference]: Without dead ends: 888 [2018-10-14 18:11:14,597 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-14 18:11:14,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2018-10-14 18:11:14,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 835. [2018-10-14 18:11:14,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 835 states. [2018-10-14 18:11:14,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 856 transitions. [2018-10-14 18:11:14,607 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 856 transitions. Word has length 518 [2018-10-14 18:11:14,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:11:14,607 INFO L481 AbstractCegarLoop]: Abstraction has 835 states and 856 transitions. [2018-10-14 18:11:14,607 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-14 18:11:14,608 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 856 transitions. [2018-10-14 18:11:14,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 545 [2018-10-14 18:11:14,611 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:11:14,612 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:11:14,612 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:11:14,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:11:14,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1264058885, now seen corresponding path program 20 times [2018-10-14 18:11:14,613 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:11:14,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:11:15,732 INFO L134 CoverageAnalysis]: Checked inductivity of 4960 backedges. 0 proven. 4960 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:11:15,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:11:15,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-14 18:11:15,733 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-14 18:11:15,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-14 18:11:15,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2018-10-14 18:11:15,735 INFO L87 Difference]: Start difference. First operand 835 states and 856 transitions. Second operand 43 states. [2018-10-14 18:11:17,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:11:17,128 INFO L93 Difference]: Finished difference Result 928 states and 951 transitions. [2018-10-14 18:11:17,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-14 18:11:17,129 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 544 [2018-10-14 18:11:17,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:11:17,134 INFO L225 Difference]: With dead ends: 928 [2018-10-14 18:11:17,134 INFO L226 Difference]: Without dead ends: 928 [2018-10-14 18:11:17,137 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1160 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2203, Invalid=4603, Unknown=0, NotChecked=0, Total=6806 [2018-10-14 18:11:17,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2018-10-14 18:11:17,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 875. [2018-10-14 18:11:17,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 875 states. [2018-10-14 18:11:17,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 897 transitions. [2018-10-14 18:11:17,148 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 897 transitions. Word has length 544 [2018-10-14 18:11:17,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:11:17,149 INFO L481 AbstractCegarLoop]: Abstraction has 875 states and 897 transitions. [2018-10-14 18:11:17,149 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-14 18:11:17,149 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 897 transitions. [2018-10-14 18:11:17,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 571 [2018-10-14 18:11:17,154 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:11:17,154 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:11:17,154 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:11:17,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:11:17,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1297575450, now seen corresponding path program 21 times [2018-10-14 18:11:17,156 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:11:17,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:11:19,250 INFO L134 CoverageAnalysis]: Checked inductivity of 5481 backedges. 0 proven. 5481 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:11:19,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:11:19,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-14 18:11:19,251 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-14 18:11:19,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-14 18:11:19,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=1452, Unknown=0, NotChecked=0, Total=1980 [2018-10-14 18:11:19,252 INFO L87 Difference]: Start difference. First operand 875 states and 897 transitions. Second operand 45 states. [2018-10-14 18:11:21,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:11:21,423 INFO L93 Difference]: Finished difference Result 968 states and 992 transitions. [2018-10-14 18:11:21,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-14 18:11:21,425 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 570 [2018-10-14 18:11:21,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:11:21,430 INFO L225 Difference]: With dead ends: 968 [2018-10-14 18:11:21,430 INFO L226 Difference]: Without dead ends: 968 [2018-10-14 18:11:21,431 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1281 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2418, Invalid=5064, Unknown=0, NotChecked=0, Total=7482 [2018-10-14 18:11:21,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2018-10-14 18:11:21,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 915. [2018-10-14 18:11:21,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 915 states. [2018-10-14 18:11:21,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 938 transitions. [2018-10-14 18:11:21,442 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 938 transitions. Word has length 570 [2018-10-14 18:11:21,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:11:21,443 INFO L481 AbstractCegarLoop]: Abstraction has 915 states and 938 transitions. [2018-10-14 18:11:21,443 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-14 18:11:21,443 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 938 transitions. [2018-10-14 18:11:21,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 597 [2018-10-14 18:11:21,448 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:11:21,448 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:11:21,448 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:11:21,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:11:21,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1049893511, now seen corresponding path program 22 times [2018-10-14 18:11:21,450 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:11:21,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:11:22,833 INFO L134 CoverageAnalysis]: Checked inductivity of 6028 backedges. 0 proven. 6028 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:11:22,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:11:22,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-14 18:11:22,834 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-14 18:11:22,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-14 18:11:22,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=1587, Unknown=0, NotChecked=0, Total=2162 [2018-10-14 18:11:22,835 INFO L87 Difference]: Start difference. First operand 915 states and 938 transitions. Second operand 47 states. [2018-10-14 18:11:24,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:11:24,397 INFO L93 Difference]: Finished difference Result 1008 states and 1033 transitions. [2018-10-14 18:11:24,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-14 18:11:24,397 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 596 [2018-10-14 18:11:24,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:11:24,402 INFO L225 Difference]: With dead ends: 1008 [2018-10-14 18:11:24,403 INFO L226 Difference]: Without dead ends: 1008 [2018-10-14 18:11:24,404 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1408 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2643, Invalid=5547, Unknown=0, NotChecked=0, Total=8190 [2018-10-14 18:11:24,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2018-10-14 18:11:24,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 955. [2018-10-14 18:11:24,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 955 states. [2018-10-14 18:11:24,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 979 transitions. [2018-10-14 18:11:24,412 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 979 transitions. Word has length 596 [2018-10-14 18:11:24,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:11:24,413 INFO L481 AbstractCegarLoop]: Abstraction has 955 states and 979 transitions. [2018-10-14 18:11:24,413 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-14 18:11:24,413 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 979 transitions. [2018-10-14 18:11:24,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 623 [2018-10-14 18:11:24,418 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:11:24,418 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:11:24,419 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:11:24,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:11:24,419 INFO L82 PathProgramCache]: Analyzing trace with hash -2019480600, now seen corresponding path program 23 times [2018-10-14 18:11:24,420 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:11:24,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:11:25,964 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-14 18:11:25,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:11:25,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-14 18:11:25,966 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-14 18:11:25,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-14 18:11:25,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=624, Invalid=1728, Unknown=0, NotChecked=0, Total=2352 [2018-10-14 18:11:25,967 INFO L87 Difference]: Start difference. First operand 955 states and 979 transitions. Second operand 49 states. [2018-10-14 18:11:27,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:11:27,682 INFO L93 Difference]: Finished difference Result 1048 states and 1074 transitions. [2018-10-14 18:11:27,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-14 18:11:27,682 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 622 [2018-10-14 18:11:27,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:11:27,688 INFO L225 Difference]: With dead ends: 1048 [2018-10-14 18:11:27,688 INFO L226 Difference]: Without dead ends: 1048 [2018-10-14 18:11:27,689 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1541 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2878, Invalid=6052, Unknown=0, NotChecked=0, Total=8930 [2018-10-14 18:11:27,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2018-10-14 18:11:27,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 995. [2018-10-14 18:11:27,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 995 states. [2018-10-14 18:11:27,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1020 transitions. [2018-10-14 18:11:27,698 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1020 transitions. Word has length 622 [2018-10-14 18:11:27,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:11:27,698 INFO L481 AbstractCegarLoop]: Abstraction has 995 states and 1020 transitions. [2018-10-14 18:11:27,698 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-14 18:11:27,699 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1020 transitions. [2018-10-14 18:11:27,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 649 [2018-10-14 18:11:27,704 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:11:27,704 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:11:27,705 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:11:27,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:11:27,705 INFO L82 PathProgramCache]: Analyzing trace with hash -2076027383, now seen corresponding path program 24 times [2018-10-14 18:11:27,706 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:11:27,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:11:29,230 INFO L134 CoverageAnalysis]: Checked inductivity of 7200 backedges. 0 proven. 7200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:11:29,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:11:29,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-14 18:11:29,231 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-14 18:11:29,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-14 18:11:29,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2018-10-14 18:11:29,232 INFO L87 Difference]: Start difference. First operand 995 states and 1020 transitions. Second operand 51 states. [2018-10-14 18:11:30,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:11:30,851 INFO L93 Difference]: Finished difference Result 1088 states and 1115 transitions. [2018-10-14 18:11:30,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-14 18:11:30,853 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 648 [2018-10-14 18:11:30,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:11:30,857 INFO L225 Difference]: With dead ends: 1088 [2018-10-14 18:11:30,858 INFO L226 Difference]: Without dead ends: 1088 [2018-10-14 18:11:30,859 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1680 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3123, Invalid=6579, Unknown=0, NotChecked=0, Total=9702 [2018-10-14 18:11:30,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2018-10-14 18:11:30,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 1035. [2018-10-14 18:11:30,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1035 states. [2018-10-14 18:11:30,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1061 transitions. [2018-10-14 18:11:30,870 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1061 transitions. Word has length 648 [2018-10-14 18:11:30,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:11:30,871 INFO L481 AbstractCegarLoop]: Abstraction has 1035 states and 1061 transitions. [2018-10-14 18:11:30,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-14 18:11:30,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1061 transitions. [2018-10-14 18:11:30,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 675 [2018-10-14 18:11:30,877 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:11:30,878 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:11:30,878 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:11:30,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:11:30,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1177147158, now seen corresponding path program 25 times [2018-10-14 18:11:30,879 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:11:30,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:11:32,523 INFO L134 CoverageAnalysis]: Checked inductivity of 7825 backedges. 0 proven. 7825 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:11:32,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:11:32,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-14 18:11:32,524 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-14 18:11:32,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-14 18:11:32,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=728, Invalid=2028, Unknown=0, NotChecked=0, Total=2756 [2018-10-14 18:11:32,525 INFO L87 Difference]: Start difference. First operand 1035 states and 1061 transitions. Second operand 53 states. [2018-10-14 18:11:34,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:11:34,624 INFO L93 Difference]: Finished difference Result 1128 states and 1156 transitions. [2018-10-14 18:11:34,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-14 18:11:34,625 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 674 [2018-10-14 18:11:34,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:11:34,631 INFO L225 Difference]: With dead ends: 1128 [2018-10-14 18:11:34,631 INFO L226 Difference]: Without dead ends: 1128 [2018-10-14 18:11:34,632 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1825 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3378, Invalid=7128, Unknown=0, NotChecked=0, Total=10506 [2018-10-14 18:11:34,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2018-10-14 18:11:34,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 1075. [2018-10-14 18:11:34,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1075 states. [2018-10-14 18:11:34,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1102 transitions. [2018-10-14 18:11:34,645 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 1102 transitions. Word has length 674 [2018-10-14 18:11:34,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:11:34,645 INFO L481 AbstractCegarLoop]: Abstraction has 1075 states and 1102 transitions. [2018-10-14 18:11:34,646 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-14 18:11:34,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1102 transitions. [2018-10-14 18:11:34,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 701 [2018-10-14 18:11:34,652 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:11:34,652 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:11:34,652 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:11:34,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:11:34,653 INFO L82 PathProgramCache]: Analyzing trace with hash 765932683, now seen corresponding path program 26 times [2018-10-14 18:11:34,654 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:11:34,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:11:36,217 INFO L134 CoverageAnalysis]: Checked inductivity of 8476 backedges. 0 proven. 8476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:11:36,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:11:36,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-14 18:11:36,218 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-14 18:11:36,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-14 18:11:36,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=783, Invalid=2187, Unknown=0, NotChecked=0, Total=2970 [2018-10-14 18:11:36,219 INFO L87 Difference]: Start difference. First operand 1075 states and 1102 transitions. Second operand 55 states. [2018-10-14 18:11:38,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:11:38,230 INFO L93 Difference]: Finished difference Result 1168 states and 1197 transitions. [2018-10-14 18:11:38,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-14 18:11:38,230 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 700 [2018-10-14 18:11:38,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:11:38,234 INFO L225 Difference]: With dead ends: 1168 [2018-10-14 18:11:38,234 INFO L226 Difference]: Without dead ends: 1168 [2018-10-14 18:11:38,235 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-14 18:11:38,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2018-10-14 18:11:38,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 1115. [2018-10-14 18:11:38,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1115 states. [2018-10-14 18:11:38,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1143 transitions. [2018-10-14 18:11:38,244 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1143 transitions. Word has length 700 [2018-10-14 18:11:38,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:11:38,245 INFO L481 AbstractCegarLoop]: Abstraction has 1115 states and 1143 transitions. [2018-10-14 18:11:38,245 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-14 18:11:38,245 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1143 transitions. [2018-10-14 18:11:38,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 727 [2018-10-14 18:11:38,251 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:11:38,251 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:11:38,252 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:11:38,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:11:38,252 INFO L82 PathProgramCache]: Analyzing trace with hash 367790316, now seen corresponding path program 27 times [2018-10-14 18:11:38,253 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:11:38,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:11:39,887 INFO L134 CoverageAnalysis]: Checked inductivity of 9153 backedges. 0 proven. 9153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:11:39,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:11:39,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-14 18:11:39,888 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-14 18:11:39,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-14 18:11:39,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=840, Invalid=2352, Unknown=0, NotChecked=0, Total=3192 [2018-10-14 18:11:39,889 INFO L87 Difference]: Start difference. First operand 1115 states and 1143 transitions. Second operand 57 states. [2018-10-14 18:11:42,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:11:42,049 INFO L93 Difference]: Finished difference Result 1208 states and 1238 transitions. [2018-10-14 18:11:42,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-14 18:11:42,050 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 726 [2018-10-14 18:11:42,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:11:42,055 INFO L225 Difference]: With dead ends: 1208 [2018-10-14 18:11:42,055 INFO L226 Difference]: Without dead ends: 1208 [2018-10-14 18:11:42,057 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2133 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3918, Invalid=8292, Unknown=0, NotChecked=0, Total=12210 [2018-10-14 18:11:42,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2018-10-14 18:11:42,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 1155. [2018-10-14 18:11:42,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1155 states. [2018-10-14 18:11:42,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 1184 transitions. [2018-10-14 18:11:42,066 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 1184 transitions. Word has length 726 [2018-10-14 18:11:42,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:11:42,067 INFO L481 AbstractCegarLoop]: Abstraction has 1155 states and 1184 transitions. [2018-10-14 18:11:42,067 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-14 18:11:42,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 1184 transitions. [2018-10-14 18:11:42,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 753 [2018-10-14 18:11:42,073 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:11:42,073 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:11:42,074 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:11:42,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:11:42,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1254569485, now seen corresponding path program 28 times [2018-10-14 18:11:42,075 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:11:42,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:11:43,961 INFO L134 CoverageAnalysis]: Checked inductivity of 9856 backedges. 0 proven. 9856 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:11:43,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:11:43,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-14 18:11:43,963 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-14 18:11:43,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-14 18:11:43,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=899, Invalid=2523, Unknown=0, NotChecked=0, Total=3422 [2018-10-14 18:11:43,964 INFO L87 Difference]: Start difference. First operand 1155 states and 1184 transitions. Second operand 59 states. [2018-10-14 18:11:46,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:11:46,217 INFO L93 Difference]: Finished difference Result 1248 states and 1279 transitions. [2018-10-14 18:11:46,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-14 18:11:46,217 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 752 [2018-10-14 18:11:46,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:11:46,224 INFO L225 Difference]: With dead ends: 1248 [2018-10-14 18:11:46,224 INFO L226 Difference]: Without dead ends: 1248 [2018-10-14 18:11:46,225 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2296 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4203, Invalid=8907, Unknown=0, NotChecked=0, Total=13110 [2018-10-14 18:11:46,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2018-10-14 18:11:46,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 1195. [2018-10-14 18:11:46,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1195 states. [2018-10-14 18:11:46,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 1195 states and 1225 transitions. [2018-10-14 18:11:46,237 INFO L78 Accepts]: Start accepts. Automaton has 1195 states and 1225 transitions. Word has length 752 [2018-10-14 18:11:46,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:11:46,237 INFO L481 AbstractCegarLoop]: Abstraction has 1195 states and 1225 transitions. [2018-10-14 18:11:46,237 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-14 18:11:46,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 1225 transitions. [2018-10-14 18:11:46,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 779 [2018-10-14 18:11:46,243 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:11:46,243 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:11:46,244 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:11:46,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:11:46,244 INFO L82 PathProgramCache]: Analyzing trace with hash 2001161198, now seen corresponding path program 29 times [2018-10-14 18:11:46,245 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:11:46,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:11:48,166 INFO L134 CoverageAnalysis]: Checked inductivity of 10585 backedges. 0 proven. 10585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:11:48,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:11:48,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-14 18:11:48,167 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-14 18:11:48,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-14 18:11:48,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=960, Invalid=2700, Unknown=0, NotChecked=0, Total=3660 [2018-10-14 18:11:48,169 INFO L87 Difference]: Start difference. First operand 1195 states and 1225 transitions. Second operand 61 states. [2018-10-14 18:11:51,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:11:51,041 INFO L93 Difference]: Finished difference Result 1288 states and 1320 transitions. [2018-10-14 18:11:51,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-14 18:11:51,041 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 778 [2018-10-14 18:11:51,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:11:51,048 INFO L225 Difference]: With dead ends: 1288 [2018-10-14 18:11:51,048 INFO L226 Difference]: Without dead ends: 1288 [2018-10-14 18:11:51,049 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2465 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4498, Invalid=9544, Unknown=0, NotChecked=0, Total=14042 [2018-10-14 18:11:51,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1288 states. [2018-10-14 18:11:51,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1288 to 1235. [2018-10-14 18:11:51,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1235 states. [2018-10-14 18:11:51,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1266 transitions. [2018-10-14 18:11:51,059 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 1266 transitions. Word has length 778 [2018-10-14 18:11:51,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:11:51,059 INFO L481 AbstractCegarLoop]: Abstraction has 1235 states and 1266 transitions. [2018-10-14 18:11:51,060 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-14 18:11:51,060 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1266 transitions. [2018-10-14 18:11:51,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 805 [2018-10-14 18:11:51,064 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:11:51,065 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:11:51,065 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:11:51,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:11:51,066 INFO L82 PathProgramCache]: Analyzing trace with hash 174512783, now seen corresponding path program 30 times [2018-10-14 18:11:51,066 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:11:51,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:11:53,591 INFO L134 CoverageAnalysis]: Checked inductivity of 11340 backedges. 0 proven. 11340 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:11:53,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:11:53,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-14 18:11:53,593 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-14 18:11:53,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-14 18:11:53,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2018-10-14 18:11:53,594 INFO L87 Difference]: Start difference. First operand 1235 states and 1266 transitions. Second operand 63 states. [2018-10-14 18:11:56,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:11:56,399 INFO L93 Difference]: Finished difference Result 1328 states and 1361 transitions. [2018-10-14 18:11:56,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-14 18:11:56,400 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 804 [2018-10-14 18:11:56,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:11:56,406 INFO L225 Difference]: With dead ends: 1328 [2018-10-14 18:11:56,406 INFO L226 Difference]: Without dead ends: 1328 [2018-10-14 18:11:56,408 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2640 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4803, Invalid=10203, Unknown=0, NotChecked=0, Total=15006 [2018-10-14 18:11:56,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1328 states. [2018-10-14 18:11:56,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1328 to 1275. [2018-10-14 18:11:56,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1275 states. [2018-10-14 18:11:56,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 1307 transitions. [2018-10-14 18:11:56,421 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 1307 transitions. Word has length 804 [2018-10-14 18:11:56,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:11:56,422 INFO L481 AbstractCegarLoop]: Abstraction has 1275 states and 1307 transitions. [2018-10-14 18:11:56,422 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-14 18:11:56,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 1307 transitions. [2018-10-14 18:11:56,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 831 [2018-10-14 18:11:56,430 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:11:56,430 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:11:56,430 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:11:56,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:11:56,431 INFO L82 PathProgramCache]: Analyzing trace with hash -401837584, now seen corresponding path program 31 times [2018-10-14 18:11:56,431 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:11:56,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:11:58,510 INFO L134 CoverageAnalysis]: Checked inductivity of 12121 backedges. 0 proven. 12121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:11:58,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:11:58,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-14 18:11:58,512 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-14 18:11:58,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-14 18:11:58,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1088, Invalid=3072, Unknown=0, NotChecked=0, Total=4160 [2018-10-14 18:11:58,512 INFO L87 Difference]: Start difference. First operand 1275 states and 1307 transitions. Second operand 65 states. [2018-10-14 18:12:01,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:12:01,575 INFO L93 Difference]: Finished difference Result 1368 states and 1402 transitions. [2018-10-14 18:12:01,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-14 18:12:01,576 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 830 [2018-10-14 18:12:01,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:12:01,581 INFO L225 Difference]: With dead ends: 1368 [2018-10-14 18:12:01,581 INFO L226 Difference]: Without dead ends: 1368 [2018-10-14 18:12:01,583 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2821 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5118, Invalid=10884, Unknown=0, NotChecked=0, Total=16002 [2018-10-14 18:12:01,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2018-10-14 18:12:01,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 1315. [2018-10-14 18:12:01,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1315 states. [2018-10-14 18:12:01,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1315 states to 1315 states and 1348 transitions. [2018-10-14 18:12:01,595 INFO L78 Accepts]: Start accepts. Automaton has 1315 states and 1348 transitions. Word has length 830 [2018-10-14 18:12:01,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:12:01,595 INFO L481 AbstractCegarLoop]: Abstraction has 1315 states and 1348 transitions. [2018-10-14 18:12:01,595 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-14 18:12:01,595 INFO L276 IsEmpty]: Start isEmpty. Operand 1315 states and 1348 transitions. [2018-10-14 18:12:01,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 857 [2018-10-14 18:12:01,601 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:12:01,601 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:12:01,602 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:12:01,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:12:01,602 INFO L82 PathProgramCache]: Analyzing trace with hash -636837359, now seen corresponding path program 32 times [2018-10-14 18:12:01,602 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:12:01,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:12:04,408 INFO L134 CoverageAnalysis]: Checked inductivity of 12928 backedges. 0 proven. 12928 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:12:04,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:12:04,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-14 18:12:04,410 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-14 18:12:04,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-14 18:12:04,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1155, Invalid=3267, Unknown=0, NotChecked=0, Total=4422 [2018-10-14 18:12:04,411 INFO L87 Difference]: Start difference. First operand 1315 states and 1348 transitions. Second operand 67 states. [2018-10-14 18:12:07,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:12:07,374 INFO L93 Difference]: Finished difference Result 1408 states and 1443 transitions. [2018-10-14 18:12:07,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-10-14 18:12:07,375 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 856 [2018-10-14 18:12:07,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:12:07,381 INFO L225 Difference]: With dead ends: 1408 [2018-10-14 18:12:07,381 INFO L226 Difference]: Without dead ends: 1408 [2018-10-14 18:12:07,383 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3008 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5443, Invalid=11587, Unknown=0, NotChecked=0, Total=17030 [2018-10-14 18:12:07,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2018-10-14 18:12:07,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 1355. [2018-10-14 18:12:07,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1355 states. [2018-10-14 18:12:07,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1355 states to 1355 states and 1389 transitions. [2018-10-14 18:12:07,394 INFO L78 Accepts]: Start accepts. Automaton has 1355 states and 1389 transitions. Word has length 856 [2018-10-14 18:12:07,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:12:07,395 INFO L481 AbstractCegarLoop]: Abstraction has 1355 states and 1389 transitions. [2018-10-14 18:12:07,395 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-14 18:12:07,395 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 1389 transitions. [2018-10-14 18:12:07,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 883 [2018-10-14 18:12:07,403 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:12:07,403 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:12:07,403 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:12:07,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:12:07,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1054868750, now seen corresponding path program 33 times [2018-10-14 18:12:07,404 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:12:07,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:12:09,936 INFO L134 CoverageAnalysis]: Checked inductivity of 13761 backedges. 0 proven. 13761 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:12:09,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:12:09,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-14 18:12:09,937 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-14 18:12:09,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-14 18:12:09,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1224, Invalid=3468, Unknown=0, NotChecked=0, Total=4692 [2018-10-14 18:12:09,938 INFO L87 Difference]: Start difference. First operand 1355 states and 1389 transitions. Second operand 69 states. [2018-10-14 18:12:12,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:12:12,823 INFO L93 Difference]: Finished difference Result 1448 states and 1484 transitions. [2018-10-14 18:12:12,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-10-14 18:12:12,823 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 882 [2018-10-14 18:12:12,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:12:12,829 INFO L225 Difference]: With dead ends: 1448 [2018-10-14 18:12:12,829 INFO L226 Difference]: Without dead ends: 1448 [2018-10-14 18:12:12,830 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3201 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5778, Invalid=12312, Unknown=0, NotChecked=0, Total=18090 [2018-10-14 18:12:12,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1448 states. [2018-10-14 18:12:12,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1448 to 1395. [2018-10-14 18:12:12,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1395 states. [2018-10-14 18:12:12,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1395 states to 1395 states and 1430 transitions. [2018-10-14 18:12:12,841 INFO L78 Accepts]: Start accepts. Automaton has 1395 states and 1430 transitions. Word has length 882 [2018-10-14 18:12:12,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:12:12,842 INFO L481 AbstractCegarLoop]: Abstraction has 1395 states and 1430 transitions. [2018-10-14 18:12:12,842 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-14 18:12:12,842 INFO L276 IsEmpty]: Start isEmpty. Operand 1395 states and 1430 transitions. [2018-10-14 18:12:12,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 909 [2018-10-14 18:12:12,848 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:12:12,848 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:12:12,848 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:12:12,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:12:12,849 INFO L82 PathProgramCache]: Analyzing trace with hash -2047406957, now seen corresponding path program 34 times [2018-10-14 18:12:12,850 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:12:12,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:12:15,295 INFO L134 CoverageAnalysis]: Checked inductivity of 14620 backedges. 0 proven. 14620 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:12:15,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:12:15,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-14 18:12:15,296 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-14 18:12:15,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-14 18:12:15,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1295, Invalid=3675, Unknown=0, NotChecked=0, Total=4970 [2018-10-14 18:12:15,297 INFO L87 Difference]: Start difference. First operand 1395 states and 1430 transitions. Second operand 71 states. [2018-10-14 18:12:18,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:12:18,561 INFO L93 Difference]: Finished difference Result 1488 states and 1525 transitions. [2018-10-14 18:12:18,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-10-14 18:12:18,568 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 908 [2018-10-14 18:12:18,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:12:18,573 INFO L225 Difference]: With dead ends: 1488 [2018-10-14 18:12:18,573 INFO L226 Difference]: Without dead ends: 1488 [2018-10-14 18:12:18,575 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3400 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=6123, Invalid=13059, Unknown=0, NotChecked=0, Total=19182 [2018-10-14 18:12:18,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1488 states. [2018-10-14 18:12:18,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1488 to 1435. [2018-10-14 18:12:18,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1435 states. [2018-10-14 18:12:18,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1435 states to 1435 states and 1471 transitions. [2018-10-14 18:12:18,587 INFO L78 Accepts]: Start accepts. Automaton has 1435 states and 1471 transitions. Word has length 908 [2018-10-14 18:12:18,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:12:18,587 INFO L481 AbstractCegarLoop]: Abstraction has 1435 states and 1471 transitions. [2018-10-14 18:12:18,587 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-14 18:12:18,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1435 states and 1471 transitions. [2018-10-14 18:12:18,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 935 [2018-10-14 18:12:18,594 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:12:18,594 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:12:18,594 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:12:18,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:12:18,595 INFO L82 PathProgramCache]: Analyzing trace with hash -903452940, now seen corresponding path program 35 times [2018-10-14 18:12:18,596 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:12:18,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:12:21,444 INFO L134 CoverageAnalysis]: Checked inductivity of 15505 backedges. 0 proven. 15505 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:12:21,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:12:21,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-14 18:12:21,446 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-14 18:12:21,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-14 18:12:21,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1368, Invalid=3888, Unknown=0, NotChecked=0, Total=5256 [2018-10-14 18:12:21,446 INFO L87 Difference]: Start difference. First operand 1435 states and 1471 transitions. Second operand 73 states. [2018-10-14 18:12:24,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:12:24,986 INFO L93 Difference]: Finished difference Result 1528 states and 1566 transitions. [2018-10-14 18:12:24,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-10-14 18:12:24,987 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 934 [2018-10-14 18:12:24,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:12:24,994 INFO L225 Difference]: With dead ends: 1528 [2018-10-14 18:12:24,994 INFO L226 Difference]: Without dead ends: 1528 [2018-10-14 18:12:24,995 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3605 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6478, Invalid=13828, Unknown=0, NotChecked=0, Total=20306 [2018-10-14 18:12:24,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1528 states. [2018-10-14 18:12:25,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1528 to 1475. [2018-10-14 18:12:25,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1475 states. [2018-10-14 18:12:25,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1475 states to 1475 states and 1512 transitions. [2018-10-14 18:12:25,010 INFO L78 Accepts]: Start accepts. Automaton has 1475 states and 1512 transitions. Word has length 934 [2018-10-14 18:12:25,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:12:25,011 INFO L481 AbstractCegarLoop]: Abstraction has 1475 states and 1512 transitions. [2018-10-14 18:12:25,011 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-14 18:12:25,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1475 states and 1512 transitions. [2018-10-14 18:12:25,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 961 [2018-10-14 18:12:25,018 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:12:25,018 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:12:25,018 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:12:25,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:12:25,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1496357397, now seen corresponding path program 36 times [2018-10-14 18:12:25,019 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:12:25,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:12:27,460 INFO L134 CoverageAnalysis]: Checked inductivity of 16416 backedges. 0 proven. 16416 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:12:27,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:12:27,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-14 18:12:27,462 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-14 18:12:27,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-14 18:12:27,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1443, Invalid=4107, Unknown=0, NotChecked=0, Total=5550 [2018-10-14 18:12:27,463 INFO L87 Difference]: Start difference. First operand 1475 states and 1512 transitions. Second operand 75 states. [2018-10-14 18:12:31,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:12:31,330 INFO L93 Difference]: Finished difference Result 1568 states and 1607 transitions. [2018-10-14 18:12:31,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-10-14 18:12:31,331 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 960 [2018-10-14 18:12:31,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:12:31,338 INFO L225 Difference]: With dead ends: 1568 [2018-10-14 18:12:31,339 INFO L226 Difference]: Without dead ends: 1568 [2018-10-14 18:12:31,340 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3816 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6843, Invalid=14619, Unknown=0, NotChecked=0, Total=21462 [2018-10-14 18:12:31,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1568 states. [2018-10-14 18:12:31,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1568 to 1515. [2018-10-14 18:12:31,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1515 states. [2018-10-14 18:12:31,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 1515 states and 1553 transitions. [2018-10-14 18:12:31,355 INFO L78 Accepts]: Start accepts. Automaton has 1515 states and 1553 transitions. Word has length 960 [2018-10-14 18:12:31,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:12:31,356 INFO L481 AbstractCegarLoop]: Abstraction has 1515 states and 1553 transitions. [2018-10-14 18:12:31,356 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-14 18:12:31,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 1553 transitions. [2018-10-14 18:12:31,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 987 [2018-10-14 18:12:31,365 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:12:31,366 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 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] [2018-10-14 18:12:31,366 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:12:31,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:12:31,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1501836790, now seen corresponding path program 37 times [2018-10-14 18:12:31,367 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:12:31,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:12:34,176 INFO L134 CoverageAnalysis]: Checked inductivity of 17353 backedges. 0 proven. 17353 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:12:34,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:12:34,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-10-14 18:12:34,177 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-14 18:12:34,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-14 18:12:34,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1520, Invalid=4332, Unknown=0, NotChecked=0, Total=5852 [2018-10-14 18:12:34,178 INFO L87 Difference]: Start difference. First operand 1515 states and 1553 transitions. Second operand 77 states. [2018-10-14 18:12:37,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:12:37,917 INFO L93 Difference]: Finished difference Result 1608 states and 1648 transitions. [2018-10-14 18:12:37,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-10-14 18:12:37,918 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 986 [2018-10-14 18:12:37,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:12:37,924 INFO L225 Difference]: With dead ends: 1608 [2018-10-14 18:12:37,924 INFO L226 Difference]: Without dead ends: 1608 [2018-10-14 18:12:37,926 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4033 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=7218, Invalid=15432, Unknown=0, NotChecked=0, Total=22650 [2018-10-14 18:12:37,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1608 states. [2018-10-14 18:12:37,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1608 to 1555. [2018-10-14 18:12:37,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1555 states. [2018-10-14 18:12:37,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 1594 transitions. [2018-10-14 18:12:37,940 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 1594 transitions. Word has length 986 [2018-10-14 18:12:37,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:12:37,941 INFO L481 AbstractCegarLoop]: Abstraction has 1555 states and 1594 transitions. [2018-10-14 18:12:37,941 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-14 18:12:37,941 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 1594 transitions. [2018-10-14 18:12:37,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1013 [2018-10-14 18:12:37,950 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:12:37,951 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 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] [2018-10-14 18:12:37,951 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:12:37,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:12:37,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1031522967, now seen corresponding path program 38 times [2018-10-14 18:12:37,952 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:12:37,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:12:40,787 INFO L134 CoverageAnalysis]: Checked inductivity of 18316 backedges. 0 proven. 18316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:12:40,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:12:40,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-10-14 18:12:40,789 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-14 18:12:40,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-14 18:12:40,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1599, Invalid=4563, Unknown=0, NotChecked=0, Total=6162 [2018-10-14 18:12:40,789 INFO L87 Difference]: Start difference. First operand 1555 states and 1594 transitions. Second operand 79 states. [2018-10-14 18:12:44,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:12:44,614 INFO L93 Difference]: Finished difference Result 1648 states and 1689 transitions. [2018-10-14 18:12:44,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-10-14 18:12:44,615 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 1012 [2018-10-14 18:12:44,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:12:44,620 INFO L225 Difference]: With dead ends: 1648 [2018-10-14 18:12:44,620 INFO L226 Difference]: Without dead ends: 1648 [2018-10-14 18:12:44,622 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4256 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=7603, Invalid=16267, Unknown=0, NotChecked=0, Total=23870 [2018-10-14 18:12:44,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2018-10-14 18:12:44,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 1595. [2018-10-14 18:12:44,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1595 states. [2018-10-14 18:12:44,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1595 states to 1595 states and 1635 transitions. [2018-10-14 18:12:44,633 INFO L78 Accepts]: Start accepts. Automaton has 1595 states and 1635 transitions. Word has length 1012 [2018-10-14 18:12:44,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:12:44,633 INFO L481 AbstractCegarLoop]: Abstraction has 1595 states and 1635 transitions. [2018-10-14 18:12:44,633 INFO L482 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-14 18:12:44,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1595 states and 1635 transitions. [2018-10-14 18:12:44,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1039 [2018-10-14 18:12:44,640 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:12:44,641 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 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] [2018-10-14 18:12:44,641 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:12:44,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:12:44,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1952311288, now seen corresponding path program 39 times [2018-10-14 18:12:44,642 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:12:44,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:12:47,565 INFO L134 CoverageAnalysis]: Checked inductivity of 19305 backedges. 0 proven. 19305 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:12:47,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:12:47,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-14 18:12:47,567 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-14 18:12:47,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-14 18:12:47,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1680, Invalid=4800, Unknown=0, NotChecked=0, Total=6480 [2018-10-14 18:12:47,567 INFO L87 Difference]: Start difference. First operand 1595 states and 1635 transitions. Second operand 81 states. [2018-10-14 18:12:51,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:12:51,911 INFO L93 Difference]: Finished difference Result 1688 states and 1730 transitions. [2018-10-14 18:12:51,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-10-14 18:12:51,911 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 1038 [2018-10-14 18:12:51,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:12:51,915 INFO L225 Difference]: With dead ends: 1688 [2018-10-14 18:12:51,915 INFO L226 Difference]: Without dead ends: 1688 [2018-10-14 18:12:51,917 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4485 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7998, Invalid=17124, Unknown=0, NotChecked=0, Total=25122 [2018-10-14 18:12:51,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1688 states. [2018-10-14 18:12:51,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1688 to 1635. [2018-10-14 18:12:51,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1635 states. [2018-10-14 18:12:51,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1635 states to 1635 states and 1676 transitions. [2018-10-14 18:12:51,928 INFO L78 Accepts]: Start accepts. Automaton has 1635 states and 1676 transitions. Word has length 1038 [2018-10-14 18:12:51,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:12:51,929 INFO L481 AbstractCegarLoop]: Abstraction has 1635 states and 1676 transitions. [2018-10-14 18:12:51,929 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-14 18:12:51,929 INFO L276 IsEmpty]: Start isEmpty. Operand 1635 states and 1676 transitions. [2018-10-14 18:12:51,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1065 [2018-10-14 18:12:51,936 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:12:51,937 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 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] [2018-10-14 18:12:51,937 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:12:51,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:12:51,937 INFO L82 PathProgramCache]: Analyzing trace with hash -614654439, now seen corresponding path program 40 times [2018-10-14 18:12:51,938 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:12:51,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:12:54,774 INFO L134 CoverageAnalysis]: Checked inductivity of 20320 backedges. 0 proven. 20320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:12:54,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:12:54,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-14 18:12:54,775 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-14 18:12:54,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-14 18:12:54,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1763, Invalid=5043, Unknown=0, NotChecked=0, Total=6806 [2018-10-14 18:12:54,776 INFO L87 Difference]: Start difference. First operand 1635 states and 1676 transitions. Second operand 83 states. [2018-10-14 18:12:59,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:12:59,278 INFO L93 Difference]: Finished difference Result 1728 states and 1771 transitions. [2018-10-14 18:12:59,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-10-14 18:12:59,278 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 1064 [2018-10-14 18:12:59,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:12:59,282 INFO L225 Difference]: With dead ends: 1728 [2018-10-14 18:12:59,282 INFO L226 Difference]: Without dead ends: 1728 [2018-10-14 18:12:59,284 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4720 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=8403, Invalid=18003, Unknown=0, NotChecked=0, Total=26406 [2018-10-14 18:12:59,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1728 states. [2018-10-14 18:12:59,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1728 to 1675. [2018-10-14 18:12:59,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1675 states. [2018-10-14 18:12:59,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1675 states to 1675 states and 1717 transitions. [2018-10-14 18:12:59,293 INFO L78 Accepts]: Start accepts. Automaton has 1675 states and 1717 transitions. Word has length 1064 [2018-10-14 18:12:59,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:12:59,294 INFO L481 AbstractCegarLoop]: Abstraction has 1675 states and 1717 transitions. [2018-10-14 18:12:59,294 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-14 18:12:59,294 INFO L276 IsEmpty]: Start isEmpty. Operand 1675 states and 1717 transitions. [2018-10-14 18:12:59,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1091 [2018-10-14 18:12:59,302 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:12:59,302 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 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] [2018-10-14 18:12:59,302 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:12:59,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:12:59,303 INFO L82 PathProgramCache]: Analyzing trace with hash -292029190, now seen corresponding path program 41 times [2018-10-14 18:12:59,303 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:12:59,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:13:02,522 INFO L134 CoverageAnalysis]: Checked inductivity of 21361 backedges. 0 proven. 21361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:13:02,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:13:02,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-10-14 18:13:02,524 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-14 18:13:02,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-14 18:13:02,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1848, Invalid=5292, Unknown=0, NotChecked=0, Total=7140 [2018-10-14 18:13:02,524 INFO L87 Difference]: Start difference. First operand 1675 states and 1717 transitions. Second operand 85 states. [2018-10-14 18:13:07,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:13:07,059 INFO L93 Difference]: Finished difference Result 1768 states and 1812 transitions. [2018-10-14 18:13:07,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-10-14 18:13:07,060 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 1090 [2018-10-14 18:13:07,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:13:07,064 INFO L225 Difference]: With dead ends: 1768 [2018-10-14 18:13:07,065 INFO L226 Difference]: Without dead ends: 1768 [2018-10-14 18:13:07,067 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4961 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=8818, Invalid=18904, Unknown=0, NotChecked=0, Total=27722 [2018-10-14 18:13:07,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1768 states. [2018-10-14 18:13:07,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1768 to 1715. [2018-10-14 18:13:07,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1715 states. [2018-10-14 18:13:07,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1715 states to 1715 states and 1758 transitions. [2018-10-14 18:13:07,081 INFO L78 Accepts]: Start accepts. Automaton has 1715 states and 1758 transitions. Word has length 1090 [2018-10-14 18:13:07,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:13:07,082 INFO L481 AbstractCegarLoop]: Abstraction has 1715 states and 1758 transitions. [2018-10-14 18:13:07,082 INFO L482 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-14 18:13:07,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 1758 transitions. [2018-10-14 18:13:07,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1117 [2018-10-14 18:13:07,095 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:13:07,095 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 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] [2018-10-14 18:13:07,095 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:13:07,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:13:07,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1172761445, now seen corresponding path program 42 times [2018-10-14 18:13:07,097 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:13:07,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:13:10,118 INFO L134 CoverageAnalysis]: Checked inductivity of 22428 backedges. 0 proven. 22428 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:13:10,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:13:10,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-14 18:13:10,119 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-14 18:13:10,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-14 18:13:10,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1935, Invalid=5547, Unknown=0, NotChecked=0, Total=7482 [2018-10-14 18:13:10,120 INFO L87 Difference]: Start difference. First operand 1715 states and 1758 transitions. Second operand 87 states. [2018-10-14 18:13:14,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:13:14,948 INFO L93 Difference]: Finished difference Result 1808 states and 1853 transitions. [2018-10-14 18:13:14,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-10-14 18:13:14,949 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 1116 [2018-10-14 18:13:14,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:13:14,952 INFO L225 Difference]: With dead ends: 1808 [2018-10-14 18:13:14,952 INFO L226 Difference]: Without dead ends: 1808 [2018-10-14 18:13:14,954 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5208 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=9243, Invalid=19827, Unknown=0, NotChecked=0, Total=29070 [2018-10-14 18:13:14,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1808 states. [2018-10-14 18:13:14,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1808 to 1755. [2018-10-14 18:13:14,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1755 states. [2018-10-14 18:13:14,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1755 states to 1755 states and 1799 transitions. [2018-10-14 18:13:14,967 INFO L78 Accepts]: Start accepts. Automaton has 1755 states and 1799 transitions. Word has length 1116 [2018-10-14 18:13:14,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:13:14,968 INFO L481 AbstractCegarLoop]: Abstraction has 1755 states and 1799 transitions. [2018-10-14 18:13:14,968 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-14 18:13:14,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 1799 transitions. [2018-10-14 18:13:14,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1143 [2018-10-14 18:13:14,980 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:13:14,981 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 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] [2018-10-14 18:13:14,981 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:13:14,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:13:14,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1965624068, now seen corresponding path program 43 times [2018-10-14 18:13:14,982 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:13:15,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:13:18,508 INFO L134 CoverageAnalysis]: Checked inductivity of 23521 backedges. 0 proven. 23521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:13:18,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:13:18,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-10-14 18:13:18,509 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-14 18:13:18,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-14 18:13:18,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2024, Invalid=5808, Unknown=0, NotChecked=0, Total=7832 [2018-10-14 18:13:18,510 INFO L87 Difference]: Start difference. First operand 1755 states and 1799 transitions. Second operand 89 states. [2018-10-14 18:13:23,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:13:23,310 INFO L93 Difference]: Finished difference Result 1848 states and 1894 transitions. [2018-10-14 18:13:23,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-10-14 18:13:23,310 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 1142 [2018-10-14 18:13:23,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:13:23,316 INFO L225 Difference]: With dead ends: 1848 [2018-10-14 18:13:23,316 INFO L226 Difference]: Without dead ends: 1848 [2018-10-14 18:13:23,318 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5461 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=9678, Invalid=20772, Unknown=0, NotChecked=0, Total=30450 [2018-10-14 18:13:23,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1848 states. [2018-10-14 18:13:23,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1848 to 1795. [2018-10-14 18:13:23,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1795 states. [2018-10-14 18:13:23,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 1840 transitions. [2018-10-14 18:13:23,333 INFO L78 Accepts]: Start accepts. Automaton has 1795 states and 1840 transitions. Word has length 1142 [2018-10-14 18:13:23,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:13:23,334 INFO L481 AbstractCegarLoop]: Abstraction has 1795 states and 1840 transitions. [2018-10-14 18:13:23,334 INFO L482 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-14 18:13:23,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 1840 transitions. [2018-10-14 18:13:23,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1169 [2018-10-14 18:13:23,347 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:13:23,347 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 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] [2018-10-14 18:13:23,348 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:13:23,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:13:23,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1605643805, now seen corresponding path program 44 times [2018-10-14 18:13:23,349 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:13:23,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:13:26,925 INFO L134 CoverageAnalysis]: Checked inductivity of 24640 backedges. 0 proven. 24640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:13:26,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:13:26,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-10-14 18:13:26,926 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-14 18:13:26,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-14 18:13:26,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2115, Invalid=6075, Unknown=0, NotChecked=0, Total=8190 [2018-10-14 18:13:26,927 INFO L87 Difference]: Start difference. First operand 1795 states and 1840 transitions. Second operand 91 states. [2018-10-14 18:13:32,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:13:32,213 INFO L93 Difference]: Finished difference Result 1888 states and 1935 transitions. [2018-10-14 18:13:32,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-10-14 18:13:32,214 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 1168 [2018-10-14 18:13:32,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:13:32,219 INFO L225 Difference]: With dead ends: 1888 [2018-10-14 18:13:32,219 INFO L226 Difference]: Without dead ends: 1888 [2018-10-14 18:13:32,221 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5720 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=10123, Invalid=21739, Unknown=0, NotChecked=0, Total=31862 [2018-10-14 18:13:32,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1888 states. [2018-10-14 18:13:32,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1888 to 1835. [2018-10-14 18:13:32,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1835 states. [2018-10-14 18:13:32,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1835 states to 1835 states and 1881 transitions. [2018-10-14 18:13:32,237 INFO L78 Accepts]: Start accepts. Automaton has 1835 states and 1881 transitions. Word has length 1168 [2018-10-14 18:13:32,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:13:32,238 INFO L481 AbstractCegarLoop]: Abstraction has 1835 states and 1881 transitions. [2018-10-14 18:13:32,238 INFO L482 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-14 18:13:32,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1835 states and 1881 transitions. [2018-10-14 18:13:32,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1195 [2018-10-14 18:13:32,250 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:13:32,251 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 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] [2018-10-14 18:13:32,251 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:13:32,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:13:32,252 INFO L82 PathProgramCache]: Analyzing trace with hash 444551166, now seen corresponding path program 45 times [2018-10-14 18:13:32,252 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:13:32,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:13:35,729 INFO L134 CoverageAnalysis]: Checked inductivity of 25785 backedges. 0 proven. 25785 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:13:35,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:13:35,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-14 18:13:35,731 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-14 18:13:35,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-14 18:13:35,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2208, Invalid=6348, Unknown=0, NotChecked=0, Total=8556 [2018-10-14 18:13:35,731 INFO L87 Difference]: Start difference. First operand 1835 states and 1881 transitions. Second operand 93 states. [2018-10-14 18:13:41,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:13:41,399 INFO L93 Difference]: Finished difference Result 1928 states and 1976 transitions. [2018-10-14 18:13:41,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-10-14 18:13:41,400 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 1194 [2018-10-14 18:13:41,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:13:41,403 INFO L225 Difference]: With dead ends: 1928 [2018-10-14 18:13:41,403 INFO L226 Difference]: Without dead ends: 1928 [2018-10-14 18:13:41,405 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5985 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=10578, Invalid=22728, Unknown=0, NotChecked=0, Total=33306 [2018-10-14 18:13:41,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1928 states. [2018-10-14 18:13:41,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1875. [2018-10-14 18:13:41,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1875 states. [2018-10-14 18:13:41,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1875 states to 1875 states and 1922 transitions. [2018-10-14 18:13:41,420 INFO L78 Accepts]: Start accepts. Automaton has 1875 states and 1922 transitions. Word has length 1194 [2018-10-14 18:13:41,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:13:41,421 INFO L481 AbstractCegarLoop]: Abstraction has 1875 states and 1922 transitions. [2018-10-14 18:13:41,421 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-14 18:13:41,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 1922 transitions. [2018-10-14 18:13:41,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1221 [2018-10-14 18:13:41,434 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:13:41,435 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 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] [2018-10-14 18:13:41,435 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:13:41,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:13:41,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1894967967, now seen corresponding path program 46 times [2018-10-14 18:13:41,436 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:13:41,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:13:45,021 INFO L134 CoverageAnalysis]: Checked inductivity of 26956 backedges. 0 proven. 26956 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:13:45,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:13:45,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-10-14 18:13:45,022 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-14 18:13:45,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-14 18:13:45,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2303, Invalid=6627, Unknown=0, NotChecked=0, Total=8930 [2018-10-14 18:13:45,023 INFO L87 Difference]: Start difference. First operand 1875 states and 1922 transitions. Second operand 95 states. [2018-10-14 18:13:50,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:13:50,862 INFO L93 Difference]: Finished difference Result 1968 states and 2017 transitions. [2018-10-14 18:13:50,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-10-14 18:13:50,863 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 1220 [2018-10-14 18:13:50,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:13:50,866 INFO L225 Difference]: With dead ends: 1968 [2018-10-14 18:13:50,866 INFO L226 Difference]: Without dead ends: 1968 [2018-10-14 18:13:50,868 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6256 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=11043, Invalid=23739, Unknown=0, NotChecked=0, Total=34782 [2018-10-14 18:13:50,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1968 states. [2018-10-14 18:13:50,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1968 to 1915. [2018-10-14 18:13:50,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1915 states. [2018-10-14 18:13:50,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1915 states to 1915 states and 1963 transitions. [2018-10-14 18:13:50,883 INFO L78 Accepts]: Start accepts. Automaton has 1915 states and 1963 transitions. Word has length 1220 [2018-10-14 18:13:50,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:13:50,884 INFO L481 AbstractCegarLoop]: Abstraction has 1915 states and 1963 transitions. [2018-10-14 18:13:50,884 INFO L482 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-14 18:13:50,884 INFO L276 IsEmpty]: Start isEmpty. Operand 1915 states and 1963 transitions. [2018-10-14 18:13:50,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1247 [2018-10-14 18:13:50,898 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:13:50,899 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 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] [2018-10-14 18:13:50,899 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:13:50,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:13:50,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1649046016, now seen corresponding path program 47 times [2018-10-14 18:13:50,900 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:13:50,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:13:54,875 INFO L134 CoverageAnalysis]: Checked inductivity of 28153 backedges. 0 proven. 28153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:13:54,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:13:54,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-10-14 18:13:54,876 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-10-14 18:13:54,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-10-14 18:13:54,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2400, Invalid=6912, Unknown=0, NotChecked=0, Total=9312 [2018-10-14 18:13:54,877 INFO L87 Difference]: Start difference. First operand 1915 states and 1963 transitions. Second operand 97 states. [2018-10-14 18:14:00,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:14:00,940 INFO L93 Difference]: Finished difference Result 2008 states and 2058 transitions. [2018-10-14 18:14:00,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-10-14 18:14:00,941 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 1246 [2018-10-14 18:14:00,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:14:00,944 INFO L225 Difference]: With dead ends: 2008 [2018-10-14 18:14:00,944 INFO L226 Difference]: Without dead ends: 2008 [2018-10-14 18:14:00,947 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6533 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=11518, Invalid=24772, Unknown=0, NotChecked=0, Total=36290 [2018-10-14 18:14:00,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2008 states. [2018-10-14 18:14:00,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2008 to 1955. [2018-10-14 18:14:00,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1955 states. [2018-10-14 18:14:00,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1955 states to 1955 states and 2004 transitions. [2018-10-14 18:14:00,960 INFO L78 Accepts]: Start accepts. Automaton has 1955 states and 2004 transitions. Word has length 1246 [2018-10-14 18:14:00,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:14:00,961 INFO L481 AbstractCegarLoop]: Abstraction has 1955 states and 2004 transitions. [2018-10-14 18:14:00,961 INFO L482 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-10-14 18:14:00,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1955 states and 2004 transitions. [2018-10-14 18:14:00,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1273 [2018-10-14 18:14:00,971 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:14:00,972 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 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] [2018-10-14 18:14:00,972 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:14:00,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:14:00,973 INFO L82 PathProgramCache]: Analyzing trace with hash -782644703, now seen corresponding path program 48 times [2018-10-14 18:14:00,973 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:14:01,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:14:05,078 INFO L134 CoverageAnalysis]: Checked inductivity of 29376 backedges. 0 proven. 29376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:14:05,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:14:05,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-10-14 18:14:05,080 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-10-14 18:14:05,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-10-14 18:14:05,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2499, Invalid=7203, Unknown=0, NotChecked=0, Total=9702 [2018-10-14 18:14:05,080 INFO L87 Difference]: Start difference. First operand 1955 states and 2004 transitions. Second operand 99 states. [2018-10-14 18:14:11,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:14:11,239 INFO L93 Difference]: Finished difference Result 2048 states and 2099 transitions. [2018-10-14 18:14:11,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-10-14 18:14:11,239 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 1272 [2018-10-14 18:14:11,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:14:11,242 INFO L225 Difference]: With dead ends: 2048 [2018-10-14 18:14:11,242 INFO L226 Difference]: Without dead ends: 2048 [2018-10-14 18:14:11,244 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-14 18:14:11,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2048 states. [2018-10-14 18:14:11,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2048 to 1995. [2018-10-14 18:14:11,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1995 states. [2018-10-14 18:14:11,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1995 states to 1995 states and 2045 transitions. [2018-10-14 18:14:11,255 INFO L78 Accepts]: Start accepts. Automaton has 1995 states and 2045 transitions. Word has length 1272 [2018-10-14 18:14:11,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:14:11,256 INFO L481 AbstractCegarLoop]: Abstraction has 1995 states and 2045 transitions. [2018-10-14 18:14:11,256 INFO L482 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-10-14 18:14:11,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1995 states and 2045 transitions. [2018-10-14 18:14:11,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1299 [2018-10-14 18:14:11,267 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:14:11,267 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 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] [2018-10-14 18:14:11,268 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:14:11,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:14:11,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1667116802, now seen corresponding path program 49 times [2018-10-14 18:14:11,268 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:14:11,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:14:15,630 INFO L134 CoverageAnalysis]: Checked inductivity of 30625 backedges. 0 proven. 30625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:14:15,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:14:15,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-10-14 18:14:15,631 INFO L460 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-10-14 18:14:15,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-10-14 18:14:15,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2600, Invalid=7500, Unknown=0, NotChecked=0, Total=10100 [2018-10-14 18:14:15,632 INFO L87 Difference]: Start difference. First operand 1995 states and 2045 transitions. Second operand 101 states. [2018-10-14 18:14:21,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:14:21,775 INFO L93 Difference]: Finished difference Result 2088 states and 2140 transitions. [2018-10-14 18:14:21,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-10-14 18:14:21,775 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 1298 [2018-10-14 18:14:21,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:14:21,778 INFO L225 Difference]: With dead ends: 2088 [2018-10-14 18:14:21,779 INFO L226 Difference]: Without dead ends: 2088 [2018-10-14 18:14:21,782 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7105 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=12498, Invalid=26904, Unknown=0, NotChecked=0, Total=39402 [2018-10-14 18:14:21,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2088 states. [2018-10-14 18:14:21,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2088 to 2035. [2018-10-14 18:14:21,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2035 states. [2018-10-14 18:14:21,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2035 states to 2035 states and 2086 transitions. [2018-10-14 18:14:21,795 INFO L78 Accepts]: Start accepts. Automaton has 2035 states and 2086 transitions. Word has length 1298 [2018-10-14 18:14:21,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:14:21,796 INFO L481 AbstractCegarLoop]: Abstraction has 2035 states and 2086 transitions. [2018-10-14 18:14:21,796 INFO L482 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-10-14 18:14:21,796 INFO L276 IsEmpty]: Start isEmpty. Operand 2035 states and 2086 transitions. [2018-10-14 18:14:21,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1325 [2018-10-14 18:14:21,806 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:14:21,807 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 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] [2018-10-14 18:14:21,807 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:14:21,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:14:21,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1020441437, now seen corresponding path program 50 times [2018-10-14 18:14:21,808 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:14:21,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:14:26,239 INFO L134 CoverageAnalysis]: Checked inductivity of 31900 backedges. 0 proven. 31900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:14:26,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:14:26,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-10-14 18:14:26,240 INFO L460 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-10-14 18:14:26,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-10-14 18:14:26,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2703, Invalid=7803, Unknown=0, NotChecked=0, Total=10506 [2018-10-14 18:14:26,241 INFO L87 Difference]: Start difference. First operand 2035 states and 2086 transitions. Second operand 103 states. [2018-10-14 18:14:33,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:14:33,277 INFO L93 Difference]: Finished difference Result 2128 states and 2181 transitions. [2018-10-14 18:14:33,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2018-10-14 18:14:33,278 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 1324 [2018-10-14 18:14:33,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:14:33,281 INFO L225 Difference]: With dead ends: 2128 [2018-10-14 18:14:33,281 INFO L226 Difference]: Without dead ends: 2128 [2018-10-14 18:14:33,284 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7400 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=13003, Invalid=28003, Unknown=0, NotChecked=0, Total=41006 [2018-10-14 18:14:33,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2128 states. [2018-10-14 18:14:33,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2128 to 2075. [2018-10-14 18:14:33,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2075 states. [2018-10-14 18:14:33,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2075 states to 2075 states and 2127 transitions. [2018-10-14 18:14:33,297 INFO L78 Accepts]: Start accepts. Automaton has 2075 states and 2127 transitions. Word has length 1324 [2018-10-14 18:14:33,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:14:33,298 INFO L481 AbstractCegarLoop]: Abstraction has 2075 states and 2127 transitions. [2018-10-14 18:14:33,298 INFO L482 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-10-14 18:14:33,298 INFO L276 IsEmpty]: Start isEmpty. Operand 2075 states and 2127 transitions. [2018-10-14 18:14:33,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1351 [2018-10-14 18:14:33,310 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:14:33,310 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 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] [2018-10-14 18:14:33,311 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:14:33,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:14:33,311 INFO L82 PathProgramCache]: Analyzing trace with hash 689812228, now seen corresponding path program 51 times [2018-10-14 18:14:33,312 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:14:33,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:14:37,707 INFO L134 CoverageAnalysis]: Checked inductivity of 33201 backedges. 0 proven. 33201 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:14:37,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:14:37,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-10-14 18:14:37,708 INFO L460 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-10-14 18:14:37,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-10-14 18:14:37,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2808, Invalid=8112, Unknown=0, NotChecked=0, Total=10920 [2018-10-14 18:14:37,709 INFO L87 Difference]: Start difference. First operand 2075 states and 2127 transitions. Second operand 105 states. [2018-10-14 18:14:44,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:14:44,410 INFO L93 Difference]: Finished difference Result 2168 states and 2222 transitions. [2018-10-14 18:14:44,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2018-10-14 18:14:44,410 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 1350 [2018-10-14 18:14:44,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:14:44,414 INFO L225 Difference]: With dead ends: 2168 [2018-10-14 18:14:44,414 INFO L226 Difference]: Without dead ends: 2168 [2018-10-14 18:14:44,417 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7701 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=13518, Invalid=29124, Unknown=0, NotChecked=0, Total=42642 [2018-10-14 18:14:44,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2168 states. [2018-10-14 18:14:44,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2168 to 2115. [2018-10-14 18:14:44,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2115 states. [2018-10-14 18:14:44,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2115 states to 2115 states and 2168 transitions. [2018-10-14 18:14:44,429 INFO L78 Accepts]: Start accepts. Automaton has 2115 states and 2168 transitions. Word has length 1350 [2018-10-14 18:14:44,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:14:44,430 INFO L481 AbstractCegarLoop]: Abstraction has 2115 states and 2168 transitions. [2018-10-14 18:14:44,430 INFO L482 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-10-14 18:14:44,430 INFO L276 IsEmpty]: Start isEmpty. Operand 2115 states and 2168 transitions. [2018-10-14 18:14:44,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1377 [2018-10-14 18:14:44,442 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:14:44,443 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 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] [2018-10-14 18:14:44,443 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:14:44,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:14:44,443 INFO L82 PathProgramCache]: Analyzing trace with hash 124908069, now seen corresponding path program 52 times [2018-10-14 18:14:44,444 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:14:44,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:14:49,208 INFO L134 CoverageAnalysis]: Checked inductivity of 34528 backedges. 0 proven. 34528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:14:49,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:14:49,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-10-14 18:14:49,209 INFO L460 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-10-14 18:14:49,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-10-14 18:14:49,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2915, Invalid=8427, Unknown=0, NotChecked=0, Total=11342 [2018-10-14 18:14:49,210 INFO L87 Difference]: Start difference. First operand 2115 states and 2168 transitions. Second operand 107 states. [2018-10-14 18:14:56,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:14:56,305 INFO L93 Difference]: Finished difference Result 2208 states and 2263 transitions. [2018-10-14 18:14:56,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2018-10-14 18:14:56,306 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 1376 [2018-10-14 18:14:56,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:14:56,309 INFO L225 Difference]: With dead ends: 2208 [2018-10-14 18:14:56,309 INFO L226 Difference]: Without dead ends: 2208 [2018-10-14 18:14:56,312 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8008 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=14043, Invalid=30267, Unknown=0, NotChecked=0, Total=44310 [2018-10-14 18:14:56,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2208 states. [2018-10-14 18:14:56,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2208 to 2155. [2018-10-14 18:14:56,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2155 states. [2018-10-14 18:14:56,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2155 states to 2155 states and 2209 transitions. [2018-10-14 18:14:56,328 INFO L78 Accepts]: Start accepts. Automaton has 2155 states and 2209 transitions. Word has length 1376 [2018-10-14 18:14:56,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:14:56,328 INFO L481 AbstractCegarLoop]: Abstraction has 2155 states and 2209 transitions. [2018-10-14 18:14:56,329 INFO L482 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-10-14 18:14:56,329 INFO L276 IsEmpty]: Start isEmpty. Operand 2155 states and 2209 transitions. [2018-10-14 18:14:56,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1403 [2018-10-14 18:14:56,344 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:14:56,345 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 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] [2018-10-14 18:14:56,345 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:14:56,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:14:56,346 INFO L82 PathProgramCache]: Analyzing trace with hash 995662342, now seen corresponding path program 53 times [2018-10-14 18:14:56,346 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:14:56,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:15:01,231 INFO L134 CoverageAnalysis]: Checked inductivity of 35881 backedges. 0 proven. 35881 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:15:01,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:15:01,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-10-14 18:15:01,232 INFO L460 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-10-14 18:15:01,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-10-14 18:15:01,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3024, Invalid=8748, Unknown=0, NotChecked=0, Total=11772 [2018-10-14 18:15:01,233 INFO L87 Difference]: Start difference. First operand 2155 states and 2209 transitions. Second operand 109 states. [2018-10-14 18:15:08,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:15:08,879 INFO L93 Difference]: Finished difference Result 2248 states and 2304 transitions. [2018-10-14 18:15:08,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2018-10-14 18:15:08,880 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 1402 [2018-10-14 18:15:08,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:15:08,883 INFO L225 Difference]: With dead ends: 2248 [2018-10-14 18:15:08,883 INFO L226 Difference]: Without dead ends: 2248 [2018-10-14 18:15:08,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-14 18:15:08,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2248 states. [2018-10-14 18:15:08,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2248 to 2195. [2018-10-14 18:15:08,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2195 states. [2018-10-14 18:15:08,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2195 states to 2195 states and 2250 transitions. [2018-10-14 18:15:08,898 INFO L78 Accepts]: Start accepts. Automaton has 2195 states and 2250 transitions. Word has length 1402 [2018-10-14 18:15:08,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:15:08,899 INFO L481 AbstractCegarLoop]: Abstraction has 2195 states and 2250 transitions. [2018-10-14 18:15:08,899 INFO L482 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-10-14 18:15:08,899 INFO L276 IsEmpty]: Start isEmpty. Operand 2195 states and 2250 transitions. [2018-10-14 18:15:08,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1429 [2018-10-14 18:15:08,912 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:15:08,912 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 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] [2018-10-14 18:15:08,912 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:15:08,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:15:08,913 INFO L82 PathProgramCache]: Analyzing trace with hash -34850137, now seen corresponding path program 54 times [2018-10-14 18:15:08,913 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:15:08,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:15:13,702 INFO L134 CoverageAnalysis]: Checked inductivity of 37260 backedges. 0 proven. 37260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:15:13,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:15:13,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-10-14 18:15:13,703 INFO L460 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-10-14 18:15:13,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-10-14 18:15:13,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3135, Invalid=9075, Unknown=0, NotChecked=0, Total=12210 [2018-10-14 18:15:13,704 INFO L87 Difference]: Start difference. First operand 2195 states and 2250 transitions. Second operand 111 states. [2018-10-14 18:15:21,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:15:21,774 INFO L93 Difference]: Finished difference Result 2288 states and 2345 transitions. [2018-10-14 18:15:21,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2018-10-14 18:15:21,774 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 1428 [2018-10-14 18:15:21,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:15:21,778 INFO L225 Difference]: With dead ends: 2288 [2018-10-14 18:15:21,778 INFO L226 Difference]: Without dead ends: 2288 [2018-10-14 18:15:21,781 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-14 18:15:21,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2288 states. [2018-10-14 18:15:21,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2288 to 2235. [2018-10-14 18:15:21,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2235 states. [2018-10-14 18:15:21,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2235 states to 2235 states and 2291 transitions. [2018-10-14 18:15:21,792 INFO L78 Accepts]: Start accepts. Automaton has 2235 states and 2291 transitions. Word has length 1428 [2018-10-14 18:15:21,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:15:21,793 INFO L481 AbstractCegarLoop]: Abstraction has 2235 states and 2291 transitions. [2018-10-14 18:15:21,793 INFO L482 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-10-14 18:15:21,793 INFO L276 IsEmpty]: Start isEmpty. Operand 2235 states and 2291 transitions. [2018-10-14 18:15:21,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1455 [2018-10-14 18:15:21,807 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:15:21,807 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 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] [2018-10-14 18:15:21,807 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:15:21,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:15:21,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1791794168, now seen corresponding path program 55 times [2018-10-14 18:15:21,808 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:15:21,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:15:27,095 INFO L134 CoverageAnalysis]: Checked inductivity of 38665 backedges. 0 proven. 38665 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:15:27,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:15:27,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-10-14 18:15:27,096 INFO L460 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-10-14 18:15:27,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-10-14 18:15:27,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3248, Invalid=9408, Unknown=0, NotChecked=0, Total=12656 [2018-10-14 18:15:27,097 INFO L87 Difference]: Start difference. First operand 2235 states and 2291 transitions. Second operand 113 states. [2018-10-14 18:15:35,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:15:35,377 INFO L93 Difference]: Finished difference Result 2328 states and 2386 transitions. [2018-10-14 18:15:35,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2018-10-14 18:15:35,378 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 1454 [2018-10-14 18:15:35,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:15:35,381 INFO L225 Difference]: With dead ends: 2328 [2018-10-14 18:15:35,381 INFO L226 Difference]: Without dead ends: 2328 [2018-10-14 18:15:35,383 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-14 18:15:35,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2328 states. [2018-10-14 18:15:35,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2328 to 2275. [2018-10-14 18:15:35,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2275 states. [2018-10-14 18:15:35,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2275 states to 2275 states and 2332 transitions. [2018-10-14 18:15:35,395 INFO L78 Accepts]: Start accepts. Automaton has 2275 states and 2332 transitions. Word has length 1454 [2018-10-14 18:15:35,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:15:35,396 INFO L481 AbstractCegarLoop]: Abstraction has 2275 states and 2332 transitions. [2018-10-14 18:15:35,396 INFO L482 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-10-14 18:15:35,396 INFO L276 IsEmpty]: Start isEmpty. Operand 2275 states and 2332 transitions. [2018-10-14 18:15:35,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1481 [2018-10-14 18:15:35,408 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:15:35,409 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 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] [2018-10-14 18:15:35,409 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:15:35,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:15:35,409 INFO L82 PathProgramCache]: Analyzing trace with hash -987716055, now seen corresponding path program 56 times [2018-10-14 18:15:35,410 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:15:35,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:15:40,790 INFO L134 CoverageAnalysis]: Checked inductivity of 40096 backedges. 0 proven. 40096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:15:40,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:15:40,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-10-14 18:15:40,792 INFO L460 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-10-14 18:15:40,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-10-14 18:15:40,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3363, Invalid=9747, Unknown=0, NotChecked=0, Total=13110 [2018-10-14 18:15:40,793 INFO L87 Difference]: Start difference. First operand 2275 states and 2332 transitions. Second operand 115 states. [2018-10-14 18:15:48,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:15:48,746 INFO L93 Difference]: Finished difference Result 2368 states and 2427 transitions. [2018-10-14 18:15:48,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2018-10-14 18:15:48,747 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 1480 [2018-10-14 18:15:48,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:15:48,751 INFO L225 Difference]: With dead ends: 2368 [2018-10-14 18:15:48,751 INFO L226 Difference]: Without dead ends: 2368 [2018-10-14 18:15:48,754 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-14 18:15:48,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2368 states. [2018-10-14 18:15:48,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2368 to 2315. [2018-10-14 18:15:48,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2315 states. [2018-10-14 18:15:48,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2315 states to 2315 states and 2373 transitions. [2018-10-14 18:15:48,770 INFO L78 Accepts]: Start accepts. Automaton has 2315 states and 2373 transitions. Word has length 1480 [2018-10-14 18:15:48,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:15:48,771 INFO L481 AbstractCegarLoop]: Abstraction has 2315 states and 2373 transitions. [2018-10-14 18:15:48,771 INFO L482 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-10-14 18:15:48,771 INFO L276 IsEmpty]: Start isEmpty. Operand 2315 states and 2373 transitions. [2018-10-14 18:15:48,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1507 [2018-10-14 18:15:48,785 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:15:48,786 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 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] [2018-10-14 18:15:48,786 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:15:48,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:15:48,786 INFO L82 PathProgramCache]: Analyzing trace with hash 9605386, now seen corresponding path program 57 times [2018-10-14 18:15:48,787 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:15:48,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:15:54,369 INFO L134 CoverageAnalysis]: Checked inductivity of 41553 backedges. 0 proven. 41553 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:15:54,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:15:54,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-10-14 18:15:54,370 INFO L460 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-10-14 18:15:54,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-10-14 18:15:54,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3480, Invalid=10092, Unknown=0, NotChecked=0, Total=13572 [2018-10-14 18:15:54,371 INFO L87 Difference]: Start difference. First operand 2315 states and 2373 transitions. Second operand 117 states. [2018-10-14 18:16:02,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:16:02,865 INFO L93 Difference]: Finished difference Result 2408 states and 2468 transitions. [2018-10-14 18:16:02,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2018-10-14 18:16:02,866 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 1506 [2018-10-14 18:16:02,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:16:02,869 INFO L225 Difference]: With dead ends: 2408 [2018-10-14 18:16:02,869 INFO L226 Difference]: Without dead ends: 2408 [2018-10-14 18:16:02,871 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9633 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=16818, Invalid=36312, Unknown=0, NotChecked=0, Total=53130 [2018-10-14 18:16:02,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2408 states. [2018-10-14 18:16:02,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2408 to 2355. [2018-10-14 18:16:02,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2355 states. [2018-10-14 18:16:02,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2355 states to 2355 states and 2414 transitions. [2018-10-14 18:16:02,882 INFO L78 Accepts]: Start accepts. Automaton has 2355 states and 2414 transitions. Word has length 1506 [2018-10-14 18:16:02,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:16:02,883 INFO L481 AbstractCegarLoop]: Abstraction has 2355 states and 2414 transitions. [2018-10-14 18:16:02,883 INFO L482 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-10-14 18:16:02,883 INFO L276 IsEmpty]: Start isEmpty. Operand 2355 states and 2414 transitions. [2018-10-14 18:16:02,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1533 [2018-10-14 18:16:02,897 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:16:02,898 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 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] [2018-10-14 18:16:02,898 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:16:02,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:16:02,899 INFO L82 PathProgramCache]: Analyzing trace with hash 1515435179, now seen corresponding path program 58 times [2018-10-14 18:16:02,899 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:16:02,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:16:08,694 INFO L134 CoverageAnalysis]: Checked inductivity of 43036 backedges. 0 proven. 43036 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:16:08,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:16:08,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-10-14 18:16:08,695 INFO L460 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-10-14 18:16:08,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-10-14 18:16:08,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3599, Invalid=10443, Unknown=0, NotChecked=0, Total=14042 [2018-10-14 18:16:08,696 INFO L87 Difference]: Start difference. First operand 2355 states and 2414 transitions. Second operand 119 states. [2018-10-14 18:16:17,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:16:17,283 INFO L93 Difference]: Finished difference Result 2448 states and 2509 transitions. [2018-10-14 18:16:17,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2018-10-14 18:16:17,283 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 1532 [2018-10-14 18:16:17,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:16:17,287 INFO L225 Difference]: With dead ends: 2448 [2018-10-14 18:16:17,287 INFO L226 Difference]: Without dead ends: 2448 [2018-10-14 18:16:17,290 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9976 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=17403, Invalid=37587, Unknown=0, NotChecked=0, Total=54990 [2018-10-14 18:16:17,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2448 states. [2018-10-14 18:16:17,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2448 to 2395. [2018-10-14 18:16:17,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2395 states. [2018-10-14 18:16:17,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2395 states to 2395 states and 2455 transitions. [2018-10-14 18:16:17,302 INFO L78 Accepts]: Start accepts. Automaton has 2395 states and 2455 transitions. Word has length 1532 [2018-10-14 18:16:17,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:16:17,303 INFO L481 AbstractCegarLoop]: Abstraction has 2395 states and 2455 transitions. [2018-10-14 18:16:17,303 INFO L482 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-10-14 18:16:17,303 INFO L276 IsEmpty]: Start isEmpty. Operand 2395 states and 2455 transitions. [2018-10-14 18:16:17,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1559 [2018-10-14 18:16:17,316 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:16:17,316 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 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] [2018-10-14 18:16:17,316 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:16:17,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:16:17,317 INFO L82 PathProgramCache]: Analyzing trace with hash 907714828, now seen corresponding path program 59 times [2018-10-14 18:16:17,317 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:16:17,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:16:23,196 INFO L134 CoverageAnalysis]: Checked inductivity of 44545 backedges. 0 proven. 44545 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:16:23,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:16:23,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-10-14 18:16:23,198 INFO L460 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-10-14 18:16:23,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-10-14 18:16:23,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3720, Invalid=10800, Unknown=0, NotChecked=0, Total=14520 [2018-10-14 18:16:23,199 INFO L87 Difference]: Start difference. First operand 2395 states and 2455 transitions. Second operand 121 states. [2018-10-14 18:16:32,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:16:32,474 INFO L93 Difference]: Finished difference Result 2488 states and 2550 transitions. [2018-10-14 18:16:32,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2018-10-14 18:16:32,475 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 1558 [2018-10-14 18:16:32,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:16:32,477 INFO L225 Difference]: With dead ends: 2488 [2018-10-14 18:16:32,478 INFO L226 Difference]: Without dead ends: 2488 [2018-10-14 18:16:32,479 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10325 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=17998, Invalid=38884, Unknown=0, NotChecked=0, Total=56882 [2018-10-14 18:16:32,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2488 states. [2018-10-14 18:16:32,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2488 to 2435. [2018-10-14 18:16:32,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2435 states. [2018-10-14 18:16:32,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2435 states to 2435 states and 2496 transitions. [2018-10-14 18:16:32,490 INFO L78 Accepts]: Start accepts. Automaton has 2435 states and 2496 transitions. Word has length 1558 [2018-10-14 18:16:32,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:16:32,491 INFO L481 AbstractCegarLoop]: Abstraction has 2435 states and 2496 transitions. [2018-10-14 18:16:32,491 INFO L482 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-10-14 18:16:32,491 INFO L276 IsEmpty]: Start isEmpty. Operand 2435 states and 2496 transitions. [2018-10-14 18:16:32,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1585 [2018-10-14 18:16:32,505 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:16:32,506 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 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] [2018-10-14 18:16:32,506 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:16:32,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:16:32,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1182144979, now seen corresponding path program 60 times [2018-10-14 18:16:32,507 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:16:32,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:16:38,587 INFO L134 CoverageAnalysis]: Checked inductivity of 46080 backedges. 0 proven. 46080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:16:38,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:16:38,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-10-14 18:16:38,588 INFO L460 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-10-14 18:16:38,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-10-14 18:16:38,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3843, Invalid=11163, Unknown=0, NotChecked=0, Total=15006 [2018-10-14 18:16:38,590 INFO L87 Difference]: Start difference. First operand 2435 states and 2496 transitions. Second operand 123 states. [2018-10-14 18:16:48,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:16:48,035 INFO L93 Difference]: Finished difference Result 2528 states and 2591 transitions. [2018-10-14 18:16:48,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2018-10-14 18:16:48,036 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 1584 [2018-10-14 18:16:48,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:16:48,040 INFO L225 Difference]: With dead ends: 2528 [2018-10-14 18:16:48,040 INFO L226 Difference]: Without dead ends: 2528 [2018-10-14 18:16:48,045 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10680 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=18603, Invalid=40203, Unknown=0, NotChecked=0, Total=58806 [2018-10-14 18:16:48,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2528 states. [2018-10-14 18:16:48,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2528 to 2475. [2018-10-14 18:16:48,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2475 states. [2018-10-14 18:16:48,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2475 states to 2475 states and 2537 transitions. [2018-10-14 18:16:48,062 INFO L78 Accepts]: Start accepts. Automaton has 2475 states and 2537 transitions. Word has length 1584 [2018-10-14 18:16:48,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:16:48,064 INFO L481 AbstractCegarLoop]: Abstraction has 2475 states and 2537 transitions. [2018-10-14 18:16:48,064 INFO L482 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-10-14 18:16:48,064 INFO L276 IsEmpty]: Start isEmpty. Operand 2475 states and 2537 transitions. [2018-10-14 18:16:48,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1611 [2018-10-14 18:16:48,082 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:16:48,082 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 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] [2018-10-14 18:16:48,083 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:16:48,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:16:48,083 INFO L82 PathProgramCache]: Analyzing trace with hash -47180786, now seen corresponding path program 61 times [2018-10-14 18:16:48,084 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:16:48,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:16:54,604 INFO L134 CoverageAnalysis]: Checked inductivity of 47641 backedges. 0 proven. 47641 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:16:54,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:16:54,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-10-14 18:16:54,606 INFO L460 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-10-14 18:16:54,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-10-14 18:16:54,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3968, Invalid=11532, Unknown=0, NotChecked=0, Total=15500 [2018-10-14 18:16:54,607 INFO L87 Difference]: Start difference. First operand 2475 states and 2537 transitions. Second operand 125 states. [2018-10-14 18:17:04,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:17:04,405 INFO L93 Difference]: Finished difference Result 2568 states and 2632 transitions. [2018-10-14 18:17:04,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 186 states. [2018-10-14 18:17:04,405 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 1610 [2018-10-14 18:17:04,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:17:04,409 INFO L225 Difference]: With dead ends: 2568 [2018-10-14 18:17:04,409 INFO L226 Difference]: Without dead ends: 2568 [2018-10-14 18:17:04,411 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11041 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=19218, Invalid=41544, Unknown=0, NotChecked=0, Total=60762 [2018-10-14 18:17:04,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2568 states. [2018-10-14 18:17:04,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2568 to 2515. [2018-10-14 18:17:04,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2515 states. [2018-10-14 18:17:04,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2515 states to 2515 states and 2578 transitions. [2018-10-14 18:17:04,424 INFO L78 Accepts]: Start accepts. Automaton has 2515 states and 2578 transitions. Word has length 1610 [2018-10-14 18:17:04,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:17:04,424 INFO L481 AbstractCegarLoop]: Abstraction has 2515 states and 2578 transitions. [2018-10-14 18:17:04,425 INFO L482 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-10-14 18:17:04,425 INFO L276 IsEmpty]: Start isEmpty. Operand 2515 states and 2578 transitions. [2018-10-14 18:17:04,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1637 [2018-10-14 18:17:04,441 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:17:04,442 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 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] [2018-10-14 18:17:04,442 INFO L424 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:17:04,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:17:04,443 INFO L82 PathProgramCache]: Analyzing trace with hash -41436497, now seen corresponding path program 62 times [2018-10-14 18:17:04,443 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:17:04,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:17:10,994 INFO L134 CoverageAnalysis]: Checked inductivity of 49228 backedges. 0 proven. 49228 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:17:10,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:17:10,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-10-14 18:17:10,996 INFO L460 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-10-14 18:17:10,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-10-14 18:17:10,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=11907, Unknown=0, NotChecked=0, Total=16002 [2018-10-14 18:17:10,997 INFO L87 Difference]: Start difference. First operand 2515 states and 2578 transitions. Second operand 127 states. [2018-10-14 18:17:22,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:17:22,180 INFO L93 Difference]: Finished difference Result 2608 states and 2673 transitions. [2018-10-14 18:17:22,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 189 states. [2018-10-14 18:17:22,181 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 1636 [2018-10-14 18:17:22,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:17:22,186 INFO L225 Difference]: With dead ends: 2608 [2018-10-14 18:17:22,186 INFO L226 Difference]: Without dead ends: 2608 [2018-10-14 18:17:22,190 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11408 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=19843, Invalid=42907, Unknown=0, NotChecked=0, Total=62750 [2018-10-14 18:17:22,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2608 states. [2018-10-14 18:17:22,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2608 to 2555. [2018-10-14 18:17:22,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2555 states. [2018-10-14 18:17:22,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2555 states to 2555 states and 2619 transitions. [2018-10-14 18:17:22,203 INFO L78 Accepts]: Start accepts. Automaton has 2555 states and 2619 transitions. Word has length 1636 [2018-10-14 18:17:22,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:17:22,203 INFO L481 AbstractCegarLoop]: Abstraction has 2555 states and 2619 transitions. [2018-10-14 18:17:22,203 INFO L482 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-10-14 18:17:22,204 INFO L276 IsEmpty]: Start isEmpty. Operand 2555 states and 2619 transitions. [2018-10-14 18:17:22,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1663 [2018-10-14 18:17:22,218 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:17:22,219 INFO L375 BasicCegarLoop]: trace histogram [63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 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] [2018-10-14 18:17:22,219 INFO L424 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:17:22,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:17:22,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1274505744, now seen corresponding path program 63 times [2018-10-14 18:17:22,220 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:17:22,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:17:29,042 INFO L134 CoverageAnalysis]: Checked inductivity of 50841 backedges. 0 proven. 50841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:17:29,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:17:29,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-10-14 18:17:29,044 INFO L460 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-10-14 18:17:29,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-10-14 18:17:29,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4224, Invalid=12288, Unknown=0, NotChecked=0, Total=16512 [2018-10-14 18:17:29,045 INFO L87 Difference]: Start difference. First operand 2555 states and 2619 transitions. Second operand 129 states. [2018-10-14 18:17:39,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:17:39,584 INFO L93 Difference]: Finished difference Result 2648 states and 2714 transitions. [2018-10-14 18:17:39,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2018-10-14 18:17:39,584 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 1662 [2018-10-14 18:17:39,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:17:39,588 INFO L225 Difference]: With dead ends: 2648 [2018-10-14 18:17:39,588 INFO L226 Difference]: Without dead ends: 2648 [2018-10-14 18:17:39,592 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11781 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=20478, Invalid=44292, Unknown=0, NotChecked=0, Total=64770 [2018-10-14 18:17:39,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2648 states. [2018-10-14 18:17:39,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2648 to 2595. [2018-10-14 18:17:39,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2595 states. [2018-10-14 18:17:39,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2595 states to 2595 states and 2660 transitions. [2018-10-14 18:17:39,605 INFO L78 Accepts]: Start accepts. Automaton has 2595 states and 2660 transitions. Word has length 1662 [2018-10-14 18:17:39,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:17:39,606 INFO L481 AbstractCegarLoop]: Abstraction has 2595 states and 2660 transitions. [2018-10-14 18:17:39,607 INFO L482 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-10-14 18:17:39,607 INFO L276 IsEmpty]: Start isEmpty. Operand 2595 states and 2660 transitions. [2018-10-14 18:17:39,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1689 [2018-10-14 18:17:39,623 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:17:39,623 INFO L375 BasicCegarLoop]: trace histogram [64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 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] [2018-10-14 18:17:39,624 INFO L424 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:17:39,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:17:39,624 INFO L82 PathProgramCache]: Analyzing trace with hash 2144449073, now seen corresponding path program 64 times [2018-10-14 18:17:39,625 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:17:39,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:17:46,611 INFO L134 CoverageAnalysis]: Checked inductivity of 52480 backedges. 0 proven. 52480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:17:46,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:17:46,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-10-14 18:17:46,613 INFO L460 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-10-14 18:17:46,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-10-14 18:17:46,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4355, Invalid=12675, Unknown=0, NotChecked=0, Total=17030 [2018-10-14 18:17:46,614 INFO L87 Difference]: Start difference. First operand 2595 states and 2660 transitions. Second operand 131 states. [2018-10-14 18:17:57,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:17:57,935 INFO L93 Difference]: Finished difference Result 2688 states and 2755 transitions. [2018-10-14 18:17:57,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2018-10-14 18:17:57,935 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 1688 [2018-10-14 18:17:57,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:17:57,939 INFO L225 Difference]: With dead ends: 2688 [2018-10-14 18:17:57,939 INFO L226 Difference]: Without dead ends: 2688 [2018-10-14 18:17:57,942 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 257 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12160 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=21123, Invalid=45699, Unknown=0, NotChecked=0, Total=66822 [2018-10-14 18:17:57,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2688 states. [2018-10-14 18:17:57,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2688 to 2635. [2018-10-14 18:17:57,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2635 states. [2018-10-14 18:17:57,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2635 states to 2635 states and 2701 transitions. [2018-10-14 18:17:57,953 INFO L78 Accepts]: Start accepts. Automaton has 2635 states and 2701 transitions. Word has length 1688 [2018-10-14 18:17:57,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:17:57,955 INFO L481 AbstractCegarLoop]: Abstraction has 2635 states and 2701 transitions. [2018-10-14 18:17:57,955 INFO L482 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-10-14 18:17:57,955 INFO L276 IsEmpty]: Start isEmpty. Operand 2635 states and 2701 transitions. [2018-10-14 18:17:57,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1715 [2018-10-14 18:17:57,971 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:17:57,972 INFO L375 BasicCegarLoop]: trace histogram [65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 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] [2018-10-14 18:17:57,972 INFO L424 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:17:57,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:17:57,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1733632786, now seen corresponding path program 65 times [2018-10-14 18:17:57,973 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:17:58,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:18:05,302 INFO L134 CoverageAnalysis]: Checked inductivity of 54145 backedges. 0 proven. 54145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:18:05,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:18:05,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-10-14 18:18:05,304 INFO L460 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-10-14 18:18:05,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-10-14 18:18:05,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4488, Invalid=13068, Unknown=0, NotChecked=0, Total=17556 [2018-10-14 18:18:05,305 INFO L87 Difference]: Start difference. First operand 2635 states and 2701 transitions. Second operand 133 states. [2018-10-14 18:18:16,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:18:16,984 INFO L93 Difference]: Finished difference Result 2728 states and 2796 transitions. [2018-10-14 18:18:16,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 198 states. [2018-10-14 18:18:16,985 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 1714 [2018-10-14 18:18:16,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:18:16,989 INFO L225 Difference]: With dead ends: 2728 [2018-10-14 18:18:16,989 INFO L226 Difference]: Without dead ends: 2728 [2018-10-14 18:18:16,993 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12545 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=21778, Invalid=47128, Unknown=0, NotChecked=0, Total=68906 [2018-10-14 18:18:16,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2728 states. [2018-10-14 18:18:17,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2728 to 2675. [2018-10-14 18:18:17,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2675 states. [2018-10-14 18:18:17,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2675 states to 2675 states and 2742 transitions. [2018-10-14 18:18:17,005 INFO L78 Accepts]: Start accepts. Automaton has 2675 states and 2742 transitions. Word has length 1714 [2018-10-14 18:18:17,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:18:17,005 INFO L481 AbstractCegarLoop]: Abstraction has 2675 states and 2742 transitions. [2018-10-14 18:18:17,006 INFO L482 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-10-14 18:18:17,006 INFO L276 IsEmpty]: Start isEmpty. Operand 2675 states and 2742 transitions. [2018-10-14 18:18:17,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1741 [2018-10-14 18:18:17,021 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:18:17,021 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 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] [2018-10-14 18:18:17,022 INFO L424 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:18:17,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:18:17,022 INFO L82 PathProgramCache]: Analyzing trace with hash -122925901, now seen corresponding path program 66 times [2018-10-14 18:18:17,023 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:18:17,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:18:24,616 INFO L134 CoverageAnalysis]: Checked inductivity of 55836 backedges. 0 proven. 55836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:18:24,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:18:24,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-10-14 18:18:24,618 INFO L460 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-10-14 18:18:24,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-10-14 18:18:24,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4623, Invalid=13467, Unknown=0, NotChecked=0, Total=18090 [2018-10-14 18:18:24,619 INFO L87 Difference]: Start difference. First operand 2675 states and 2742 transitions. Second operand 135 states. [2018-10-14 18:18:37,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:18:37,209 INFO L93 Difference]: Finished difference Result 2768 states and 2837 transitions. [2018-10-14 18:18:37,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2018-10-14 18:18:37,209 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 1740 [2018-10-14 18:18:37,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:18:37,214 INFO L225 Difference]: With dead ends: 2768 [2018-10-14 18:18:37,214 INFO L226 Difference]: Without dead ends: 2768 [2018-10-14 18:18:37,219 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12936 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=22443, Invalid=48579, Unknown=0, NotChecked=0, Total=71022 [2018-10-14 18:18:37,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2768 states. [2018-10-14 18:18:37,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2768 to 2715. [2018-10-14 18:18:37,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2715 states. [2018-10-14 18:18:37,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2715 states to 2715 states and 2783 transitions. [2018-10-14 18:18:37,237 INFO L78 Accepts]: Start accepts. Automaton has 2715 states and 2783 transitions. Word has length 1740 [2018-10-14 18:18:37,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:18:37,238 INFO L481 AbstractCegarLoop]: Abstraction has 2715 states and 2783 transitions. [2018-10-14 18:18:37,238 INFO L482 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-10-14 18:18:37,238 INFO L276 IsEmpty]: Start isEmpty. Operand 2715 states and 2783 transitions. [2018-10-14 18:18:37,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1767 [2018-10-14 18:18:37,262 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:18:37,263 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 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] [2018-10-14 18:18:37,263 INFO L424 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:18:37,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:18:37,264 INFO L82 PathProgramCache]: Analyzing trace with hash 49135380, now seen corresponding path program 67 times [2018-10-14 18:18:37,264 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:18:37,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:18:44,803 INFO L134 CoverageAnalysis]: Checked inductivity of 57553 backedges. 0 proven. 57553 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:18:44,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:18:44,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2018-10-14 18:18:44,805 INFO L460 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-10-14 18:18:44,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-10-14 18:18:44,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4760, Invalid=13872, Unknown=0, NotChecked=0, Total=18632 [2018-10-14 18:18:44,807 INFO L87 Difference]: Start difference. First operand 2715 states and 2783 transitions. Second operand 137 states.