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-b8f97f7-m [2018-10-10 16:22:50,715 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 16:22:50,717 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 16:22:50,734 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 16:22:50,734 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 16:22:50,735 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 16:22:50,737 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 16:22:50,738 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 16:22:50,740 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 16:22:50,741 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 16:22:50,742 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 16:22:50,742 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 16:22:50,743 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 16:22:50,744 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 16:22:50,745 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 16:22:50,746 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 16:22:50,747 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 16:22:50,748 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 16:22:50,750 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 16:22:50,752 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 16:22:50,753 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 16:22:50,754 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 16:22:50,757 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 16:22:50,757 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 16:22:50,757 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 16:22:50,758 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 16:22:50,759 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 16:22:50,760 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 16:22:50,761 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 16:22:50,763 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 16:22:50,763 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 16:22:50,764 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 16:22:50,764 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 16:22:50,765 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 16:22:50,765 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 16:22:50,768 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 16:22:50,768 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-10 16:22:50,785 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 16:22:50,786 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 16:22:50,787 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-10 16:22:50,787 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-10 16:22:50,787 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-10 16:22:50,787 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-10 16:22:50,788 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 16:22:50,788 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-10 16:22:50,789 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 16:22:50,789 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-10 16:22:50,789 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-10 16:22:50,789 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-10 16:22:50,789 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-10 16:22:50,791 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-10 16:22:50,791 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-10 16:22:50,860 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 16:22:50,875 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 16:22:50,881 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 16:22:50,882 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-10 16:22:50,883 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-10 16:22:50,884 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-10 16:22:50,884 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-10 16:22:50,954 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 16:22:50,956 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-10 16:22:50,956 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 16:22:50,956 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 16:22:50,957 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 16:22:50,984 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 10.10 04:22:50" (1/1) ... [2018-10-10 16:22:50,986 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 10.10 04:22:50" (1/1) ... [2018-10-10 16:22:51,001 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 10.10 04:22:50" (1/1) ... [2018-10-10 16:22:51,002 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 10.10 04:22:50" (1/1) ... [2018-10-10 16:22:51,007 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 10.10 04:22:50" (1/1) ... [2018-10-10 16:22:51,009 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 10.10 04:22:50" (1/1) ... [2018-10-10 16:22:51,011 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 10.10 04:22:50" (1/1) ... [2018-10-10 16:22:51,013 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 16:22:51,014 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 16:22:51,015 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 16:22:51,015 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 16:22:51,016 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 10.10 04:22:50" (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-10 16:22:51,096 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-10 16:22:51,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 16:22:51,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 16:22:51,765 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 16:22:51,766 INFO L202 PluginConnector]: Adding new model ArraysOfVariableLength_true-valid-memsafety.c_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 04:22:51 BoogieIcfgContainer [2018-10-10 16:22:51,766 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 16:22:51,766 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-10 16:22:51,767 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-10 16:22:51,768 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-10 16:22:51,771 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 10.10 04:22:51" (1/1) ... [2018-10-10 16:22:51,778 INFO L137 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-10-10 16:22:51,778 INFO L138 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-10-10 16:22:51,816 INFO L191 apSepIcfgTransformer]: Heap separator: starting loc-array-style preprocessing [2018-10-10 16:22:51,857 INFO L217 apSepIcfgTransformer]: finished MemlocArrayUpdater [2018-10-10 16:22:51,873 INFO L280 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-10-10 16:22:51,940 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=1) [2018-10-10 16:22:58,409 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-10 16:22:58,415 INFO L304 apSepIcfgTransformer]: finished equality analysis [2018-10-10 16:22:58,419 INFO L316 apSepIcfgTransformer]: Finished detection of select terms ("array reads") [2018-10-10 16:22:58,430 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-10 16:22:58,432 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-10 16:22:58,433 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-10 16:22:58,434 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-10 16:22:58,456 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-10 16:22:58,457 INFO L232 HeapPartitionManager]: partitioning result: [2018-10-10 16:22:58,458 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-10 16:22:58,458 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-10 16:22:58,458 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-10 16:22:58,459 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-10 16:22:58,460 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-10 16:22:58,460 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-10 16:22:58,460 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-10 16:22:58,461 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-10 16:22:58,461 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-10 16:22:58,461 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-10 16:22:58,461 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-10 16:22:58,463 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-10 16:22:58,463 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-10 16:22:58,463 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-10 16:22:58,465 INFO L145 ransitionTransformer]: executing heap partitioning transformation [2018-10-10 16:22:58,498 INFO L202 PluginConnector]: Adding new model ArraysOfVariableLength_true-valid-memsafety.c_13.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.10 04:22:58 BasicIcfg [2018-10-10 16:22:58,498 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-10 16:22:58,500 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 16:22:58,500 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 16:22:58,504 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 16:22:58,505 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 10.10 04:22:50" (1/3) ... [2018-10-10 16:22:58,506 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67b2158c and model type ArraysOfVariableLength_true-valid-memsafety.c_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 04:22:58, skipping insertion in model container [2018-10-10 16:22:58,506 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 10.10 04:22:51" (2/3) ... [2018-10-10 16:22:58,506 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67b2158c and model type ArraysOfVariableLength_true-valid-memsafety.c_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 04:22:58, skipping insertion in model container [2018-10-10 16:22:58,507 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 10.10 04:22:58" (3/3) ... [2018-10-10 16:22:58,509 INFO L112 eAbstractionObserver]: Analyzing ICFG memPartitionedIcfg [2018-10-10 16:22:58,519 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-10 16:22:58,527 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-10 16:22:58,545 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-10 16:22:58,570 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 16:22:58,571 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 16:22:58,572 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 16:22:58,572 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-10 16:22:58,572 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 16:22:58,572 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 16:22:58,572 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 16:22:58,572 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 16:22:58,573 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 16:22:58,586 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2018-10-10 16:22:58,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-10 16:22:58,593 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:58,594 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-10 16:22:58,595 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:58,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:58,601 INFO L82 PathProgramCache]: Analyzing trace with hash -320433679, now seen corresponding path program 1 times [2018-10-10 16:22:58,666 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:58,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:58,819 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-10 16:22:58,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 16:22:58,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-10 16:22:58,828 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-10 16:22:58,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-10 16:22:58,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-10 16:22:58,844 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 3 states. [2018-10-10 16:22:59,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:59,111 INFO L93 Difference]: Finished difference Result 128 states and 131 transitions. [2018-10-10 16:22:59,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-10 16:22:59,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-10-10 16:22:59,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:59,190 INFO L225 Difference]: With dead ends: 128 [2018-10-10 16:22:59,190 INFO L226 Difference]: Without dead ends: 128 [2018-10-10 16:22:59,196 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-10 16:22:59,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-10-10 16:22:59,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 75. [2018-10-10 16:22:59,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-10 16:22:59,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2018-10-10 16:22:59,256 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 24 [2018-10-10 16:22:59,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:59,258 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2018-10-10 16:22:59,258 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-10 16:22:59,259 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2018-10-10 16:22:59,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-10 16:22:59,261 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:59,261 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-10 16:22:59,262 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:59,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:59,262 INFO L82 PathProgramCache]: Analyzing trace with hash 2110640850, now seen corresponding path program 1 times [2018-10-10 16:22:59,264 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:59,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:59,479 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-10 16:22:59,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:59,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-10 16:22:59,481 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 16:22:59,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 16:22:59,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-10 16:22:59,482 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand 5 states. [2018-10-10 16:23:00,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:00,003 INFO L93 Difference]: Finished difference Result 168 states and 172 transitions. [2018-10-10 16:23:00,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 16:23:00,003 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-10-10 16:23:00,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:00,006 INFO L225 Difference]: With dead ends: 168 [2018-10-10 16:23:00,006 INFO L226 Difference]: Without dead ends: 168 [2018-10-10 16:23:00,007 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-10 16:23:00,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-10-10 16:23:00,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 115. [2018-10-10 16:23:00,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-10-10 16:23:00,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 118 transitions. [2018-10-10 16:23:00,019 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 118 transitions. Word has length 50 [2018-10-10 16:23:00,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:00,020 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 118 transitions. [2018-10-10 16:23:00,020 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 16:23:00,020 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 118 transitions. [2018-10-10 16:23:00,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-10 16:23:00,023 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:00,023 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-10 16:23:00,024 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:00,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:00,024 INFO L82 PathProgramCache]: Analyzing trace with hash -798700429, now seen corresponding path program 2 times [2018-10-10 16:23:00,025 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:00,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:00,604 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-10 16:23:00,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:00,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-10 16:23:00,605 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 16:23:00,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 16:23:00,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-10 16:23:00,606 INFO L87 Difference]: Start difference. First operand 115 states and 118 transitions. Second operand 7 states. [2018-10-10 16:23:00,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:00,959 INFO L93 Difference]: Finished difference Result 208 states and 213 transitions. [2018-10-10 16:23:00,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-10 16:23:00,960 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 76 [2018-10-10 16:23:00,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:00,963 INFO L225 Difference]: With dead ends: 208 [2018-10-10 16:23:00,963 INFO L226 Difference]: Without dead ends: 208 [2018-10-10 16:23:00,964 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-10-10 16:23:00,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-10-10 16:23:00,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 155. [2018-10-10 16:23:00,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-10-10 16:23:00,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 159 transitions. [2018-10-10 16:23:00,991 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 159 transitions. Word has length 76 [2018-10-10 16:23:00,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:00,992 INFO L481 AbstractCegarLoop]: Abstraction has 155 states and 159 transitions. [2018-10-10 16:23:00,992 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 16:23:00,992 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 159 transitions. [2018-10-10 16:23:00,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-10 16:23:00,994 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:00,994 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-10 16:23:00,994 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:00,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:00,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1489112788, now seen corresponding path program 3 times [2018-10-10 16:23:00,996 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:01,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:01,521 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-10 16:23:01,521 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:01,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-10 16:23:01,522 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 16:23:01,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 16:23:01,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-10-10 16:23:01,524 INFO L87 Difference]: Start difference. First operand 155 states and 159 transitions. Second operand 9 states. [2018-10-10 16:23:01,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:01,894 INFO L93 Difference]: Finished difference Result 248 states and 254 transitions. [2018-10-10 16:23:01,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-10 16:23:01,896 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 102 [2018-10-10 16:23:01,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:01,898 INFO L225 Difference]: With dead ends: 248 [2018-10-10 16:23:01,899 INFO L226 Difference]: Without dead ends: 248 [2018-10-10 16:23:01,899 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2018-10-10 16:23:01,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-10-10 16:23:01,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 195. [2018-10-10 16:23:01,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-10-10 16:23:01,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 200 transitions. [2018-10-10 16:23:01,911 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 200 transitions. Word has length 102 [2018-10-10 16:23:01,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:01,911 INFO L481 AbstractCegarLoop]: Abstraction has 195 states and 200 transitions. [2018-10-10 16:23:01,911 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 16:23:01,912 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 200 transitions. [2018-10-10 16:23:01,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-10 16:23:01,914 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:01,914 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-10 16:23:01,915 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:01,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:01,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1796724235, now seen corresponding path program 4 times [2018-10-10 16:23:01,916 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:01,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:02,112 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-10 16:23:02,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:02,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-10 16:23:02,113 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-10 16:23:02,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-10 16:23:02,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-10-10 16:23:02,114 INFO L87 Difference]: Start difference. First operand 195 states and 200 transitions. Second operand 11 states. [2018-10-10 16:23:02,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:02,615 INFO L93 Difference]: Finished difference Result 288 states and 295 transitions. [2018-10-10 16:23:02,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-10 16:23:02,615 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 128 [2018-10-10 16:23:02,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:02,619 INFO L225 Difference]: With dead ends: 288 [2018-10-10 16:23:02,619 INFO L226 Difference]: Without dead ends: 288 [2018-10-10 16:23:02,620 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-10 16:23:02,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-10-10 16:23:02,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 235. [2018-10-10 16:23:02,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-10-10 16:23:02,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 241 transitions. [2018-10-10 16:23:02,632 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 241 transitions. Word has length 128 [2018-10-10 16:23:02,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:02,632 INFO L481 AbstractCegarLoop]: Abstraction has 235 states and 241 transitions. [2018-10-10 16:23:02,633 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-10 16:23:02,633 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 241 transitions. [2018-10-10 16:23:02,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-10 16:23:02,636 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:02,636 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-10 16:23:02,636 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:02,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:02,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1036365270, now seen corresponding path program 5 times [2018-10-10 16:23:02,638 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:02,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:02,922 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-10 16:23:02,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:02,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-10 16:23:02,923 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-10 16:23:02,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-10 16:23:02,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-10-10 16:23:02,923 INFO L87 Difference]: Start difference. First operand 235 states and 241 transitions. Second operand 13 states. [2018-10-10 16:23:03,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:03,251 INFO L93 Difference]: Finished difference Result 328 states and 336 transitions. [2018-10-10 16:23:03,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-10 16:23:03,251 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 154 [2018-10-10 16:23:03,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:03,253 INFO L225 Difference]: With dead ends: 328 [2018-10-10 16:23:03,253 INFO L226 Difference]: Without dead ends: 328 [2018-10-10 16:23:03,254 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=178, Invalid=328, Unknown=0, NotChecked=0, Total=506 [2018-10-10 16:23:03,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-10-10 16:23:03,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 275. [2018-10-10 16:23:03,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-10-10 16:23:03,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 282 transitions. [2018-10-10 16:23:03,266 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 282 transitions. Word has length 154 [2018-10-10 16:23:03,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:03,266 INFO L481 AbstractCegarLoop]: Abstraction has 275 states and 282 transitions. [2018-10-10 16:23:03,266 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-10 16:23:03,266 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 282 transitions. [2018-10-10 16:23:03,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-10 16:23:03,270 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:03,270 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-10 16:23:03,271 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:03,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:03,271 INFO L82 PathProgramCache]: Analyzing trace with hash 943008375, now seen corresponding path program 6 times [2018-10-10 16:23:03,280 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:03,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:04,147 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-10 16:23:04,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:04,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-10 16:23:04,148 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-10 16:23:04,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-10 16:23:04,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-10-10 16:23:04,149 INFO L87 Difference]: Start difference. First operand 275 states and 282 transitions. Second operand 15 states. [2018-10-10 16:23:04,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:04,536 INFO L93 Difference]: Finished difference Result 368 states and 377 transitions. [2018-10-10 16:23:04,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-10 16:23:04,537 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 180 [2018-10-10 16:23:04,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:04,540 INFO L225 Difference]: With dead ends: 368 [2018-10-10 16:23:04,540 INFO L226 Difference]: Without dead ends: 368 [2018-10-10 16:23:04,541 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=243, Invalid=459, Unknown=0, NotChecked=0, Total=702 [2018-10-10 16:23:04,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-10-10 16:23:04,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 315. [2018-10-10 16:23:04,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-10-10 16:23:04,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 323 transitions. [2018-10-10 16:23:04,549 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 323 transitions. Word has length 180 [2018-10-10 16:23:04,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:04,550 INFO L481 AbstractCegarLoop]: Abstraction has 315 states and 323 transitions. [2018-10-10 16:23:04,550 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-10 16:23:04,550 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 323 transitions. [2018-10-10 16:23:04,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-10-10 16:23:04,554 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:04,554 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-10 16:23:04,554 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:04,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:04,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1174220760, now seen corresponding path program 7 times [2018-10-10 16:23:04,555 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:04,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:05,533 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-10 16:23:05,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:05,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-10 16:23:05,535 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-10 16:23:05,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-10 16:23:05,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2018-10-10 16:23:05,535 INFO L87 Difference]: Start difference. First operand 315 states and 323 transitions. Second operand 17 states. [2018-10-10 16:23:06,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:06,171 INFO L93 Difference]: Finished difference Result 408 states and 418 transitions. [2018-10-10 16:23:06,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-10 16:23:06,172 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 206 [2018-10-10 16:23:06,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:06,174 INFO L225 Difference]: With dead ends: 408 [2018-10-10 16:23:06,174 INFO L226 Difference]: Without dead ends: 408 [2018-10-10 16:23:06,175 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=318, Invalid=612, Unknown=0, NotChecked=0, Total=930 [2018-10-10 16:23:06,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2018-10-10 16:23:06,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 355. [2018-10-10 16:23:06,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2018-10-10 16:23:06,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 364 transitions. [2018-10-10 16:23:06,182 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 364 transitions. Word has length 206 [2018-10-10 16:23:06,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:06,183 INFO L481 AbstractCegarLoop]: Abstraction has 355 states and 364 transitions. [2018-10-10 16:23:06,183 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-10 16:23:06,183 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 364 transitions. [2018-10-10 16:23:06,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-10-10 16:23:06,186 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:06,186 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-10 16:23:06,186 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:06,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:06,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1993362937, now seen corresponding path program 8 times [2018-10-10 16:23:06,187 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:06,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:06,981 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-10 16:23:06,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:06,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-10 16:23:06,982 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-10 16:23:06,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-10 16:23:06,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2018-10-10 16:23:06,983 INFO L87 Difference]: Start difference. First operand 355 states and 364 transitions. Second operand 19 states. [2018-10-10 16:23:07,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:07,497 INFO L93 Difference]: Finished difference Result 448 states and 459 transitions. [2018-10-10 16:23:07,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-10 16:23:07,497 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 232 [2018-10-10 16:23:07,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:07,500 INFO L225 Difference]: With dead ends: 448 [2018-10-10 16:23:07,501 INFO L226 Difference]: Without dead ends: 448 [2018-10-10 16:23:07,502 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-10 16:23:07,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2018-10-10 16:23:07,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 395. [2018-10-10 16:23:07,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-10-10 16:23:07,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 405 transitions. [2018-10-10 16:23:07,509 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 405 transitions. Word has length 232 [2018-10-10 16:23:07,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:07,509 INFO L481 AbstractCegarLoop]: Abstraction has 395 states and 405 transitions. [2018-10-10 16:23:07,510 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-10 16:23:07,510 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 405 transitions. [2018-10-10 16:23:07,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-10-10 16:23:07,513 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:07,513 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-10 16:23:07,513 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:07,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:07,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1498223834, now seen corresponding path program 9 times [2018-10-10 16:23:07,514 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:07,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:07,967 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-10 16:23:07,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:07,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-10 16:23:07,968 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-10 16:23:07,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-10 16:23:07,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2018-10-10 16:23:07,969 INFO L87 Difference]: Start difference. First operand 395 states and 405 transitions. Second operand 21 states. [2018-10-10 16:23:08,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:08,581 INFO L93 Difference]: Finished difference Result 488 states and 500 transitions. [2018-10-10 16:23:08,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-10 16:23:08,581 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 258 [2018-10-10 16:23:08,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:08,585 INFO L225 Difference]: With dead ends: 488 [2018-10-10 16:23:08,585 INFO L226 Difference]: Without dead ends: 488 [2018-10-10 16:23:08,586 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-10 16:23:08,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2018-10-10 16:23:08,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 435. [2018-10-10 16:23:08,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-10-10 16:23:08,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 446 transitions. [2018-10-10 16:23:08,594 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 446 transitions. Word has length 258 [2018-10-10 16:23:08,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:08,594 INFO L481 AbstractCegarLoop]: Abstraction has 435 states and 446 transitions. [2018-10-10 16:23:08,594 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-10 16:23:08,595 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 446 transitions. [2018-10-10 16:23:08,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-10-10 16:23:08,596 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:08,597 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-10 16:23:08,597 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:08,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:08,597 INFO L82 PathProgramCache]: Analyzing trace with hash -335670149, now seen corresponding path program 10 times [2018-10-10 16:23:08,598 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:08,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:09,093 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-10 16:23:09,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:09,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-10 16:23:09,094 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-10 16:23:09,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-10 16:23:09,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2018-10-10 16:23:09,095 INFO L87 Difference]: Start difference. First operand 435 states and 446 transitions. Second operand 23 states. [2018-10-10 16:23:10,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:10,477 INFO L93 Difference]: Finished difference Result 528 states and 541 transitions. [2018-10-10 16:23:10,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-10 16:23:10,477 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 284 [2018-10-10 16:23:10,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:10,480 INFO L225 Difference]: With dead ends: 528 [2018-10-10 16:23:10,480 INFO L226 Difference]: Without dead ends: 528 [2018-10-10 16:23:10,481 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-10 16:23:10,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2018-10-10 16:23:10,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 475. [2018-10-10 16:23:10,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 475 states. [2018-10-10 16:23:10,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 487 transitions. [2018-10-10 16:23:10,489 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 487 transitions. Word has length 284 [2018-10-10 16:23:10,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:10,490 INFO L481 AbstractCegarLoop]: Abstraction has 475 states and 487 transitions. [2018-10-10 16:23:10,490 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-10 16:23:10,490 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 487 transitions. [2018-10-10 16:23:10,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-10-10 16:23:10,492 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:10,492 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-10 16:23:10,492 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:10,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:10,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1314512092, now seen corresponding path program 11 times [2018-10-10 16:23:10,493 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:10,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:11,289 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-10 16:23:11,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:11,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-10 16:23:11,290 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-10 16:23:11,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-10 16:23:11,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2018-10-10 16:23:11,291 INFO L87 Difference]: Start difference. First operand 475 states and 487 transitions. Second operand 25 states. [2018-10-10 16:23:11,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:11,953 INFO L93 Difference]: Finished difference Result 568 states and 582 transitions. [2018-10-10 16:23:11,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-10 16:23:11,955 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 310 [2018-10-10 16:23:11,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:11,959 INFO L225 Difference]: With dead ends: 568 [2018-10-10 16:23:11,959 INFO L226 Difference]: Without dead ends: 568 [2018-10-10 16:23:11,961 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=718, Invalid=1444, Unknown=0, NotChecked=0, Total=2162 [2018-10-10 16:23:11,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2018-10-10 16:23:11,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 515. [2018-10-10 16:23:11,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2018-10-10 16:23:11,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 528 transitions. [2018-10-10 16:23:11,969 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 528 transitions. Word has length 310 [2018-10-10 16:23:11,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:11,970 INFO L481 AbstractCegarLoop]: Abstraction has 515 states and 528 transitions. [2018-10-10 16:23:11,970 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-10 16:23:11,970 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 528 transitions. [2018-10-10 16:23:11,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2018-10-10 16:23:11,972 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:11,973 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-10 16:23:11,973 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:11,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:11,974 INFO L82 PathProgramCache]: Analyzing trace with hash 834862589, now seen corresponding path program 12 times [2018-10-10 16:23:11,974 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:12,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:12,582 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-10 16:23:12,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:12,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-10 16:23:12,583 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-10 16:23:12,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-10 16:23:12,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2018-10-10 16:23:12,583 INFO L87 Difference]: Start difference. First operand 515 states and 528 transitions. Second operand 27 states. [2018-10-10 16:23:13,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:13,290 INFO L93 Difference]: Finished difference Result 608 states and 623 transitions. [2018-10-10 16:23:13,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-10 16:23:13,291 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 336 [2018-10-10 16:23:13,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:13,295 INFO L225 Difference]: With dead ends: 608 [2018-10-10 16:23:13,295 INFO L226 Difference]: Without dead ends: 608 [2018-10-10 16:23:13,297 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=843, Invalid=1707, Unknown=0, NotChecked=0, Total=2550 [2018-10-10 16:23:13,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2018-10-10 16:23:13,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 555. [2018-10-10 16:23:13,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2018-10-10 16:23:13,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 569 transitions. [2018-10-10 16:23:13,305 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 569 transitions. Word has length 336 [2018-10-10 16:23:13,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:13,306 INFO L481 AbstractCegarLoop]: Abstraction has 555 states and 569 transitions. [2018-10-10 16:23:13,306 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-10 16:23:13,306 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 569 transitions. [2018-10-10 16:23:13,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2018-10-10 16:23:13,308 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:13,308 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-10 16:23:13,308 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:13,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:13,309 INFO L82 PathProgramCache]: Analyzing trace with hash 176687070, now seen corresponding path program 13 times [2018-10-10 16:23:13,309 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:13,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:14,108 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-10 16:23:14,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:14,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-10 16:23:14,109 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-10 16:23:14,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-10 16:23:14,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=588, Unknown=0, NotChecked=0, Total=812 [2018-10-10 16:23:14,109 INFO L87 Difference]: Start difference. First operand 555 states and 569 transitions. Second operand 29 states. [2018-10-10 16:23:15,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:15,036 INFO L93 Difference]: Finished difference Result 648 states and 664 transitions. [2018-10-10 16:23:15,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-10 16:23:15,036 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 362 [2018-10-10 16:23:15,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:15,040 INFO L225 Difference]: With dead ends: 648 [2018-10-10 16:23:15,041 INFO L226 Difference]: Without dead ends: 648 [2018-10-10 16:23:15,042 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=978, Invalid=1992, Unknown=0, NotChecked=0, Total=2970 [2018-10-10 16:23:15,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2018-10-10 16:23:15,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 595. [2018-10-10 16:23:15,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2018-10-10 16:23:15,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 610 transitions. [2018-10-10 16:23:15,050 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 610 transitions. Word has length 362 [2018-10-10 16:23:15,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:15,051 INFO L481 AbstractCegarLoop]: Abstraction has 595 states and 610 transitions. [2018-10-10 16:23:15,051 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-10 16:23:15,051 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 610 transitions. [2018-10-10 16:23:15,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2018-10-10 16:23:15,054 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:15,054 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-10 16:23:15,054 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:15,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:15,055 INFO L82 PathProgramCache]: Analyzing trace with hash 14912127, now seen corresponding path program 14 times [2018-10-10 16:23:15,055 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:15,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:15,879 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-10 16:23:15,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:15,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-10 16:23:15,880 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-10 16:23:15,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-10 16:23:15,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2018-10-10 16:23:15,881 INFO L87 Difference]: Start difference. First operand 595 states and 610 transitions. Second operand 31 states. [2018-10-10 16:23:16,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:16,607 INFO L93 Difference]: Finished difference Result 688 states and 705 transitions. [2018-10-10 16:23:16,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-10 16:23:16,608 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 388 [2018-10-10 16:23:16,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:16,613 INFO L225 Difference]: With dead ends: 688 [2018-10-10 16:23:16,613 INFO L226 Difference]: Without dead ends: 688 [2018-10-10 16:23:16,615 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1123, Invalid=2299, Unknown=0, NotChecked=0, Total=3422 [2018-10-10 16:23:16,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2018-10-10 16:23:16,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 635. [2018-10-10 16:23:16,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2018-10-10 16:23:16,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 651 transitions. [2018-10-10 16:23:16,623 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 651 transitions. Word has length 388 [2018-10-10 16:23:16,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:16,624 INFO L481 AbstractCegarLoop]: Abstraction has 635 states and 651 transitions. [2018-10-10 16:23:16,624 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-10 16:23:16,624 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 651 transitions. [2018-10-10 16:23:16,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2018-10-10 16:23:16,627 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:16,628 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-10 16:23:16,628 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:16,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:16,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1577314848, now seen corresponding path program 15 times [2018-10-10 16:23:16,629 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:16,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:18,628 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-10 16:23:18,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:18,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-10 16:23:18,629 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-10 16:23:18,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-10 16:23:18,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2018-10-10 16:23:18,630 INFO L87 Difference]: Start difference. First operand 635 states and 651 transitions. Second operand 33 states. [2018-10-10 16:23:19,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:19,404 INFO L93 Difference]: Finished difference Result 728 states and 746 transitions. [2018-10-10 16:23:19,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-10 16:23:19,405 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 414 [2018-10-10 16:23:19,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:19,410 INFO L225 Difference]: With dead ends: 728 [2018-10-10 16:23:19,410 INFO L226 Difference]: Without dead ends: 728 [2018-10-10 16:23:19,412 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1278, Invalid=2628, Unknown=0, NotChecked=0, Total=3906 [2018-10-10 16:23:19,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2018-10-10 16:23:19,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 675. [2018-10-10 16:23:19,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 675 states. [2018-10-10 16:23:19,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 692 transitions. [2018-10-10 16:23:19,421 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 692 transitions. Word has length 414 [2018-10-10 16:23:19,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:19,421 INFO L481 AbstractCegarLoop]: Abstraction has 675 states and 692 transitions. [2018-10-10 16:23:19,422 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-10 16:23:19,422 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 692 transitions. [2018-10-10 16:23:19,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2018-10-10 16:23:19,424 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:19,425 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-10 16:23:19,425 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:19,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:19,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1357134337, now seen corresponding path program 16 times [2018-10-10 16:23:19,426 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:19,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:20,348 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-10 16:23:20,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:20,349 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-10 16:23:20,350 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-10 16:23:20,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-10 16:23:20,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2018-10-10 16:23:20,350 INFO L87 Difference]: Start difference. First operand 675 states and 692 transitions. Second operand 35 states. [2018-10-10 16:23:21,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:21,486 INFO L93 Difference]: Finished difference Result 768 states and 787 transitions. [2018-10-10 16:23:21,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-10 16:23:21,486 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 440 [2018-10-10 16:23:21,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:21,491 INFO L225 Difference]: With dead ends: 768 [2018-10-10 16:23:21,492 INFO L226 Difference]: Without dead ends: 768 [2018-10-10 16:23:21,493 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1443, Invalid=2979, Unknown=0, NotChecked=0, Total=4422 [2018-10-10 16:23:21,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2018-10-10 16:23:21,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 715. [2018-10-10 16:23:21,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2018-10-10 16:23:21,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 733 transitions. [2018-10-10 16:23:21,502 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 733 transitions. Word has length 440 [2018-10-10 16:23:21,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:21,503 INFO L481 AbstractCegarLoop]: Abstraction has 715 states and 733 transitions. [2018-10-10 16:23:21,503 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-10 16:23:21,503 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 733 transitions. [2018-10-10 16:23:21,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2018-10-10 16:23:21,506 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:21,506 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-10 16:23:21,507 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:21,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:21,507 INFO L82 PathProgramCache]: Analyzing trace with hash 2006615778, now seen corresponding path program 17 times [2018-10-10 16:23:21,508 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:21,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:22,391 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-10 16:23:22,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:22,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-10 16:23:22,392 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-10 16:23:22,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-10 16:23:22,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2018-10-10 16:23:22,393 INFO L87 Difference]: Start difference. First operand 715 states and 733 transitions. Second operand 37 states. [2018-10-10 16:23:23,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:23,334 INFO L93 Difference]: Finished difference Result 808 states and 828 transitions. [2018-10-10 16:23:23,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-10 16:23:23,334 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 466 [2018-10-10 16:23:23,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:23,339 INFO L225 Difference]: With dead ends: 808 [2018-10-10 16:23:23,339 INFO L226 Difference]: Without dead ends: 808 [2018-10-10 16:23:23,341 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 833 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1618, Invalid=3352, Unknown=0, NotChecked=0, Total=4970 [2018-10-10 16:23:23,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2018-10-10 16:23:23,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 755. [2018-10-10 16:23:23,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 755 states. [2018-10-10 16:23:23,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 774 transitions. [2018-10-10 16:23:23,349 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 774 transitions. Word has length 466 [2018-10-10 16:23:23,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:23,350 INFO L481 AbstractCegarLoop]: Abstraction has 755 states and 774 transitions. [2018-10-10 16:23:23,350 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-10 16:23:23,350 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 774 transitions. [2018-10-10 16:23:23,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2018-10-10 16:23:23,353 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:23,353 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-10 16:23:23,354 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:23,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:23,354 INFO L82 PathProgramCache]: Analyzing trace with hash 2013891715, now seen corresponding path program 18 times [2018-10-10 16:23:23,355 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:23,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:24,362 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-10 16:23:24,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:24,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-10 16:23:24,363 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-10 16:23:24,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-10 16:23:24,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2018-10-10 16:23:24,365 INFO L87 Difference]: Start difference. First operand 755 states and 774 transitions. Second operand 39 states. [2018-10-10 16:23:25,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:25,422 INFO L93 Difference]: Finished difference Result 848 states and 869 transitions. [2018-10-10 16:23:25,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-10 16:23:25,423 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 492 [2018-10-10 16:23:25,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:25,427 INFO L225 Difference]: With dead ends: 848 [2018-10-10 16:23:25,428 INFO L226 Difference]: Without dead ends: 848 [2018-10-10 16:23:25,430 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1803, Invalid=3747, Unknown=0, NotChecked=0, Total=5550 [2018-10-10 16:23:25,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2018-10-10 16:23:25,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 795. [2018-10-10 16:23:25,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2018-10-10 16:23:25,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 815 transitions. [2018-10-10 16:23:25,440 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 815 transitions. Word has length 492 [2018-10-10 16:23:25,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:25,440 INFO L481 AbstractCegarLoop]: Abstraction has 795 states and 815 transitions. [2018-10-10 16:23:25,440 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-10 16:23:25,441 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 815 transitions. [2018-10-10 16:23:25,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 519 [2018-10-10 16:23:25,444 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:25,444 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-10 16:23:25,445 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:25,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:25,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1560795876, now seen corresponding path program 19 times [2018-10-10 16:23:25,446 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:25,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:26,356 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-10 16:23:26,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:26,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-10 16:23:26,357 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-10 16:23:26,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-10 16:23:26,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=1200, Unknown=0, NotChecked=0, Total=1640 [2018-10-10 16:23:26,358 INFO L87 Difference]: Start difference. First operand 795 states and 815 transitions. Second operand 41 states. [2018-10-10 16:23:27,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:27,581 INFO L93 Difference]: Finished difference Result 888 states and 910 transitions. [2018-10-10 16:23:27,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-10 16:23:27,581 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 518 [2018-10-10 16:23:27,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:27,585 INFO L225 Difference]: With dead ends: 888 [2018-10-10 16:23:27,585 INFO L226 Difference]: Without dead ends: 888 [2018-10-10 16:23:27,587 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1045 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1998, Invalid=4164, Unknown=0, NotChecked=0, Total=6162 [2018-10-10 16:23:27,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2018-10-10 16:23:27,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 835. [2018-10-10 16:23:27,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 835 states. [2018-10-10 16:23:27,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 856 transitions. [2018-10-10 16:23:27,595 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 856 transitions. Word has length 518 [2018-10-10 16:23:27,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:27,596 INFO L481 AbstractCegarLoop]: Abstraction has 835 states and 856 transitions. [2018-10-10 16:23:27,596 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-10 16:23:27,596 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 856 transitions. [2018-10-10 16:23:27,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 545 [2018-10-10 16:23:27,599 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:27,600 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-10 16:23:27,600 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:27,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:27,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1264058885, now seen corresponding path program 20 times [2018-10-10 16:23:27,601 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:27,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:28,900 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-10 16:23:28,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:28,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-10 16:23:28,902 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-10 16:23:28,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-10 16:23:28,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2018-10-10 16:23:28,903 INFO L87 Difference]: Start difference. First operand 835 states and 856 transitions. Second operand 43 states. [2018-10-10 16:23:30,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:30,219 INFO L93 Difference]: Finished difference Result 928 states and 951 transitions. [2018-10-10 16:23:30,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-10 16:23:30,220 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 544 [2018-10-10 16:23:30,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:30,225 INFO L225 Difference]: With dead ends: 928 [2018-10-10 16:23:30,225 INFO L226 Difference]: Without dead ends: 928 [2018-10-10 16:23:30,228 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1160 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2203, Invalid=4603, Unknown=0, NotChecked=0, Total=6806 [2018-10-10 16:23:30,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2018-10-10 16:23:30,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 875. [2018-10-10 16:23:30,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 875 states. [2018-10-10 16:23:30,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 897 transitions. [2018-10-10 16:23:30,237 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 897 transitions. Word has length 544 [2018-10-10 16:23:30,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:30,238 INFO L481 AbstractCegarLoop]: Abstraction has 875 states and 897 transitions. [2018-10-10 16:23:30,238 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-10 16:23:30,238 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 897 transitions. [2018-10-10 16:23:30,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 571 [2018-10-10 16:23:30,242 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:30,242 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-10 16:23:30,243 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:30,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:30,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1297575450, now seen corresponding path program 21 times [2018-10-10 16:23:30,244 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:30,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:31,730 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-10 16:23:31,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:31,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-10 16:23:31,732 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-10 16:23:31,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-10 16:23:31,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=1452, Unknown=0, NotChecked=0, Total=1980 [2018-10-10 16:23:31,733 INFO L87 Difference]: Start difference. First operand 875 states and 897 transitions. Second operand 45 states. [2018-10-10 16:23:33,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:33,662 INFO L93 Difference]: Finished difference Result 968 states and 992 transitions. [2018-10-10 16:23:33,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-10 16:23:33,665 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 570 [2018-10-10 16:23:33,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:33,669 INFO L225 Difference]: With dead ends: 968 [2018-10-10 16:23:33,669 INFO L226 Difference]: Without dead ends: 968 [2018-10-10 16:23:33,670 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1281 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2418, Invalid=5064, Unknown=0, NotChecked=0, Total=7482 [2018-10-10 16:23:33,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2018-10-10 16:23:33,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 915. [2018-10-10 16:23:33,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 915 states. [2018-10-10 16:23:33,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 938 transitions. [2018-10-10 16:23:33,679 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 938 transitions. Word has length 570 [2018-10-10 16:23:33,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:33,679 INFO L481 AbstractCegarLoop]: Abstraction has 915 states and 938 transitions. [2018-10-10 16:23:33,679 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-10 16:23:33,679 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 938 transitions. [2018-10-10 16:23:33,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 597 [2018-10-10 16:23:33,684 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:33,684 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-10 16:23:33,684 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:33,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:33,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1049893511, now seen corresponding path program 22 times [2018-10-10 16:23:33,685 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:33,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:34,870 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-10 16:23:34,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:34,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-10 16:23:34,871 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-10 16:23:34,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-10 16:23:34,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=1587, Unknown=0, NotChecked=0, Total=2162 [2018-10-10 16:23:34,872 INFO L87 Difference]: Start difference. First operand 915 states and 938 transitions. Second operand 47 states. [2018-10-10 16:23:36,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:36,433 INFO L93 Difference]: Finished difference Result 1008 states and 1033 transitions. [2018-10-10 16:23:36,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-10 16:23:36,434 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 596 [2018-10-10 16:23:36,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:36,438 INFO L225 Difference]: With dead ends: 1008 [2018-10-10 16:23:36,439 INFO L226 Difference]: Without dead ends: 1008 [2018-10-10 16:23:36,440 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1408 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2643, Invalid=5547, Unknown=0, NotChecked=0, Total=8190 [2018-10-10 16:23:36,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1008 states. [2018-10-10 16:23:36,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1008 to 955. [2018-10-10 16:23:36,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 955 states. [2018-10-10 16:23:36,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 979 transitions. [2018-10-10 16:23:36,447 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 979 transitions. Word has length 596 [2018-10-10 16:23:36,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:36,448 INFO L481 AbstractCegarLoop]: Abstraction has 955 states and 979 transitions. [2018-10-10 16:23:36,448 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-10 16:23:36,448 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 979 transitions. [2018-10-10 16:23:36,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 623 [2018-10-10 16:23:36,453 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:36,453 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-10 16:23:36,453 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:36,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:36,454 INFO L82 PathProgramCache]: Analyzing trace with hash -2019480600, now seen corresponding path program 23 times [2018-10-10 16:23:36,454 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:36,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:37,602 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-10 16:23:37,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:37,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-10 16:23:37,604 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-10 16:23:37,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-10 16:23:37,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=624, Invalid=1728, Unknown=0, NotChecked=0, Total=2352 [2018-10-10 16:23:37,605 INFO L87 Difference]: Start difference. First operand 955 states and 979 transitions. Second operand 49 states. [2018-10-10 16:23:39,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:39,322 INFO L93 Difference]: Finished difference Result 1048 states and 1074 transitions. [2018-10-10 16:23:39,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-10 16:23:39,323 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 622 [2018-10-10 16:23:39,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:39,328 INFO L225 Difference]: With dead ends: 1048 [2018-10-10 16:23:39,328 INFO L226 Difference]: Without dead ends: 1048 [2018-10-10 16:23:39,329 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1541 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2878, Invalid=6052, Unknown=0, NotChecked=0, Total=8930 [2018-10-10 16:23:39,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2018-10-10 16:23:39,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 995. [2018-10-10 16:23:39,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 995 states. [2018-10-10 16:23:39,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1020 transitions. [2018-10-10 16:23:39,337 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1020 transitions. Word has length 622 [2018-10-10 16:23:39,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:39,337 INFO L481 AbstractCegarLoop]: Abstraction has 995 states and 1020 transitions. [2018-10-10 16:23:39,337 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-10 16:23:39,337 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1020 transitions. [2018-10-10 16:23:39,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 649 [2018-10-10 16:23:39,342 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:39,342 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-10 16:23:39,343 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:39,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:39,343 INFO L82 PathProgramCache]: Analyzing trace with hash -2076027383, now seen corresponding path program 24 times [2018-10-10 16:23:39,344 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:39,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:40,685 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-10 16:23:40,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:40,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-10 16:23:40,687 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-10 16:23:40,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-10 16:23:40,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2018-10-10 16:23:40,688 INFO L87 Difference]: Start difference. First operand 995 states and 1020 transitions. Second operand 51 states. [2018-10-10 16:23:42,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:42,445 INFO L93 Difference]: Finished difference Result 1088 states and 1115 transitions. [2018-10-10 16:23:42,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-10 16:23:42,445 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 648 [2018-10-10 16:23:42,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:42,450 INFO L225 Difference]: With dead ends: 1088 [2018-10-10 16:23:42,450 INFO L226 Difference]: Without dead ends: 1088 [2018-10-10 16:23:42,451 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1680 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3123, Invalid=6579, Unknown=0, NotChecked=0, Total=9702 [2018-10-10 16:23:42,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1088 states. [2018-10-10 16:23:42,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1088 to 1035. [2018-10-10 16:23:42,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1035 states. [2018-10-10 16:23:42,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1061 transitions. [2018-10-10 16:23:42,462 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1061 transitions. Word has length 648 [2018-10-10 16:23:42,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:42,462 INFO L481 AbstractCegarLoop]: Abstraction has 1035 states and 1061 transitions. [2018-10-10 16:23:42,462 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-10 16:23:42,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1061 transitions. [2018-10-10 16:23:42,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 675 [2018-10-10 16:23:42,468 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:42,468 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-10 16:23:42,468 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:42,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:42,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1177147158, now seen corresponding path program 25 times [2018-10-10 16:23:42,470 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:42,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:44,284 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-10 16:23:44,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:44,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-10 16:23:44,285 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-10 16:23:44,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-10 16:23:44,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=728, Invalid=2028, Unknown=0, NotChecked=0, Total=2756 [2018-10-10 16:23:44,287 INFO L87 Difference]: Start difference. First operand 1035 states and 1061 transitions. Second operand 53 states. [2018-10-10 16:23:46,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:46,270 INFO L93 Difference]: Finished difference Result 1128 states and 1156 transitions. [2018-10-10 16:23:46,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-10 16:23:46,271 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 674 [2018-10-10 16:23:46,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:46,274 INFO L225 Difference]: With dead ends: 1128 [2018-10-10 16:23:46,274 INFO L226 Difference]: Without dead ends: 1128 [2018-10-10 16:23:46,276 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-10 16:23:46,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2018-10-10 16:23:46,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 1075. [2018-10-10 16:23:46,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1075 states. [2018-10-10 16:23:46,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 1102 transitions. [2018-10-10 16:23:46,286 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 1102 transitions. Word has length 674 [2018-10-10 16:23:46,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:46,287 INFO L481 AbstractCegarLoop]: Abstraction has 1075 states and 1102 transitions. [2018-10-10 16:23:46,287 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-10 16:23:46,287 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 1102 transitions. [2018-10-10 16:23:46,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 701 [2018-10-10 16:23:46,292 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:46,293 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-10 16:23:46,293 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:46,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:46,293 INFO L82 PathProgramCache]: Analyzing trace with hash 765932683, now seen corresponding path program 26 times [2018-10-10 16:23:46,294 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:46,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:47,955 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-10 16:23:47,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:47,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-10 16:23:47,956 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-10 16:23:47,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-10 16:23:47,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=783, Invalid=2187, Unknown=0, NotChecked=0, Total=2970 [2018-10-10 16:23:47,956 INFO L87 Difference]: Start difference. First operand 1075 states and 1102 transitions. Second operand 55 states. [2018-10-10 16:23:49,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:49,846 INFO L93 Difference]: Finished difference Result 1168 states and 1197 transitions. [2018-10-10 16:23:49,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-10 16:23:49,847 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 700 [2018-10-10 16:23:49,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:49,852 INFO L225 Difference]: With dead ends: 1168 [2018-10-10 16:23:49,853 INFO L226 Difference]: Without dead ends: 1168 [2018-10-10 16:23:49,853 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-10 16:23:49,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2018-10-10 16:23:49,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 1115. [2018-10-10 16:23:49,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1115 states. [2018-10-10 16:23:49,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1143 transitions. [2018-10-10 16:23:49,861 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1143 transitions. Word has length 700 [2018-10-10 16:23:49,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:49,862 INFO L481 AbstractCegarLoop]: Abstraction has 1115 states and 1143 transitions. [2018-10-10 16:23:49,862 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-10 16:23:49,862 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1143 transitions. [2018-10-10 16:23:49,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 727 [2018-10-10 16:23:49,867 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:49,868 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-10 16:23:49,868 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:49,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:49,869 INFO L82 PathProgramCache]: Analyzing trace with hash 367790316, now seen corresponding path program 27 times [2018-10-10 16:23:49,869 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:49,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:51,660 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-10 16:23:51,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:51,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-10 16:23:51,661 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-10 16:23:51,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-10 16:23:51,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=840, Invalid=2352, Unknown=0, NotChecked=0, Total=3192 [2018-10-10 16:23:51,662 INFO L87 Difference]: Start difference. First operand 1115 states and 1143 transitions. Second operand 57 states. [2018-10-10 16:23:53,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:53,848 INFO L93 Difference]: Finished difference Result 1208 states and 1238 transitions. [2018-10-10 16:23:53,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-10 16:23:53,848 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 726 [2018-10-10 16:23:53,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:53,854 INFO L225 Difference]: With dead ends: 1208 [2018-10-10 16:23:53,854 INFO L226 Difference]: Without dead ends: 1208 [2018-10-10 16:23:53,855 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2133 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3918, Invalid=8292, Unknown=0, NotChecked=0, Total=12210 [2018-10-10 16:23:53,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2018-10-10 16:23:53,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 1155. [2018-10-10 16:23:53,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1155 states. [2018-10-10 16:23:53,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 1184 transitions. [2018-10-10 16:23:53,863 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 1184 transitions. Word has length 726 [2018-10-10 16:23:53,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:53,864 INFO L481 AbstractCegarLoop]: Abstraction has 1155 states and 1184 transitions. [2018-10-10 16:23:53,864 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-10 16:23:53,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 1184 transitions. [2018-10-10 16:23:53,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 753 [2018-10-10 16:23:53,869 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:53,869 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-10 16:23:53,869 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:53,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:53,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1254569485, now seen corresponding path program 28 times [2018-10-10 16:23:53,870 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:53,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:55,606 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-10 16:23:55,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:55,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-10 16:23:55,607 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-10 16:23:55,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-10 16:23:55,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=899, Invalid=2523, Unknown=0, NotChecked=0, Total=3422 [2018-10-10 16:23:55,608 INFO L87 Difference]: Start difference. First operand 1155 states and 1184 transitions. Second operand 59 states. [2018-10-10 16:23:58,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:58,082 INFO L93 Difference]: Finished difference Result 1248 states and 1279 transitions. [2018-10-10 16:23:58,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-10 16:23:58,083 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 752 [2018-10-10 16:23:58,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:58,087 INFO L225 Difference]: With dead ends: 1248 [2018-10-10 16:23:58,087 INFO L226 Difference]: Without dead ends: 1248 [2018-10-10 16:23:58,089 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2296 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4203, Invalid=8907, Unknown=0, NotChecked=0, Total=13110 [2018-10-10 16:23:58,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2018-10-10 16:23:58,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 1195. [2018-10-10 16:23:58,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1195 states. [2018-10-10 16:23:58,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1195 states to 1195 states and 1225 transitions. [2018-10-10 16:23:58,098 INFO L78 Accepts]: Start accepts. Automaton has 1195 states and 1225 transitions. Word has length 752 [2018-10-10 16:23:58,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:58,098 INFO L481 AbstractCegarLoop]: Abstraction has 1195 states and 1225 transitions. [2018-10-10 16:23:58,098 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-10 16:23:58,098 INFO L276 IsEmpty]: Start isEmpty. Operand 1195 states and 1225 transitions. [2018-10-10 16:23:58,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 779 [2018-10-10 16:23:58,102 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:58,103 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-10 16:23:58,103 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:58,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:58,103 INFO L82 PathProgramCache]: Analyzing trace with hash 2001161198, now seen corresponding path program 29 times [2018-10-10 16:23:58,104 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:58,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:59,918 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-10 16:23:59,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:59,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-10 16:23:59,919 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-10 16:23:59,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-10 16:23:59,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=960, Invalid=2700, Unknown=0, NotChecked=0, Total=3660 [2018-10-10 16:23:59,920 INFO L87 Difference]: Start difference. First operand 1195 states and 1225 transitions. Second operand 61 states. [2018-10-10 16:24:02,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:24:02,603 INFO L93 Difference]: Finished difference Result 1288 states and 1320 transitions. [2018-10-10 16:24:02,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-10 16:24:02,604 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 778 [2018-10-10 16:24:02,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:24:02,608 INFO L225 Difference]: With dead ends: 1288 [2018-10-10 16:24:02,608 INFO L226 Difference]: Without dead ends: 1288 [2018-10-10 16:24:02,609 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2465 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4498, Invalid=9544, Unknown=0, NotChecked=0, Total=14042 [2018-10-10 16:24:02,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1288 states. [2018-10-10 16:24:02,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1288 to 1235. [2018-10-10 16:24:02,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1235 states. [2018-10-10 16:24:02,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1266 transitions. [2018-10-10 16:24:02,618 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 1266 transitions. Word has length 778 [2018-10-10 16:24:02,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:24:02,619 INFO L481 AbstractCegarLoop]: Abstraction has 1235 states and 1266 transitions. [2018-10-10 16:24:02,619 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-10 16:24:02,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1266 transitions. [2018-10-10 16:24:02,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 805 [2018-10-10 16:24:02,623 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:24:02,624 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-10 16:24:02,624 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:24:02,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:24:02,624 INFO L82 PathProgramCache]: Analyzing trace with hash 174512783, now seen corresponding path program 30 times [2018-10-10 16:24:02,625 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:24:02,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:24:04,553 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-10 16:24:04,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:24:04,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-10 16:24:04,554 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-10 16:24:04,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-10 16:24:04,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2018-10-10 16:24:04,555 INFO L87 Difference]: Start difference. First operand 1235 states and 1266 transitions. Second operand 63 states. [2018-10-10 16:24:07,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:24:07,497 INFO L93 Difference]: Finished difference Result 1328 states and 1361 transitions. [2018-10-10 16:24:07,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-10 16:24:07,498 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 804 [2018-10-10 16:24:07,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:24:07,504 INFO L225 Difference]: With dead ends: 1328 [2018-10-10 16:24:07,504 INFO L226 Difference]: Without dead ends: 1328 [2018-10-10 16:24:07,505 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2640 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4803, Invalid=10203, Unknown=0, NotChecked=0, Total=15006 [2018-10-10 16:24:07,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1328 states. [2018-10-10 16:24:07,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1328 to 1275. [2018-10-10 16:24:07,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1275 states. [2018-10-10 16:24:07,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 1307 transitions. [2018-10-10 16:24:07,514 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 1307 transitions. Word has length 804 [2018-10-10 16:24:07,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:24:07,515 INFO L481 AbstractCegarLoop]: Abstraction has 1275 states and 1307 transitions. [2018-10-10 16:24:07,515 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-10 16:24:07,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 1307 transitions. [2018-10-10 16:24:07,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 831 [2018-10-10 16:24:07,520 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:24:07,520 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-10 16:24:07,520 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:24:07,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:24:07,521 INFO L82 PathProgramCache]: Analyzing trace with hash -401837584, now seen corresponding path program 31 times [2018-10-10 16:24:07,521 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:24:07,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:24:09,738 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-10 16:24:09,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:24:09,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-10 16:24:09,739 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-10 16:24:09,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-10 16:24:09,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1088, Invalid=3072, Unknown=0, NotChecked=0, Total=4160 [2018-10-10 16:24:09,740 INFO L87 Difference]: Start difference. First operand 1275 states and 1307 transitions. Second operand 65 states. [2018-10-10 16:24:12,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:24:12,717 INFO L93 Difference]: Finished difference Result 1368 states and 1402 transitions. [2018-10-10 16:24:12,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-10 16:24:12,720 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 830 [2018-10-10 16:24:12,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:24:12,725 INFO L225 Difference]: With dead ends: 1368 [2018-10-10 16:24:12,725 INFO L226 Difference]: Without dead ends: 1368 [2018-10-10 16:24:12,726 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2821 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5118, Invalid=10884, Unknown=0, NotChecked=0, Total=16002 [2018-10-10 16:24:12,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2018-10-10 16:24:12,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 1315. [2018-10-10 16:24:12,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1315 states. [2018-10-10 16:24:12,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1315 states to 1315 states and 1348 transitions. [2018-10-10 16:24:12,736 INFO L78 Accepts]: Start accepts. Automaton has 1315 states and 1348 transitions. Word has length 830 [2018-10-10 16:24:12,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:24:12,737 INFO L481 AbstractCegarLoop]: Abstraction has 1315 states and 1348 transitions. [2018-10-10 16:24:12,737 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-10 16:24:12,737 INFO L276 IsEmpty]: Start isEmpty. Operand 1315 states and 1348 transitions. [2018-10-10 16:24:12,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 857 [2018-10-10 16:24:12,742 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:24:12,743 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-10 16:24:12,743 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:24:12,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:24:12,743 INFO L82 PathProgramCache]: Analyzing trace with hash -636837359, now seen corresponding path program 32 times [2018-10-10 16:24:12,744 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:24:12,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:24:14,926 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-10 16:24:14,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:24:14,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-10 16:24:14,929 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-10 16:24:14,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-10 16:24:14,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1155, Invalid=3267, Unknown=0, NotChecked=0, Total=4422 [2018-10-10 16:24:14,930 INFO L87 Difference]: Start difference. First operand 1315 states and 1348 transitions. Second operand 67 states. [2018-10-10 16:24:18,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:24:18,023 INFO L93 Difference]: Finished difference Result 1408 states and 1443 transitions. [2018-10-10 16:24:18,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-10-10 16:24:18,023 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 856 [2018-10-10 16:24:18,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:24:18,030 INFO L225 Difference]: With dead ends: 1408 [2018-10-10 16:24:18,030 INFO L226 Difference]: Without dead ends: 1408 [2018-10-10 16:24:18,031 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3008 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5443, Invalid=11587, Unknown=0, NotChecked=0, Total=17030 [2018-10-10 16:24:18,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2018-10-10 16:24:18,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 1355. [2018-10-10 16:24:18,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1355 states. [2018-10-10 16:24:18,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1355 states to 1355 states and 1389 transitions. [2018-10-10 16:24:18,041 INFO L78 Accepts]: Start accepts. Automaton has 1355 states and 1389 transitions. Word has length 856 [2018-10-10 16:24:18,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:24:18,042 INFO L481 AbstractCegarLoop]: Abstraction has 1355 states and 1389 transitions. [2018-10-10 16:24:18,042 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-10 16:24:18,042 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 1389 transitions. [2018-10-10 16:24:18,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 883 [2018-10-10 16:24:18,047 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:24:18,048 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-10 16:24:18,048 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:24:18,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:24:18,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1054868750, now seen corresponding path program 33 times [2018-10-10 16:24:18,049 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:24:18,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:24:20,039 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-10 16:24:20,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:24:20,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-10 16:24:20,040 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-10 16:24:20,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-10 16:24:20,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1224, Invalid=3468, Unknown=0, NotChecked=0, Total=4692 [2018-10-10 16:24:20,041 INFO L87 Difference]: Start difference. First operand 1355 states and 1389 transitions. Second operand 69 states. [2018-10-10 16:24:22,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:24:22,963 INFO L93 Difference]: Finished difference Result 1448 states and 1484 transitions. [2018-10-10 16:24:22,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-10-10 16:24:22,963 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 882 [2018-10-10 16:24:22,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:24:22,969 INFO L225 Difference]: With dead ends: 1448 [2018-10-10 16:24:22,969 INFO L226 Difference]: Without dead ends: 1448 [2018-10-10 16:24:22,970 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3201 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5778, Invalid=12312, Unknown=0, NotChecked=0, Total=18090 [2018-10-10 16:24:22,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1448 states. [2018-10-10 16:24:22,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1448 to 1395. [2018-10-10 16:24:22,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1395 states. [2018-10-10 16:24:22,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1395 states to 1395 states and 1430 transitions. [2018-10-10 16:24:22,980 INFO L78 Accepts]: Start accepts. Automaton has 1395 states and 1430 transitions. Word has length 882 [2018-10-10 16:24:22,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:24:22,980 INFO L481 AbstractCegarLoop]: Abstraction has 1395 states and 1430 transitions. [2018-10-10 16:24:22,981 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-10 16:24:22,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1395 states and 1430 transitions. [2018-10-10 16:24:22,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 909 [2018-10-10 16:24:22,986 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:24:22,987 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-10 16:24:22,987 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:24:22,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:24:22,987 INFO L82 PathProgramCache]: Analyzing trace with hash -2047406957, now seen corresponding path program 34 times [2018-10-10 16:24:22,988 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:24:23,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:24:25,179 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-10 16:24:25,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:24:25,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-10 16:24:25,181 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-10 16:24:25,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-10 16:24:25,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1295, Invalid=3675, Unknown=0, NotChecked=0, Total=4970 [2018-10-10 16:24:25,182 INFO L87 Difference]: Start difference. First operand 1395 states and 1430 transitions. Second operand 71 states. [2018-10-10 16:24:28,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:24:28,609 INFO L93 Difference]: Finished difference Result 1488 states and 1525 transitions. [2018-10-10 16:24:28,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-10-10 16:24:28,609 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 908 [2018-10-10 16:24:28,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:24:28,615 INFO L225 Difference]: With dead ends: 1488 [2018-10-10 16:24:28,615 INFO L226 Difference]: Without dead ends: 1488 [2018-10-10 16:24:28,616 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-10 16:24:28,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1488 states. [2018-10-10 16:24:28,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1488 to 1435. [2018-10-10 16:24:28,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1435 states. [2018-10-10 16:24:28,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1435 states to 1435 states and 1471 transitions. [2018-10-10 16:24:28,626 INFO L78 Accepts]: Start accepts. Automaton has 1435 states and 1471 transitions. Word has length 908 [2018-10-10 16:24:28,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:24:28,627 INFO L481 AbstractCegarLoop]: Abstraction has 1435 states and 1471 transitions. [2018-10-10 16:24:28,627 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-10 16:24:28,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1435 states and 1471 transitions. [2018-10-10 16:24:28,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 935 [2018-10-10 16:24:28,635 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:24:28,636 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-10 16:24:28,636 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:24:28,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:24:28,636 INFO L82 PathProgramCache]: Analyzing trace with hash -903452940, now seen corresponding path program 35 times [2018-10-10 16:24:28,637 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:24:28,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:24:30,912 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-10 16:24:30,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:24:30,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-10 16:24:30,913 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-10 16:24:30,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-10 16:24:30,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1368, Invalid=3888, Unknown=0, NotChecked=0, Total=5256 [2018-10-10 16:24:30,914 INFO L87 Difference]: Start difference. First operand 1435 states and 1471 transitions. Second operand 73 states. [2018-10-10 16:24:34,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:24:34,513 INFO L93 Difference]: Finished difference Result 1528 states and 1566 transitions. [2018-10-10 16:24:34,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-10-10 16:24:34,514 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 934 [2018-10-10 16:24:34,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:24:34,521 INFO L225 Difference]: With dead ends: 1528 [2018-10-10 16:24:34,521 INFO L226 Difference]: Without dead ends: 1528 [2018-10-10 16:24:34,522 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3605 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6478, Invalid=13828, Unknown=0, NotChecked=0, Total=20306 [2018-10-10 16:24:34,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1528 states. [2018-10-10 16:24:34,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1528 to 1475. [2018-10-10 16:24:34,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1475 states. [2018-10-10 16:24:34,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1475 states to 1475 states and 1512 transitions. [2018-10-10 16:24:34,533 INFO L78 Accepts]: Start accepts. Automaton has 1475 states and 1512 transitions. Word has length 934 [2018-10-10 16:24:34,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:24:34,534 INFO L481 AbstractCegarLoop]: Abstraction has 1475 states and 1512 transitions. [2018-10-10 16:24:34,534 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-10 16:24:34,534 INFO L276 IsEmpty]: Start isEmpty. Operand 1475 states and 1512 transitions. [2018-10-10 16:24:34,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 961 [2018-10-10 16:24:34,542 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:24:34,542 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-10 16:24:34,543 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:24:34,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:24:34,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1496357397, now seen corresponding path program 36 times [2018-10-10 16:24:34,543 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:24:34,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:24:36,967 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-10 16:24:36,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:24:36,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-10 16:24:36,968 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-10 16:24:36,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-10 16:24:36,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1443, Invalid=4107, Unknown=0, NotChecked=0, Total=5550 [2018-10-10 16:24:36,969 INFO L87 Difference]: Start difference. First operand 1475 states and 1512 transitions. Second operand 75 states. [2018-10-10 16:24:40,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:24:40,742 INFO L93 Difference]: Finished difference Result 1568 states and 1607 transitions. [2018-10-10 16:24:40,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-10-10 16:24:40,743 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 960 [2018-10-10 16:24:40,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:24:40,749 INFO L225 Difference]: With dead ends: 1568 [2018-10-10 16:24:40,749 INFO L226 Difference]: Without dead ends: 1568 [2018-10-10 16:24:40,750 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3816 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6843, Invalid=14619, Unknown=0, NotChecked=0, Total=21462 [2018-10-10 16:24:40,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1568 states. [2018-10-10 16:24:40,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1568 to 1515. [2018-10-10 16:24:40,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1515 states. [2018-10-10 16:24:40,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 1515 states and 1553 transitions. [2018-10-10 16:24:40,764 INFO L78 Accepts]: Start accepts. Automaton has 1515 states and 1553 transitions. Word has length 960 [2018-10-10 16:24:40,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:24:40,765 INFO L481 AbstractCegarLoop]: Abstraction has 1515 states and 1553 transitions. [2018-10-10 16:24:40,765 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-10 16:24:40,765 INFO L276 IsEmpty]: Start isEmpty. Operand 1515 states and 1553 transitions. [2018-10-10 16:24:40,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 987 [2018-10-10 16:24:40,773 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:24:40,774 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-10 16:24:40,776 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:24:40,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:24:40,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1501836790, now seen corresponding path program 37 times [2018-10-10 16:24:40,777 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:24:40,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:24:43,699 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-10 16:24:43,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:24:43,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-10-10 16:24:43,700 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-10 16:24:43,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-10 16:24:43,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1520, Invalid=4332, Unknown=0, NotChecked=0, Total=5852 [2018-10-10 16:24:43,701 INFO L87 Difference]: Start difference. First operand 1515 states and 1553 transitions. Second operand 77 states. [2018-10-10 16:24:47,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:24:47,200 INFO L93 Difference]: Finished difference Result 1608 states and 1648 transitions. [2018-10-10 16:24:47,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-10-10 16:24:47,201 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 986 [2018-10-10 16:24:47,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:24:47,207 INFO L225 Difference]: With dead ends: 1608 [2018-10-10 16:24:47,207 INFO L226 Difference]: Without dead ends: 1608 [2018-10-10 16:24:47,208 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4033 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=7218, Invalid=15432, Unknown=0, NotChecked=0, Total=22650 [2018-10-10 16:24:47,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1608 states. [2018-10-10 16:24:47,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1608 to 1555. [2018-10-10 16:24:47,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1555 states. [2018-10-10 16:24:47,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 1594 transitions. [2018-10-10 16:24:47,223 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 1594 transitions. Word has length 986 [2018-10-10 16:24:47,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:24:47,224 INFO L481 AbstractCegarLoop]: Abstraction has 1555 states and 1594 transitions. [2018-10-10 16:24:47,224 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-10 16:24:47,224 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 1594 transitions. [2018-10-10 16:24:47,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1013 [2018-10-10 16:24:47,234 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:24:47,234 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-10 16:24:47,235 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:24:47,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:24:47,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1031522967, now seen corresponding path program 38 times [2018-10-10 16:24:47,236 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:24:47,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:24:49,926 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-10 16:24:49,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:24:49,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-10-10 16:24:49,928 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-10 16:24:49,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-10 16:24:49,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1599, Invalid=4563, Unknown=0, NotChecked=0, Total=6162 [2018-10-10 16:24:49,929 INFO L87 Difference]: Start difference. First operand 1555 states and 1594 transitions. Second operand 79 states. [2018-10-10 16:24:54,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:24:54,211 INFO L93 Difference]: Finished difference Result 1648 states and 1689 transitions. [2018-10-10 16:24:54,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-10-10 16:24:54,212 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 1012 [2018-10-10 16:24:54,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:24:54,217 INFO L225 Difference]: With dead ends: 1648 [2018-10-10 16:24:54,217 INFO L226 Difference]: Without dead ends: 1648 [2018-10-10 16:24:54,218 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4256 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7603, Invalid=16267, Unknown=0, NotChecked=0, Total=23870 [2018-10-10 16:24:54,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1648 states. [2018-10-10 16:24:54,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1648 to 1595. [2018-10-10 16:24:54,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1595 states. [2018-10-10 16:24:54,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1595 states to 1595 states and 1635 transitions. [2018-10-10 16:24:54,231 INFO L78 Accepts]: Start accepts. Automaton has 1595 states and 1635 transitions. Word has length 1012 [2018-10-10 16:24:54,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:24:54,232 INFO L481 AbstractCegarLoop]: Abstraction has 1595 states and 1635 transitions. [2018-10-10 16:24:54,232 INFO L482 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-10 16:24:54,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1595 states and 1635 transitions. [2018-10-10 16:24:54,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1039 [2018-10-10 16:24:54,242 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:24:54,242 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-10 16:24:54,243 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:24:54,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:24:54,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1952311288, now seen corresponding path program 39 times [2018-10-10 16:24:54,244 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:24:54,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:24:56,926 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-10 16:24:56,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:24:56,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-10 16:24:56,928 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-10 16:24:56,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-10 16:24:56,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1680, Invalid=4800, Unknown=0, NotChecked=0, Total=6480 [2018-10-10 16:24:56,929 INFO L87 Difference]: Start difference. First operand 1595 states and 1635 transitions. Second operand 81 states. [2018-10-10 16:25:01,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:25:01,203 INFO L93 Difference]: Finished difference Result 1688 states and 1730 transitions. [2018-10-10 16:25:01,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-10-10 16:25:01,204 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 1038 [2018-10-10 16:25:01,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:25:01,207 INFO L225 Difference]: With dead ends: 1688 [2018-10-10 16:25:01,207 INFO L226 Difference]: Without dead ends: 1688 [2018-10-10 16:25:01,209 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4485 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=7998, Invalid=17124, Unknown=0, NotChecked=0, Total=25122 [2018-10-10 16:25:01,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1688 states. [2018-10-10 16:25:01,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1688 to 1635. [2018-10-10 16:25:01,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1635 states. [2018-10-10 16:25:01,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1635 states to 1635 states and 1676 transitions. [2018-10-10 16:25:01,218 INFO L78 Accepts]: Start accepts. Automaton has 1635 states and 1676 transitions. Word has length 1038 [2018-10-10 16:25:01,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:25:01,219 INFO L481 AbstractCegarLoop]: Abstraction has 1635 states and 1676 transitions. [2018-10-10 16:25:01,219 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-10 16:25:01,219 INFO L276 IsEmpty]: Start isEmpty. Operand 1635 states and 1676 transitions. [2018-10-10 16:25:01,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1065 [2018-10-10 16:25:01,226 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:25:01,227 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-10 16:25:01,227 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:25:01,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:25:01,227 INFO L82 PathProgramCache]: Analyzing trace with hash -614654439, now seen corresponding path program 40 times [2018-10-10 16:25:01,228 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:25:01,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:25:04,271 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-10 16:25:04,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:25:04,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-10 16:25:04,273 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-10 16:25:04,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-10 16:25:04,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1763, Invalid=5043, Unknown=0, NotChecked=0, Total=6806 [2018-10-10 16:25:04,273 INFO L87 Difference]: Start difference. First operand 1635 states and 1676 transitions. Second operand 83 states. [2018-10-10 16:25:08,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:25:08,800 INFO L93 Difference]: Finished difference Result 1728 states and 1771 transitions. [2018-10-10 16:25:08,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-10-10 16:25:08,801 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 1064 [2018-10-10 16:25:08,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:25:08,805 INFO L225 Difference]: With dead ends: 1728 [2018-10-10 16:25:08,805 INFO L226 Difference]: Without dead ends: 1728 [2018-10-10 16:25:08,807 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4720 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=8403, Invalid=18003, Unknown=0, NotChecked=0, Total=26406 [2018-10-10 16:25:08,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1728 states. [2018-10-10 16:25:08,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1728 to 1675. [2018-10-10 16:25:08,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1675 states. [2018-10-10 16:25:08,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1675 states to 1675 states and 1717 transitions. [2018-10-10 16:25:08,817 INFO L78 Accepts]: Start accepts. Automaton has 1675 states and 1717 transitions. Word has length 1064 [2018-10-10 16:25:08,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:25:08,817 INFO L481 AbstractCegarLoop]: Abstraction has 1675 states and 1717 transitions. [2018-10-10 16:25:08,817 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-10 16:25:08,817 INFO L276 IsEmpty]: Start isEmpty. Operand 1675 states and 1717 transitions. [2018-10-10 16:25:08,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1091 [2018-10-10 16:25:08,825 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:25:08,825 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-10 16:25:08,825 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:25:08,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:25:08,826 INFO L82 PathProgramCache]: Analyzing trace with hash -292029190, now seen corresponding path program 41 times [2018-10-10 16:25:08,826 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:25:08,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:25:11,692 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-10 16:25:11,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:25:11,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-10-10 16:25:11,694 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-10 16:25:11,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-10 16:25:11,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1848, Invalid=5292, Unknown=0, NotChecked=0, Total=7140 [2018-10-10 16:25:11,694 INFO L87 Difference]: Start difference. First operand 1675 states and 1717 transitions. Second operand 85 states. [2018-10-10 16:25:16,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:25:16,047 INFO L93 Difference]: Finished difference Result 1768 states and 1812 transitions. [2018-10-10 16:25:16,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-10-10 16:25:16,047 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 1090 [2018-10-10 16:25:16,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:25:16,051 INFO L225 Difference]: With dead ends: 1768 [2018-10-10 16:25:16,051 INFO L226 Difference]: Without dead ends: 1768 [2018-10-10 16:25:16,053 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4961 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=8818, Invalid=18904, Unknown=0, NotChecked=0, Total=27722 [2018-10-10 16:25:16,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1768 states. [2018-10-10 16:25:16,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1768 to 1715. [2018-10-10 16:25:16,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1715 states. [2018-10-10 16:25:16,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1715 states to 1715 states and 1758 transitions. [2018-10-10 16:25:16,067 INFO L78 Accepts]: Start accepts. Automaton has 1715 states and 1758 transitions. Word has length 1090 [2018-10-10 16:25:16,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:25:16,068 INFO L481 AbstractCegarLoop]: Abstraction has 1715 states and 1758 transitions. [2018-10-10 16:25:16,068 INFO L482 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-10 16:25:16,068 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 1758 transitions. [2018-10-10 16:25:16,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1117 [2018-10-10 16:25:16,080 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:25:16,081 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-10 16:25:16,081 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:25:16,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:25:16,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1172761445, now seen corresponding path program 42 times [2018-10-10 16:25:16,082 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:25:16,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:25:19,850 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-10 16:25:19,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:25:19,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-10 16:25:19,852 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-10 16:25:19,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-10 16:25:19,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1935, Invalid=5547, Unknown=0, NotChecked=0, Total=7482 [2018-10-10 16:25:19,853 INFO L87 Difference]: Start difference. First operand 1715 states and 1758 transitions. Second operand 87 states. [2018-10-10 16:25:24,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:25:24,516 INFO L93 Difference]: Finished difference Result 1808 states and 1853 transitions. [2018-10-10 16:25:24,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-10-10 16:25:24,517 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 1116 [2018-10-10 16:25:24,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:25:24,522 INFO L225 Difference]: With dead ends: 1808 [2018-10-10 16:25:24,522 INFO L226 Difference]: Without dead ends: 1808 [2018-10-10 16:25:24,525 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5208 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=9243, Invalid=19827, Unknown=0, NotChecked=0, Total=29070 [2018-10-10 16:25:24,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1808 states. [2018-10-10 16:25:24,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1808 to 1755. [2018-10-10 16:25:24,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1755 states. [2018-10-10 16:25:24,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1755 states to 1755 states and 1799 transitions. [2018-10-10 16:25:24,539 INFO L78 Accepts]: Start accepts. Automaton has 1755 states and 1799 transitions. Word has length 1116 [2018-10-10 16:25:24,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:25:24,540 INFO L481 AbstractCegarLoop]: Abstraction has 1755 states and 1799 transitions. [2018-10-10 16:25:24,540 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-10 16:25:24,540 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 1799 transitions. [2018-10-10 16:25:24,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1143 [2018-10-10 16:25:24,553 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:25:24,554 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-10 16:25:24,554 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:25:24,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:25:24,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1965624068, now seen corresponding path program 43 times [2018-10-10 16:25:24,555 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:25:24,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:25:27,819 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-10 16:25:27,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:25:27,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-10-10 16:25:27,820 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-10 16:25:27,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-10 16:25:27,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2024, Invalid=5808, Unknown=0, NotChecked=0, Total=7832 [2018-10-10 16:25:27,821 INFO L87 Difference]: Start difference. First operand 1755 states and 1799 transitions. Second operand 89 states. [2018-10-10 16:25:32,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:25:32,754 INFO L93 Difference]: Finished difference Result 1848 states and 1894 transitions. [2018-10-10 16:25:32,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-10-10 16:25:32,755 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 1142 [2018-10-10 16:25:32,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:25:32,760 INFO L225 Difference]: With dead ends: 1848 [2018-10-10 16:25:32,760 INFO L226 Difference]: Without dead ends: 1848 [2018-10-10 16:25:32,762 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5461 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=9678, Invalid=20772, Unknown=0, NotChecked=0, Total=30450 [2018-10-10 16:25:32,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1848 states. [2018-10-10 16:25:32,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1848 to 1795. [2018-10-10 16:25:32,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1795 states. [2018-10-10 16:25:32,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1795 states to 1795 states and 1840 transitions. [2018-10-10 16:25:32,776 INFO L78 Accepts]: Start accepts. Automaton has 1795 states and 1840 transitions. Word has length 1142 [2018-10-10 16:25:32,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:25:32,777 INFO L481 AbstractCegarLoop]: Abstraction has 1795 states and 1840 transitions. [2018-10-10 16:25:32,778 INFO L482 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-10 16:25:32,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1795 states and 1840 transitions. [2018-10-10 16:25:32,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1169 [2018-10-10 16:25:32,791 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:25:32,792 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-10 16:25:32,792 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:25:32,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:25:32,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1605643805, now seen corresponding path program 44 times [2018-10-10 16:25:32,793 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:25:32,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:25:36,495 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-10 16:25:36,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:25:36,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-10-10 16:25:36,497 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-10 16:25:36,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-10 16:25:36,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2115, Invalid=6075, Unknown=0, NotChecked=0, Total=8190 [2018-10-10 16:25:36,498 INFO L87 Difference]: Start difference. First operand 1795 states and 1840 transitions. Second operand 91 states. [2018-10-10 16:25:41,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:25:41,759 INFO L93 Difference]: Finished difference Result 1888 states and 1935 transitions. [2018-10-10 16:25:41,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-10-10 16:25:41,759 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 1168 [2018-10-10 16:25:41,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:25:41,764 INFO L225 Difference]: With dead ends: 1888 [2018-10-10 16:25:41,764 INFO L226 Difference]: Without dead ends: 1888 [2018-10-10 16:25:41,767 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5720 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=10123, Invalid=21739, Unknown=0, NotChecked=0, Total=31862 [2018-10-10 16:25:41,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1888 states. [2018-10-10 16:25:41,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1888 to 1835. [2018-10-10 16:25:41,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1835 states. [2018-10-10 16:25:41,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1835 states to 1835 states and 1881 transitions. [2018-10-10 16:25:41,782 INFO L78 Accepts]: Start accepts. Automaton has 1835 states and 1881 transitions. Word has length 1168 [2018-10-10 16:25:41,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:25:41,783 INFO L481 AbstractCegarLoop]: Abstraction has 1835 states and 1881 transitions. [2018-10-10 16:25:41,783 INFO L482 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-10 16:25:41,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1835 states and 1881 transitions. [2018-10-10 16:25:41,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1195 [2018-10-10 16:25:41,795 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:25:41,796 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-10 16:25:41,796 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:25:41,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:25:41,796 INFO L82 PathProgramCache]: Analyzing trace with hash 444551166, now seen corresponding path program 45 times [2018-10-10 16:25:41,797 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:25:41,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:25:45,676 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-10 16:25:45,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:25:45,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-10 16:25:45,677 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-10 16:25:45,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-10 16:25:45,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2208, Invalid=6348, Unknown=0, NotChecked=0, Total=8556 [2018-10-10 16:25:45,678 INFO L87 Difference]: Start difference. First operand 1835 states and 1881 transitions. Second operand 93 states. [2018-10-10 16:25:51,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:25:51,253 INFO L93 Difference]: Finished difference Result 1928 states and 1976 transitions. [2018-10-10 16:25:51,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-10-10 16:25:51,254 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 1194 [2018-10-10 16:25:51,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:25:51,256 INFO L225 Difference]: With dead ends: 1928 [2018-10-10 16:25:51,257 INFO L226 Difference]: Without dead ends: 1928 [2018-10-10 16:25:51,258 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5985 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=10578, Invalid=22728, Unknown=0, NotChecked=0, Total=33306 [2018-10-10 16:25:51,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1928 states. [2018-10-10 16:25:51,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1875. [2018-10-10 16:25:51,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1875 states. [2018-10-10 16:25:51,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1875 states to 1875 states and 1922 transitions. [2018-10-10 16:25:51,268 INFO L78 Accepts]: Start accepts. Automaton has 1875 states and 1922 transitions. Word has length 1194 [2018-10-10 16:25:51,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:25:51,269 INFO L481 AbstractCegarLoop]: Abstraction has 1875 states and 1922 transitions. [2018-10-10 16:25:51,269 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-10 16:25:51,269 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 1922 transitions. [2018-10-10 16:25:51,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1221 [2018-10-10 16:25:51,279 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:25:51,279 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-10 16:25:51,280 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:25:51,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:25:51,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1894967967, now seen corresponding path program 46 times [2018-10-10 16:25:51,280 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:25:51,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:25:54,905 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-10 16:25:54,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:25:54,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-10-10 16:25:54,906 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-10 16:25:54,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-10 16:25:54,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2303, Invalid=6627, Unknown=0, NotChecked=0, Total=8930 [2018-10-10 16:25:54,907 INFO L87 Difference]: Start difference. First operand 1875 states and 1922 transitions. Second operand 95 states. [2018-10-10 16:26:00,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:26:00,682 INFO L93 Difference]: Finished difference Result 1968 states and 2017 transitions. [2018-10-10 16:26:00,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-10-10 16:26:00,683 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 1220 [2018-10-10 16:26:00,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:26:00,686 INFO L225 Difference]: With dead ends: 1968 [2018-10-10 16:26:00,686 INFO L226 Difference]: Without dead ends: 1968 [2018-10-10 16:26:00,689 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-10 16:26:00,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1968 states. [2018-10-10 16:26:00,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1968 to 1915. [2018-10-10 16:26:00,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1915 states. [2018-10-10 16:26:00,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1915 states to 1915 states and 1963 transitions. [2018-10-10 16:26:00,705 INFO L78 Accepts]: Start accepts. Automaton has 1915 states and 1963 transitions. Word has length 1220 [2018-10-10 16:26:00,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:26:00,706 INFO L481 AbstractCegarLoop]: Abstraction has 1915 states and 1963 transitions. [2018-10-10 16:26:00,707 INFO L482 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-10 16:26:00,707 INFO L276 IsEmpty]: Start isEmpty. Operand 1915 states and 1963 transitions. [2018-10-10 16:26:00,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1247 [2018-10-10 16:26:00,720 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:26:00,721 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-10 16:26:00,721 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:26:00,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:26:00,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1649046016, now seen corresponding path program 47 times [2018-10-10 16:26:00,722 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:26:00,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:26:04,584 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-10 16:26:04,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:26:04,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-10-10 16:26:04,585 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-10-10 16:26:04,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-10-10 16:26:04,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2400, Invalid=6912, Unknown=0, NotChecked=0, Total=9312 [2018-10-10 16:26:04,586 INFO L87 Difference]: Start difference. First operand 1915 states and 1963 transitions. Second operand 97 states. [2018-10-10 16:26:10,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:26:10,567 INFO L93 Difference]: Finished difference Result 2008 states and 2058 transitions. [2018-10-10 16:26:10,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-10-10 16:26:10,568 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 1246 [2018-10-10 16:26:10,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:26:10,570 INFO L225 Difference]: With dead ends: 2008 [2018-10-10 16:26:10,571 INFO L226 Difference]: Without dead ends: 2008 [2018-10-10 16:26:10,573 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6533 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=11518, Invalid=24772, Unknown=0, NotChecked=0, Total=36290 [2018-10-10 16:26:10,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2008 states. [2018-10-10 16:26:10,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2008 to 1955. [2018-10-10 16:26:10,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1955 states. [2018-10-10 16:26:10,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1955 states to 1955 states and 2004 transitions. [2018-10-10 16:26:10,588 INFO L78 Accepts]: Start accepts. Automaton has 1955 states and 2004 transitions. Word has length 1246 [2018-10-10 16:26:10,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:26:10,589 INFO L481 AbstractCegarLoop]: Abstraction has 1955 states and 2004 transitions. [2018-10-10 16:26:10,589 INFO L482 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-10-10 16:26:10,589 INFO L276 IsEmpty]: Start isEmpty. Operand 1955 states and 2004 transitions. [2018-10-10 16:26:10,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1273 [2018-10-10 16:26:10,603 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:26:10,604 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-10 16:26:10,604 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:26:10,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:26:10,604 INFO L82 PathProgramCache]: Analyzing trace with hash -782644703, now seen corresponding path program 48 times [2018-10-10 16:26:10,605 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:26:10,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:26:14,530 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-10 16:26:14,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:26:14,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-10-10 16:26:14,531 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-10-10 16:26:14,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-10-10 16:26:14,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2499, Invalid=7203, Unknown=0, NotChecked=0, Total=9702 [2018-10-10 16:26:14,532 INFO L87 Difference]: Start difference. First operand 1955 states and 2004 transitions. Second operand 99 states. [2018-10-10 16:26:20,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:26:20,629 INFO L93 Difference]: Finished difference Result 2048 states and 2099 transitions. [2018-10-10 16:26:20,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-10-10 16:26:20,630 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 1272 [2018-10-10 16:26:20,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:26:20,634 INFO L225 Difference]: With dead ends: 2048 [2018-10-10 16:26:20,634 INFO L226 Difference]: Without dead ends: 2048 [2018-10-10 16:26:20,636 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6816 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=12003, Invalid=25827, Unknown=0, NotChecked=0, Total=37830 [2018-10-10 16:26:20,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2048 states. [2018-10-10 16:26:20,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2048 to 1995. [2018-10-10 16:26:20,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1995 states. [2018-10-10 16:26:20,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1995 states to 1995 states and 2045 transitions. [2018-10-10 16:26:20,648 INFO L78 Accepts]: Start accepts. Automaton has 1995 states and 2045 transitions. Word has length 1272 [2018-10-10 16:26:20,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:26:20,649 INFO L481 AbstractCegarLoop]: Abstraction has 1995 states and 2045 transitions. [2018-10-10 16:26:20,649 INFO L482 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-10-10 16:26:20,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1995 states and 2045 transitions. [2018-10-10 16:26:20,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1299 [2018-10-10 16:26:20,660 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:26:20,660 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-10 16:26:20,661 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:26:20,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:26:20,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1667116802, now seen corresponding path program 49 times [2018-10-10 16:26:20,661 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:26:20,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:26:24,685 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-10 16:26:24,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:26:24,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-10-10 16:26:24,687 INFO L460 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-10-10 16:26:24,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-10-10 16:26:24,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2600, Invalid=7500, Unknown=0, NotChecked=0, Total=10100 [2018-10-10 16:26:24,688 INFO L87 Difference]: Start difference. First operand 1995 states and 2045 transitions. Second operand 101 states. [2018-10-10 16:26:30,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:26:30,968 INFO L93 Difference]: Finished difference Result 2088 states and 2140 transitions. [2018-10-10 16:26:30,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-10-10 16:26:30,968 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 1298 [2018-10-10 16:26:30,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:26:30,972 INFO L225 Difference]: With dead ends: 2088 [2018-10-10 16:26:30,972 INFO L226 Difference]: Without dead ends: 2088 [2018-10-10 16:26:30,975 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7105 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=12498, Invalid=26904, Unknown=0, NotChecked=0, Total=39402 [2018-10-10 16:26:30,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2088 states. [2018-10-10 16:26:30,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2088 to 2035. [2018-10-10 16:26:30,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2035 states. [2018-10-10 16:26:30,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2035 states to 2035 states and 2086 transitions. [2018-10-10 16:26:30,989 INFO L78 Accepts]: Start accepts. Automaton has 2035 states and 2086 transitions. Word has length 1298 [2018-10-10 16:26:30,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:26:30,989 INFO L481 AbstractCegarLoop]: Abstraction has 2035 states and 2086 transitions. [2018-10-10 16:26:30,990 INFO L482 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-10-10 16:26:30,990 INFO L276 IsEmpty]: Start isEmpty. Operand 2035 states and 2086 transitions. [2018-10-10 16:26:31,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1325 [2018-10-10 16:26:31,001 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:26:31,002 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-10 16:26:31,002 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:26:31,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:26:31,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1020441437, now seen corresponding path program 50 times [2018-10-10 16:26:31,003 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:26:31,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:26:35,174 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-10 16:26:35,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:26:35,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-10-10 16:26:35,175 INFO L460 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-10-10 16:26:35,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-10-10 16:26:35,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2703, Invalid=7803, Unknown=0, NotChecked=0, Total=10506 [2018-10-10 16:26:35,177 INFO L87 Difference]: Start difference. First operand 2035 states and 2086 transitions. Second operand 103 states. [2018-10-10 16:26:42,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:26:42,164 INFO L93 Difference]: Finished difference Result 2128 states and 2181 transitions. [2018-10-10 16:26:42,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2018-10-10 16:26:42,164 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 1324 [2018-10-10 16:26:42,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:26:42,169 INFO L225 Difference]: With dead ends: 2128 [2018-10-10 16:26:42,169 INFO L226 Difference]: Without dead ends: 2128 [2018-10-10 16:26:42,171 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7400 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=13003, Invalid=28003, Unknown=0, NotChecked=0, Total=41006 [2018-10-10 16:26:42,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2128 states. [2018-10-10 16:26:42,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2128 to 2075. [2018-10-10 16:26:42,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2075 states. [2018-10-10 16:26:42,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2075 states to 2075 states and 2127 transitions. [2018-10-10 16:26:42,185 INFO L78 Accepts]: Start accepts. Automaton has 2075 states and 2127 transitions. Word has length 1324 [2018-10-10 16:26:42,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:26:42,185 INFO L481 AbstractCegarLoop]: Abstraction has 2075 states and 2127 transitions. [2018-10-10 16:26:42,186 INFO L482 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-10-10 16:26:42,186 INFO L276 IsEmpty]: Start isEmpty. Operand 2075 states and 2127 transitions. [2018-10-10 16:26:42,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1351 [2018-10-10 16:26:42,198 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:26:42,199 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-10 16:26:42,199 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:26:42,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:26:42,199 INFO L82 PathProgramCache]: Analyzing trace with hash 689812228, now seen corresponding path program 51 times [2018-10-10 16:26:42,200 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:26:42,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:26:46,947 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-10 16:26:46,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:26:46,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-10-10 16:26:46,949 INFO L460 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-10-10 16:26:46,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-10-10 16:26:46,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2808, Invalid=8112, Unknown=0, NotChecked=0, Total=10920 [2018-10-10 16:26:46,950 INFO L87 Difference]: Start difference. First operand 2075 states and 2127 transitions. Second operand 105 states. [2018-10-10 16:26:53,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:26:53,655 INFO L93 Difference]: Finished difference Result 2168 states and 2222 transitions. [2018-10-10 16:26:53,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2018-10-10 16:26:53,656 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 1350 [2018-10-10 16:26:53,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:26:53,658 INFO L225 Difference]: With dead ends: 2168 [2018-10-10 16:26:53,659 INFO L226 Difference]: Without dead ends: 2168 [2018-10-10 16:26:53,661 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7701 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=13518, Invalid=29124, Unknown=0, NotChecked=0, Total=42642 [2018-10-10 16:26:53,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2168 states. [2018-10-10 16:26:53,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2168 to 2115. [2018-10-10 16:26:53,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2115 states. [2018-10-10 16:26:53,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2115 states to 2115 states and 2168 transitions. [2018-10-10 16:26:53,672 INFO L78 Accepts]: Start accepts. Automaton has 2115 states and 2168 transitions. Word has length 1350 [2018-10-10 16:26:53,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:26:53,672 INFO L481 AbstractCegarLoop]: Abstraction has 2115 states and 2168 transitions. [2018-10-10 16:26:53,673 INFO L482 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-10-10 16:26:53,673 INFO L276 IsEmpty]: Start isEmpty. Operand 2115 states and 2168 transitions. [2018-10-10 16:26:53,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1377 [2018-10-10 16:26:53,684 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:26:53,684 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-10 16:26:53,685 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:26:53,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:26:53,685 INFO L82 PathProgramCache]: Analyzing trace with hash 124908069, now seen corresponding path program 52 times [2018-10-10 16:26:53,686 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:26:53,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:26:58,531 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-10 16:26:58,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:26:58,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-10-10 16:26:58,533 INFO L460 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-10-10 16:26:58,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-10-10 16:26:58,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2915, Invalid=8427, Unknown=0, NotChecked=0, Total=11342 [2018-10-10 16:26:58,534 INFO L87 Difference]: Start difference. First operand 2115 states and 2168 transitions. Second operand 107 states. [2018-10-10 16:27:06,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:27:06,113 INFO L93 Difference]: Finished difference Result 2208 states and 2263 transitions. [2018-10-10 16:27:06,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2018-10-10 16:27:06,113 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 1376 [2018-10-10 16:27:06,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:27:06,116 INFO L225 Difference]: With dead ends: 2208 [2018-10-10 16:27:06,117 INFO L226 Difference]: Without dead ends: 2208 [2018-10-10 16:27:06,119 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8008 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=14043, Invalid=30267, Unknown=0, NotChecked=0, Total=44310 [2018-10-10 16:27:06,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2208 states. [2018-10-10 16:27:06,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2208 to 2155. [2018-10-10 16:27:06,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2155 states. [2018-10-10 16:27:06,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2155 states to 2155 states and 2209 transitions. [2018-10-10 16:27:06,134 INFO L78 Accepts]: Start accepts. Automaton has 2155 states and 2209 transitions. Word has length 1376 [2018-10-10 16:27:06,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:27:06,135 INFO L481 AbstractCegarLoop]: Abstraction has 2155 states and 2209 transitions. [2018-10-10 16:27:06,135 INFO L482 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-10-10 16:27:06,135 INFO L276 IsEmpty]: Start isEmpty. Operand 2155 states and 2209 transitions. [2018-10-10 16:27:06,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1403 [2018-10-10 16:27:06,151 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:27:06,152 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-10 16:27:06,152 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:27:06,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:27:06,153 INFO L82 PathProgramCache]: Analyzing trace with hash 995662342, now seen corresponding path program 53 times [2018-10-10 16:27:06,153 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:27:06,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:27:10,916 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-10 16:27:10,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:27:10,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-10-10 16:27:10,917 INFO L460 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-10-10 16:27:10,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-10-10 16:27:10,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3024, Invalid=8748, Unknown=0, NotChecked=0, Total=11772 [2018-10-10 16:27:10,918 INFO L87 Difference]: Start difference. First operand 2155 states and 2209 transitions. Second operand 109 states. [2018-10-10 16:27:18,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:27:18,687 INFO L93 Difference]: Finished difference Result 2248 states and 2304 transitions. [2018-10-10 16:27:18,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2018-10-10 16:27:18,687 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 1402 [2018-10-10 16:27:18,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:27:18,690 INFO L225 Difference]: With dead ends: 2248 [2018-10-10 16:27:18,690 INFO L226 Difference]: Without dead ends: 2248 [2018-10-10 16:27:18,692 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8321 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=14578, Invalid=31432, Unknown=0, NotChecked=0, Total=46010 [2018-10-10 16:27:18,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2248 states. [2018-10-10 16:27:18,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2248 to 2195. [2018-10-10 16:27:18,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2195 states. [2018-10-10 16:27:18,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2195 states to 2195 states and 2250 transitions. [2018-10-10 16:27:18,704 INFO L78 Accepts]: Start accepts. Automaton has 2195 states and 2250 transitions. Word has length 1402 [2018-10-10 16:27:18,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:27:18,704 INFO L481 AbstractCegarLoop]: Abstraction has 2195 states and 2250 transitions. [2018-10-10 16:27:18,705 INFO L482 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-10-10 16:27:18,705 INFO L276 IsEmpty]: Start isEmpty. Operand 2195 states and 2250 transitions. [2018-10-10 16:27:18,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1429 [2018-10-10 16:27:18,717 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:27:18,718 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-10 16:27:18,718 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:27:18,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:27:18,718 INFO L82 PathProgramCache]: Analyzing trace with hash -34850137, now seen corresponding path program 54 times [2018-10-10 16:27:18,719 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:27:18,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:27:23,807 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-10 16:27:23,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:27:23,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-10-10 16:27:23,809 INFO L460 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-10-10 16:27:23,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-10-10 16:27:23,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3135, Invalid=9075, Unknown=0, NotChecked=0, Total=12210 [2018-10-10 16:27:23,810 INFO L87 Difference]: Start difference. First operand 2195 states and 2250 transitions. Second operand 111 states. [2018-10-10 16:27:31,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:27:31,817 INFO L93 Difference]: Finished difference Result 2288 states and 2345 transitions. [2018-10-10 16:27:31,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2018-10-10 16:27:31,818 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 1428 [2018-10-10 16:27:31,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:27:31,821 INFO L225 Difference]: With dead ends: 2288 [2018-10-10 16:27:31,821 INFO L226 Difference]: Without dead ends: 2288 [2018-10-10 16:27:31,823 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8640 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=15123, Invalid=32619, Unknown=0, NotChecked=0, Total=47742 [2018-10-10 16:27:31,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2288 states. [2018-10-10 16:27:31,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2288 to 2235. [2018-10-10 16:27:31,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2235 states. [2018-10-10 16:27:31,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2235 states to 2235 states and 2291 transitions. [2018-10-10 16:27:31,835 INFO L78 Accepts]: Start accepts. Automaton has 2235 states and 2291 transitions. Word has length 1428 [2018-10-10 16:27:31,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:27:31,835 INFO L481 AbstractCegarLoop]: Abstraction has 2235 states and 2291 transitions. [2018-10-10 16:27:31,835 INFO L482 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-10-10 16:27:31,835 INFO L276 IsEmpty]: Start isEmpty. Operand 2235 states and 2291 transitions. [2018-10-10 16:27:31,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1455 [2018-10-10 16:27:31,848 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:27:31,848 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-10 16:27:31,849 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:27:31,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:27:31,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1791794168, now seen corresponding path program 55 times [2018-10-10 16:27:31,850 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:27:31,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:27:36,838 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-10 16:27:36,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:27:36,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-10-10 16:27:36,840 INFO L460 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-10-10 16:27:36,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-10-10 16:27:36,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3248, Invalid=9408, Unknown=0, NotChecked=0, Total=12656 [2018-10-10 16:27:36,841 INFO L87 Difference]: Start difference. First operand 2235 states and 2291 transitions. Second operand 113 states. [2018-10-10 16:27:44,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:27:44,845 INFO L93 Difference]: Finished difference Result 2328 states and 2386 transitions. [2018-10-10 16:27:44,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2018-10-10 16:27:44,845 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 1454 [2018-10-10 16:27:44,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:27:44,849 INFO L225 Difference]: With dead ends: 2328 [2018-10-10 16:27:44,849 INFO L226 Difference]: Without dead ends: 2328 [2018-10-10 16:27:44,852 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8965 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=15678, Invalid=33828, Unknown=0, NotChecked=0, Total=49506 [2018-10-10 16:27:44,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2328 states. [2018-10-10 16:27:44,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2328 to 2275. [2018-10-10 16:27:44,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2275 states. [2018-10-10 16:27:44,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2275 states to 2275 states and 2332 transitions. [2018-10-10 16:27:44,864 INFO L78 Accepts]: Start accepts. Automaton has 2275 states and 2332 transitions. Word has length 1454 [2018-10-10 16:27:44,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:27:44,864 INFO L481 AbstractCegarLoop]: Abstraction has 2275 states and 2332 transitions. [2018-10-10 16:27:44,864 INFO L482 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-10-10 16:27:44,864 INFO L276 IsEmpty]: Start isEmpty. Operand 2275 states and 2332 transitions. [2018-10-10 16:27:44,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1481 [2018-10-10 16:27:44,877 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:27:44,877 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-10 16:27:44,877 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:27:44,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:27:44,878 INFO L82 PathProgramCache]: Analyzing trace with hash -987716055, now seen corresponding path program 56 times [2018-10-10 16:27:44,878 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:27:44,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:27:50,380 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-10 16:27:50,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:27:50,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-10-10 16:27:50,381 INFO L460 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-10-10 16:27:50,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-10-10 16:27:50,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3363, Invalid=9747, Unknown=0, NotChecked=0, Total=13110 [2018-10-10 16:27:50,382 INFO L87 Difference]: Start difference. First operand 2275 states and 2332 transitions. Second operand 115 states. [2018-10-10 16:27:58,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:27:58,599 INFO L93 Difference]: Finished difference Result 2368 states and 2427 transitions. [2018-10-10 16:27:58,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2018-10-10 16:27:58,599 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 1480 [2018-10-10 16:27:58,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:27:58,603 INFO L225 Difference]: With dead ends: 2368 [2018-10-10 16:27:58,603 INFO L226 Difference]: Without dead ends: 2368 [2018-10-10 16:27:58,607 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9296 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=16243, Invalid=35059, Unknown=0, NotChecked=0, Total=51302 [2018-10-10 16:27:58,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2368 states. [2018-10-10 16:27:58,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2368 to 2315. [2018-10-10 16:27:58,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2315 states. [2018-10-10 16:27:58,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2315 states to 2315 states and 2373 transitions. [2018-10-10 16:27:58,620 INFO L78 Accepts]: Start accepts. Automaton has 2315 states and 2373 transitions. Word has length 1480 [2018-10-10 16:27:58,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:27:58,620 INFO L481 AbstractCegarLoop]: Abstraction has 2315 states and 2373 transitions. [2018-10-10 16:27:58,620 INFO L482 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-10-10 16:27:58,621 INFO L276 IsEmpty]: Start isEmpty. Operand 2315 states and 2373 transitions. [2018-10-10 16:27:58,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1507 [2018-10-10 16:27:58,634 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:27:58,635 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-10 16:27:58,635 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:27:58,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:27:58,635 INFO L82 PathProgramCache]: Analyzing trace with hash 9605386, now seen corresponding path program 57 times [2018-10-10 16:27:58,636 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:27:58,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:28:04,413 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-10 16:28:04,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:28:04,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-10-10 16:28:04,415 INFO L460 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-10-10 16:28:04,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-10-10 16:28:04,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3480, Invalid=10092, Unknown=0, NotChecked=0, Total=13572 [2018-10-10 16:28:04,416 INFO L87 Difference]: Start difference. First operand 2315 states and 2373 transitions. Second operand 117 states. [2018-10-10 16:28:13,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:28:13,150 INFO L93 Difference]: Finished difference Result 2408 states and 2468 transitions. [2018-10-10 16:28:13,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2018-10-10 16:28:13,151 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 1506 [2018-10-10 16:28:13,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:28:13,154 INFO L225 Difference]: With dead ends: 2408 [2018-10-10 16:28:13,154 INFO L226 Difference]: Without dead ends: 2408 [2018-10-10 16:28:13,156 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9633 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=16818, Invalid=36312, Unknown=0, NotChecked=0, Total=53130 [2018-10-10 16:28:13,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2408 states. [2018-10-10 16:28:13,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2408 to 2355. [2018-10-10 16:28:13,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2355 states. [2018-10-10 16:28:13,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2355 states to 2355 states and 2414 transitions. [2018-10-10 16:28:13,169 INFO L78 Accepts]: Start accepts. Automaton has 2355 states and 2414 transitions. Word has length 1506 [2018-10-10 16:28:13,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:28:13,169 INFO L481 AbstractCegarLoop]: Abstraction has 2355 states and 2414 transitions. [2018-10-10 16:28:13,170 INFO L482 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-10-10 16:28:13,170 INFO L276 IsEmpty]: Start isEmpty. Operand 2355 states and 2414 transitions. [2018-10-10 16:28:13,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1533 [2018-10-10 16:28:13,184 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:28:13,185 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-10 16:28:13,185 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:28:13,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:28:13,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1515435179, now seen corresponding path program 58 times [2018-10-10 16:28:13,186 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:28:13,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:28:18,829 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-10 16:28:18,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:28:18,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-10-10 16:28:18,830 INFO L460 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-10-10 16:28:18,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-10-10 16:28:18,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3599, Invalid=10443, Unknown=0, NotChecked=0, Total=14042 [2018-10-10 16:28:18,831 INFO L87 Difference]: Start difference. First operand 2355 states and 2414 transitions. Second operand 119 states. [2018-10-10 16:28:27,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:28:27,555 INFO L93 Difference]: Finished difference Result 2448 states and 2509 transitions. [2018-10-10 16:28:27,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2018-10-10 16:28:27,556 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 1532 [2018-10-10 16:28:27,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:28:27,559 INFO L225 Difference]: With dead ends: 2448 [2018-10-10 16:28:27,559 INFO L226 Difference]: Without dead ends: 2448 [2018-10-10 16:28:27,562 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9976 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=17403, Invalid=37587, Unknown=0, NotChecked=0, Total=54990 [2018-10-10 16:28:27,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2448 states. [2018-10-10 16:28:27,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2448 to 2395. [2018-10-10 16:28:27,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2395 states. [2018-10-10 16:28:27,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2395 states to 2395 states and 2455 transitions. [2018-10-10 16:28:27,574 INFO L78 Accepts]: Start accepts. Automaton has 2395 states and 2455 transitions. Word has length 1532 [2018-10-10 16:28:27,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:28:27,575 INFO L481 AbstractCegarLoop]: Abstraction has 2395 states and 2455 transitions. [2018-10-10 16:28:27,575 INFO L482 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-10-10 16:28:27,575 INFO L276 IsEmpty]: Start isEmpty. Operand 2395 states and 2455 transitions. [2018-10-10 16:28:27,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1559 [2018-10-10 16:28:27,590 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:28:27,591 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-10 16:28:27,591 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:28:27,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:28:27,592 INFO L82 PathProgramCache]: Analyzing trace with hash 907714828, now seen corresponding path program 59 times [2018-10-10 16:28:27,592 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:28:27,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:28:33,478 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-10 16:28:33,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:28:33,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-10-10 16:28:33,480 INFO L460 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-10-10 16:28:33,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-10-10 16:28:33,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3720, Invalid=10800, Unknown=0, NotChecked=0, Total=14520 [2018-10-10 16:28:33,481 INFO L87 Difference]: Start difference. First operand 2395 states and 2455 transitions. Second operand 121 states. [2018-10-10 16:28:42,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:28:42,413 INFO L93 Difference]: Finished difference Result 2488 states and 2550 transitions. [2018-10-10 16:28:42,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2018-10-10 16:28:42,413 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 1558 [2018-10-10 16:28:42,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:28:42,417 INFO L225 Difference]: With dead ends: 2488 [2018-10-10 16:28:42,417 INFO L226 Difference]: Without dead ends: 2488 [2018-10-10 16:28:42,420 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10325 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=17998, Invalid=38884, Unknown=0, NotChecked=0, Total=56882 [2018-10-10 16:28:42,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2488 states. [2018-10-10 16:28:42,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2488 to 2435. [2018-10-10 16:28:42,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2435 states. [2018-10-10 16:28:42,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2435 states to 2435 states and 2496 transitions. [2018-10-10 16:28:42,433 INFO L78 Accepts]: Start accepts. Automaton has 2435 states and 2496 transitions. Word has length 1558 [2018-10-10 16:28:42,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:28:42,433 INFO L481 AbstractCegarLoop]: Abstraction has 2435 states and 2496 transitions. [2018-10-10 16:28:42,434 INFO L482 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-10-10 16:28:42,434 INFO L276 IsEmpty]: Start isEmpty. Operand 2435 states and 2496 transitions. [2018-10-10 16:28:42,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1585 [2018-10-10 16:28:42,447 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:28:42,448 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-10 16:28:42,448 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:28:42,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:28:42,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1182144979, now seen corresponding path program 60 times [2018-10-10 16:28:42,449 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:28:42,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:28:48,766 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-10 16:28:48,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:28:48,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-10-10 16:28:48,768 INFO L460 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-10-10 16:28:48,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-10-10 16:28:48,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3843, Invalid=11163, Unknown=0, NotChecked=0, Total=15006 [2018-10-10 16:28:48,769 INFO L87 Difference]: Start difference. First operand 2435 states and 2496 transitions. Second operand 123 states. [2018-10-10 16:28:57,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:28:57,982 INFO L93 Difference]: Finished difference Result 2528 states and 2591 transitions. [2018-10-10 16:28:57,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2018-10-10 16:28:57,983 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 1584 [2018-10-10 16:28:57,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:28:57,986 INFO L225 Difference]: With dead ends: 2528 [2018-10-10 16:28:57,986 INFO L226 Difference]: Without dead ends: 2528 [2018-10-10 16:28:57,989 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10680 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=18603, Invalid=40203, Unknown=0, NotChecked=0, Total=58806 [2018-10-10 16:28:57,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2528 states. [2018-10-10 16:28:58,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2528 to 2475. [2018-10-10 16:28:58,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2475 states. [2018-10-10 16:28:58,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2475 states to 2475 states and 2537 transitions. [2018-10-10 16:28:58,003 INFO L78 Accepts]: Start accepts. Automaton has 2475 states and 2537 transitions. Word has length 1584 [2018-10-10 16:28:58,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:28:58,004 INFO L481 AbstractCegarLoop]: Abstraction has 2475 states and 2537 transitions. [2018-10-10 16:28:58,004 INFO L482 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-10-10 16:28:58,004 INFO L276 IsEmpty]: Start isEmpty. Operand 2475 states and 2537 transitions. [2018-10-10 16:28:58,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1611 [2018-10-10 16:28:58,019 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:28:58,020 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-10 16:28:58,020 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:28:58,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:28:58,020 INFO L82 PathProgramCache]: Analyzing trace with hash -47180786, now seen corresponding path program 61 times [2018-10-10 16:28:58,021 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:28:58,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:29:04,364 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-10 16:29:04,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:29:04,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-10-10 16:29:04,365 INFO L460 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-10-10 16:29:04,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-10-10 16:29:04,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3968, Invalid=11532, Unknown=0, NotChecked=0, Total=15500 [2018-10-10 16:29:04,366 INFO L87 Difference]: Start difference. First operand 2475 states and 2537 transitions. Second operand 125 states. [2018-10-10 16:29:14,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:29:14,063 INFO L93 Difference]: Finished difference Result 2568 states and 2632 transitions. [2018-10-10 16:29:14,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 186 states. [2018-10-10 16:29:14,064 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 1610 [2018-10-10 16:29:14,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:29:14,067 INFO L225 Difference]: With dead ends: 2568 [2018-10-10 16:29:14,067 INFO L226 Difference]: Without dead ends: 2568 [2018-10-10 16:29:14,069 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11041 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=19218, Invalid=41544, Unknown=0, NotChecked=0, Total=60762 [2018-10-10 16:29:14,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2568 states. [2018-10-10 16:29:14,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2568 to 2515. [2018-10-10 16:29:14,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2515 states. [2018-10-10 16:29:14,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2515 states to 2515 states and 2578 transitions. [2018-10-10 16:29:14,081 INFO L78 Accepts]: Start accepts. Automaton has 2515 states and 2578 transitions. Word has length 1610 [2018-10-10 16:29:14,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:29:14,082 INFO L481 AbstractCegarLoop]: Abstraction has 2515 states and 2578 transitions. [2018-10-10 16:29:14,082 INFO L482 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-10-10 16:29:14,082 INFO L276 IsEmpty]: Start isEmpty. Operand 2515 states and 2578 transitions. [2018-10-10 16:29:14,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1637 [2018-10-10 16:29:14,096 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:29:14,097 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-10 16:29:14,097 INFO L424 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:29:14,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:29:14,098 INFO L82 PathProgramCache]: Analyzing trace with hash -41436497, now seen corresponding path program 62 times [2018-10-10 16:29:14,098 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:29:14,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:29:20,453 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-10 16:29:20,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:29:20,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-10-10 16:29:20,455 INFO L460 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-10-10 16:29:20,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-10-10 16:29:20,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=11907, Unknown=0, NotChecked=0, Total=16002 [2018-10-10 16:29:20,456 INFO L87 Difference]: Start difference. First operand 2515 states and 2578 transitions. Second operand 127 states. [2018-10-10 16:29:31,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:29:31,567 INFO L93 Difference]: Finished difference Result 2608 states and 2673 transitions. [2018-10-10 16:29:31,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 189 states. [2018-10-10 16:29:31,567 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 1636 [2018-10-10 16:29:31,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:29:31,571 INFO L225 Difference]: With dead ends: 2608 [2018-10-10 16:29:31,571 INFO L226 Difference]: Without dead ends: 2608 [2018-10-10 16:29:31,573 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11408 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=19843, Invalid=42907, Unknown=0, NotChecked=0, Total=62750 [2018-10-10 16:29:31,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2608 states. [2018-10-10 16:29:31,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2608 to 2555. [2018-10-10 16:29:31,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2555 states. [2018-10-10 16:29:31,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2555 states to 2555 states and 2619 transitions. [2018-10-10 16:29:31,585 INFO L78 Accepts]: Start accepts. Automaton has 2555 states and 2619 transitions. Word has length 1636 [2018-10-10 16:29:31,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:29:31,586 INFO L481 AbstractCegarLoop]: Abstraction has 2555 states and 2619 transitions. [2018-10-10 16:29:31,586 INFO L482 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-10-10 16:29:31,586 INFO L276 IsEmpty]: Start isEmpty. Operand 2555 states and 2619 transitions. [2018-10-10 16:29:31,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1663 [2018-10-10 16:29:31,600 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:29:31,601 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-10 16:29:31,601 INFO L424 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:29:31,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:29:31,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1274505744, now seen corresponding path program 63 times [2018-10-10 16:29:31,602 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:29:31,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:29:38,420 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-10 16:29:38,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:29:38,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-10-10 16:29:38,422 INFO L460 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-10-10 16:29:38,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-10-10 16:29:38,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4224, Invalid=12288, Unknown=0, NotChecked=0, Total=16512 [2018-10-10 16:29:38,423 INFO L87 Difference]: Start difference. First operand 2555 states and 2619 transitions. Second operand 129 states. [2018-10-10 16:29:49,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:29:49,105 INFO L93 Difference]: Finished difference Result 2648 states and 2714 transitions. [2018-10-10 16:29:49,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2018-10-10 16:29:49,105 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 1662 [2018-10-10 16:29:49,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:29:49,110 INFO L225 Difference]: With dead ends: 2648 [2018-10-10 16:29:49,110 INFO L226 Difference]: Without dead ends: 2648 [2018-10-10 16:29:49,114 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-10 16:29:49,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2648 states. [2018-10-10 16:29:49,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2648 to 2595. [2018-10-10 16:29:49,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2595 states. [2018-10-10 16:29:49,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2595 states to 2595 states and 2660 transitions. [2018-10-10 16:29:49,130 INFO L78 Accepts]: Start accepts. Automaton has 2595 states and 2660 transitions. Word has length 1662 [2018-10-10 16:29:49,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:29:49,132 INFO L481 AbstractCegarLoop]: Abstraction has 2595 states and 2660 transitions. [2018-10-10 16:29:49,132 INFO L482 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-10-10 16:29:49,132 INFO L276 IsEmpty]: Start isEmpty. Operand 2595 states and 2660 transitions. [2018-10-10 16:29:49,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1689 [2018-10-10 16:29:49,149 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:29:49,149 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-10 16:29:49,150 INFO L424 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:29:49,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:29:49,150 INFO L82 PathProgramCache]: Analyzing trace with hash 2144449073, now seen corresponding path program 64 times [2018-10-10 16:29:49,151 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:29:49,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:29:56,274 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-10 16:29:56,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:29:56,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-10-10 16:29:56,276 INFO L460 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-10-10 16:29:56,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-10-10 16:29:56,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4355, Invalid=12675, Unknown=0, NotChecked=0, Total=17030 [2018-10-10 16:29:56,277 INFO L87 Difference]: Start difference. First operand 2595 states and 2660 transitions. Second operand 131 states. [2018-10-10 16:30:07,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:30:07,826 INFO L93 Difference]: Finished difference Result 2688 states and 2755 transitions. [2018-10-10 16:30:07,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2018-10-10 16:30:07,826 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 1688 [2018-10-10 16:30:07,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:30:07,831 INFO L225 Difference]: With dead ends: 2688 [2018-10-10 16:30:07,831 INFO L226 Difference]: Without dead ends: 2688 [2018-10-10 16:30:07,836 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-10 16:30:07,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2688 states. [2018-10-10 16:30:07,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2688 to 2635. [2018-10-10 16:30:07,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2635 states. [2018-10-10 16:30:07,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2635 states to 2635 states and 2701 transitions. [2018-10-10 16:30:07,852 INFO L78 Accepts]: Start accepts. Automaton has 2635 states and 2701 transitions. Word has length 1688 [2018-10-10 16:30:07,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:30:07,853 INFO L481 AbstractCegarLoop]: Abstraction has 2635 states and 2701 transitions. [2018-10-10 16:30:07,854 INFO L482 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-10-10 16:30:07,854 INFO L276 IsEmpty]: Start isEmpty. Operand 2635 states and 2701 transitions. [2018-10-10 16:30:07,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1715 [2018-10-10 16:30:07,872 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:30:07,873 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-10 16:30:07,873 INFO L424 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:30:07,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:30:07,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1733632786, now seen corresponding path program 65 times [2018-10-10 16:30:07,874 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:30:07,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:30:15,153 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-10 16:30:15,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:30:15,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-10-10 16:30:15,155 INFO L460 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-10-10 16:30:15,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-10-10 16:30:15,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4488, Invalid=13068, Unknown=0, NotChecked=0, Total=17556 [2018-10-10 16:30:15,156 INFO L87 Difference]: Start difference. First operand 2635 states and 2701 transitions. Second operand 133 states. [2018-10-10 16:30:27,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:30:27,181 INFO L93 Difference]: Finished difference Result 2728 states and 2796 transitions. [2018-10-10 16:30:27,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 198 states. [2018-10-10 16:30:27,181 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 1714 [2018-10-10 16:30:27,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:30:27,186 INFO L225 Difference]: With dead ends: 2728 [2018-10-10 16:30:27,186 INFO L226 Difference]: Without dead ends: 2728 [2018-10-10 16:30:27,190 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12545 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=21778, Invalid=47128, Unknown=0, NotChecked=0, Total=68906 [2018-10-10 16:30:27,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2728 states. [2018-10-10 16:30:27,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2728 to 2675. [2018-10-10 16:30:27,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2675 states. [2018-10-10 16:30:27,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2675 states to 2675 states and 2742 transitions. [2018-10-10 16:30:27,206 INFO L78 Accepts]: Start accepts. Automaton has 2675 states and 2742 transitions. Word has length 1714 [2018-10-10 16:30:27,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:30:27,207 INFO L481 AbstractCegarLoop]: Abstraction has 2675 states and 2742 transitions. [2018-10-10 16:30:27,207 INFO L482 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-10-10 16:30:27,207 INFO L276 IsEmpty]: Start isEmpty. Operand 2675 states and 2742 transitions. [2018-10-10 16:30:27,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1741 [2018-10-10 16:30:27,224 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:30:27,224 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-10 16:30:27,225 INFO L424 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:30:27,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:30:27,225 INFO L82 PathProgramCache]: Analyzing trace with hash -122925901, now seen corresponding path program 66 times [2018-10-10 16:30:27,226 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:30:27,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:30:34,729 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-10 16:30:34,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:30:34,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-10-10 16:30:34,730 INFO L460 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-10-10 16:30:34,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-10-10 16:30:34,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4623, Invalid=13467, Unknown=0, NotChecked=0, Total=18090 [2018-10-10 16:30:34,732 INFO L87 Difference]: Start difference. First operand 2675 states and 2742 transitions. Second operand 135 states. [2018-10-10 16:30:47,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:30:47,581 INFO L93 Difference]: Finished difference Result 2768 states and 2837 transitions. [2018-10-10 16:30:47,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2018-10-10 16:30:47,581 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 1740 [2018-10-10 16:30:47,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:30:47,584 INFO L225 Difference]: With dead ends: 2768 [2018-10-10 16:30:47,584 INFO L226 Difference]: Without dead ends: 2768 [2018-10-10 16:30:47,587 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12936 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=22443, Invalid=48579, Unknown=0, NotChecked=0, Total=71022 [2018-10-10 16:30:47,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2768 states. [2018-10-10 16:30:47,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2768 to 2715. [2018-10-10 16:30:47,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2715 states. [2018-10-10 16:30:47,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2715 states to 2715 states and 2783 transitions. [2018-10-10 16:30:47,604 INFO L78 Accepts]: Start accepts. Automaton has 2715 states and 2783 transitions. Word has length 1740 [2018-10-10 16:30:47,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:30:47,605 INFO L481 AbstractCegarLoop]: Abstraction has 2715 states and 2783 transitions. [2018-10-10 16:30:47,605 INFO L482 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-10-10 16:30:47,605 INFO L276 IsEmpty]: Start isEmpty. Operand 2715 states and 2783 transitions. [2018-10-10 16:30:47,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1767 [2018-10-10 16:30:47,627 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:30:47,628 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-10 16:30:47,628 INFO L424 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:30:47,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:30:47,629 INFO L82 PathProgramCache]: Analyzing trace with hash 49135380, now seen corresponding path program 67 times [2018-10-10 16:30:47,629 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:30:47,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:30:55,225 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-10 16:30:55,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:30:55,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2018-10-10 16:30:55,227 INFO L460 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-10-10 16:30:55,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-10-10 16:30:55,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4760, Invalid=13872, Unknown=0, NotChecked=0, Total=18632 [2018-10-10 16:30:55,228 INFO L87 Difference]: Start difference. First operand 2715 states and 2783 transitions. Second operand 137 states. [2018-10-10 16:31:08,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:31:08,351 INFO L93 Difference]: Finished difference Result 2808 states and 2878 transitions. [2018-10-10 16:31:08,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 204 states. [2018-10-10 16:31:08,351 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 1766 [2018-10-10 16:31:08,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:31:08,355 INFO L225 Difference]: With dead ends: 2808 [2018-10-10 16:31:08,355 INFO L226 Difference]: Without dead ends: 2808 [2018-10-10 16:31:08,358 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13333 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=23118, Invalid=50052, Unknown=0, NotChecked=0, Total=73170 [2018-10-10 16:31:08,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2808 states. [2018-10-10 16:31:08,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2808 to 2755. [2018-10-10 16:31:08,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2755 states. [2018-10-10 16:31:08,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2755 states to 2755 states and 2824 transitions. [2018-10-10 16:31:08,371 INFO L78 Accepts]: Start accepts. Automaton has 2755 states and 2824 transitions. Word has length 1766 [2018-10-10 16:31:08,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:31:08,372 INFO L481 AbstractCegarLoop]: Abstraction has 2755 states and 2824 transitions. [2018-10-10 16:31:08,372 INFO L482 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-10-10 16:31:08,372 INFO L276 IsEmpty]: Start isEmpty. Operand 2755 states and 2824 transitions. [2018-10-10 16:31:08,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1793 [2018-10-10 16:31:08,390 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:31:08,391 INFO L375 BasicCegarLoop]: trace histogram [68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:31:08,391 INFO L424 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:31:08,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:31:08,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1625552331, now seen corresponding path program 68 times [2018-10-10 16:31:08,392 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:31:08,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:31:16,242 INFO L134 CoverageAnalysis]: Checked inductivity of 59296 backedges. 0 proven. 59296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:31:16,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:31:16,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2018-10-10 16:31:16,244 INFO L460 AbstractCegarLoop]: Interpolant automaton has 139 states [2018-10-10 16:31:16,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2018-10-10 16:31:16,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4899, Invalid=14283, Unknown=0, NotChecked=0, Total=19182 [2018-10-10 16:31:16,245 INFO L87 Difference]: Start difference. First operand 2755 states and 2824 transitions. Second operand 139 states.