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/ArraysOfVariableLength2_true-valid-memsafety.c_16.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-b8f97f7-m [2018-10-10 16:21:11,217 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 16:21:11,219 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 16:21:11,234 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 16:21:11,234 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 16:21:11,236 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 16:21:11,237 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 16:21:11,239 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 16:21:11,240 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 16:21:11,241 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 16:21:11,242 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 16:21:11,242 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 16:21:11,244 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 16:21:11,246 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 16:21:11,249 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 16:21:11,250 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 16:21:11,251 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 16:21:11,258 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 16:21:11,260 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 16:21:11,262 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 16:21:11,266 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 16:21:11,267 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 16:21:11,273 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 16:21:11,275 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 16:21:11,275 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 16:21:11,276 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 16:21:11,277 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 16:21:11,278 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 16:21:11,278 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 16:21:11,281 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 16:21:11,282 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 16:21:11,284 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 16:21:11,284 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 16:21:11,284 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 16:21:11,288 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 16:21:11,288 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 16:21:11,289 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:21:11,306 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 16:21:11,306 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 16:21:11,308 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-10 16:21:11,308 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-10 16:21:11,308 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-10 16:21:11,308 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-10 16:21:11,309 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 16:21:11,309 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-10 16:21:11,310 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 16:21:11,311 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-10 16:21:11,311 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-10 16:21:11,311 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-10 16:21:11,311 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-10 16:21:11,312 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-10 16:21:11,312 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-10 16:21:11,367 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 16:21:11,383 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 16:21:11,388 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 16:21:11,390 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-10 16:21:11,391 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-10 16:21:11,391 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysOfVariableLength2_true-valid-memsafety.c_16.bpl [2018-10-10 16:21:11,392 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysOfVariableLength2_true-valid-memsafety.c_16.bpl' [2018-10-10 16:21:11,456 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 16:21:11,460 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-10 16:21:11,461 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 16:21:11,461 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 16:21:11,461 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 16:21:11,487 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:21:11" (1/1) ... [2018-10-10 16:21:11,489 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:21:11" (1/1) ... [2018-10-10 16:21:11,512 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:21:11" (1/1) ... [2018-10-10 16:21:11,512 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:21:11" (1/1) ... [2018-10-10 16:21:11,525 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:21:11" (1/1) ... [2018-10-10 16:21:11,534 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:21:11" (1/1) ... [2018-10-10 16:21:11,536 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:21:11" (1/1) ... [2018-10-10 16:21:11,543 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 16:21:11,545 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 16:21:11,546 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 16:21:11,546 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 16:21:11,548 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArraysOfVariableLength2_true-valid-memsafety.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:21:11" (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:21:11,622 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-10 16:21:11,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 16:21:11,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 16:21:12,302 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 16:21:12,303 INFO L202 PluginConnector]: Adding new model ArraysOfVariableLength2_true-valid-memsafety.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 04:21:12 BoogieIcfgContainer [2018-10-10 16:21:12,303 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 16:21:12,303 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-10 16:21:12,303 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-10 16:21:12,304 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-10 16:21:12,308 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "ArraysOfVariableLength2_true-valid-memsafety.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 04:21:12" (1/1) ... [2018-10-10 16:21:12,315 INFO L137 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-10-10 16:21:12,315 INFO L138 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-10-10 16:21:12,359 INFO L191 apSepIcfgTransformer]: Heap separator: starting loc-array-style preprocessing [2018-10-10 16:21:12,406 INFO L217 apSepIcfgTransformer]: finished MemlocArrayUpdater [2018-10-10 16:21:12,422 INFO L280 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-10-10 16:21:12,489 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=1) [2018-10-10 16:22:12,949 INFO L315 AbstractInterpreter]: Visited 110 different actions 480 times. Merged at 91 different actions 357 times. Widened at 6 different actions 9 times. Found 11 fixpoints after 6 different actions. Largest state had 0 variables. [2018-10-10 16:22:12,952 INFO L304 apSepIcfgTransformer]: finished equality analysis [2018-10-10 16:22:12,959 INFO L316 apSepIcfgTransformer]: Finished detection of select terms ("array reads") [2018-10-10 16:22:13,009 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:13,019 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_6|) at (assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value;) [2018-10-10 16:22:13,020 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_6|) |v_ULTIMATE.start_read~int_#ptr.offset_4|) at (assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value;) [2018-10-10 16:22:13,022 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:13,023 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:13,054 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select |v_#locv_ULTIMATE.start_write~int_old_#memory_int_4_1_1| |v_ULTIMATE.start_write~int_#ptr.base_12|) at (assume write~int_old_#memory_int[write~int_#ptr.base := write~int_old_#memory_int[write~int_#ptr.base][write~int_#ptr.offset := write~int_#value]] == #memory_int;) [2018-10-10 16:22:13,055 INFO L232 HeapPartitionManager]: partitioning result: [2018-10-10 16:22:13,056 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-10 16:22:13,056 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-10 16:22:13,056 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 2 [2018-10-10 16:22:13,056 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-10 16:22:13,057 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-10 16:22:13,057 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 2 [2018-10-10 16:22:13,057 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-10 16:22:13,057 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-10 16:22:13,057 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-10 16:22:13,057 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 2 [2018-10-10 16:22:13,058 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-10 16:22:13,058 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-10 16:22:13,058 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 2 [2018-10-10 16:22:13,058 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-10 16:22:13,060 INFO L145 ransitionTransformer]: executing heap partitioning transformation [2018-10-10 16:22:13,099 INFO L202 PluginConnector]: Adding new model ArraysOfVariableLength2_true-valid-memsafety.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.10 04:22:13 BasicIcfg [2018-10-10 16:22:13,100 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-10 16:22:13,101 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 16:22:13,101 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 16:22:13,107 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 16:22:13,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength2_true-valid-memsafety.c_16.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:21:11" (1/3) ... [2018-10-10 16:22:13,111 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f398dc and model type ArraysOfVariableLength2_true-valid-memsafety.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 04:22:13, skipping insertion in model container [2018-10-10 16:22:13,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength2_true-valid-memsafety.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 04:21:12" (2/3) ... [2018-10-10 16:22:13,112 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f398dc and model type ArraysOfVariableLength2_true-valid-memsafety.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 04:22:13, skipping insertion in model container [2018-10-10 16:22:13,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength2_true-valid-memsafety.c_16.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.10 04:22:13" (3/3) ... [2018-10-10 16:22:13,115 INFO L112 eAbstractionObserver]: Analyzing ICFG memPartitionedIcfg [2018-10-10 16:22:13,125 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-10 16:22:13,134 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-10 16:22:13,151 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-10 16:22:13,175 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 16:22:13,176 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 16:22:13,176 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 16:22:13,176 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-10 16:22:13,176 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 16:22:13,176 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 16:22:13,176 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 16:22:13,177 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 16:22:13,177 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 16:22:13,189 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states. [2018-10-10 16:22:13,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-10 16:22:13,196 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:13,198 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:13,199 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:13,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:13,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1384560059, now seen corresponding path program 1 times [2018-10-10 16:22:13,254 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:13,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:13,727 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:13,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 16:22:13,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 16:22:13,734 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 16:22:13,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 16:22:13,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-10 16:22:13,879 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 8 states. [2018-10-10 16:22:14,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:14,419 INFO L93 Difference]: Finished difference Result 223 states and 227 transitions. [2018-10-10 16:22:14,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-10 16:22:14,421 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2018-10-10 16:22:14,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:14,441 INFO L225 Difference]: With dead ends: 223 [2018-10-10 16:22:14,441 INFO L226 Difference]: Without dead ends: 223 [2018-10-10 16:22:14,449 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2018-10-10 16:22:14,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-10-10 16:22:14,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 155. [2018-10-10 16:22:14,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-10-10 16:22:14,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 158 transitions. [2018-10-10 16:22:14,529 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 158 transitions. Word has length 50 [2018-10-10 16:22:14,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:14,530 INFO L481 AbstractCegarLoop]: Abstraction has 155 states and 158 transitions. [2018-10-10 16:22:14,530 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 16:22:14,530 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 158 transitions. [2018-10-10 16:22:14,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-10-10 16:22:14,540 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:14,540 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:22:14,540 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:14,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:14,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1647669911, now seen corresponding path program 1 times [2018-10-10 16:22:14,542 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:14,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:14,831 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 9 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:22:14,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:14,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-10 16:22:14,833 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 16:22:14,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 16:22:14,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-10 16:22:14,835 INFO L87 Difference]: Start difference. First operand 155 states and 158 transitions. Second operand 8 states. [2018-10-10 16:22:15,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:15,639 INFO L93 Difference]: Finished difference Result 293 states and 298 transitions. [2018-10-10 16:22:15,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 16:22:15,645 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 104 [2018-10-10 16:22:15,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:15,649 INFO L225 Difference]: With dead ends: 293 [2018-10-10 16:22:15,650 INFO L226 Difference]: Without dead ends: 293 [2018-10-10 16:22:15,652 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-10-10 16:22:15,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-10-10 16:22:15,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 200. [2018-10-10 16:22:15,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-10-10 16:22:15,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 203 transitions. [2018-10-10 16:22:15,675 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 203 transitions. Word has length 104 [2018-10-10 16:22:15,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:15,676 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 203 transitions. [2018-10-10 16:22:15,676 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 16:22:15,676 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 203 transitions. [2018-10-10 16:22:15,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-10 16:22:15,683 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:15,683 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15,684 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:15,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:15,684 INFO L82 PathProgramCache]: Analyzing trace with hash -961609495, now seen corresponding path program 1 times [2018-10-10 16:22:15,685 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:15,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:16,238 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:22:16,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:16,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-10 16:22:16,239 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-10 16:22:16,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-10 16:22:16,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2018-10-10 16:22:16,240 INFO L87 Difference]: Start difference. First operand 200 states and 203 transitions. Second operand 18 states. [2018-10-10 16:22:17,173 WARN L178 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-10-10 16:22:18,788 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-10-10 16:22:19,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:19,651 INFO L93 Difference]: Finished difference Result 448 states and 457 transitions. [2018-10-10 16:22:19,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-10 16:22:19,652 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 125 [2018-10-10 16:22:19,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:19,657 INFO L225 Difference]: With dead ends: 448 [2018-10-10 16:22:19,658 INFO L226 Difference]: Without dead ends: 448 [2018-10-10 16:22:19,659 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=811, Invalid=2611, Unknown=0, NotChecked=0, Total=3422 [2018-10-10 16:22:19,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2018-10-10 16:22:19,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 233. [2018-10-10 16:22:19,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-10-10 16:22:19,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 238 transitions. [2018-10-10 16:22:19,678 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 238 transitions. Word has length 125 [2018-10-10 16:22:19,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:19,679 INFO L481 AbstractCegarLoop]: Abstraction has 233 states and 238 transitions. [2018-10-10 16:22:19,679 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-10 16:22:19,679 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 238 transitions. [2018-10-10 16:22:19,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-10 16:22:19,686 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:19,688 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19,688 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:19,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:19,688 INFO L82 PathProgramCache]: Analyzing trace with hash -393191757, now seen corresponding path program 1 times [2018-10-10 16:22:19,691 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:19,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:19,920 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-10-10 16:22:19,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:19,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-10 16:22:19,921 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-10 16:22:19,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-10 16:22:19,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-10-10 16:22:19,922 INFO L87 Difference]: Start difference. First operand 233 states and 238 transitions. Second operand 11 states. [2018-10-10 16:22:20,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:20,867 INFO L93 Difference]: Finished difference Result 864 states and 885 transitions. [2018-10-10 16:22:20,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-10 16:22:20,868 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 139 [2018-10-10 16:22:20,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:20,873 INFO L225 Difference]: With dead ends: 864 [2018-10-10 16:22:20,873 INFO L226 Difference]: Without dead ends: 864 [2018-10-10 16:22:20,875 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 692 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=499, Invalid=1853, Unknown=0, NotChecked=0, Total=2352 [2018-10-10 16:22:20,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2018-10-10 16:22:20,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 311. [2018-10-10 16:22:20,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-10-10 16:22:20,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 322 transitions. [2018-10-10 16:22:20,889 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 322 transitions. Word has length 139 [2018-10-10 16:22:20,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:20,889 INFO L481 AbstractCegarLoop]: Abstraction has 311 states and 322 transitions. [2018-10-10 16:22:20,890 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-10 16:22:20,890 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 322 transitions. [2018-10-10 16:22:20,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-10 16:22:20,892 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:20,892 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20,892 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:20,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:20,893 INFO L82 PathProgramCache]: Analyzing trace with hash -151249119, now seen corresponding path program 2 times [2018-10-10 16:22:20,894 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:20,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:21,211 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 33 proven. 22 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-10 16:22:21,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:21,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-10 16:22:21,212 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 16:22:21,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 16:22:21,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-10-10 16:22:21,212 INFO L87 Difference]: Start difference. First operand 311 states and 322 transitions. Second operand 10 states. [2018-10-10 16:22:21,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:21,666 INFO L93 Difference]: Finished difference Result 357 states and 365 transitions. [2018-10-10 16:22:21,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-10 16:22:21,667 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 160 [2018-10-10 16:22:21,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:21,669 INFO L225 Difference]: With dead ends: 357 [2018-10-10 16:22:21,670 INFO L226 Difference]: Without dead ends: 357 [2018-10-10 16:22:21,670 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=254, Invalid=616, Unknown=0, NotChecked=0, Total=870 [2018-10-10 16:22:21,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2018-10-10 16:22:21,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 279. [2018-10-10 16:22:21,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-10-10 16:22:21,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 287 transitions. [2018-10-10 16:22:21,678 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 287 transitions. Word has length 160 [2018-10-10 16:22:21,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:21,679 INFO L481 AbstractCegarLoop]: Abstraction has 279 states and 287 transitions. [2018-10-10 16:22:21,679 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 16:22:21,679 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 287 transitions. [2018-10-10 16:22:21,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-10 16:22:21,681 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:21,682 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, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:22:21,682 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:21,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:21,682 INFO L82 PathProgramCache]: Analyzing trace with hash -800242117, now seen corresponding path program 2 times [2018-10-10 16:22:21,683 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:21,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:21,841 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 84 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-10 16:22:21,841 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:21,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-10 16:22:21,841 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 16:22:21,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 16:22:21,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-10-10 16:22:21,842 INFO L87 Difference]: Start difference. First operand 279 states and 287 transitions. Second operand 10 states. [2018-10-10 16:22:22,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:22,135 INFO L93 Difference]: Finished difference Result 383 states and 393 transitions. [2018-10-10 16:22:22,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-10 16:22:22,138 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 179 [2018-10-10 16:22:22,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:22,140 INFO L225 Difference]: With dead ends: 383 [2018-10-10 16:22:22,140 INFO L226 Difference]: Without dead ends: 383 [2018-10-10 16:22:22,143 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2018-10-10 16:22:22,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2018-10-10 16:22:22,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 279. [2018-10-10 16:22:22,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-10-10 16:22:22,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 286 transitions. [2018-10-10 16:22:22,149 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 286 transitions. Word has length 179 [2018-10-10 16:22:22,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:22,150 INFO L481 AbstractCegarLoop]: Abstraction has 279 states and 286 transitions. [2018-10-10 16:22:22,150 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 16:22:22,150 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 286 transitions. [2018-10-10 16:22:22,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-10-10 16:22:22,153 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:22,153 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, 3, 3, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:22:22,153 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:22,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:22,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1592928389, now seen corresponding path program 3 times [2018-10-10 16:22:22,155 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:22,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:23,044 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 25 proven. 94 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-10 16:22:23,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:23,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-10 16:22:23,046 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 16:22:23,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 16:22:23,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-10-10 16:22:23,046 INFO L87 Difference]: Start difference. First operand 279 states and 286 transitions. Second operand 10 states. [2018-10-10 16:22:23,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:23,272 INFO L93 Difference]: Finished difference Result 319 states and 325 transitions. [2018-10-10 16:22:23,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-10 16:22:23,272 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 193 [2018-10-10 16:22:23,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:23,275 INFO L225 Difference]: With dead ends: 319 [2018-10-10 16:22:23,275 INFO L226 Difference]: Without dead ends: 319 [2018-10-10 16:22:23,276 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2018-10-10 16:22:23,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-10-10 16:22:23,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 279. [2018-10-10 16:22:23,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-10-10 16:22:23,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 285 transitions. [2018-10-10 16:22:23,282 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 285 transitions. Word has length 193 [2018-10-10 16:22:23,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:23,282 INFO L481 AbstractCegarLoop]: Abstraction has 279 states and 285 transitions. [2018-10-10 16:22:23,283 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 16:22:23,283 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 285 transitions. [2018-10-10 16:22:23,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-10-10 16:22:23,285 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:23,285 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, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1] [2018-10-10 16:22:23,285 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:23,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:23,286 INFO L82 PathProgramCache]: Analyzing trace with hash -189207621, now seen corresponding path program 4 times [2018-10-10 16:22:23,286 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:23,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:23,616 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 25 proven. 118 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-10 16:22:23,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:23,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-10 16:22:23,618 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 16:22:23,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 16:22:23,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-10-10 16:22:23,618 INFO L87 Difference]: Start difference. First operand 279 states and 285 transitions. Second operand 12 states. [2018-10-10 16:22:24,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:24,010 INFO L93 Difference]: Finished difference Result 296 states and 299 transitions. [2018-10-10 16:22:24,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-10 16:22:24,011 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 214 [2018-10-10 16:22:24,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:24,014 INFO L225 Difference]: With dead ends: 296 [2018-10-10 16:22:24,014 INFO L226 Difference]: Without dead ends: 296 [2018-10-10 16:22:24,015 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=477, Unknown=0, NotChecked=0, Total=600 [2018-10-10 16:22:24,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-10-10 16:22:24,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 267. [2018-10-10 16:22:24,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-10-10 16:22:24,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 270 transitions. [2018-10-10 16:22:24,020 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 270 transitions. Word has length 214 [2018-10-10 16:22:24,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:24,021 INFO L481 AbstractCegarLoop]: Abstraction has 267 states and 270 transitions. [2018-10-10 16:22:24,021 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 16:22:24,021 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 270 transitions. [2018-10-10 16:22:24,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-10-10 16:22:24,023 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:24,024 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:22:24,024 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:24,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:24,024 INFO L82 PathProgramCache]: Analyzing trace with hash 336553541, now seen corresponding path program 5 times [2018-10-10 16:22:24,025 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:24,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:24,491 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-10-10 16:22:24,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 16:22:24,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-10-10 16:22:24,491 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-10 16:22:24,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-10 16:22:24,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-10-10 16:22:24,492 INFO L87 Difference]: Start difference. First operand 267 states and 270 transitions. Second operand 16 states. [2018-10-10 16:22:25,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:25,711 INFO L93 Difference]: Finished difference Result 361 states and 365 transitions. [2018-10-10 16:22:25,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-10 16:22:25,712 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 235 [2018-10-10 16:22:25,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:25,715 INFO L225 Difference]: With dead ends: 361 [2018-10-10 16:22:25,715 INFO L226 Difference]: Without dead ends: 361 [2018-10-10 16:22:25,717 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=281, Invalid=979, Unknown=0, NotChecked=0, Total=1260 [2018-10-10 16:22:25,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2018-10-10 16:22:25,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 271. [2018-10-10 16:22:25,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-10-10 16:22:25,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 275 transitions. [2018-10-10 16:22:25,722 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 275 transitions. Word has length 235 [2018-10-10 16:22:25,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:25,722 INFO L481 AbstractCegarLoop]: Abstraction has 271 states and 275 transitions. [2018-10-10 16:22:25,722 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-10 16:22:25,723 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 275 transitions. [2018-10-10 16:22:25,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-10-10 16:22:25,724 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:25,724 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, 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, 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, 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] [2018-10-10 16:22:25,724 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:25,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:25,725 INFO L82 PathProgramCache]: Analyzing trace with hash 699806479, now seen corresponding path program 6 times [2018-10-10 16:22:25,726 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:25,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:26,177 WARN L178 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-10-10 16:22:26,465 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 97 proven. 27 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2018-10-10 16:22:26,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:26,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-10 16:22:26,466 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-10 16:22:26,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-10 16:22:26,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-10-10 16:22:26,466 INFO L87 Difference]: Start difference. First operand 271 states and 275 transitions. Second operand 16 states. [2018-10-10 16:22:28,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:28,553 INFO L93 Difference]: Finished difference Result 590 states and 601 transitions. [2018-10-10 16:22:28,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-10 16:22:28,553 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 249 [2018-10-10 16:22:28,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:28,557 INFO L225 Difference]: With dead ends: 590 [2018-10-10 16:22:28,557 INFO L226 Difference]: Without dead ends: 590 [2018-10-10 16:22:28,558 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 621 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=470, Invalid=1882, Unknown=0, NotChecked=0, Total=2352 [2018-10-10 16:22:28,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2018-10-10 16:22:28,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 285. [2018-10-10 16:22:28,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-10-10 16:22:28,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 290 transitions. [2018-10-10 16:22:28,564 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 290 transitions. Word has length 249 [2018-10-10 16:22:28,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:28,565 INFO L481 AbstractCegarLoop]: Abstraction has 285 states and 290 transitions. [2018-10-10 16:22:28,565 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-10 16:22:28,565 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 290 transitions. [2018-10-10 16:22:28,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-10-10 16:22:28,567 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:28,567 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-10 16:22:28,567 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:28,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:28,568 INFO L82 PathProgramCache]: Analyzing trace with hash 615110233, now seen corresponding path program 7 times [2018-10-10 16:22:28,568 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:28,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:29,577 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 11 proven. 208 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-10-10 16:22:29,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:29,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-10 16:22:29,578 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-10 16:22:29,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-10 16:22:29,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2018-10-10 16:22:29,579 INFO L87 Difference]: Start difference. First operand 285 states and 290 transitions. Second operand 16 states. [2018-10-10 16:22:30,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:30,688 INFO L93 Difference]: Finished difference Result 589 states and 599 transitions. [2018-10-10 16:22:30,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-10 16:22:30,689 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 263 [2018-10-10 16:22:30,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:30,692 INFO L225 Difference]: With dead ends: 589 [2018-10-10 16:22:30,692 INFO L226 Difference]: Without dead ends: 589 [2018-10-10 16:22:30,694 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 771 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=632, Invalid=2230, Unknown=0, NotChecked=0, Total=2862 [2018-10-10 16:22:30,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2018-10-10 16:22:30,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 409. [2018-10-10 16:22:30,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 409 states. [2018-10-10 16:22:30,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 417 transitions. [2018-10-10 16:22:30,701 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 417 transitions. Word has length 263 [2018-10-10 16:22:30,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:30,702 INFO L481 AbstractCegarLoop]: Abstraction has 409 states and 417 transitions. [2018-10-10 16:22:30,702 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-10 16:22:30,702 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 417 transitions. [2018-10-10 16:22:30,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2018-10-10 16:22:30,704 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:30,704 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, 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, 4, 4, 4, 4, 4, 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, 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] [2018-10-10 16:22:30,704 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:30,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:30,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1932241173, now seen corresponding path program 8 times [2018-10-10 16:22:30,706 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:30,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:30,998 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 211 proven. 37 refuted. 0 times theorem prover too weak. 294 trivial. 0 not checked. [2018-10-10 16:22:30,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:30,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-10 16:22:30,999 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-10 16:22:30,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-10 16:22:30,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-10-10 16:22:31,000 INFO L87 Difference]: Start difference. First operand 409 states and 417 transitions. Second operand 15 states. [2018-10-10 16:22:32,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:32,241 INFO L93 Difference]: Finished difference Result 867 states and 885 transitions. [2018-10-10 16:22:32,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-10 16:22:32,244 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 359 [2018-10-10 16:22:32,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:32,248 INFO L225 Difference]: With dead ends: 867 [2018-10-10 16:22:32,248 INFO L226 Difference]: Without dead ends: 867 [2018-10-10 16:22:32,250 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1458 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=810, Invalid=3746, Unknown=0, NotChecked=0, Total=4556 [2018-10-10 16:22:32,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2018-10-10 16:22:32,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 430. [2018-10-10 16:22:32,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2018-10-10 16:22:32,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 439 transitions. [2018-10-10 16:22:32,261 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 439 transitions. Word has length 359 [2018-10-10 16:22:32,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:32,262 INFO L481 AbstractCegarLoop]: Abstraction has 430 states and 439 transitions. [2018-10-10 16:22:32,262 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-10 16:22:32,262 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 439 transitions. [2018-10-10 16:22:32,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2018-10-10 16:22:32,264 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:32,265 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, 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, 4, 4, 4, 4, 4, 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, 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] [2018-10-10 16:22:32,265 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:32,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:32,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1638131779, now seen corresponding path program 9 times [2018-10-10 16:22:32,266 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:32,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:33,781 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 379 proven. 159 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-10-10 16:22:33,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:33,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-10 16:22:33,782 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 16:22:33,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 16:22:33,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-10-10 16:22:33,783 INFO L87 Difference]: Start difference. First operand 430 states and 439 transitions. Second operand 12 states. [2018-10-10 16:22:34,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:34,147 INFO L93 Difference]: Finished difference Result 433 states and 440 transitions. [2018-10-10 16:22:34,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-10 16:22:34,147 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 380 [2018-10-10 16:22:34,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:34,150 INFO L225 Difference]: With dead ends: 433 [2018-10-10 16:22:34,150 INFO L226 Difference]: Without dead ends: 433 [2018-10-10 16:22:34,151 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2018-10-10 16:22:34,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2018-10-10 16:22:34,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 430. [2018-10-10 16:22:34,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2018-10-10 16:22:34,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 437 transitions. [2018-10-10 16:22:34,159 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 437 transitions. Word has length 380 [2018-10-10 16:22:34,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:34,160 INFO L481 AbstractCegarLoop]: Abstraction has 430 states and 437 transitions. [2018-10-10 16:22:34,160 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 16:22:34,160 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 437 transitions. [2018-10-10 16:22:34,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2018-10-10 16:22:34,162 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:34,162 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, 5, 5, 5, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-10-10 16:22:34,163 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:34,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:34,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1933191117, now seen corresponding path program 10 times [2018-10-10 16:22:34,164 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:34,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:35,246 INFO L134 CoverageAnalysis]: Checked inductivity of 700 backedges. 411 proven. 176 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2018-10-10 16:22:35,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:35,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-10 16:22:35,247 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-10 16:22:35,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-10 16:22:35,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-10-10 16:22:35,248 INFO L87 Difference]: Start difference. First operand 430 states and 437 transitions. Second operand 14 states. [2018-10-10 16:22:35,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:35,699 INFO L93 Difference]: Finished difference Result 433 states and 438 transitions. [2018-10-10 16:22:35,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-10 16:22:35,700 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 394 [2018-10-10 16:22:35,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:35,702 INFO L225 Difference]: With dead ends: 433 [2018-10-10 16:22:35,702 INFO L226 Difference]: Without dead ends: 433 [2018-10-10 16:22:35,703 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=177, Invalid=635, Unknown=0, NotChecked=0, Total=812 [2018-10-10 16:22:35,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2018-10-10 16:22:35,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 430. [2018-10-10 16:22:35,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2018-10-10 16:22:35,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 435 transitions. [2018-10-10 16:22:35,710 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 435 transitions. Word has length 394 [2018-10-10 16:22:35,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:35,711 INFO L481 AbstractCegarLoop]: Abstraction has 430 states and 435 transitions. [2018-10-10 16:22:35,711 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-10 16:22:35,711 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 435 transitions. [2018-10-10 16:22:35,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 409 [2018-10-10 16:22:35,714 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:35,714 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 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] [2018-10-10 16:22:35,714 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:35,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:35,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1975348695, now seen corresponding path program 11 times [2018-10-10 16:22:35,715 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:35,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:36,963 INFO L134 CoverageAnalysis]: Checked inductivity of 763 backedges. 142 proven. 526 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-10-10 16:22:36,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:36,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-10 16:22:36,964 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-10 16:22:36,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-10 16:22:36,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=496, Unknown=0, NotChecked=0, Total=552 [2018-10-10 16:22:36,965 INFO L87 Difference]: Start difference. First operand 430 states and 435 transitions. Second operand 24 states. [2018-10-10 16:22:39,890 WARN L178 SmtUtils]: Spent 318.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-10-10 16:22:40,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:40,723 INFO L93 Difference]: Finished difference Result 601 states and 608 transitions. [2018-10-10 16:22:40,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-10 16:22:40,723 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 408 [2018-10-10 16:22:40,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:40,728 INFO L225 Difference]: With dead ends: 601 [2018-10-10 16:22:40,728 INFO L226 Difference]: Without dead ends: 601 [2018-10-10 16:22:40,729 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 808 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=766, Invalid=3140, Unknown=0, NotChecked=0, Total=3906 [2018-10-10 16:22:40,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2018-10-10 16:22:40,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 444. [2018-10-10 16:22:40,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2018-10-10 16:22:40,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 450 transitions. [2018-10-10 16:22:40,737 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 450 transitions. Word has length 408 [2018-10-10 16:22:40,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:40,738 INFO L481 AbstractCegarLoop]: Abstraction has 444 states and 450 transitions. [2018-10-10 16:22:40,738 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-10 16:22:40,739 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 450 transitions. [2018-10-10 16:22:40,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2018-10-10 16:22:40,741 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:40,741 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 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, 6, 6, 6, 6, 6, 6, 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, 4, 4, 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] [2018-10-10 16:22:40,742 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:40,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:40,742 INFO L82 PathProgramCache]: Analyzing trace with hash 753713139, now seen corresponding path program 12 times [2018-10-10 16:22:40,743 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:40,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:41,196 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 36 proven. 697 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-10-10 16:22:41,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:41,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-10 16:22:41,198 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-10 16:22:41,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-10 16:22:41,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2018-10-10 16:22:41,199 INFO L87 Difference]: Start difference. First operand 444 states and 450 transitions. Second operand 20 states. [2018-10-10 16:22:41,774 WARN L178 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 14 [2018-10-10 16:22:43,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:43,115 INFO L93 Difference]: Finished difference Result 791 states and 802 transitions. [2018-10-10 16:22:43,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-10 16:22:43,116 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 422 [2018-10-10 16:22:43,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:43,120 INFO L225 Difference]: With dead ends: 791 [2018-10-10 16:22:43,120 INFO L226 Difference]: Without dead ends: 791 [2018-10-10 16:22:43,122 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1374 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=954, Invalid=3738, Unknown=0, NotChecked=0, Total=4692 [2018-10-10 16:22:43,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2018-10-10 16:22:43,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 626. [2018-10-10 16:22:43,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2018-10-10 16:22:43,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 635 transitions. [2018-10-10 16:22:43,131 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 635 transitions. Word has length 422 [2018-10-10 16:22:43,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:43,132 INFO L481 AbstractCegarLoop]: Abstraction has 626 states and 635 transitions. [2018-10-10 16:22:43,132 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-10 16:22:43,132 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 635 transitions. [2018-10-10 16:22:43,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 547 [2018-10-10 16:22:43,135 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:43,136 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 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, 8, 8, 8, 8, 8, 8, 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, 5, 5, 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] [2018-10-10 16:22:43,136 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:43,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:43,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1729859443, now seen corresponding path program 13 times [2018-10-10 16:22:43,137 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:43,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:43,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1524 backedges. 917 proven. 326 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2018-10-10 16:22:43,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:43,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-10 16:22:43,594 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-10 16:22:43,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-10 16:22:43,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-10-10 16:22:43,594 INFO L87 Difference]: Start difference. First operand 626 states and 635 transitions. Second operand 16 states. [2018-10-10 16:22:44,291 WARN L178 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-10 16:22:44,691 WARN L178 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-10 16:22:45,319 WARN L178 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-10 16:22:45,709 WARN L178 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-10 16:22:46,021 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-10 16:22:46,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:46,308 INFO L93 Difference]: Finished difference Result 603 states and 610 transitions. [2018-10-10 16:22:46,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-10 16:22:46,311 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 546 [2018-10-10 16:22:46,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:46,313 INFO L225 Difference]: With dead ends: 603 [2018-10-10 16:22:46,313 INFO L226 Difference]: Without dead ends: 603 [2018-10-10 16:22:46,314 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=232, Invalid=958, Unknown=0, NotChecked=0, Total=1190 [2018-10-10 16:22:46,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2018-10-10 16:22:46,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 603. [2018-10-10 16:22:46,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2018-10-10 16:22:46,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 610 transitions. [2018-10-10 16:22:46,321 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 610 transitions. Word has length 546 [2018-10-10 16:22:46,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:46,322 INFO L481 AbstractCegarLoop]: Abstraction has 603 states and 610 transitions. [2018-10-10 16:22:46,322 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-10 16:22:46,322 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 610 transitions. [2018-10-10 16:22:46,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 568 [2018-10-10 16:22:46,325 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:46,326 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, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 5, 5, 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] [2018-10-10 16:22:46,326 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:46,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:46,327 INFO L82 PathProgramCache]: Analyzing trace with hash 660441635, now seen corresponding path program 14 times [2018-10-10 16:22:46,327 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:46,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:47,036 INFO L134 CoverageAnalysis]: Checked inductivity of 1697 backedges. 1155 proven. 80 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2018-10-10 16:22:47,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:47,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-10 16:22:47,037 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-10 16:22:47,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-10 16:22:47,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-10-10 16:22:47,038 INFO L87 Difference]: Start difference. First operand 603 states and 610 transitions. Second operand 15 states. [2018-10-10 16:22:48,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:48,086 INFO L93 Difference]: Finished difference Result 699 states and 704 transitions. [2018-10-10 16:22:48,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-10 16:22:48,086 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 567 [2018-10-10 16:22:48,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:48,090 INFO L225 Difference]: With dead ends: 699 [2018-10-10 16:22:48,090 INFO L226 Difference]: Without dead ends: 641 [2018-10-10 16:22:48,091 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=320, Invalid=1320, Unknown=0, NotChecked=0, Total=1640 [2018-10-10 16:22:48,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2018-10-10 16:22:48,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 603. [2018-10-10 16:22:48,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2018-10-10 16:22:48,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 607 transitions. [2018-10-10 16:22:48,099 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 607 transitions. Word has length 567 [2018-10-10 16:22:48,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:48,100 INFO L481 AbstractCegarLoop]: Abstraction has 603 states and 607 transitions. [2018-10-10 16:22:48,100 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-10 16:22:48,100 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 607 transitions. [2018-10-10 16:22:48,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 582 [2018-10-10 16:22:48,104 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:48,104 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 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, 9, 9, 9, 9, 9, 9, 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, 5, 5, 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] [2018-10-10 16:22:48,104 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:48,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:48,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1195719911, now seen corresponding path program 15 times [2018-10-10 16:22:48,106 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:48,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:48,706 INFO L134 CoverageAnalysis]: Checked inductivity of 1817 backedges. 751 proven. 93 refuted. 0 times theorem prover too weak. 973 trivial. 0 not checked. [2018-10-10 16:22:48,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:48,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-10 16:22:48,708 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-10 16:22:48,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-10 16:22:48,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2018-10-10 16:22:48,708 INFO L87 Difference]: Start difference. First operand 603 states and 607 transitions. Second operand 19 states. [2018-10-10 16:22:49,385 WARN L178 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-10 16:22:50,821 WARN L178 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-10 16:22:51,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:51,130 INFO L93 Difference]: Finished difference Result 977 states and 985 transitions. [2018-10-10 16:22:51,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-10 16:22:51,131 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 581 [2018-10-10 16:22:51,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:51,134 INFO L225 Difference]: With dead ends: 977 [2018-10-10 16:22:51,134 INFO L226 Difference]: Without dead ends: 977 [2018-10-10 16:22:51,136 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2437 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1174, Invalid=6136, Unknown=0, NotChecked=0, Total=7310 [2018-10-10 16:22:51,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2018-10-10 16:22:51,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 624. [2018-10-10 16:22:51,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624 states. [2018-10-10 16:22:51,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 629 transitions. [2018-10-10 16:22:51,144 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 629 transitions. Word has length 581 [2018-10-10 16:22:51,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:51,144 INFO L481 AbstractCegarLoop]: Abstraction has 624 states and 629 transitions. [2018-10-10 16:22:51,145 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-10 16:22:51,145 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 629 transitions. [2018-10-10 16:22:51,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 603 [2018-10-10 16:22:51,149 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:51,149 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, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 5, 5, 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] [2018-10-10 16:22:51,149 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:51,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:51,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1903038243, now seen corresponding path program 16 times [2018-10-10 16:22:51,150 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:51,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:52,586 INFO L134 CoverageAnalysis]: Checked inductivity of 2011 backedges. 586 proven. 1161 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-10-10 16:22:52,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:52,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-10 16:22:52,588 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-10 16:22:52,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-10 16:22:52,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=685, Unknown=0, NotChecked=0, Total=756 [2018-10-10 16:22:52,588 INFO L87 Difference]: Start difference. First operand 624 states and 629 transitions. Second operand 28 states. [2018-10-10 16:22:55,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:55,837 INFO L93 Difference]: Finished difference Result 809 states and 816 transitions. [2018-10-10 16:22:55,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-10 16:22:55,838 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 602 [2018-10-10 16:22:55,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:55,842 INFO L225 Difference]: With dead ends: 809 [2018-10-10 16:22:55,842 INFO L226 Difference]: Without dead ends: 809 [2018-10-10 16:22:55,843 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1126 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=937, Invalid=4175, Unknown=0, NotChecked=0, Total=5112 [2018-10-10 16:22:55,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2018-10-10 16:22:55,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 638. [2018-10-10 16:22:55,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2018-10-10 16:22:55,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 644 transitions. [2018-10-10 16:22:55,851 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 644 transitions. Word has length 602 [2018-10-10 16:22:55,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:55,852 INFO L481 AbstractCegarLoop]: Abstraction has 638 states and 644 transitions. [2018-10-10 16:22:55,852 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-10 16:22:55,852 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 644 transitions. [2018-10-10 16:22:55,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 617 [2018-10-10 16:22:55,856 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:55,856 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 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, 10, 10, 10, 10, 10, 10, 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, 5, 5, 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] [2018-10-10 16:22:55,856 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:55,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:55,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1265303699, now seen corresponding path program 17 times [2018-10-10 16:22:55,857 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:55,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:57,129 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 1002 proven. 170 refuted. 0 times theorem prover too weak. 973 trivial. 0 not checked. [2018-10-10 16:22:57,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:57,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-10 16:22:57,130 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-10 16:22:57,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-10 16:22:57,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2018-10-10 16:22:57,131 INFO L87 Difference]: Start difference. First operand 638 states and 644 transitions. Second operand 23 states. [2018-10-10 16:22:59,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:59,234 INFO L93 Difference]: Finished difference Result 1151 states and 1164 transitions. [2018-10-10 16:22:59,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-10 16:22:59,235 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 616 [2018-10-10 16:22:59,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:59,240 INFO L225 Difference]: With dead ends: 1151 [2018-10-10 16:22:59,240 INFO L226 Difference]: Without dead ends: 1151 [2018-10-10 16:22:59,245 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4560 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1871, Invalid=11011, Unknown=0, NotChecked=0, Total=12882 [2018-10-10 16:22:59,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1151 states. [2018-10-10 16:22:59,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1151 to 710. [2018-10-10 16:22:59,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 710 states. [2018-10-10 16:22:59,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 718 transitions. [2018-10-10 16:22:59,255 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 718 transitions. Word has length 616 [2018-10-10 16:22:59,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:59,255 INFO L481 AbstractCegarLoop]: Abstraction has 710 states and 718 transitions. [2018-10-10 16:22:59,255 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-10 16:22:59,255 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 718 transitions. [2018-10-10 16:22:59,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 638 [2018-10-10 16:22:59,260 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:59,260 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, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 5, 5, 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] [2018-10-10 16:22:59,260 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:59,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:59,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1237948637, now seen corresponding path program 18 times [2018-10-10 16:22:59,261 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:59,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:59,967 INFO L134 CoverageAnalysis]: Checked inductivity of 2360 backedges. 696 proven. 1412 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2018-10-10 16:22:59,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:59,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-10 16:22:59,969 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-10 16:22:59,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-10 16:22:59,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2018-10-10 16:22:59,969 INFO L87 Difference]: Start difference. First operand 710 states and 718 transitions. Second operand 22 states. [2018-10-10 16:23:01,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:01,841 INFO L93 Difference]: Finished difference Result 1080 states and 1090 transitions. [2018-10-10 16:23:01,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-10 16:23:01,844 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 637 [2018-10-10 16:23:01,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:01,848 INFO L225 Difference]: With dead ends: 1080 [2018-10-10 16:23:01,848 INFO L226 Difference]: Without dead ends: 1080 [2018-10-10 16:23:01,849 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2743 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1546, Invalid=6464, Unknown=0, NotChecked=0, Total=8010 [2018-10-10 16:23:01,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1080 states. [2018-10-10 16:23:01,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1080 to 911. [2018-10-10 16:23:01,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 911 states. [2018-10-10 16:23:01,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 911 states and 920 transitions. [2018-10-10 16:23:01,859 INFO L78 Accepts]: Start accepts. Automaton has 911 states and 920 transitions. Word has length 637 [2018-10-10 16:23:01,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:01,859 INFO L481 AbstractCegarLoop]: Abstraction has 911 states and 920 transitions. [2018-10-10 16:23:01,860 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-10 16:23:01,860 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 920 transitions. [2018-10-10 16:23:01,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 797 [2018-10-10 16:23:01,866 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:01,866 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, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 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, 6, 6, 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] [2018-10-10 16:23:01,866 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:01,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:01,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1128871619, now seen corresponding path program 19 times [2018-10-10 16:23:01,867 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:01,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:02,727 INFO L134 CoverageAnalysis]: Checked inductivity of 3889 backedges. 2364 proven. 992 refuted. 0 times theorem prover too weak. 533 trivial. 0 not checked. [2018-10-10 16:23:02,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:02,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-10 16:23:02,728 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-10 16:23:02,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-10 16:23:02,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2018-10-10 16:23:02,728 INFO L87 Difference]: Start difference. First operand 911 states and 920 transitions. Second operand 22 states. [2018-10-10 16:23:03,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:03,769 INFO L93 Difference]: Finished difference Result 931 states and 937 transitions. [2018-10-10 16:23:03,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-10 16:23:03,769 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 796 [2018-10-10 16:23:03,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:03,774 INFO L225 Difference]: With dead ends: 931 [2018-10-10 16:23:03,774 INFO L226 Difference]: Without dead ends: 877 [2018-10-10 16:23:03,774 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=469, Invalid=1883, Unknown=0, NotChecked=0, Total=2352 [2018-10-10 16:23:03,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2018-10-10 16:23:03,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 874. [2018-10-10 16:23:03,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 874 states. [2018-10-10 16:23:03,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 879 transitions. [2018-10-10 16:23:03,783 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 879 transitions. Word has length 796 [2018-10-10 16:23:03,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:03,783 INFO L481 AbstractCegarLoop]: Abstraction has 874 states and 879 transitions. [2018-10-10 16:23:03,784 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-10 16:23:03,784 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 879 transitions. [2018-10-10 16:23:03,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 832 [2018-10-10 16:23:03,790 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:03,790 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, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 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, 6, 6, 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] [2018-10-10 16:23:03,791 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:03,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:03,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1046335081, now seen corresponding path program 20 times [2018-10-10 16:23:03,792 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:03,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:05,091 INFO L134 CoverageAnalysis]: Checked inductivity of 4380 backedges. 1867 proven. 228 refuted. 0 times theorem prover too weak. 2285 trivial. 0 not checked. [2018-10-10 16:23:05,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:05,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-10 16:23:05,092 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-10 16:23:05,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-10 16:23:05,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=672, Unknown=0, NotChecked=0, Total=756 [2018-10-10 16:23:05,093 INFO L87 Difference]: Start difference. First operand 874 states and 879 transitions. Second operand 28 states. [2018-10-10 16:23:08,205 WARN L178 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2018-10-10 16:23:08,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:08,873 INFO L93 Difference]: Finished difference Result 1102 states and 1109 transitions. [2018-10-10 16:23:08,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-10 16:23:08,873 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 831 [2018-10-10 16:23:08,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:08,877 INFO L225 Difference]: With dead ends: 1102 [2018-10-10 16:23:08,878 INFO L226 Difference]: Without dead ends: 1102 [2018-10-10 16:23:08,878 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1109 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=824, Invalid=3868, Unknown=0, NotChecked=0, Total=4692 [2018-10-10 16:23:08,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states. [2018-10-10 16:23:08,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 888. [2018-10-10 16:23:08,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 888 states. [2018-10-10 16:23:08,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 888 states to 888 states and 894 transitions. [2018-10-10 16:23:08,887 INFO L78 Accepts]: Start accepts. Automaton has 888 states and 894 transitions. Word has length 831 [2018-10-10 16:23:08,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:08,888 INFO L481 AbstractCegarLoop]: Abstraction has 888 states and 894 transitions. [2018-10-10 16:23:08,888 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-10 16:23:08,888 INFO L276 IsEmpty]: Start isEmpty. Operand 888 states and 894 transitions. [2018-10-10 16:23:08,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 846 [2018-10-10 16:23:08,895 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:08,895 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 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, 15, 15, 15, 15, 15, 15, 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, 6, 6, 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] [2018-10-10 16:23:08,895 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:08,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:08,896 INFO L82 PathProgramCache]: Analyzing trace with hash -108426189, now seen corresponding path program 21 times [2018-10-10 16:23:08,896 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:08,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:10,089 INFO L134 CoverageAnalysis]: Checked inductivity of 4585 backedges. 137 proven. 3863 refuted. 0 times theorem prover too weak. 585 trivial. 0 not checked. [2018-10-10 16:23:10,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:10,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-10 16:23:10,090 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-10 16:23:10,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-10 16:23:10,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=660, Unknown=0, NotChecked=0, Total=756 [2018-10-10 16:23:10,090 INFO L87 Difference]: Start difference. First operand 888 states and 894 transitions. Second operand 28 states. [2018-10-10 16:23:13,009 WARN L178 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-10 16:23:13,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:13,321 INFO L93 Difference]: Finished difference Result 1403 states and 1414 transitions. [2018-10-10 16:23:13,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-10-10 16:23:13,321 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 845 [2018-10-10 16:23:13,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:13,327 INFO L225 Difference]: With dead ends: 1403 [2018-10-10 16:23:13,327 INFO L226 Difference]: Without dead ends: 1403 [2018-10-10 16:23:13,328 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4801 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2389, Invalid=11417, Unknown=0, NotChecked=0, Total=13806 [2018-10-10 16:23:13,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2018-10-10 16:23:13,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 1168. [2018-10-10 16:23:13,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1168 states. [2018-10-10 16:23:13,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1168 states to 1168 states and 1177 transitions. [2018-10-10 16:23:13,340 INFO L78 Accepts]: Start accepts. Automaton has 1168 states and 1177 transitions. Word has length 845 [2018-10-10 16:23:13,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:13,341 INFO L481 AbstractCegarLoop]: Abstraction has 1168 states and 1177 transitions. [2018-10-10 16:23:13,341 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-10 16:23:13,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1168 states and 1177 transitions. [2018-10-10 16:23:13,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1040 [2018-10-10 16:23:13,350 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:13,351 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 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, 19, 19, 19, 19, 19, 19, 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, 7, 7, 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] [2018-10-10 16:23:13,351 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:13,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:13,352 INFO L82 PathProgramCache]: Analyzing trace with hash 2063472505, now seen corresponding path program 22 times [2018-10-10 16:23:13,352 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:13,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:14,497 INFO L134 CoverageAnalysis]: Checked inductivity of 7292 backedges. 4825 proven. 1324 refuted. 0 times theorem prover too weak. 1143 trivial. 0 not checked. [2018-10-10 16:23:14,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:14,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-10 16:23:14,498 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-10 16:23:14,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-10 16:23:14,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2018-10-10 16:23:14,500 INFO L87 Difference]: Start difference. First operand 1168 states and 1177 transitions. Second operand 24 states. [2018-10-10 16:23:15,816 WARN L178 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-10 16:23:16,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:16,202 INFO L93 Difference]: Finished difference Result 1117 states and 1124 transitions. [2018-10-10 16:23:16,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-10 16:23:16,203 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 1039 [2018-10-10 16:23:16,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:16,208 INFO L225 Difference]: With dead ends: 1117 [2018-10-10 16:23:16,208 INFO L226 Difference]: Without dead ends: 1117 [2018-10-10 16:23:16,209 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=564, Invalid=2406, Unknown=0, NotChecked=0, Total=2970 [2018-10-10 16:23:16,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2018-10-10 16:23:16,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 1117. [2018-10-10 16:23:16,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1117 states. [2018-10-10 16:23:16,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 1124 transitions. [2018-10-10 16:23:16,218 INFO L78 Accepts]: Start accepts. Automaton has 1117 states and 1124 transitions. Word has length 1039 [2018-10-10 16:23:16,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:16,218 INFO L481 AbstractCegarLoop]: Abstraction has 1117 states and 1124 transitions. [2018-10-10 16:23:16,218 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-10 16:23:16,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 1124 transitions. [2018-10-10 16:23:16,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1061 [2018-10-10 16:23:16,228 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:16,228 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, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 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, 7, 7, 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] [2018-10-10 16:23:16,228 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:16,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:16,229 INFO L82 PathProgramCache]: Analyzing trace with hash -612808009, now seen corresponding path program 23 times [2018-10-10 16:23:16,229 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:16,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:17,659 INFO L134 CoverageAnalysis]: Checked inductivity of 7698 backedges. 4779 proven. 234 refuted. 0 times theorem prover too weak. 2685 trivial. 0 not checked. [2018-10-10 16:23:17,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:17,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-10 16:23:17,660 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-10 16:23:17,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-10 16:23:17,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2018-10-10 16:23:17,661 INFO L87 Difference]: Start difference. First operand 1117 states and 1124 transitions. Second operand 23 states. [2018-10-10 16:23:19,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:19,510 INFO L93 Difference]: Finished difference Result 1235 states and 1240 transitions. [2018-10-10 16:23:19,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-10 16:23:19,511 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 1060 [2018-10-10 16:23:19,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:19,515 INFO L225 Difference]: With dead ends: 1235 [2018-10-10 16:23:19,515 INFO L226 Difference]: Without dead ends: 1235 [2018-10-10 16:23:19,516 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1031 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=808, Invalid=3614, Unknown=0, NotChecked=0, Total=4422 [2018-10-10 16:23:19,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2018-10-10 16:23:19,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 1117. [2018-10-10 16:23:19,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1117 states. [2018-10-10 16:23:19,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 1122 transitions. [2018-10-10 16:23:19,525 INFO L78 Accepts]: Start accepts. Automaton has 1117 states and 1122 transitions. Word has length 1060 [2018-10-10 16:23:19,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:19,525 INFO L481 AbstractCegarLoop]: Abstraction has 1117 states and 1122 transitions. [2018-10-10 16:23:19,525 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-10 16:23:19,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 1122 transitions. [2018-10-10 16:23:19,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1075 [2018-10-10 16:23:19,534 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:19,535 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 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, 20, 20, 20, 20, 20, 20, 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, 7, 7, 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] [2018-10-10 16:23:19,535 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:19,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:19,536 INFO L82 PathProgramCache]: Analyzing trace with hash 209709, now seen corresponding path program 24 times [2018-10-10 16:23:19,536 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:19,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:20,657 INFO L134 CoverageAnalysis]: Checked inductivity of 7974 backedges. 2927 proven. 268 refuted. 0 times theorem prover too weak. 4779 trivial. 0 not checked. [2018-10-10 16:23:20,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:20,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-10 16:23:20,658 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-10 16:23:20,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-10 16:23:20,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=608, Unknown=0, NotChecked=0, Total=702 [2018-10-10 16:23:20,659 INFO L87 Difference]: Start difference. First operand 1117 states and 1122 transitions. Second operand 27 states. [2018-10-10 16:23:23,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:23,507 INFO L93 Difference]: Finished difference Result 1669 states and 1678 transitions. [2018-10-10 16:23:23,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-10-10 16:23:23,507 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 1074 [2018-10-10 16:23:23,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:23,512 INFO L225 Difference]: With dead ends: 1669 [2018-10-10 16:23:23,512 INFO L226 Difference]: Without dead ends: 1669 [2018-10-10 16:23:23,515 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7278 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2723, Invalid=17017, Unknown=0, NotChecked=0, Total=19740 [2018-10-10 16:23:23,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1669 states. [2018-10-10 16:23:23,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1669 to 1138. [2018-10-10 16:23:23,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1138 states. [2018-10-10 16:23:23,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1144 transitions. [2018-10-10 16:23:23,525 INFO L78 Accepts]: Start accepts. Automaton has 1138 states and 1144 transitions. Word has length 1074 [2018-10-10 16:23:23,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:23,526 INFO L481 AbstractCegarLoop]: Abstraction has 1138 states and 1144 transitions. [2018-10-10 16:23:23,526 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-10 16:23:23,526 INFO L276 IsEmpty]: Start isEmpty. Operand 1138 states and 1144 transitions. [2018-10-10 16:23:23,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1096 [2018-10-10 16:23:23,533 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:23,534 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, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 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, 7, 7, 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] [2018-10-10 16:23:23,534 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:23,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:23,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1686790089, now seen corresponding path program 25 times [2018-10-10 16:23:23,535 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:23,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:25,379 INFO L134 CoverageAnalysis]: Checked inductivity of 8401 backedges. 3327 proven. 325 refuted. 0 times theorem prover too weak. 4749 trivial. 0 not checked. [2018-10-10 16:23:25,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:25,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-10 16:23:25,381 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-10 16:23:25,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-10 16:23:25,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1004, Unknown=0, NotChecked=0, Total=1122 [2018-10-10 16:23:25,381 INFO L87 Difference]: Start difference. First operand 1138 states and 1144 transitions. Second operand 34 states. [2018-10-10 16:23:31,054 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2018-10-10 16:23:31,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:31,776 INFO L93 Difference]: Finished difference Result 1478 states and 1487 transitions. [2018-10-10 16:23:31,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-10 16:23:31,776 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 1095 [2018-10-10 16:23:31,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:31,781 INFO L225 Difference]: With dead ends: 1478 [2018-10-10 16:23:31,782 INFO L226 Difference]: Without dead ends: 1478 [2018-10-10 16:23:31,783 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1682 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=1439, Invalid=5701, Unknown=0, NotChecked=0, Total=7140 [2018-10-10 16:23:31,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1478 states. [2018-10-10 16:23:31,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1478 to 1152. [2018-10-10 16:23:31,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1152 states. [2018-10-10 16:23:31,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 1159 transitions. [2018-10-10 16:23:31,795 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 1159 transitions. Word has length 1095 [2018-10-10 16:23:31,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:31,796 INFO L481 AbstractCegarLoop]: Abstraction has 1152 states and 1159 transitions. [2018-10-10 16:23:31,796 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-10 16:23:31,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 1159 transitions. [2018-10-10 16:23:31,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1110 [2018-10-10 16:23:31,805 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:31,806 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 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, 21, 21, 21, 21, 21, 21, 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, 7, 7, 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] [2018-10-10 16:23:31,806 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:31,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:31,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1834017407, now seen corresponding path program 26 times [2018-10-10 16:23:31,807 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:31,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:33,202 INFO L134 CoverageAnalysis]: Checked inductivity of 8691 backedges. 3525 proven. 387 refuted. 0 times theorem prover too weak. 4779 trivial. 0 not checked. [2018-10-10 16:23:33,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:33,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-10 16:23:33,203 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-10 16:23:33,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-10 16:23:33,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=808, Unknown=0, NotChecked=0, Total=930 [2018-10-10 16:23:33,204 INFO L87 Difference]: Start difference. First operand 1152 states and 1159 transitions. Second operand 31 states. [2018-10-10 16:23:37,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:37,198 INFO L93 Difference]: Finished difference Result 1871 states and 1885 transitions. [2018-10-10 16:23:37,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2018-10-10 16:23:37,199 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 1109 [2018-10-10 16:23:37,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:37,210 INFO L225 Difference]: With dead ends: 1871 [2018-10-10 16:23:37,210 INFO L226 Difference]: Without dead ends: 1871 [2018-10-10 16:23:37,214 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11628 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=3946, Invalid=26504, Unknown=0, NotChecked=0, Total=30450 [2018-10-10 16:23:37,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1871 states. [2018-10-10 16:23:37,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1871 to 1252. [2018-10-10 16:23:37,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1252 states. [2018-10-10 16:23:37,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 1261 transitions. [2018-10-10 16:23:37,228 INFO L78 Accepts]: Start accepts. Automaton has 1252 states and 1261 transitions. Word has length 1109 [2018-10-10 16:23:37,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:37,229 INFO L481 AbstractCegarLoop]: Abstraction has 1252 states and 1261 transitions. [2018-10-10 16:23:37,229 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-10 16:23:37,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1252 states and 1261 transitions. [2018-10-10 16:23:37,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1131 [2018-10-10 16:23:37,239 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:37,240 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, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 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, 7, 7, 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] [2018-10-10 16:23:37,240 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:37,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:37,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1485454281, now seen corresponding path program 27 times [2018-10-10 16:23:37,241 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:37,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:39,238 INFO L134 CoverageAnalysis]: Checked inductivity of 9139 backedges. 2078 proven. 6097 refuted. 0 times theorem prover too weak. 964 trivial. 0 not checked. [2018-10-10 16:23:39,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:39,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-10 16:23:39,239 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-10 16:23:39,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-10 16:23:39,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=750, Unknown=0, NotChecked=0, Total=870 [2018-10-10 16:23:39,240 INFO L87 Difference]: Start difference. First operand 1252 states and 1261 transitions. Second operand 30 states. [2018-10-10 16:23:42,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:42,523 INFO L93 Difference]: Finished difference Result 1748 states and 1759 transitions. [2018-10-10 16:23:42,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-10-10 16:23:42,523 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 1130 [2018-10-10 16:23:42,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:42,530 INFO L225 Difference]: With dead ends: 1748 [2018-10-10 16:23:42,530 INFO L226 Difference]: Without dead ends: 1748 [2018-10-10 16:23:42,532 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8106 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3604, Invalid=17566, Unknown=0, NotChecked=0, Total=21170 [2018-10-10 16:23:42,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1748 states. [2018-10-10 16:23:42,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1748 to 1523. [2018-10-10 16:23:42,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1523 states. [2018-10-10 16:23:42,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1523 states to 1523 states and 1533 transitions. [2018-10-10 16:23:42,544 INFO L78 Accepts]: Start accepts. Automaton has 1523 states and 1533 transitions. Word has length 1130 [2018-10-10 16:23:42,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:42,544 INFO L481 AbstractCegarLoop]: Abstraction has 1523 states and 1533 transitions. [2018-10-10 16:23:42,544 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-10 16:23:42,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1523 states and 1533 transitions. [2018-10-10 16:23:42,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1360 [2018-10-10 16:23:42,556 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:42,557 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, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 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, 8, 8, 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] [2018-10-10 16:23:42,557 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:42,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:42,557 INFO L82 PathProgramCache]: Analyzing trace with hash -711936131, now seen corresponding path program 28 times [2018-10-10 16:23:42,558 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:42,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:44,851 INFO L134 CoverageAnalysis]: Checked inductivity of 13760 backedges. 9508 proven. 2240 refuted. 0 times theorem prover too weak. 2012 trivial. 0 not checked. [2018-10-10 16:23:44,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:44,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-10 16:23:44,852 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-10 16:23:44,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-10 16:23:44,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=651, Unknown=0, NotChecked=0, Total=756 [2018-10-10 16:23:44,853 INFO L87 Difference]: Start difference. First operand 1523 states and 1533 transitions. Second operand 28 states. [2018-10-10 16:23:46,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:46,766 INFO L93 Difference]: Finished difference Result 1458 states and 1466 transitions. [2018-10-10 16:23:46,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-10 16:23:46,766 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 1359 [2018-10-10 16:23:46,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:46,772 INFO L225 Difference]: With dead ends: 1458 [2018-10-10 16:23:46,772 INFO L226 Difference]: Without dead ends: 1458 [2018-10-10 16:23:46,773 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 865 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=787, Invalid=3373, Unknown=0, NotChecked=0, Total=4160 [2018-10-10 16:23:46,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2018-10-10 16:23:46,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 1458. [2018-10-10 16:23:46,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1458 states. [2018-10-10 16:23:46,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1458 states to 1458 states and 1466 transitions. [2018-10-10 16:23:46,785 INFO L78 Accepts]: Start accepts. Automaton has 1458 states and 1466 transitions. Word has length 1359 [2018-10-10 16:23:46,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:46,785 INFO L481 AbstractCegarLoop]: Abstraction has 1458 states and 1466 transitions. [2018-10-10 16:23:46,785 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-10 16:23:46,786 INFO L276 IsEmpty]: Start isEmpty. Operand 1458 states and 1466 transitions. [2018-10-10 16:23:46,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1381 [2018-10-10 16:23:46,796 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:46,797 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, 27, 27, 27, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 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, 8, 8, 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] [2018-10-10 16:23:46,797 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:46,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:46,798 INFO L82 PathProgramCache]: Analyzing trace with hash -488808781, now seen corresponding path program 29 times [2018-10-10 16:23:46,798 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:46,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:48,710 INFO L134 CoverageAnalysis]: Checked inductivity of 14335 backedges. 8542 proven. 332 refuted. 0 times theorem prover too weak. 5461 trivial. 0 not checked. [2018-10-10 16:23:48,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:48,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-10 16:23:48,712 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-10 16:23:48,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-10 16:23:48,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=608, Unknown=0, NotChecked=0, Total=702 [2018-10-10 16:23:48,713 INFO L87 Difference]: Start difference. First operand 1458 states and 1466 transitions. Second operand 27 states. [2018-10-10 16:23:51,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:51,413 INFO L93 Difference]: Finished difference Result 1658 states and 1663 transitions. [2018-10-10 16:23:51,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-10 16:23:51,414 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 1380 [2018-10-10 16:23:51,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:51,420 INFO L225 Difference]: With dead ends: 1658 [2018-10-10 16:23:51,420 INFO L226 Difference]: Without dead ends: 1558 [2018-10-10 16:23:51,421 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1538 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1142, Invalid=5178, Unknown=0, NotChecked=0, Total=6320 [2018-10-10 16:23:51,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1558 states. [2018-10-10 16:23:51,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1558 to 1437. [2018-10-10 16:23:51,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1437 states. [2018-10-10 16:23:51,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1437 states to 1437 states and 1442 transitions. [2018-10-10 16:23:51,431 INFO L78 Accepts]: Start accepts. Automaton has 1437 states and 1442 transitions. Word has length 1380 [2018-10-10 16:23:51,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:51,432 INFO L481 AbstractCegarLoop]: Abstraction has 1437 states and 1442 transitions. [2018-10-10 16:23:51,432 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-10 16:23:51,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1437 states and 1442 transitions. [2018-10-10 16:23:51,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1395 [2018-10-10 16:23:51,443 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:51,443 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, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 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, 8, 8, 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] [2018-10-10 16:23:51,443 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:51,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:51,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1227873705, now seen corresponding path program 30 times [2018-10-10 16:23:51,444 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:51,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:52,139 WARN L178 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-10-10 16:23:52,352 WARN L178 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-10-10 16:23:54,104 INFO L134 CoverageAnalysis]: Checked inductivity of 14710 backedges. 5398 proven. 436 refuted. 0 times theorem prover too weak. 8876 trivial. 0 not checked. [2018-10-10 16:23:54,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:54,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-10 16:23:54,105 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-10 16:23:54,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-10 16:23:54,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1269, Unknown=0, NotChecked=0, Total=1406 [2018-10-10 16:23:54,106 INFO L87 Difference]: Start difference. First operand 1437 states and 1442 transitions. Second operand 38 states. [2018-10-10 16:24:01,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:24:01,659 INFO L93 Difference]: Finished difference Result 1665 states and 1672 transitions. [2018-10-10 16:24:01,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-10 16:24:01,660 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 1394 [2018-10-10 16:24:01,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:24:01,667 INFO L225 Difference]: With dead ends: 1665 [2018-10-10 16:24:01,667 INFO L226 Difference]: Without dead ends: 1665 [2018-10-10 16:24:01,668 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2066 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1665, Invalid=7077, Unknown=0, NotChecked=0, Total=8742 [2018-10-10 16:24:01,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1665 states. [2018-10-10 16:24:01,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1665 to 1451. [2018-10-10 16:24:01,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1451 states. [2018-10-10 16:24:01,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1451 states to 1451 states and 1457 transitions. [2018-10-10 16:24:01,681 INFO L78 Accepts]: Start accepts. Automaton has 1451 states and 1457 transitions. Word has length 1394 [2018-10-10 16:24:01,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:24:01,682 INFO L481 AbstractCegarLoop]: Abstraction has 1451 states and 1457 transitions. [2018-10-10 16:24:01,682 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-10 16:24:01,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1451 states and 1457 transitions. [2018-10-10 16:24:01,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1409 [2018-10-10 16:24:01,693 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:24:01,694 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 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, 28, 28, 28, 28, 28, 28, 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, 8, 8, 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] [2018-10-10 16:24:01,694 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:24:01,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:24:01,694 INFO L82 PathProgramCache]: Analyzing trace with hash -17831053, now seen corresponding path program 31 times [2018-10-10 16:24:01,695 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:24:01,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:24:04,494 INFO L134 CoverageAnalysis]: Checked inductivity of 15099 backedges. 306 proven. 13078 refuted. 0 times theorem prover too weak. 1715 trivial. 0 not checked. [2018-10-10 16:24:04,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:24:04,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-10 16:24:04,495 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-10 16:24:04,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-10 16:24:04,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=1104, Unknown=0, NotChecked=0, Total=1260 [2018-10-10 16:24:04,496 INFO L87 Difference]: Start difference. First operand 1451 states and 1457 transitions. Second operand 36 states. [2018-10-10 16:24:08,205 WARN L178 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-10-10 16:24:10,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:24:10,004 INFO L93 Difference]: Finished difference Result 2134 states and 2145 transitions. [2018-10-10 16:24:10,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-10-10 16:24:10,004 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 1408 [2018-10-10 16:24:10,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:24:10,010 INFO L225 Difference]: With dead ends: 2134 [2018-10-10 16:24:10,010 INFO L226 Difference]: Without dead ends: 2134 [2018-10-10 16:24:10,013 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12230 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=4995, Invalid=26867, Unknown=0, NotChecked=0, Total=31862 [2018-10-10 16:24:10,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2134 states. [2018-10-10 16:24:10,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2134 to 1829. [2018-10-10 16:24:10,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1829 states. [2018-10-10 16:24:10,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1829 states to 1829 states and 1838 transitions. [2018-10-10 16:24:10,030 INFO L78 Accepts]: Start accepts. Automaton has 1829 states and 1838 transitions. Word has length 1408 [2018-10-10 16:24:10,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:24:10,031 INFO L481 AbstractCegarLoop]: Abstraction has 1829 states and 1838 transitions. [2018-10-10 16:24:10,031 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-10 16:24:10,031 INFO L276 IsEmpty]: Start isEmpty. Operand 1829 states and 1838 transitions. [2018-10-10 16:24:10,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1673 [2018-10-10 16:24:10,048 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:24:10,048 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 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, 34, 34, 34, 34, 34, 34, 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, 9, 9, 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] [2018-10-10 16:24:10,048 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:24:10,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:24:10,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1096106853, now seen corresponding path program 32 times [2018-10-10 16:24:10,049 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:24:10,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:24:12,374 INFO L134 CoverageAnalysis]: Checked inductivity of 22093 backedges. 15694 proven. 3518 refuted. 0 times theorem prover too weak. 2881 trivial. 0 not checked. [2018-10-10 16:24:12,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:24:12,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-10 16:24:12,375 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-10 16:24:12,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-10 16:24:12,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=857, Unknown=0, NotChecked=0, Total=992 [2018-10-10 16:24:12,376 INFO L87 Difference]: Start difference. First operand 1829 states and 1838 transitions. Second operand 32 states. [2018-10-10 16:24:14,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:24:14,490 INFO L93 Difference]: Finished difference Result 1750 states and 1757 transitions. [2018-10-10 16:24:14,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-10 16:24:14,491 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 1672 [2018-10-10 16:24:14,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:24:14,495 INFO L225 Difference]: With dead ends: 1750 [2018-10-10 16:24:14,495 INFO L226 Difference]: Without dead ends: 1750 [2018-10-10 16:24:14,496 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1188 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1048, Invalid=4502, Unknown=0, NotChecked=0, Total=5550 [2018-10-10 16:24:14,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1750 states. [2018-10-10 16:24:14,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1750 to 1750. [2018-10-10 16:24:14,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1750 states. [2018-10-10 16:24:14,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1750 states and 1757 transitions. [2018-10-10 16:24:14,511 INFO L78 Accepts]: Start accepts. Automaton has 1750 states and 1757 transitions. Word has length 1672 [2018-10-10 16:24:14,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:24:14,512 INFO L481 AbstractCegarLoop]: Abstraction has 1750 states and 1757 transitions. [2018-10-10 16:24:14,512 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-10 16:24:14,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 1757 transitions. [2018-10-10 16:24:14,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1694 [2018-10-10 16:24:14,528 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:24:14,529 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, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 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, 9, 9, 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] [2018-10-10 16:24:14,529 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:24:14,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:24:14,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1008950709, now seen corresponding path program 33 times [2018-10-10 16:24:14,530 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:24:14,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:24:16,855 INFO L134 CoverageAnalysis]: Checked inductivity of 22816 backedges. 12691 proven. 444 refuted. 0 times theorem prover too weak. 9681 trivial. 0 not checked. [2018-10-10 16:24:16,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:24:16,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-10 16:24:16,857 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-10 16:24:16,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-10 16:24:16,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=808, Unknown=0, NotChecked=0, Total=930 [2018-10-10 16:24:16,857 INFO L87 Difference]: Start difference. First operand 1750 states and 1757 transitions. Second operand 31 states. [2018-10-10 16:24:20,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:24:20,148 INFO L93 Difference]: Finished difference Result 1868 states and 1873 transitions. [2018-10-10 16:24:20,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-10 16:24:20,148 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 1693 [2018-10-10 16:24:20,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:24:20,151 INFO L225 Difference]: With dead ends: 1868 [2018-10-10 16:24:20,151 INFO L226 Difference]: Without dead ends: 1868 [2018-10-10 16:24:20,152 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2145 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1536, Invalid=7020, Unknown=0, NotChecked=0, Total=8556 [2018-10-10 16:24:20,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1868 states. [2018-10-10 16:24:20,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1868 to 1750. [2018-10-10 16:24:20,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1750 states. [2018-10-10 16:24:20,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1750 states and 1755 transitions. [2018-10-10 16:24:20,162 INFO L78 Accepts]: Start accepts. Automaton has 1750 states and 1755 transitions. Word has length 1693 [2018-10-10 16:24:20,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:24:20,163 INFO L481 AbstractCegarLoop]: Abstraction has 1750 states and 1755 transitions. [2018-10-10 16:24:20,163 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-10 16:24:20,163 INFO L276 IsEmpty]: Start isEmpty. Operand 1750 states and 1755 transitions. [2018-10-10 16:24:20,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1708 [2018-10-10 16:24:20,180 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:24:20,181 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 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, 35, 35, 35, 35, 35, 35, 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, 9, 9, 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] [2018-10-10 16:24:20,181 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:24:20,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:24:20,181 INFO L82 PathProgramCache]: Analyzing trace with hash 571923009, now seen corresponding path program 34 times [2018-10-10 16:24:20,182 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:24:20,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:24:22,166 INFO L134 CoverageAnalysis]: Checked inductivity of 23304 backedges. 7435 proven. 527 refuted. 0 times theorem prover too weak. 15342 trivial. 0 not checked. [2018-10-10 16:24:22,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:24:22,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-10 16:24:22,168 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-10 16:24:22,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-10 16:24:22,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1036, Unknown=0, NotChecked=0, Total=1190 [2018-10-10 16:24:22,168 INFO L87 Difference]: Start difference. First operand 1750 states and 1755 transitions. Second operand 35 states. [2018-10-10 16:24:27,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:24:27,344 INFO L93 Difference]: Finished difference Result 2400 states and 2409 transitions. [2018-10-10 16:24:27,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2018-10-10 16:24:27,344 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 1707 [2018-10-10 16:24:27,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:24:27,347 INFO L225 Difference]: With dead ends: 2400 [2018-10-10 16:24:27,347 INFO L226 Difference]: Without dead ends: 2400 [2018-10-10 16:24:27,351 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17008 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=5419, Invalid=37637, Unknown=0, NotChecked=0, Total=43056 [2018-10-10 16:24:27,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2400 states. [2018-10-10 16:24:27,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2400 to 1771. [2018-10-10 16:24:27,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1771 states. [2018-10-10 16:24:27,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 1771 states and 1777 transitions. [2018-10-10 16:24:27,361 INFO L78 Accepts]: Start accepts. Automaton has 1771 states and 1777 transitions. Word has length 1707 [2018-10-10 16:24:27,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:24:27,362 INFO L481 AbstractCegarLoop]: Abstraction has 1771 states and 1777 transitions. [2018-10-10 16:24:27,362 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-10 16:24:27,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 1777 transitions. [2018-10-10 16:24:27,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1729 [2018-10-10 16:24:27,377 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:24:27,377 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, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 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, 9, 9, 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] [2018-10-10 16:24:27,378 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:24:27,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:24:27,378 INFO L82 PathProgramCache]: Analyzing trace with hash -889303477, now seen corresponding path program 35 times [2018-10-10 16:24:27,378 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:24:27,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:24:28,179 WARN L178 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-10-10 16:24:28,368 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-10-10 16:24:30,822 INFO L134 CoverageAnalysis]: Checked inductivity of 24048 backedges. 8185 proven. 561 refuted. 0 times theorem prover too weak. 15302 trivial. 0 not checked. [2018-10-10 16:24:30,822 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:24:30,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-10 16:24:30,823 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-10 16:24:30,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-10 16:24:30,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1544, Unknown=0, NotChecked=0, Total=1722 [2018-10-10 16:24:30,824 INFO L87 Difference]: Start difference. First operand 1771 states and 1777 transitions. Second operand 42 states. [2018-10-10 16:24:37,487 WARN L178 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2018-10-10 16:24:39,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:24:39,966 INFO L93 Difference]: Finished difference Result 2139 states and 2148 transitions. [2018-10-10 16:24:39,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-10 16:24:39,967 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 1728 [2018-10-10 16:24:39,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:24:39,971 INFO L225 Difference]: With dead ends: 2139 [2018-10-10 16:24:39,971 INFO L226 Difference]: Without dead ends: 2139 [2018-10-10 16:24:39,972 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2754 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=2274, Invalid=9068, Unknown=0, NotChecked=0, Total=11342 [2018-10-10 16:24:39,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2139 states. [2018-10-10 16:24:39,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 1785. [2018-10-10 16:24:39,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1785 states. [2018-10-10 16:24:39,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1785 states to 1785 states and 1792 transitions. [2018-10-10 16:24:39,987 INFO L78 Accepts]: Start accepts. Automaton has 1785 states and 1792 transitions. Word has length 1728 [2018-10-10 16:24:39,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:24:39,988 INFO L481 AbstractCegarLoop]: Abstraction has 1785 states and 1792 transitions. [2018-10-10 16:24:39,988 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-10 16:24:39,988 INFO L276 IsEmpty]: Start isEmpty. Operand 1785 states and 1792 transitions. [2018-10-10 16:24:40,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1743 [2018-10-10 16:24:40,009 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:24:40,010 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 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, 36, 36, 36, 36, 36, 36, 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, 9, 9, 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] [2018-10-10 16:24:40,010 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:24:40,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:24:40,011 INFO L82 PathProgramCache]: Analyzing trace with hash 462657685, now seen corresponding path program 36 times [2018-10-10 16:24:40,012 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:24:40,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:24:42,630 INFO L134 CoverageAnalysis]: Checked inductivity of 24550 backedges. 8520 proven. 688 refuted. 0 times theorem prover too weak. 15342 trivial. 0 not checked. [2018-10-10 16:24:42,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:24:42,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-10 16:24:42,631 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-10 16:24:42,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-10 16:24:42,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1292, Unknown=0, NotChecked=0, Total=1482 [2018-10-10 16:24:42,632 INFO L87 Difference]: Start difference. First operand 1785 states and 1792 transitions. Second operand 39 states. [2018-10-10 16:24:49,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:24:49,075 INFO L93 Difference]: Finished difference Result 2630 states and 2644 transitions. [2018-10-10 16:24:49,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 214 states. [2018-10-10 16:24:49,076 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 1742 [2018-10-10 16:24:49,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:24:49,081 INFO L225 Difference]: With dead ends: 2630 [2018-10-10 16:24:49,082 INFO L226 Difference]: Without dead ends: 2630 [2018-10-10 16:24:49,088 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24773 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=7404, Invalid=53852, Unknown=0, NotChecked=0, Total=61256 [2018-10-10 16:24:49,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2630 states. [2018-10-10 16:24:49,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2630 to 1913. [2018-10-10 16:24:49,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1913 states. [2018-10-10 16:24:49,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1913 states to 1913 states and 1922 transitions. [2018-10-10 16:24:49,105 INFO L78 Accepts]: Start accepts. Automaton has 1913 states and 1922 transitions. Word has length 1742 [2018-10-10 16:24:49,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:24:49,106 INFO L481 AbstractCegarLoop]: Abstraction has 1913 states and 1922 transitions. [2018-10-10 16:24:49,106 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-10 16:24:49,106 INFO L276 IsEmpty]: Start isEmpty. Operand 1913 states and 1922 transitions. [2018-10-10 16:24:49,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1764 [2018-10-10 16:24:49,132 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:24:49,133 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, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 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, 9, 9, 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] [2018-10-10 16:24:49,134 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:24:49,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:24:49,134 INFO L82 PathProgramCache]: Analyzing trace with hash -2125473717, now seen corresponding path program 37 times [2018-10-10 16:24:49,135 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:24:49,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:24:52,188 INFO L134 CoverageAnalysis]: Checked inductivity of 25315 backedges. 4604 proven. 18271 refuted. 0 times theorem prover too weak. 2440 trivial. 0 not checked. [2018-10-10 16:24:52,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:24:52,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-10 16:24:52,189 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-10 16:24:52,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-10 16:24:52,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1218, Unknown=0, NotChecked=0, Total=1406 [2018-10-10 16:24:52,189 INFO L87 Difference]: Start difference. First operand 1913 states and 1922 transitions. Second operand 38 states. [2018-10-10 16:24:57,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:24:57,795 INFO L93 Difference]: Finished difference Result 2535 states and 2546 transitions. [2018-10-10 16:24:57,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2018-10-10 16:24:57,796 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 1763 [2018-10-10 16:24:57,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:24:57,803 INFO L225 Difference]: With dead ends: 2535 [2018-10-10 16:24:57,803 INFO L226 Difference]: Without dead ends: 2535 [2018-10-10 16:24:57,807 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18146 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=6942, Invalid=37368, Unknown=0, NotChecked=0, Total=44310 [2018-10-10 16:24:57,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2535 states. [2018-10-10 16:24:57,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2535 to 2254. [2018-10-10 16:24:57,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2254 states. [2018-10-10 16:24:57,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2254 states to 2254 states and 2264 transitions. [2018-10-10 16:24:57,825 INFO L78 Accepts]: Start accepts. Automaton has 2254 states and 2264 transitions. Word has length 1763 [2018-10-10 16:24:57,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:24:57,827 INFO L481 AbstractCegarLoop]: Abstraction has 2254 states and 2264 transitions. [2018-10-10 16:24:57,827 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-10 16:24:57,827 INFO L276 IsEmpty]: Start isEmpty. Operand 2254 states and 2264 transitions. [2018-10-10 16:24:57,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2063 [2018-10-10 16:24:57,855 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:24:57,856 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, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 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, 10, 10, 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] [2018-10-10 16:24:57,857 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:24:57,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:24:57,857 INFO L82 PathProgramCache]: Analyzing trace with hash 282244797, now seen corresponding path program 38 times [2018-10-10 16:24:57,858 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:24:57,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:25:01,189 INFO L134 CoverageAnalysis]: Checked inductivity of 35712 backedges. 26156 proven. 5221 refuted. 0 times theorem prover too weak. 4335 trivial. 0 not checked. [2018-10-10 16:25:01,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:25:01,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-10 16:25:01,191 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-10 16:25:01,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-10 16:25:01,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1091, Unknown=0, NotChecked=0, Total=1260 [2018-10-10 16:25:01,192 INFO L87 Difference]: Start difference. First operand 2254 states and 2264 transitions. Second operand 36 states. [2018-10-10 16:25:04,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:25:04,169 INFO L93 Difference]: Finished difference Result 2161 states and 2169 transitions. [2018-10-10 16:25:04,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-10 16:25:04,169 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 2062 [2018-10-10 16:25:04,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:25:04,173 INFO L225 Difference]: With dead ends: 2161 [2018-10-10 16:25:04,173 INFO L226 Difference]: Without dead ends: 2161 [2018-10-10 16:25:04,174 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1562 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1347, Invalid=5793, Unknown=0, NotChecked=0, Total=7140 [2018-10-10 16:25:04,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2161 states. [2018-10-10 16:25:04,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2161 to 2161. [2018-10-10 16:25:04,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2161 states. [2018-10-10 16:25:04,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2161 states to 2161 states and 2169 transitions. [2018-10-10 16:25:04,188 INFO L78 Accepts]: Start accepts. Automaton has 2161 states and 2169 transitions. Word has length 2062 [2018-10-10 16:25:04,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:25:04,189 INFO L481 AbstractCegarLoop]: Abstraction has 2161 states and 2169 transitions. [2018-10-10 16:25:04,189 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-10 16:25:04,189 INFO L276 IsEmpty]: Start isEmpty. Operand 2161 states and 2169 transitions. [2018-10-10 16:25:04,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2084 [2018-10-10 16:25:04,223 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:25:04,225 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, 44, 44, 44, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 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, 10, 10, 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] [2018-10-10 16:25:04,225 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:25:04,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:25:04,225 INFO L82 PathProgramCache]: Analyzing trace with hash 886277747, now seen corresponding path program 39 times [2018-10-10 16:25:04,226 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:25:04,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:25:06,649 INFO L134 CoverageAnalysis]: Checked inductivity of 36646 backedges. 19545 proven. 570 refuted. 0 times theorem prover too weak. 16531 trivial. 0 not checked. [2018-10-10 16:25:06,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:25:06,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-10 16:25:06,651 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-10 16:25:06,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-10 16:25:06,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1036, Unknown=0, NotChecked=0, Total=1190 [2018-10-10 16:25:06,652 INFO L87 Difference]: Start difference. First operand 2161 states and 2169 transitions. Second operand 35 states. [2018-10-10 16:25:10,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:25:10,937 INFO L93 Difference]: Finished difference Result 2389 states and 2394 transitions. [2018-10-10 16:25:10,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-10 16:25:10,938 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 2083 [2018-10-10 16:25:10,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:25:10,941 INFO L225 Difference]: With dead ends: 2389 [2018-10-10 16:25:10,942 INFO L226 Difference]: Without dead ends: 2261 [2018-10-10 16:25:10,943 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2852 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1990, Invalid=9140, Unknown=0, NotChecked=0, Total=11130 [2018-10-10 16:25:10,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2261 states. [2018-10-10 16:25:10,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2261 to 2140. [2018-10-10 16:25:10,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2140 states. [2018-10-10 16:25:10,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 2140 states and 2145 transitions. [2018-10-10 16:25:10,956 INFO L78 Accepts]: Start accepts. Automaton has 2140 states and 2145 transitions. Word has length 2083 [2018-10-10 16:25:10,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:25:10,957 INFO L481 AbstractCegarLoop]: Abstraction has 2140 states and 2145 transitions. [2018-10-10 16:25:10,957 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-10 16:25:10,957 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 2145 transitions. [2018-10-10 16:25:10,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2098 [2018-10-10 16:25:10,980 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:25:10,981 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, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 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, 10, 10, 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] [2018-10-10 16:25:10,981 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:25:10,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:25:10,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1437673495, now seen corresponding path program 40 times [2018-10-10 16:25:10,982 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:25:11,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:25:14,925 INFO L134 CoverageAnalysis]: Checked inductivity of 37261 backedges. 11793 proven. 700 refuted. 0 times theorem prover too weak. 24768 trivial. 0 not checked. [2018-10-10 16:25:14,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:25:14,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-10 16:25:14,926 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-10 16:25:14,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-10 16:25:14,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1720, Unknown=0, NotChecked=0, Total=1892 [2018-10-10 16:25:14,927 INFO L87 Difference]: Start difference. First operand 2140 states and 2145 transitions. Second operand 44 states. [2018-10-10 16:25:22,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:25:22,482 INFO L93 Difference]: Finished difference Result 2368 states and 2375 transitions. [2018-10-10 16:25:22,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-10 16:25:22,483 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 2097 [2018-10-10 16:25:22,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:25:22,486 INFO L225 Difference]: With dead ends: 2368 [2018-10-10 16:25:22,486 INFO L226 Difference]: Without dead ends: 2368 [2018-10-10 16:25:22,488 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3045 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1856, Invalid=9916, Unknown=0, NotChecked=0, Total=11772 [2018-10-10 16:25:22,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2368 states. [2018-10-10 16:25:22,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2368 to 2154. [2018-10-10 16:25:22,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2154 states. [2018-10-10 16:25:22,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2154 states to 2154 states and 2160 transitions. [2018-10-10 16:25:22,506 INFO L78 Accepts]: Start accepts. Automaton has 2154 states and 2160 transitions. Word has length 2097 [2018-10-10 16:25:22,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:25:22,508 INFO L481 AbstractCegarLoop]: Abstraction has 2154 states and 2160 transitions. [2018-10-10 16:25:22,508 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-10 16:25:22,508 INFO L276 IsEmpty]: Start isEmpty. Operand 2154 states and 2160 transitions. [2018-10-10 16:25:22,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2112 [2018-10-10 16:25:22,544 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:25:22,545 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 46, 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, 45, 45, 45, 45, 45, 45, 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, 10, 10, 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] [2018-10-10 16:25:22,546 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:25:22,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:25:22,546 INFO L82 PathProgramCache]: Analyzing trace with hash -802425421, now seen corresponding path program 41 times [2018-10-10 16:25:22,547 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:25:22,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:25:26,790 INFO L134 CoverageAnalysis]: Checked inductivity of 37890 backedges. 543 proven. 33570 refuted. 0 times theorem prover too weak. 3777 trivial. 0 not checked. [2018-10-10 16:25:26,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:25:26,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-10 16:25:26,792 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-10 16:25:26,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-10 16:25:26,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=1660, Unknown=0, NotChecked=0, Total=1892 [2018-10-10 16:25:26,792 INFO L87 Difference]: Start difference. First operand 2154 states and 2160 transitions. Second operand 44 states. [2018-10-10 16:25:34,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:25:34,639 INFO L93 Difference]: Finished difference Result 3005 states and 3016 transitions. [2018-10-10 16:25:34,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 212 states. [2018-10-10 16:25:34,639 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 2111 [2018-10-10 16:25:34,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:25:34,643 INFO L225 Difference]: With dead ends: 3005 [2018-10-10 16:25:34,643 INFO L226 Difference]: Without dead ends: 3005 [2018-10-10 16:25:34,649 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25981 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=9304, Invalid=53948, Unknown=0, NotChecked=0, Total=63252 [2018-10-10 16:25:34,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3005 states. [2018-10-10 16:25:34,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3005 to 2630. [2018-10-10 16:25:34,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2630 states. [2018-10-10 16:25:34,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2630 states to 2630 states and 2639 transitions. [2018-10-10 16:25:34,665 INFO L78 Accepts]: Start accepts. Automaton has 2630 states and 2639 transitions. Word has length 2111 [2018-10-10 16:25:34,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:25:34,665 INFO L481 AbstractCegarLoop]: Abstraction has 2630 states and 2639 transitions. [2018-10-10 16:25:34,665 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-10 16:25:34,666 INFO L276 IsEmpty]: Start isEmpty. Operand 2630 states and 2639 transitions. [2018-10-10 16:25:34,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2446 [2018-10-10 16:25:34,697 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:25:34,698 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 54, 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, 53, 53, 53, 53, 53, 53, 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, 11, 11, 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] [2018-10-10 16:25:34,698 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:25:34,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:25:34,698 INFO L82 PathProgramCache]: Analyzing trace with hash -805188527, now seen corresponding path program 42 times [2018-10-10 16:25:34,699 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:25:34,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:25:39,052 INFO L134 CoverageAnalysis]: Checked inductivity of 52275 backedges. 39088 proven. 7412 refuted. 0 times theorem prover too weak. 5775 trivial. 0 not checked. [2018-10-10 16:25:39,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:25:39,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-10 16:25:39,054 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-10 16:25:39,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-10 16:25:39,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1353, Unknown=0, NotChecked=0, Total=1560 [2018-10-10 16:25:39,054 INFO L87 Difference]: Start difference. First operand 2630 states and 2639 transitions. Second operand 40 states. [2018-10-10 16:25:42,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:25:42,507 INFO L93 Difference]: Finished difference Result 2523 states and 2530 transitions. [2018-10-10 16:25:42,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-10 16:25:42,508 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 2445 [2018-10-10 16:25:42,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:25:42,511 INFO L225 Difference]: With dead ends: 2523 [2018-10-10 16:25:42,512 INFO L226 Difference]: Without dead ends: 2523 [2018-10-10 16:25:42,512 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1987 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1684, Invalid=7246, Unknown=0, NotChecked=0, Total=8930 [2018-10-10 16:25:42,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2523 states. [2018-10-10 16:25:42,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2523 to 2523. [2018-10-10 16:25:42,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2523 states. [2018-10-10 16:25:42,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2523 states to 2523 states and 2530 transitions. [2018-10-10 16:25:42,526 INFO L78 Accepts]: Start accepts. Automaton has 2523 states and 2530 transitions. Word has length 2445 [2018-10-10 16:25:42,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:25:42,526 INFO L481 AbstractCegarLoop]: Abstraction has 2523 states and 2530 transitions. [2018-10-10 16:25:42,526 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-10 16:25:42,527 INFO L276 IsEmpty]: Start isEmpty. Operand 2523 states and 2530 transitions. [2018-10-10 16:25:42,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2467 [2018-10-10 16:25:42,557 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:25:42,558 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, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 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, 11, 11, 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] [2018-10-10 16:25:42,558 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:25:42,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:25:42,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1611646753, now seen corresponding path program 43 times [2018-10-10 16:25:42,559 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:25:42,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:25:45,832 INFO L134 CoverageAnalysis]: Checked inductivity of 53399 backedges. 26571 proven. 710 refuted. 0 times theorem prover too weak. 26118 trivial. 0 not checked. [2018-10-10 16:25:45,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:25:45,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-10 16:25:45,833 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-10 16:25:45,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-10 16:25:45,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1292, Unknown=0, NotChecked=0, Total=1482 [2018-10-10 16:25:45,834 INFO L87 Difference]: Start difference. First operand 2523 states and 2530 transitions. Second operand 39 states. [2018-10-10 16:25:50,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:25:50,897 INFO L93 Difference]: Finished difference Result 2641 states and 2646 transitions. [2018-10-10 16:25:50,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-10-10 16:25:50,898 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 2466 [2018-10-10 16:25:50,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:25:50,903 INFO L225 Difference]: With dead ends: 2641 [2018-10-10 16:25:50,903 INFO L226 Difference]: Without dead ends: 2641 [2018-10-10 16:25:50,905 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3659 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2504, Invalid=11538, Unknown=0, NotChecked=0, Total=14042 [2018-10-10 16:25:50,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2641 states. [2018-10-10 16:25:50,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2641 to 2523. [2018-10-10 16:25:50,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2523 states. [2018-10-10 16:25:50,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2523 states to 2523 states and 2528 transitions. [2018-10-10 16:25:50,924 INFO L78 Accepts]: Start accepts. Automaton has 2523 states and 2528 transitions. Word has length 2466 [2018-10-10 16:25:50,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:25:50,925 INFO L481 AbstractCegarLoop]: Abstraction has 2523 states and 2528 transitions. [2018-10-10 16:25:50,925 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-10 16:25:50,925 INFO L276 IsEmpty]: Start isEmpty. Operand 2523 states and 2528 transitions. [2018-10-10 16:25:50,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2481 [2018-10-10 16:25:50,974 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:25:50,975 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 55, 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, 54, 54, 54, 54, 54, 54, 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, 11, 11, 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] [2018-10-10 16:25:50,975 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:25:50,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:25:50,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1466933163, now seen corresponding path program 44 times [2018-10-10 16:25:50,976 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:25:51,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:25:54,336 INFO L134 CoverageAnalysis]: Checked inductivity of 54155 backedges. 15115 proven. 870 refuted. 0 times theorem prover too weak. 38170 trivial. 0 not checked. [2018-10-10 16:25:54,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:25:54,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-10 16:25:54,337 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-10 16:25:54,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-10 16:25:54,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=1576, Unknown=0, NotChecked=0, Total=1806 [2018-10-10 16:25:54,338 INFO L87 Difference]: Start difference. First operand 2523 states and 2528 transitions. Second operand 43 states. [2018-10-10 16:26:02,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:26:02,385 INFO L93 Difference]: Finished difference Result 3271 states and 3280 transitions. [2018-10-10 16:26:02,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 249 states. [2018-10-10 16:26:02,386 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 2480 [2018-10-10 16:26:02,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:26:02,390 INFO L225 Difference]: With dead ends: 3271 [2018-10-10 16:26:02,390 INFO L226 Difference]: Without dead ends: 3271 [2018-10-10 16:26:02,396 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 285 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34132 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=9762, Invalid=72320, Unknown=0, NotChecked=0, Total=82082 [2018-10-10 16:26:02,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3271 states. [2018-10-10 16:26:02,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3271 to 2544. [2018-10-10 16:26:02,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2544 states. [2018-10-10 16:26:02,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2544 states to 2544 states and 2550 transitions. [2018-10-10 16:26:02,416 INFO L78 Accepts]: Start accepts. Automaton has 2544 states and 2550 transitions. Word has length 2480 [2018-10-10 16:26:02,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:26:02,417 INFO L481 AbstractCegarLoop]: Abstraction has 2544 states and 2550 transitions. [2018-10-10 16:26:02,418 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-10 16:26:02,418 INFO L276 IsEmpty]: Start isEmpty. Operand 2544 states and 2550 transitions. [2018-10-10 16:26:02,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2502 [2018-10-10 16:26:02,468 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:26:02,469 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, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 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, 11, 11, 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] [2018-10-10 16:26:02,469 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:26:02,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:26:02,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1483764063, now seen corresponding path program 45 times [2018-10-10 16:26:02,470 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:26:02,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:26:07,618 INFO L134 CoverageAnalysis]: Checked inductivity of 55300 backedges. 16327 proven. 853 refuted. 0 times theorem prover too weak. 38120 trivial. 0 not checked. [2018-10-10 16:26:07,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:26:07,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-10 16:26:07,620 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-10 16:26:07,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-10 16:26:07,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=2196, Unknown=0, NotChecked=0, Total=2450 [2018-10-10 16:26:07,620 INFO L87 Difference]: Start difference. First operand 2544 states and 2550 transitions. Second operand 50 states. [2018-10-10 16:26:19,653 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2018-10-10 16:26:20,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:26:20,495 INFO L93 Difference]: Finished difference Result 2940 states and 2949 transitions. [2018-10-10 16:26:20,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-10 16:26:20,495 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 2501 [2018-10-10 16:26:20,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:26:20,498 INFO L225 Difference]: With dead ends: 2940 [2018-10-10 16:26:20,498 INFO L226 Difference]: Without dead ends: 2940 [2018-10-10 16:26:20,500 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4090 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=3297, Invalid=13215, Unknown=0, NotChecked=0, Total=16512 [2018-10-10 16:26:20,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2940 states. [2018-10-10 16:26:20,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2940 to 2558. [2018-10-10 16:26:20,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2558 states. [2018-10-10 16:26:20,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2558 states to 2558 states and 2565 transitions. [2018-10-10 16:26:20,515 INFO L78 Accepts]: Start accepts. Automaton has 2558 states and 2565 transitions. Word has length 2501 [2018-10-10 16:26:20,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:26:20,516 INFO L481 AbstractCegarLoop]: Abstraction has 2558 states and 2565 transitions. [2018-10-10 16:26:20,516 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-10 16:26:20,516 INFO L276 IsEmpty]: Start isEmpty. Operand 2558 states and 2565 transitions. [2018-10-10 16:26:20,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2516 [2018-10-10 16:26:20,552 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:26:20,553 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 56, 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, 55, 55, 55, 55, 55, 55, 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, 11, 11, 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] [2018-10-10 16:26:20,553 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:26:20,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:26:20,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1043384489, now seen corresponding path program 46 times [2018-10-10 16:26:20,555 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:26:20,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:26:24,160 INFO L134 CoverageAnalysis]: Checked inductivity of 56070 backedges. 16827 proven. 1073 refuted. 0 times theorem prover too weak. 38170 trivial. 0 not checked. [2018-10-10 16:26:24,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:26:24,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-10 16:26:24,161 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-10 16:26:24,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-10 16:26:24,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=1888, Unknown=0, NotChecked=0, Total=2162 [2018-10-10 16:26:24,162 INFO L87 Difference]: Start difference. First operand 2558 states and 2565 transitions. Second operand 47 states. [2018-10-10 16:26:34,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:26:34,309 INFO L93 Difference]: Finished difference Result 3529 states and 3543 transitions. [2018-10-10 16:26:34,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 291 states. [2018-10-10 16:26:34,309 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 2515 [2018-10-10 16:26:34,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:26:34,313 INFO L225 Difference]: With dead ends: 3529 [2018-10-10 16:26:34,314 INFO L226 Difference]: Without dead ends: 3529 [2018-10-10 16:26:34,321 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 331 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46772 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=12801, Invalid=97755, Unknown=0, NotChecked=0, Total=110556 [2018-10-10 16:26:34,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3529 states. [2018-10-10 16:26:34,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3529 to 2714. [2018-10-10 16:26:34,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2714 states. [2018-10-10 16:26:34,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2714 states to 2714 states and 2723 transitions. [2018-10-10 16:26:34,340 INFO L78 Accepts]: Start accepts. Automaton has 2714 states and 2723 transitions. Word has length 2515 [2018-10-10 16:26:34,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:26:34,340 INFO L481 AbstractCegarLoop]: Abstraction has 2714 states and 2723 transitions. [2018-10-10 16:26:34,341 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-10 16:26:34,341 INFO L276 IsEmpty]: Start isEmpty. Operand 2714 states and 2723 transitions. [2018-10-10 16:26:34,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2537 [2018-10-10 16:26:34,374 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:26:34,375 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, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 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, 11, 11, 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] [2018-10-10 16:26:34,375 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:26:34,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:26:34,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1065831263, now seen corresponding path program 47 times [2018-10-10 16:26:34,377 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:26:34,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:26:39,416 INFO L134 CoverageAnalysis]: Checked inductivity of 57236 backedges. 8610 proven. 43666 refuted. 0 times theorem prover too weak. 4960 trivial. 0 not checked. [2018-10-10 16:26:39,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:26:39,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-10 16:26:39,418 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-10 16:26:39,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-10 16:26:39,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=1798, Unknown=0, NotChecked=0, Total=2070 [2018-10-10 16:26:39,419 INFO L87 Difference]: Start difference. First operand 2714 states and 2723 transitions. Second operand 46 states. [2018-10-10 16:26:48,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:26:48,242 INFO L93 Difference]: Finished difference Result 3462 states and 3473 transitions. [2018-10-10 16:26:48,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 246 states. [2018-10-10 16:26:48,243 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 2536 [2018-10-10 16:26:48,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:26:48,248 INFO L225 Difference]: With dead ends: 3462 [2018-10-10 16:26:48,249 INFO L226 Difference]: Without dead ends: 3462 [2018-10-10 16:26:48,258 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 286 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35596 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=12251, Invalid=70405, Unknown=0, NotChecked=0, Total=82656 [2018-10-10 16:26:48,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3462 states. [2018-10-10 16:26:48,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3462 to 3125. [2018-10-10 16:26:48,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3125 states. [2018-10-10 16:26:48,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 3135 transitions. [2018-10-10 16:26:48,280 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 3135 transitions. Word has length 2536 [2018-10-10 16:26:48,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:26:48,280 INFO L481 AbstractCegarLoop]: Abstraction has 3125 states and 3135 transitions. [2018-10-10 16:26:48,281 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-10 16:26:48,281 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 3135 transitions. [2018-10-10 16:26:48,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2906 [2018-10-10 16:26:48,327 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:26:48,328 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, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 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, 12, 12, 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] [2018-10-10 16:26:48,328 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:26:48,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:26:48,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1197072643, now seen corresponding path program 48 times [2018-10-10 16:26:48,329 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:26:48,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:26:53,993 INFO L134 CoverageAnalysis]: Checked inductivity of 76933 backedges. 58825 proven. 10154 refuted. 0 times theorem prover too weak. 7954 trivial. 0 not checked. [2018-10-10 16:26:53,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:26:53,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-10 16:26:53,994 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-10 16:26:53,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-10 16:26:53,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=1643, Unknown=0, NotChecked=0, Total=1892 [2018-10-10 16:26:53,995 INFO L87 Difference]: Start difference. First operand 3125 states and 3135 transitions. Second operand 44 states. [2018-10-10 16:26:57,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:26:57,780 INFO L93 Difference]: Finished difference Result 3004 states and 3012 transitions. [2018-10-10 16:26:57,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-10 16:26:57,781 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 2905 [2018-10-10 16:26:57,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:26:57,784 INFO L225 Difference]: With dead ends: 3004 [2018-10-10 16:26:57,784 INFO L226 Difference]: Without dead ends: 3004 [2018-10-10 16:26:57,785 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2463 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2059, Invalid=8861, Unknown=0, NotChecked=0, Total=10920 [2018-10-10 16:26:57,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3004 states. [2018-10-10 16:26:57,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3004 to 3004. [2018-10-10 16:26:57,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3004 states. [2018-10-10 16:26:57,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3004 states to 3004 states and 3012 transitions. [2018-10-10 16:26:57,801 INFO L78 Accepts]: Start accepts. Automaton has 3004 states and 3012 transitions. Word has length 2905 [2018-10-10 16:26:57,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:26:57,802 INFO L481 AbstractCegarLoop]: Abstraction has 3004 states and 3012 transitions. [2018-10-10 16:26:57,802 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-10 16:26:57,802 INFO L276 IsEmpty]: Start isEmpty. Operand 3004 states and 3012 transitions. [2018-10-10 16:26:57,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2927 [2018-10-10 16:26:57,846 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:26:57,848 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, 65, 65, 65, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 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, 12, 12, 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] [2018-10-10 16:26:57,848 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:26:57,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:26:57,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1807032627, now seen corresponding path program 49 times [2018-10-10 16:26:57,849 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:26:57,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:27:02,220 INFO L134 CoverageAnalysis]: Checked inductivity of 78310 backedges. 37440 proven. 864 refuted. 0 times theorem prover too weak. 40006 trivial. 0 not checked. [2018-10-10 16:27:02,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:27:02,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-10 16:27:02,222 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-10 16:27:02,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-10 16:27:02,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=1576, Unknown=0, NotChecked=0, Total=1806 [2018-10-10 16:27:02,223 INFO L87 Difference]: Start difference. First operand 3004 states and 3012 transitions. Second operand 43 states. [2018-10-10 16:27:07,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:27:07,326 INFO L93 Difference]: Finished difference Result 3260 states and 3265 transitions. [2018-10-10 16:27:07,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-10-10 16:27:07,327 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 2926 [2018-10-10 16:27:07,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:27:07,330 INFO L225 Difference]: With dead ends: 3260 [2018-10-10 16:27:07,331 INFO L226 Difference]: Without dead ends: 3104 [2018-10-10 16:27:07,332 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4566 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3078, Invalid=14214, Unknown=0, NotChecked=0, Total=17292 [2018-10-10 16:27:07,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3104 states. [2018-10-10 16:27:07,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3104 to 2983. [2018-10-10 16:27:07,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2983 states. [2018-10-10 16:27:07,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2983 states to 2983 states and 2988 transitions. [2018-10-10 16:27:07,346 INFO L78 Accepts]: Start accepts. Automaton has 2983 states and 2988 transitions. Word has length 2926 [2018-10-10 16:27:07,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:27:07,347 INFO L481 AbstractCegarLoop]: Abstraction has 2983 states and 2988 transitions. [2018-10-10 16:27:07,347 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-10 16:27:07,347 INFO L276 IsEmpty]: Start isEmpty. Operand 2983 states and 2988 transitions. [2018-10-10 16:27:07,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2941 [2018-10-10 16:27:07,390 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:27:07,390 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, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 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, 12, 12, 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] [2018-10-10 16:27:07,391 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:27:07,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:27:07,391 INFO L82 PathProgramCache]: Analyzing trace with hash -2128354007, now seen corresponding path program 50 times [2018-10-10 16:27:07,392 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:27:07,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:27:13,829 INFO L134 CoverageAnalysis]: Checked inductivity of 79221 backedges. 21892 proven. 1020 refuted. 0 times theorem prover too weak. 56309 trivial. 0 not checked. [2018-10-10 16:27:13,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:27:13,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-10-10 16:27:13,830 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-10 16:27:13,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-10 16:27:13,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=2581, Unknown=0, NotChecked=0, Total=2862 [2018-10-10 16:27:13,831 INFO L87 Difference]: Start difference. First operand 2983 states and 2988 transitions. Second operand 54 states. [2018-10-10 16:27:22,837 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2018-10-10 16:27:23,395 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2018-10-10 16:27:23,559 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2018-10-10 16:27:24,005 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2018-10-10 16:27:24,177 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2018-10-10 16:27:24,610 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 56 [2018-10-10 16:27:24,851 WARN L178 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2018-10-10 16:27:25,914 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 56 [2018-10-10 16:27:26,504 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2018-10-10 16:27:27,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:27:27,402 INFO L93 Difference]: Finished difference Result 3211 states and 3218 transitions. [2018-10-10 16:27:27,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-10 16:27:27,403 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 2940 [2018-10-10 16:27:27,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:27:27,406 INFO L225 Difference]: With dead ends: 3211 [2018-10-10 16:27:27,406 INFO L226 Difference]: Without dead ends: 3211 [2018-10-10 16:27:27,408 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4674 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=3643, Invalid=15263, Unknown=0, NotChecked=0, Total=18906 [2018-10-10 16:27:27,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3211 states. [2018-10-10 16:27:27,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3211 to 2997. [2018-10-10 16:27:27,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2997 states. [2018-10-10 16:27:27,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2997 states to 2997 states and 3003 transitions. [2018-10-10 16:27:27,423 INFO L78 Accepts]: Start accepts. Automaton has 2997 states and 3003 transitions. Word has length 2940 [2018-10-10 16:27:27,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:27:27,424 INFO L481 AbstractCegarLoop]: Abstraction has 2997 states and 3003 transitions. [2018-10-10 16:27:27,424 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-10 16:27:27,424 INFO L276 IsEmpty]: Start isEmpty. Operand 2997 states and 3003 transitions. [2018-10-10 16:27:27,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2955 [2018-10-10 16:27:27,472 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:27:27,473 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 67, 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, 66, 66, 66, 66, 66, 66, 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, 12, 12, 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] [2018-10-10 16:27:27,473 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:27:27,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:27:27,473 INFO L82 PathProgramCache]: Analyzing trace with hash 696308467, now seen corresponding path program 51 times [2018-10-10 16:27:27,474 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:27:27,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:27:33,870 INFO L134 CoverageAnalysis]: Checked inductivity of 80146 backedges. 848 proven. 72247 refuted. 0 times theorem prover too weak. 7051 trivial. 0 not checked. [2018-10-10 16:27:33,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:27:33,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-10-10 16:27:33,872 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-10 16:27:33,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-10 16:27:33,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=324, Invalid=2328, Unknown=0, NotChecked=0, Total=2652 [2018-10-10 16:27:33,872 INFO L87 Difference]: Start difference. First operand 2997 states and 3003 transitions. Second operand 52 states. [2018-10-10 16:27:45,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:27:45,366 INFO L93 Difference]: Finished difference Result 4016 states and 4027 transitions. [2018-10-10 16:27:45,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 289 states. [2018-10-10 16:27:45,366 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 2954 [2018-10-10 16:27:45,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:27:45,370 INFO L225 Difference]: With dead ends: 4016 [2018-10-10 16:27:45,370 INFO L226 Difference]: Without dead ends: 4016 [2018-10-10 16:27:45,378 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 335 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48918 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=15960, Invalid=97272, Unknown=0, NotChecked=0, Total=113232 [2018-10-10 16:27:45,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4016 states. [2018-10-10 16:27:45,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4016 to 3571. [2018-10-10 16:27:45,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3571 states. [2018-10-10 16:27:45,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3571 states to 3571 states and 3580 transitions. [2018-10-10 16:27:45,397 INFO L78 Accepts]: Start accepts. Automaton has 3571 states and 3580 transitions. Word has length 2954 [2018-10-10 16:27:45,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:27:45,398 INFO L481 AbstractCegarLoop]: Abstraction has 3571 states and 3580 transitions. [2018-10-10 16:27:45,398 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-10 16:27:45,398 INFO L276 IsEmpty]: Start isEmpty. Operand 3571 states and 3580 transitions. [2018-10-10 16:27:45,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3359 [2018-10-10 16:27:45,452 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:27:45,453 INFO L375 BasicCegarLoop]: trace histogram [77, 77, 77, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 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, 13, 13, 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] [2018-10-10 16:27:45,453 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:27:45,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:27:45,454 INFO L82 PathProgramCache]: Analyzing trace with hash 251828797, now seen corresponding path program 52 times [2018-10-10 16:27:45,454 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:27:45,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:27:53,249 INFO L134 CoverageAnalysis]: Checked inductivity of 105866 backedges. 82251 proven. 13510 refuted. 0 times theorem prover too weak. 10105 trivial. 0 not checked. [2018-10-10 16:27:53,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:27:53,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-10 16:27:53,250 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-10 16:27:53,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-10 16:27:53,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=1961, Unknown=0, NotChecked=0, Total=2256 [2018-10-10 16:27:53,251 INFO L87 Difference]: Start difference. First operand 3571 states and 3580 transitions. Second operand 48 states. [2018-10-10 16:27:57,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:27:57,368 INFO L93 Difference]: Finished difference Result 3436 states and 3443 transitions. [2018-10-10 16:27:57,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-10 16:27:57,368 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 3358 [2018-10-10 16:27:57,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:27:57,373 INFO L225 Difference]: With dead ends: 3436 [2018-10-10 16:27:57,373 INFO L226 Difference]: Without dead ends: 3436 [2018-10-10 16:27:57,374 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2990 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2472, Invalid=10638, Unknown=0, NotChecked=0, Total=13110 [2018-10-10 16:27:57,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3436 states. [2018-10-10 16:27:57,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3436 to 3436. [2018-10-10 16:27:57,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3436 states. [2018-10-10 16:27:57,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3436 states to 3436 states and 3443 transitions. [2018-10-10 16:27:57,389 INFO L78 Accepts]: Start accepts. Automaton has 3436 states and 3443 transitions. Word has length 3358 [2018-10-10 16:27:57,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:27:57,390 INFO L481 AbstractCegarLoop]: Abstraction has 3436 states and 3443 transitions. [2018-10-10 16:27:57,390 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-10 16:27:57,390 INFO L276 IsEmpty]: Start isEmpty. Operand 3436 states and 3443 transitions. [2018-10-10 16:27:57,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3380 [2018-10-10 16:27:57,448 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:27:57,449 INFO L375 BasicCegarLoop]: trace histogram [77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 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, 13, 13, 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] [2018-10-10 16:27:57,449 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:27:57,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:27:57,450 INFO L82 PathProgramCache]: Analyzing trace with hash -79714701, now seen corresponding path program 53 times [2018-10-10 16:27:57,450 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:27:57,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:28:04,317 INFO L134 CoverageAnalysis]: Checked inductivity of 107475 backedges. 48099 proven. 1032 refuted. 0 times theorem prover too weak. 58344 trivial. 0 not checked. [2018-10-10 16:28:04,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:28:04,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-10 16:28:04,319 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-10 16:28:04,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-10 16:28:04,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=1888, Unknown=0, NotChecked=0, Total=2162 [2018-10-10 16:28:04,319 INFO L87 Difference]: Start difference. First operand 3436 states and 3443 transitions. Second operand 47 states. [2018-10-10 16:28:10,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:28:10,401 INFO L93 Difference]: Finished difference Result 3554 states and 3559 transitions. [2018-10-10 16:28:10,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-10-10 16:28:10,401 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 3379 [2018-10-10 16:28:10,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:28:10,406 INFO L225 Difference]: With dead ends: 3554 [2018-10-10 16:28:10,406 INFO L226 Difference]: Without dead ends: 3554 [2018-10-10 16:28:10,407 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5573 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=3712, Invalid=17168, Unknown=0, NotChecked=0, Total=20880 [2018-10-10 16:28:10,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3554 states. [2018-10-10 16:28:10,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3554 to 3436. [2018-10-10 16:28:10,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3436 states. [2018-10-10 16:28:10,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3436 states to 3436 states and 3441 transitions. [2018-10-10 16:28:10,426 INFO L78 Accepts]: Start accepts. Automaton has 3436 states and 3441 transitions. Word has length 3379 [2018-10-10 16:28:10,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:28:10,428 INFO L481 AbstractCegarLoop]: Abstraction has 3436 states and 3441 transitions. [2018-10-10 16:28:10,428 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-10 16:28:10,428 INFO L276 IsEmpty]: Start isEmpty. Operand 3436 states and 3441 transitions. [2018-10-10 16:28:10,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3394 [2018-10-10 16:28:10,486 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:28:10,486 INFO L375 BasicCegarLoop]: trace histogram [78, 78, 78, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 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, 13, 13, 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] [2018-10-10 16:28:10,487 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:28:10,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:28:10,487 INFO L82 PathProgramCache]: Analyzing trace with hash 793337193, now seen corresponding path program 54 times [2018-10-10 16:28:10,488 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:28:10,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:28:15,975 INFO L134 CoverageAnalysis]: Checked inductivity of 108555 backedges. 26807 proven. 1297 refuted. 0 times theorem prover too weak. 80451 trivial. 0 not checked. [2018-10-10 16:28:15,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:28:15,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-10 16:28:15,976 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-10 16:28:15,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-10 16:28:15,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=2228, Unknown=0, NotChecked=0, Total=2550 [2018-10-10 16:28:15,977 INFO L87 Difference]: Start difference. First operand 3436 states and 3441 transitions. Second operand 51 states. [2018-10-10 16:28:27,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:28:27,795 INFO L93 Difference]: Finished difference Result 4282 states and 4291 transitions. [2018-10-10 16:28:27,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 332 states. [2018-10-10 16:28:27,795 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 3393 [2018-10-10 16:28:27,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:28:27,798 INFO L225 Difference]: With dead ends: 4282 [2018-10-10 16:28:27,798 INFO L226 Difference]: Without dead ends: 4282 [2018-10-10 16:28:27,809 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 376 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61714 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=16364, Invalid=126142, Unknown=0, NotChecked=0, Total=142506 [2018-10-10 16:28:27,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4282 states. [2018-10-10 16:28:27,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4282 to 3457. [2018-10-10 16:28:27,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3457 states. [2018-10-10 16:28:27,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3457 states to 3457 states and 3463 transitions. [2018-10-10 16:28:27,831 INFO L78 Accepts]: Start accepts. Automaton has 3457 states and 3463 transitions. Word has length 3393 [2018-10-10 16:28:27,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:28:27,833 INFO L481 AbstractCegarLoop]: Abstraction has 3457 states and 3463 transitions. [2018-10-10 16:28:27,833 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-10 16:28:27,833 INFO L276 IsEmpty]: Start isEmpty. Operand 3457 states and 3463 transitions. [2018-10-10 16:28:27,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3415 [2018-10-10 16:28:27,905 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:28:27,905 INFO L375 BasicCegarLoop]: trace histogram [78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 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, 13, 13, 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] [2018-10-10 16:28:27,905 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:28:27,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:28:27,906 INFO L82 PathProgramCache]: Analyzing trace with hash -391417485, now seen corresponding path program 55 times [2018-10-10 16:28:27,906 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:28:28,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:28:29,173 WARN L178 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-10-10 16:28:29,385 WARN L178 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-10-10 16:28:29,643 WARN L178 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 7 [2018-10-10 16:28:37,127 INFO L134 CoverageAnalysis]: Checked inductivity of 110185 backedges. 28593 proven. 1201 refuted. 0 times theorem prover too weak. 80391 trivial. 0 not checked. [2018-10-10 16:28:37,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:28:37,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-10-10 16:28:37,129 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-10 16:28:37,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-10 16:28:37,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=346, Invalid=2960, Unknown=0, NotChecked=0, Total=3306 [2018-10-10 16:28:37,129 INFO L87 Difference]: Start difference. First operand 3457 states and 3463 transitions. Second operand 58 states. [2018-10-10 16:28:48,321 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2018-10-10 16:28:49,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:28:49,868 INFO L93 Difference]: Finished difference Result 3881 states and 3890 transitions. [2018-10-10 16:28:49,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-10 16:28:49,869 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 3414 [2018-10-10 16:28:49,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:28:49,873 INFO L225 Difference]: With dead ends: 3881 [2018-10-10 16:28:49,873 INFO L226 Difference]: Without dead ends: 3881 [2018-10-10 16:28:49,874 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5690 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=4508, Invalid=18142, Unknown=0, NotChecked=0, Total=22650 [2018-10-10 16:28:49,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3881 states. [2018-10-10 16:28:49,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3881 to 3471. [2018-10-10 16:28:49,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3471 states. [2018-10-10 16:28:49,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3471 states to 3471 states and 3478 transitions. [2018-10-10 16:28:49,890 INFO L78 Accepts]: Start accepts. Automaton has 3471 states and 3478 transitions. Word has length 3414 [2018-10-10 16:28:49,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:28:49,891 INFO L481 AbstractCegarLoop]: Abstraction has 3471 states and 3478 transitions. [2018-10-10 16:28:49,891 INFO L482 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-10 16:28:49,891 INFO L276 IsEmpty]: Start isEmpty. Operand 3471 states and 3478 transitions. [2018-10-10 16:28:49,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3429 [2018-10-10 16:28:49,947 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:28:49,948 INFO L375 BasicCegarLoop]: trace histogram [79, 79, 79, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 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, 13, 13, 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] [2018-10-10 16:28:49,948 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:28:49,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:28:49,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1347425725, now seen corresponding path program 56 times [2018-10-10 16:28:49,949 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:28:50,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:28:55,767 INFO L134 CoverageAnalysis]: Checked inductivity of 111279 backedges. 29286 proven. 1542 refuted. 0 times theorem prover too weak. 80451 trivial. 0 not checked. [2018-10-10 16:28:55,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:28:55,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-10 16:28:55,769 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-10 16:28:55,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-10 16:28:55,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=374, Invalid=2596, Unknown=0, NotChecked=0, Total=2970 [2018-10-10 16:28:55,770 INFO L87 Difference]: Start difference. First operand 3471 states and 3478 transitions. Second operand 55 states. [2018-10-10 16:29:10,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:29:10,073 INFO L93 Difference]: Finished difference Result 4568 states and 4582 transitions. [2018-10-10 16:29:10,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 380 states. [2018-10-10 16:29:10,073 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 3428 [2018-10-10 16:29:10,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:29:10,079 INFO L225 Difference]: With dead ends: 4568 [2018-10-10 16:29:10,079 INFO L226 Difference]: Without dead ends: 4568 [2018-10-10 16:29:10,089 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 428 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80961 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=20805, Invalid=163665, Unknown=0, NotChecked=0, Total=184470 [2018-10-10 16:29:10,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4568 states. [2018-10-10 16:29:10,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4568 to 3655. [2018-10-10 16:29:10,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3655 states. [2018-10-10 16:29:10,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3655 states to 3655 states and 3664 transitions. [2018-10-10 16:29:10,116 INFO L78 Accepts]: Start accepts. Automaton has 3655 states and 3664 transitions. Word has length 3428 [2018-10-10 16:29:10,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:29:10,118 INFO L481 AbstractCegarLoop]: Abstraction has 3655 states and 3664 transitions. [2018-10-10 16:29:10,118 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-10 16:29:10,118 INFO L276 IsEmpty]: Start isEmpty. Operand 3655 states and 3664 transitions. [2018-10-10 16:29:10,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3450 [2018-10-10 16:29:10,201 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:29:10,201 INFO L375 BasicCegarLoop]: trace histogram [79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 79, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 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, 13, 13, 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] [2018-10-10 16:29:10,202 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:29:10,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:29:10,202 INFO L82 PathProgramCache]: Analyzing trace with hash 109950323, now seen corresponding path program 57 times [2018-10-10 16:29:10,203 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:29:10,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:29:18,787 INFO L134 CoverageAnalysis]: Checked inductivity of 112930 backedges. 14432 proven. 89694 refuted. 0 times theorem prover too weak. 8804 trivial. 0 not checked. [2018-10-10 16:29:18,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:29:18,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-10-10 16:29:18,788 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-10 16:29:18,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-10 16:29:18,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=372, Invalid=2490, Unknown=0, NotChecked=0, Total=2862 [2018-10-10 16:29:18,789 INFO L87 Difference]: Start difference. First operand 3655 states and 3664 transitions. Second operand 54 states.