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_19.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-093a8c0 [2018-10-14 18:06:31,484 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-14 18:06:31,486 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-14 18:06:31,498 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-14 18:06:31,499 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-14 18:06:31,500 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-14 18:06:31,501 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-14 18:06:31,503 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-14 18:06:31,505 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-14 18:06:31,505 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-14 18:06:31,506 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-14 18:06:31,506 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-14 18:06:31,507 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-14 18:06:31,508 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-14 18:06:31,510 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-14 18:06:31,510 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-14 18:06:31,511 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-14 18:06:31,516 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-14 18:06:31,521 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-14 18:06:31,523 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-14 18:06:31,524 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-14 18:06:31,525 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-14 18:06:31,529 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-14 18:06:31,529 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-14 18:06:31,529 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-14 18:06:31,530 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-14 18:06:31,531 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-14 18:06:31,532 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-14 18:06:31,533 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-14 18:06:31,534 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-14 18:06:31,534 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-14 18:06:31,535 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-14 18:06:31,535 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-14 18:06:31,535 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-14 18:06:31,536 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-14 18:06:31,537 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-14 18:06:31,537 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-14 18:06:31,546 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-14 18:06:31,547 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-14 18:06:31,547 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-14 18:06:31,548 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-14 18:06:31,548 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-14 18:06:31,548 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-14 18:06:31,549 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-14 18:06:31,549 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-14 18:06:31,549 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-14 18:06:31,549 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-14 18:06:31,550 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-14 18:06:31,550 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-14 18:06:31,550 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-14 18:06:31,551 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-14 18:06:31,551 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-14 18:06:31,608 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-14 18:06:31,627 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-14 18:06:31,635 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-14 18:06:31,636 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-14 18:06:31,637 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-14 18:06:31,638 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_19.bpl [2018-10-14 18:06:31,638 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl' [2018-10-14 18:06:31,728 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-14 18:06:31,730 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-14 18:06:31,730 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-14 18:06:31,731 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-14 18:06:31,731 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-14 18:06:31,760 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 06:06:31" (1/1) ... [2018-10-14 18:06:31,762 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 06:06:31" (1/1) ... [2018-10-14 18:06:31,780 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 06:06:31" (1/1) ... [2018-10-14 18:06:31,781 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 06:06:31" (1/1) ... [2018-10-14 18:06:31,794 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 06:06:31" (1/1) ... [2018-10-14 18:06:31,796 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 06:06:31" (1/1) ... [2018-10-14 18:06:31,798 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 06:06:31" (1/1) ... [2018-10-14 18:06:31,801 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-14 18:06:31,802 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-14 18:06:31,803 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-14 18:06:31,803 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-14 18:06:31,804 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 06:06:31" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-14 18:06:31,882 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-14 18:06:31,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-14 18:06:31,883 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-14 18:06:32,655 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-14 18:06:32,656 INFO L202 PluginConnector]: Adding new model ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:06:32 BoogieIcfgContainer [2018-10-14 18:06:32,656 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-14 18:06:32,657 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-14 18:06:32,657 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-14 18:06:32,658 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-14 18:06:32,662 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:06:32" (1/1) ... [2018-10-14 18:06:32,671 INFO L137 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-10-14 18:06:32,672 INFO L138 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-10-14 18:06:32,722 INFO L191 apSepIcfgTransformer]: Heap separator: starting loc-array-style preprocessing [2018-10-14 18:06:32,776 INFO L219 apSepIcfgTransformer]: finished MemlocArrayUpdater [2018-10-14 18:06:32,792 INFO L282 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-10-14 18:06:32,861 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=1) [2018-10-14 18:07:57,165 INFO L315 AbstractInterpreter]: Visited 115 different actions 510 times. Merged at 96 different actions 382 times. Widened at 5 different actions 8 times. Found 11 fixpoints after 6 different actions. Largest state had 0 variables. [2018-10-14 18:07:57,168 INFO L306 apSepIcfgTransformer]: finished equality analysis [2018-10-14 18:07:57,172 INFO L318 apSepIcfgTransformer]: Finished detection of select terms ("array reads") [2018-10-14 18:07:57,221 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select |v_#locv_ULTIMATE.start_write~int_old_#memory_int_2_1_1| |v_ULTIMATE.start_write~int_#ptr.base_6|) at (assume #memory_int == write~int_old_#memory_int[write~int_#ptr.base := write~int_old_#memory_int[write~int_#ptr.base][write~int_#ptr.offset := write~int_#value]];) [2018-10-14 18:07:57,247 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-14 18:07:57,249 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_15|) at (assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value;) [2018-10-14 18:07:57,249 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_15|) |v_ULTIMATE.start_read~int_#ptr.offset_10|) at (assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value;) [2018-10-14 18:07:57,254 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_9|) at (assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value;) [2018-10-14 18:07:57,254 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_9|) |v_ULTIMATE.start_read~int_#ptr.offset_6|) at (assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value;) [2018-10-14 18:07:57,256 INFO L232 HeapPartitionManager]: partitioning result: [2018-10-14 18:07:57,257 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-14 18:07:57,257 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-14 18:07:57,257 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 2 [2018-10-14 18:07:57,257 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-14 18:07:57,258 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-14 18:07:57,258 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 2 [2018-10-14 18:07:57,258 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-14 18:07:57,258 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-14 18:07:57,258 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-14 18:07:57,259 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 2 [2018-10-14 18:07:57,259 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-14 18:07:57,259 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-14 18:07:57,260 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 2 [2018-10-14 18:07:57,260 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-14 18:07:57,261 INFO L145 ransitionTransformer]: executing heap partitioning transformation [2018-10-14 18:07:57,286 INFO L202 PluginConnector]: Adding new model ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.10 06:07:57 BasicIcfg [2018-10-14 18:07:57,286 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-14 18:07:57,288 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-14 18:07:57,288 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-14 18:07:57,291 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-14 18:07:57,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 06:06:31" (1/3) ... [2018-10-14 18:07:57,292 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bb5d1a7 and model type ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 06:07:57, skipping insertion in model container [2018-10-14 18:07:57,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:06:32" (2/3) ... [2018-10-14 18:07:57,293 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bb5d1a7 and model type ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 06:07:57, skipping insertion in model container [2018-10-14 18:07:57,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.10 06:07:57" (3/3) ... [2018-10-14 18:07:57,295 INFO L112 eAbstractionObserver]: Analyzing ICFG memPartitionedIcfg [2018-10-14 18:07:57,305 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-14 18:07:57,313 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-14 18:07:57,330 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-14 18:07:57,362 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-14 18:07:57,363 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-14 18:07:57,364 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-14 18:07:57,364 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-14 18:07:57,364 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-14 18:07:57,364 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-14 18:07:57,364 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-14 18:07:57,365 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-14 18:07:57,365 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-14 18:07:57,385 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states. [2018-10-14 18:07:57,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-14 18:07:57,397 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:07:57,399 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:07:57,401 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:07:57,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:07:57,408 INFO L82 PathProgramCache]: Analyzing trace with hash 2084722416, now seen corresponding path program 1 times [2018-10-14 18:07:57,469 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:07:57,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:07:57,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:07:57,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 18:07:57,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-14 18:07:57,630 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-14 18:07:57,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-14 18:07:57,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 18:07:57,646 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 3 states. [2018-10-14 18:07:57,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:07:57,949 INFO L93 Difference]: Finished difference Result 197 states and 201 transitions. [2018-10-14 18:07:57,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-14 18:07:57,951 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-10-14 18:07:57,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:07:57,964 INFO L225 Difference]: With dead ends: 197 [2018-10-14 18:07:57,964 INFO L226 Difference]: Without dead ends: 197 [2018-10-14 18:07:57,966 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-14 18:07:57,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-10-14 18:07:58,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 112. [2018-10-14 18:07:58,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-10-14 18:07:58,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 114 transitions. [2018-10-14 18:07:58,021 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 114 transitions. Word has length 24 [2018-10-14 18:07:58,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:07:58,021 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 114 transitions. [2018-10-14 18:07:58,021 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-14 18:07:58,022 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 114 transitions. [2018-10-14 18:07:58,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-14 18:07:58,026 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:07:58,027 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:07:58,029 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:07:58,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:07:58,029 INFO L82 PathProgramCache]: Analyzing trace with hash -664785867, now seen corresponding path program 1 times [2018-10-14 18:07:58,030 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:07:58,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:07:58,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:07:58,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:07:58,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-14 18:07:58,278 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-14 18:07:58,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-14 18:07:58,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-14 18:07:58,279 INFO L87 Difference]: Start difference. First operand 112 states and 114 transitions. Second operand 5 states. [2018-10-14 18:07:58,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:07:58,472 INFO L93 Difference]: Finished difference Result 284 states and 290 transitions. [2018-10-14 18:07:58,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-14 18:07:58,480 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2018-10-14 18:07:58,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:07:58,483 INFO L225 Difference]: With dead ends: 284 [2018-10-14 18:07:58,483 INFO L226 Difference]: Without dead ends: 284 [2018-10-14 18:07:58,484 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-14 18:07:58,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-10-14 18:07:58,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 199. [2018-10-14 18:07:58,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-10-14 18:07:58,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 203 transitions. [2018-10-14 18:07:58,501 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 203 transitions. Word has length 78 [2018-10-14 18:07:58,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:07:58,502 INFO L481 AbstractCegarLoop]: Abstraction has 199 states and 203 transitions. [2018-10-14 18:07:58,502 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-14 18:07:58,502 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 203 transitions. [2018-10-14 18:07:58,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-14 18:07:58,508 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:07:58,508 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:07:58,509 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:07:58,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:07:58,509 INFO L82 PathProgramCache]: Analyzing trace with hash 728185786, now seen corresponding path program 2 times [2018-10-14 18:07:58,510 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:07:58,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:07:58,838 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:07:58,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:07:58,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-14 18:07:58,840 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-14 18:07:58,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-14 18:07:58,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-14 18:07:58,841 INFO L87 Difference]: Start difference. First operand 199 states and 203 transitions. Second operand 7 states. [2018-10-14 18:07:59,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:07:59,463 INFO L93 Difference]: Finished difference Result 371 states and 379 transitions. [2018-10-14 18:07:59,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-14 18:07:59,463 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 132 [2018-10-14 18:07:59,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:07:59,468 INFO L225 Difference]: With dead ends: 371 [2018-10-14 18:07:59,468 INFO L226 Difference]: Without dead ends: 371 [2018-10-14 18:07:59,468 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-10-14 18:07:59,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-10-14 18:07:59,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 286. [2018-10-14 18:07:59,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-10-14 18:07:59,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 292 transitions. [2018-10-14 18:07:59,502 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 292 transitions. Word has length 132 [2018-10-14 18:07:59,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:07:59,503 INFO L481 AbstractCegarLoop]: Abstraction has 286 states and 292 transitions. [2018-10-14 18:07:59,503 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-14 18:07:59,503 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 292 transitions. [2018-10-14 18:07:59,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-10-14 18:07:59,507 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:07:59,510 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, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:07:59,511 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:07:59,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:07:59,511 INFO L82 PathProgramCache]: Analyzing trace with hash -50506369, now seen corresponding path program 3 times [2018-10-14 18:07:59,512 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:07:59,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:07:59,984 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:07:59,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:07:59,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-14 18:07:59,985 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-14 18:07:59,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-14 18:07:59,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-10-14 18:07:59,986 INFO L87 Difference]: Start difference. First operand 286 states and 292 transitions. Second operand 9 states. [2018-10-14 18:08:00,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:08:00,520 INFO L93 Difference]: Finished difference Result 458 states and 468 transitions. [2018-10-14 18:08:00,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-14 18:08:00,523 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 186 [2018-10-14 18:08:00,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:08:00,526 INFO L225 Difference]: With dead ends: 458 [2018-10-14 18:08:00,526 INFO L226 Difference]: Without dead ends: 458 [2018-10-14 18:08:00,526 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2018-10-14 18:08:00,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2018-10-14 18:08:00,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 373. [2018-10-14 18:08:00,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-10-14 18:08:00,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 381 transitions. [2018-10-14 18:08:00,539 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 381 transitions. Word has length 186 [2018-10-14 18:08:00,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:08:00,540 INFO L481 AbstractCegarLoop]: Abstraction has 373 states and 381 transitions. [2018-10-14 18:08:00,540 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-14 18:08:00,540 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 381 transitions. [2018-10-14 18:08:00,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-10-14 18:08:00,545 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:08:00,545 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:08:00,546 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:08:00,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:08:00,546 INFO L82 PathProgramCache]: Analyzing trace with hash 206326148, now seen corresponding path program 4 times [2018-10-14 18:08:00,547 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:08:00,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:08:00,850 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 0 proven. 328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:08:00,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:08:00,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-14 18:08:00,851 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-14 18:08:00,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-14 18:08:00,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-10-14 18:08:00,852 INFO L87 Difference]: Start difference. First operand 373 states and 381 transitions. Second operand 11 states. [2018-10-14 18:08:01,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:08:01,146 INFO L93 Difference]: Finished difference Result 545 states and 557 transitions. [2018-10-14 18:08:01,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-14 18:08:01,147 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 240 [2018-10-14 18:08:01,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:08:01,150 INFO L225 Difference]: With dead ends: 545 [2018-10-14 18:08:01,151 INFO L226 Difference]: Without dead ends: 545 [2018-10-14 18:08:01,151 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=219, Unknown=0, NotChecked=0, Total=342 [2018-10-14 18:08:01,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2018-10-14 18:08:01,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 460. [2018-10-14 18:08:01,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-10-14 18:08:01,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 470 transitions. [2018-10-14 18:08:01,163 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 470 transitions. Word has length 240 [2018-10-14 18:08:01,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:08:01,164 INFO L481 AbstractCegarLoop]: Abstraction has 460 states and 470 transitions. [2018-10-14 18:08:01,164 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-14 18:08:01,164 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 470 transitions. [2018-10-14 18:08:01,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-10-14 18:08:01,170 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:08:01,171 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:08:01,171 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:08:01,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:08:01,171 INFO L82 PathProgramCache]: Analyzing trace with hash 84010953, now seen corresponding path program 5 times [2018-10-14 18:08:01,172 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:08:01,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:08:02,381 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 0 proven. 545 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:08:02,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:08:02,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-14 18:08:02,382 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-14 18:08:02,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-14 18:08:02,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-10-14 18:08:02,383 INFO L87 Difference]: Start difference. First operand 460 states and 470 transitions. Second operand 13 states. [2018-10-14 18:08:02,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:08:02,785 INFO L93 Difference]: Finished difference Result 632 states and 646 transitions. [2018-10-14 18:08:02,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-14 18:08:02,786 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 294 [2018-10-14 18:08:02,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:08:02,790 INFO L225 Difference]: With dead ends: 632 [2018-10-14 18:08:02,790 INFO L226 Difference]: Without dead ends: 632 [2018-10-14 18:08:02,791 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=178, Invalid=328, Unknown=0, NotChecked=0, Total=506 [2018-10-14 18:08:02,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2018-10-14 18:08:02,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 547. [2018-10-14 18:08:02,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2018-10-14 18:08:02,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 559 transitions. [2018-10-14 18:08:02,801 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 559 transitions. Word has length 294 [2018-10-14 18:08:02,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:08:02,802 INFO L481 AbstractCegarLoop]: Abstraction has 547 states and 559 transitions. [2018-10-14 18:08:02,802 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-14 18:08:02,802 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 559 transitions. [2018-10-14 18:08:02,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2018-10-14 18:08:02,806 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:08:02,807 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:08:02,807 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:08:02,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:08:02,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1951400014, now seen corresponding path program 6 times [2018-10-14 18:08:02,808 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:08:02,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:08:03,188 INFO L134 CoverageAnalysis]: Checked inductivity of 816 backedges. 0 proven. 816 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:08:03,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:08:03,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-14 18:08:03,189 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-14 18:08:03,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-14 18:08:03,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-10-14 18:08:03,190 INFO L87 Difference]: Start difference. First operand 547 states and 559 transitions. Second operand 15 states. [2018-10-14 18:08:03,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:08:03,790 INFO L93 Difference]: Finished difference Result 719 states and 735 transitions. [2018-10-14 18:08:03,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-14 18:08:03,791 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 348 [2018-10-14 18:08:03,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:08:03,794 INFO L225 Difference]: With dead ends: 719 [2018-10-14 18:08:03,795 INFO L226 Difference]: Without dead ends: 719 [2018-10-14 18:08:03,795 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=243, Invalid=459, Unknown=0, NotChecked=0, Total=702 [2018-10-14 18:08:03,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2018-10-14 18:08:03,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 634. [2018-10-14 18:08:03,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2018-10-14 18:08:03,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 648 transitions. [2018-10-14 18:08:03,806 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 648 transitions. Word has length 348 [2018-10-14 18:08:03,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:08:03,807 INFO L481 AbstractCegarLoop]: Abstraction has 634 states and 648 transitions. [2018-10-14 18:08:03,807 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-14 18:08:03,807 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 648 transitions. [2018-10-14 18:08:03,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2018-10-14 18:08:03,813 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:08:03,813 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:08:03,814 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:08:03,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:08:03,814 INFO L82 PathProgramCache]: Analyzing trace with hash -34839789, now seen corresponding path program 7 times [2018-10-14 18:08:03,815 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:08:03,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:08:04,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1141 backedges. 0 proven. 1141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:08:04,754 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:08:04,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-14 18:08:04,755 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-14 18:08:04,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-14 18:08:04,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2018-10-14 18:08:04,756 INFO L87 Difference]: Start difference. First operand 634 states and 648 transitions. Second operand 17 states. [2018-10-14 18:08:05,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:08:05,768 INFO L93 Difference]: Finished difference Result 806 states and 824 transitions. [2018-10-14 18:08:05,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-14 18:08:05,773 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 402 [2018-10-14 18:08:05,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:08:05,778 INFO L225 Difference]: With dead ends: 806 [2018-10-14 18:08:05,780 INFO L226 Difference]: Without dead ends: 806 [2018-10-14 18:08:05,781 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=318, Invalid=612, Unknown=0, NotChecked=0, Total=930 [2018-10-14 18:08:05,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2018-10-14 18:08:05,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 721. [2018-10-14 18:08:05,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2018-10-14 18:08:05,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 737 transitions. [2018-10-14 18:08:05,799 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 737 transitions. Word has length 402 [2018-10-14 18:08:05,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:08:05,800 INFO L481 AbstractCegarLoop]: Abstraction has 721 states and 737 transitions. [2018-10-14 18:08:05,800 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-14 18:08:05,800 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 737 transitions. [2018-10-14 18:08:05,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2018-10-14 18:08:05,804 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:08:05,804 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:08:05,804 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:08:05,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:08:05,805 INFO L82 PathProgramCache]: Analyzing trace with hash -787423208, now seen corresponding path program 8 times [2018-10-14 18:08:05,806 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:08:05,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:08:06,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 0 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:08:06,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:08:06,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-14 18:08:06,600 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-14 18:08:06,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-14 18:08:06,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2018-10-14 18:08:06,601 INFO L87 Difference]: Start difference. First operand 721 states and 737 transitions. Second operand 19 states. [2018-10-14 18:08:07,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:08:07,036 INFO L93 Difference]: Finished difference Result 893 states and 913 transitions. [2018-10-14 18:08:07,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-14 18:08:07,036 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 456 [2018-10-14 18:08:07,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:08:07,042 INFO L225 Difference]: With dead ends: 893 [2018-10-14 18:08:07,042 INFO L226 Difference]: Without dead ends: 893 [2018-10-14 18:08:07,043 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=403, Invalid=787, Unknown=0, NotChecked=0, Total=1190 [2018-10-14 18:08:07,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2018-10-14 18:08:07,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 808. [2018-10-14 18:08:07,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2018-10-14 18:08:07,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 826 transitions. [2018-10-14 18:08:07,056 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 826 transitions. Word has length 456 [2018-10-14 18:08:07,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:08:07,057 INFO L481 AbstractCegarLoop]: Abstraction has 808 states and 826 transitions. [2018-10-14 18:08:07,057 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-14 18:08:07,057 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 826 transitions. [2018-10-14 18:08:07,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 511 [2018-10-14 18:08:07,060 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:08:07,061 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:08:07,061 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:08:07,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:08:07,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1568360285, now seen corresponding path program 9 times [2018-10-14 18:08:07,062 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:08:07,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:08:08,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:08:08,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:08:08,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-14 18:08:08,016 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-14 18:08:08,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-14 18:08:08,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2018-10-14 18:08:08,017 INFO L87 Difference]: Start difference. First operand 808 states and 826 transitions. Second operand 21 states. [2018-10-14 18:08:08,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:08:08,872 INFO L93 Difference]: Finished difference Result 980 states and 1002 transitions. [2018-10-14 18:08:08,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-14 18:08:08,877 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 510 [2018-10-14 18:08:08,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:08:08,882 INFO L225 Difference]: With dead ends: 980 [2018-10-14 18:08:08,882 INFO L226 Difference]: Without dead ends: 980 [2018-10-14 18:08:08,883 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=498, Invalid=984, Unknown=0, NotChecked=0, Total=1482 [2018-10-14 18:08:08,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states. [2018-10-14 18:08:08,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 895. [2018-10-14 18:08:08,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2018-10-14 18:08:08,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 915 transitions. [2018-10-14 18:08:08,896 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 915 transitions. Word has length 510 [2018-10-14 18:08:08,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:08:08,897 INFO L481 AbstractCegarLoop]: Abstraction has 895 states and 915 transitions. [2018-10-14 18:08:08,897 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-14 18:08:08,897 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 915 transitions. [2018-10-14 18:08:08,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 565 [2018-10-14 18:08:08,902 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:08:08,902 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:08:08,902 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:08:08,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:08:08,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1215129826, now seen corresponding path program 10 times [2018-10-14 18:08:08,904 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:08:08,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:08:09,574 INFO L134 CoverageAnalysis]: Checked inductivity of 2440 backedges. 0 proven. 2440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:08:09,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:08:09,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-14 18:08:09,576 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-14 18:08:09,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-14 18:08:09,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2018-10-14 18:08:09,577 INFO L87 Difference]: Start difference. First operand 895 states and 915 transitions. Second operand 23 states. [2018-10-14 18:08:10,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:08:10,182 INFO L93 Difference]: Finished difference Result 1067 states and 1091 transitions. [2018-10-14 18:08:10,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-14 18:08:10,182 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 564 [2018-10-14 18:08:10,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:08:10,187 INFO L225 Difference]: With dead ends: 1067 [2018-10-14 18:08:10,188 INFO L226 Difference]: Without dead ends: 1067 [2018-10-14 18:08:10,189 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=603, Invalid=1203, Unknown=0, NotChecked=0, Total=1806 [2018-10-14 18:08:10,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2018-10-14 18:08:10,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 982. [2018-10-14 18:08:10,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 982 states. [2018-10-14 18:08:10,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1004 transitions. [2018-10-14 18:08:10,204 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1004 transitions. Word has length 564 [2018-10-14 18:08:10,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:08:10,205 INFO L481 AbstractCegarLoop]: Abstraction has 982 states and 1004 transitions. [2018-10-14 18:08:10,205 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-14 18:08:10,205 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1004 transitions. [2018-10-14 18:08:10,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 619 [2018-10-14 18:08:10,211 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:08:10,212 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:08:10,212 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:08:10,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:08:10,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1582492505, now seen corresponding path program 11 times [2018-10-14 18:08:10,213 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:08:10,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:08:11,423 INFO L134 CoverageAnalysis]: Checked inductivity of 2981 backedges. 0 proven. 2981 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:08:11,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:08:11,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-14 18:08:11,424 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-14 18:08:11,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-14 18:08:11,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2018-10-14 18:08:11,425 INFO L87 Difference]: Start difference. First operand 982 states and 1004 transitions. Second operand 25 states. [2018-10-14 18:08:11,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:08:11,946 INFO L93 Difference]: Finished difference Result 1154 states and 1180 transitions. [2018-10-14 18:08:11,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-14 18:08:11,948 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 618 [2018-10-14 18:08:11,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:08:11,954 INFO L225 Difference]: With dead ends: 1154 [2018-10-14 18:08:11,954 INFO L226 Difference]: Without dead ends: 1154 [2018-10-14 18:08:11,955 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=718, Invalid=1444, Unknown=0, NotChecked=0, Total=2162 [2018-10-14 18:08:11,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2018-10-14 18:08:11,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1069. [2018-10-14 18:08:11,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1069 states. [2018-10-14 18:08:11,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 1093 transitions. [2018-10-14 18:08:11,971 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 1093 transitions. Word has length 618 [2018-10-14 18:08:11,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:08:11,972 INFO L481 AbstractCegarLoop]: Abstraction has 1069 states and 1093 transitions. [2018-10-14 18:08:11,972 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-14 18:08:11,972 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1093 transitions. [2018-10-14 18:08:11,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 673 [2018-10-14 18:08:11,978 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:08:11,978 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:08:11,978 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:08:11,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:08:11,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1485052588, now seen corresponding path program 12 times [2018-10-14 18:08:11,980 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:08:12,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:08:13,094 INFO L134 CoverageAnalysis]: Checked inductivity of 3576 backedges. 0 proven. 3576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:08:13,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:08:13,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-14 18:08:13,095 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-14 18:08:13,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-14 18:08:13,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2018-10-14 18:08:13,096 INFO L87 Difference]: Start difference. First operand 1069 states and 1093 transitions. Second operand 27 states. [2018-10-14 18:08:14,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:08:14,041 INFO L93 Difference]: Finished difference Result 1241 states and 1269 transitions. [2018-10-14 18:08:14,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-14 18:08:14,041 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 672 [2018-10-14 18:08:14,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:08:14,046 INFO L225 Difference]: With dead ends: 1241 [2018-10-14 18:08:14,046 INFO L226 Difference]: Without dead ends: 1241 [2018-10-14 18:08:14,048 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=843, Invalid=1707, Unknown=0, NotChecked=0, Total=2550 [2018-10-14 18:08:14,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2018-10-14 18:08:14,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 1156. [2018-10-14 18:08:14,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1156 states. [2018-10-14 18:08:14,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1182 transitions. [2018-10-14 18:08:14,063 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1182 transitions. Word has length 672 [2018-10-14 18:08:14,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:08:14,063 INFO L481 AbstractCegarLoop]: Abstraction has 1156 states and 1182 transitions. [2018-10-14 18:08:14,063 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-14 18:08:14,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1182 transitions. [2018-10-14 18:08:14,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 727 [2018-10-14 18:08:14,070 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:08:14,070 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:08:14,071 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:08:14,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:08:14,071 INFO L82 PathProgramCache]: Analyzing trace with hash -255833359, now seen corresponding path program 13 times [2018-10-14 18:08:14,072 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:08:14,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:08:15,572 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 0 proven. 4225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:08:15,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:08:15,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-14 18:08:15,574 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-14 18:08:15,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-14 18:08:15,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=588, Unknown=0, NotChecked=0, Total=812 [2018-10-14 18:08:15,575 INFO L87 Difference]: Start difference. First operand 1156 states and 1182 transitions. Second operand 29 states. [2018-10-14 18:08:16,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:08:16,363 INFO L93 Difference]: Finished difference Result 1328 states and 1358 transitions. [2018-10-14 18:08:16,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-14 18:08:16,363 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 726 [2018-10-14 18:08:16,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:08:16,368 INFO L225 Difference]: With dead ends: 1328 [2018-10-14 18:08:16,368 INFO L226 Difference]: Without dead ends: 1328 [2018-10-14 18:08:16,369 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=978, Invalid=1992, Unknown=0, NotChecked=0, Total=2970 [2018-10-14 18:08:16,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1328 states. [2018-10-14 18:08:16,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1328 to 1243. [2018-10-14 18:08:16,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1243 states. [2018-10-14 18:08:16,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1243 states to 1243 states and 1271 transitions. [2018-10-14 18:08:16,384 INFO L78 Accepts]: Start accepts. Automaton has 1243 states and 1271 transitions. Word has length 726 [2018-10-14 18:08:16,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:08:16,385 INFO L481 AbstractCegarLoop]: Abstraction has 1243 states and 1271 transitions. [2018-10-14 18:08:16,385 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-14 18:08:16,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1243 states and 1271 transitions. [2018-10-14 18:08:16,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 781 [2018-10-14 18:08:16,392 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:08:16,392 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:08:16,393 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:08:16,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:08:16,393 INFO L82 PathProgramCache]: Analyzing trace with hash 2008249718, now seen corresponding path program 14 times [2018-10-14 18:08:16,394 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:08:16,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:08:17,712 INFO L134 CoverageAnalysis]: Checked inductivity of 4928 backedges. 0 proven. 4928 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:08:17,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:08:17,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-14 18:08:17,713 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-14 18:08:17,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-14 18:08:17,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2018-10-14 18:08:17,714 INFO L87 Difference]: Start difference. First operand 1243 states and 1271 transitions. Second operand 31 states. [2018-10-14 18:08:18,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:08:18,785 INFO L93 Difference]: Finished difference Result 1415 states and 1447 transitions. [2018-10-14 18:08:18,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-14 18:08:18,786 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 780 [2018-10-14 18:08:18,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:08:18,792 INFO L225 Difference]: With dead ends: 1415 [2018-10-14 18:08:18,792 INFO L226 Difference]: Without dead ends: 1415 [2018-10-14 18:08:18,794 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1123, Invalid=2299, Unknown=0, NotChecked=0, Total=3422 [2018-10-14 18:08:18,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2018-10-14 18:08:18,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 1330. [2018-10-14 18:08:18,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1330 states. [2018-10-14 18:08:18,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1360 transitions. [2018-10-14 18:08:18,809 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 1360 transitions. Word has length 780 [2018-10-14 18:08:18,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:08:18,810 INFO L481 AbstractCegarLoop]: Abstraction has 1330 states and 1360 transitions. [2018-10-14 18:08:18,810 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-14 18:08:18,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1360 transitions. [2018-10-14 18:08:18,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 835 [2018-10-14 18:08:18,818 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:08:18,818 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:08:18,819 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:08:18,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:08:18,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1187812805, now seen corresponding path program 15 times [2018-10-14 18:08:18,820 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:08:18,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:08:19,855 INFO L134 CoverageAnalysis]: Checked inductivity of 5685 backedges. 0 proven. 5685 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:08:19,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:08:19,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-14 18:08:19,857 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-14 18:08:19,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-14 18:08:19,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2018-10-14 18:08:19,858 INFO L87 Difference]: Start difference. First operand 1330 states and 1360 transitions. Second operand 33 states. [2018-10-14 18:08:20,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:08:20,666 INFO L93 Difference]: Finished difference Result 1502 states and 1536 transitions. [2018-10-14 18:08:20,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-14 18:08:20,667 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 834 [2018-10-14 18:08:20,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:08:20,672 INFO L225 Difference]: With dead ends: 1502 [2018-10-14 18:08:20,672 INFO L226 Difference]: Without dead ends: 1502 [2018-10-14 18:08:20,674 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1278, Invalid=2628, Unknown=0, NotChecked=0, Total=3906 [2018-10-14 18:08:20,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2018-10-14 18:08:20,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1417. [2018-10-14 18:08:20,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1417 states. [2018-10-14 18:08:20,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1417 states to 1417 states and 1449 transitions. [2018-10-14 18:08:20,689 INFO L78 Accepts]: Start accepts. Automaton has 1417 states and 1449 transitions. Word has length 834 [2018-10-14 18:08:20,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:08:20,690 INFO L481 AbstractCegarLoop]: Abstraction has 1417 states and 1449 transitions. [2018-10-14 18:08:20,690 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-14 18:08:20,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1417 states and 1449 transitions. [2018-10-14 18:08:20,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 889 [2018-10-14 18:08:20,698 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:08:20,699 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:08:20,699 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:08:20,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:08:20,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1264977600, now seen corresponding path program 16 times [2018-10-14 18:08:20,700 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:08:20,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:08:21,865 INFO L134 CoverageAnalysis]: Checked inductivity of 6496 backedges. 0 proven. 6496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:08:21,866 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:08:21,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-14 18:08:21,867 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-14 18:08:21,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-14 18:08:21,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2018-10-14 18:08:21,867 INFO L87 Difference]: Start difference. First operand 1417 states and 1449 transitions. Second operand 35 states. [2018-10-14 18:08:22,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:08:22,814 INFO L93 Difference]: Finished difference Result 1589 states and 1625 transitions. [2018-10-14 18:08:22,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-14 18:08:22,814 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 888 [2018-10-14 18:08:22,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:08:22,820 INFO L225 Difference]: With dead ends: 1589 [2018-10-14 18:08:22,820 INFO L226 Difference]: Without dead ends: 1589 [2018-10-14 18:08:22,821 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1443, Invalid=2979, Unknown=0, NotChecked=0, Total=4422 [2018-10-14 18:08:22,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1589 states. [2018-10-14 18:08:22,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1589 to 1504. [2018-10-14 18:08:22,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1504 states. [2018-10-14 18:08:22,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1504 states to 1504 states and 1538 transitions. [2018-10-14 18:08:22,838 INFO L78 Accepts]: Start accepts. Automaton has 1504 states and 1538 transitions. Word has length 888 [2018-10-14 18:08:22,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:08:22,839 INFO L481 AbstractCegarLoop]: Abstraction has 1504 states and 1538 transitions. [2018-10-14 18:08:22,839 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-14 18:08:22,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 1538 transitions. [2018-10-14 18:08:22,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 943 [2018-10-14 18:08:22,848 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:08:22,848 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:08:22,848 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:08:22,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:08:22,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1371861637, now seen corresponding path program 17 times [2018-10-14 18:08:22,850 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:08:22,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:08:25,475 INFO L134 CoverageAnalysis]: Checked inductivity of 7361 backedges. 0 proven. 7361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:08:25,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:08:25,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-14 18:08:25,476 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-14 18:08:25,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-14 18:08:25,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2018-10-14 18:08:25,477 INFO L87 Difference]: Start difference. First operand 1504 states and 1538 transitions. Second operand 37 states. [2018-10-14 18:08:26,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:08:26,512 INFO L93 Difference]: Finished difference Result 1676 states and 1714 transitions. [2018-10-14 18:08:26,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-14 18:08:26,512 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 942 [2018-10-14 18:08:26,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:08:26,518 INFO L225 Difference]: With dead ends: 1676 [2018-10-14 18:08:26,518 INFO L226 Difference]: Without dead ends: 1676 [2018-10-14 18:08:26,519 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 833 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1618, Invalid=3352, Unknown=0, NotChecked=0, Total=4970 [2018-10-14 18:08:26,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1676 states. [2018-10-14 18:08:26,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1676 to 1591. [2018-10-14 18:08:26,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1591 states. [2018-10-14 18:08:26,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1591 states and 1627 transitions. [2018-10-14 18:08:26,536 INFO L78 Accepts]: Start accepts. Automaton has 1591 states and 1627 transitions. Word has length 942 [2018-10-14 18:08:26,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:08:26,537 INFO L481 AbstractCegarLoop]: Abstraction has 1591 states and 1627 transitions. [2018-10-14 18:08:26,537 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-14 18:08:26,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1591 states and 1627 transitions. [2018-10-14 18:08:26,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 997 [2018-10-14 18:08:26,547 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:08:26,548 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:08:26,548 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:08:26,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:08:26,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1444292106, now seen corresponding path program 18 times [2018-10-14 18:08:26,549 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:08:26,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:08:28,175 INFO L134 CoverageAnalysis]: Checked inductivity of 8280 backedges. 0 proven. 8280 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:08:28,175 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:08:28,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-14 18:08:28,176 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-14 18:08:28,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-14 18:08:28,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2018-10-14 18:08:28,180 INFO L87 Difference]: Start difference. First operand 1591 states and 1627 transitions. Second operand 39 states. [2018-10-14 18:08:29,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:08:29,567 INFO L93 Difference]: Finished difference Result 1763 states and 1803 transitions. [2018-10-14 18:08:29,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-14 18:08:29,567 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 996 [2018-10-14 18:08:29,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:08:29,573 INFO L225 Difference]: With dead ends: 1763 [2018-10-14 18:08:29,573 INFO L226 Difference]: Without dead ends: 1763 [2018-10-14 18:08:29,575 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1803, Invalid=3747, Unknown=0, NotChecked=0, Total=5550 [2018-10-14 18:08:29,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1763 states. [2018-10-14 18:08:29,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1763 to 1678. [2018-10-14 18:08:29,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1678 states. [2018-10-14 18:08:29,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1678 states to 1678 states and 1716 transitions. [2018-10-14 18:08:29,592 INFO L78 Accepts]: Start accepts. Automaton has 1678 states and 1716 transitions. Word has length 996 [2018-10-14 18:08:29,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:08:29,593 INFO L481 AbstractCegarLoop]: Abstraction has 1678 states and 1716 transitions. [2018-10-14 18:08:29,593 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-14 18:08:29,593 INFO L276 IsEmpty]: Start isEmpty. Operand 1678 states and 1716 transitions. [2018-10-14 18:08:29,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1051 [2018-10-14 18:08:29,604 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:08:29,604 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:08:29,605 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:08:29,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:08:29,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1720491057, now seen corresponding path program 19 times [2018-10-14 18:08:29,606 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:08:29,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:08:31,263 INFO L134 CoverageAnalysis]: Checked inductivity of 9253 backedges. 0 proven. 9253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:08:31,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:08:31,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-14 18:08:31,265 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-14 18:08:31,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-14 18:08:31,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=1200, Unknown=0, NotChecked=0, Total=1640 [2018-10-14 18:08:31,266 INFO L87 Difference]: Start difference. First operand 1678 states and 1716 transitions. Second operand 41 states. [2018-10-14 18:08:32,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:08:32,490 INFO L93 Difference]: Finished difference Result 1850 states and 1892 transitions. [2018-10-14 18:08:32,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-14 18:08:32,490 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 1050 [2018-10-14 18:08:32,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:08:32,497 INFO L225 Difference]: With dead ends: 1850 [2018-10-14 18:08:32,497 INFO L226 Difference]: Without dead ends: 1850 [2018-10-14 18:08:32,498 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1045 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1998, Invalid=4164, Unknown=0, NotChecked=0, Total=6162 [2018-10-14 18:08:32,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1850 states. [2018-10-14 18:08:32,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1850 to 1765. [2018-10-14 18:08:32,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1765 states. [2018-10-14 18:08:32,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1765 states to 1765 states and 1805 transitions. [2018-10-14 18:08:32,515 INFO L78 Accepts]: Start accepts. Automaton has 1765 states and 1805 transitions. Word has length 1050 [2018-10-14 18:08:32,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:08:32,516 INFO L481 AbstractCegarLoop]: Abstraction has 1765 states and 1805 transitions. [2018-10-14 18:08:32,516 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-14 18:08:32,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1765 states and 1805 transitions. [2018-10-14 18:08:32,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1105 [2018-10-14 18:08:32,528 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:08:32,528 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:08:32,528 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:08:32,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:08:32,529 INFO L82 PathProgramCache]: Analyzing trace with hash 2068216788, now seen corresponding path program 20 times [2018-10-14 18:08:32,530 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:08:32,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:08:34,317 INFO L134 CoverageAnalysis]: Checked inductivity of 10280 backedges. 0 proven. 10280 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:08:34,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:08:34,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-14 18:08:34,319 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-14 18:08:34,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-14 18:08:34,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2018-10-14 18:08:34,320 INFO L87 Difference]: Start difference. First operand 1765 states and 1805 transitions. Second operand 43 states. [2018-10-14 18:08:35,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:08:35,648 INFO L93 Difference]: Finished difference Result 1937 states and 1981 transitions. [2018-10-14 18:08:35,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-14 18:08:35,649 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 1104 [2018-10-14 18:08:35,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:08:35,655 INFO L225 Difference]: With dead ends: 1937 [2018-10-14 18:08:35,655 INFO L226 Difference]: Without dead ends: 1937 [2018-10-14 18:08:35,657 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1160 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2203, Invalid=4603, Unknown=0, NotChecked=0, Total=6806 [2018-10-14 18:08:35,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1937 states. [2018-10-14 18:08:35,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1937 to 1852. [2018-10-14 18:08:35,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1852 states. [2018-10-14 18:08:35,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1852 states to 1852 states and 1894 transitions. [2018-10-14 18:08:35,673 INFO L78 Accepts]: Start accepts. Automaton has 1852 states and 1894 transitions. Word has length 1104 [2018-10-14 18:08:35,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:08:35,674 INFO L481 AbstractCegarLoop]: Abstraction has 1852 states and 1894 transitions. [2018-10-14 18:08:35,674 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-14 18:08:35,674 INFO L276 IsEmpty]: Start isEmpty. Operand 1852 states and 1894 transitions. [2018-10-14 18:08:35,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1159 [2018-10-14 18:08:35,686 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:08:35,686 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:08:35,686 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:08:35,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:08:35,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1753399783, now seen corresponding path program 21 times [2018-10-14 18:08:35,688 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:08:35,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:08:37,470 INFO L134 CoverageAnalysis]: Checked inductivity of 11361 backedges. 0 proven. 11361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:08:37,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:08:37,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-14 18:08:37,472 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-14 18:08:37,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-14 18:08:37,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=1452, Unknown=0, NotChecked=0, Total=1980 [2018-10-14 18:08:37,473 INFO L87 Difference]: Start difference. First operand 1852 states and 1894 transitions. Second operand 45 states. [2018-10-14 18:08:38,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:08:38,879 INFO L93 Difference]: Finished difference Result 2024 states and 2070 transitions. [2018-10-14 18:08:38,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-14 18:08:38,881 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 1158 [2018-10-14 18:08:38,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:08:38,887 INFO L225 Difference]: With dead ends: 2024 [2018-10-14 18:08:38,887 INFO L226 Difference]: Without dead ends: 2024 [2018-10-14 18:08:38,888 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1281 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2418, Invalid=5064, Unknown=0, NotChecked=0, Total=7482 [2018-10-14 18:08:38,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2024 states. [2018-10-14 18:08:38,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2024 to 1939. [2018-10-14 18:08:38,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1939 states. [2018-10-14 18:08:38,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1939 states to 1939 states and 1983 transitions. [2018-10-14 18:08:38,903 INFO L78 Accepts]: Start accepts. Automaton has 1939 states and 1983 transitions. Word has length 1158 [2018-10-14 18:08:38,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:08:38,904 INFO L481 AbstractCegarLoop]: Abstraction has 1939 states and 1983 transitions. [2018-10-14 18:08:38,904 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-14 18:08:38,904 INFO L276 IsEmpty]: Start isEmpty. Operand 1939 states and 1983 transitions. [2018-10-14 18:08:38,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1213 [2018-10-14 18:08:38,916 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:08:38,916 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:08:38,917 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:08:38,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:08:38,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1148618082, now seen corresponding path program 22 times [2018-10-14 18:08:38,918 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:08:38,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:08:41,095 INFO L134 CoverageAnalysis]: Checked inductivity of 12496 backedges. 0 proven. 12496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:08:41,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:08:41,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-14 18:08:41,097 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-14 18:08:41,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-14 18:08:41,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=1587, Unknown=0, NotChecked=0, Total=2162 [2018-10-14 18:08:41,098 INFO L87 Difference]: Start difference. First operand 1939 states and 1983 transitions. Second operand 47 states. [2018-10-14 18:08:42,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:08:42,761 INFO L93 Difference]: Finished difference Result 2111 states and 2159 transitions. [2018-10-14 18:08:42,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-14 18:08:42,762 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 1212 [2018-10-14 18:08:42,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:08:42,768 INFO L225 Difference]: With dead ends: 2111 [2018-10-14 18:08:42,768 INFO L226 Difference]: Without dead ends: 2111 [2018-10-14 18:08:42,769 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1408 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2643, Invalid=5547, Unknown=0, NotChecked=0, Total=8190 [2018-10-14 18:08:42,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2111 states. [2018-10-14 18:08:42,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2111 to 2026. [2018-10-14 18:08:42,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2026 states. [2018-10-14 18:08:42,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2026 states to 2026 states and 2072 transitions. [2018-10-14 18:08:42,784 INFO L78 Accepts]: Start accepts. Automaton has 2026 states and 2072 transitions. Word has length 1212 [2018-10-14 18:08:42,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:08:42,785 INFO L481 AbstractCegarLoop]: Abstraction has 2026 states and 2072 transitions. [2018-10-14 18:08:42,785 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-14 18:08:42,785 INFO L276 IsEmpty]: Start isEmpty. Operand 2026 states and 2072 transitions. [2018-10-14 18:08:42,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1267 [2018-10-14 18:08:42,795 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:08:42,796 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:08:42,796 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:08:42,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:08:42,797 INFO L82 PathProgramCache]: Analyzing trace with hash 459342179, now seen corresponding path program 23 times [2018-10-14 18:08:42,797 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:08:42,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:08:45,046 INFO L134 CoverageAnalysis]: Checked inductivity of 13685 backedges. 0 proven. 13685 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:08:45,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:08:45,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-14 18:08:45,048 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-14 18:08:45,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-14 18:08:45,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=624, Invalid=1728, Unknown=0, NotChecked=0, Total=2352 [2018-10-14 18:08:45,049 INFO L87 Difference]: Start difference. First operand 2026 states and 2072 transitions. Second operand 49 states. [2018-10-14 18:08:46,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:08:46,822 INFO L93 Difference]: Finished difference Result 2198 states and 2248 transitions. [2018-10-14 18:08:46,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-14 18:08:46,822 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 1266 [2018-10-14 18:08:46,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:08:46,830 INFO L225 Difference]: With dead ends: 2198 [2018-10-14 18:08:46,830 INFO L226 Difference]: Without dead ends: 2198 [2018-10-14 18:08:46,831 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1541 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2878, Invalid=6052, Unknown=0, NotChecked=0, Total=8930 [2018-10-14 18:08:46,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2198 states. [2018-10-14 18:08:46,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2198 to 2113. [2018-10-14 18:08:46,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2113 states. [2018-10-14 18:08:46,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2113 states to 2113 states and 2161 transitions. [2018-10-14 18:08:46,846 INFO L78 Accepts]: Start accepts. Automaton has 2113 states and 2161 transitions. Word has length 1266 [2018-10-14 18:08:46,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:08:46,847 INFO L481 AbstractCegarLoop]: Abstraction has 2113 states and 2161 transitions. [2018-10-14 18:08:46,847 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-14 18:08:46,847 INFO L276 IsEmpty]: Start isEmpty. Operand 2113 states and 2161 transitions. [2018-10-14 18:08:46,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1321 [2018-10-14 18:08:46,858 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:08:46,858 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:08:46,858 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:08:46,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:08:46,859 INFO L82 PathProgramCache]: Analyzing trace with hash -964844952, now seen corresponding path program 24 times [2018-10-14 18:08:46,859 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:08:46,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:08:50,815 INFO L134 CoverageAnalysis]: Checked inductivity of 14928 backedges. 0 proven. 14928 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:08:50,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:08:50,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-14 18:08:50,817 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-14 18:08:50,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-14 18:08:50,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2018-10-14 18:08:50,818 INFO L87 Difference]: Start difference. First operand 2113 states and 2161 transitions. Second operand 51 states. [2018-10-14 18:08:52,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:08:52,839 INFO L93 Difference]: Finished difference Result 2285 states and 2337 transitions. [2018-10-14 18:08:52,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-14 18:08:52,840 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 1320 [2018-10-14 18:08:52,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:08:52,849 INFO L225 Difference]: With dead ends: 2285 [2018-10-14 18:08:52,849 INFO L226 Difference]: Without dead ends: 2285 [2018-10-14 18:08:52,851 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1680 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=3123, Invalid=6579, Unknown=0, NotChecked=0, Total=9702 [2018-10-14 18:08:52,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2285 states. [2018-10-14 18:08:52,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2285 to 2200. [2018-10-14 18:08:52,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2200 states. [2018-10-14 18:08:52,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2200 states to 2200 states and 2250 transitions. [2018-10-14 18:08:52,874 INFO L78 Accepts]: Start accepts. Automaton has 2200 states and 2250 transitions. Word has length 1320 [2018-10-14 18:08:52,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:08:52,876 INFO L481 AbstractCegarLoop]: Abstraction has 2200 states and 2250 transitions. [2018-10-14 18:08:52,876 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-14 18:08:52,876 INFO L276 IsEmpty]: Start isEmpty. Operand 2200 states and 2250 transitions. [2018-10-14 18:08:52,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1375 [2018-10-14 18:08:52,896 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:08:52,896 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:08:52,897 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:08:52,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:08:52,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1557999021, now seen corresponding path program 25 times [2018-10-14 18:08:52,898 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:08:52,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:08:55,638 INFO L134 CoverageAnalysis]: Checked inductivity of 16225 backedges. 0 proven. 16225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:08:55,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:08:55,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-14 18:08:55,640 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-14 18:08:55,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-14 18:08:55,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=728, Invalid=2028, Unknown=0, NotChecked=0, Total=2756 [2018-10-14 18:08:55,641 INFO L87 Difference]: Start difference. First operand 2200 states and 2250 transitions. Second operand 53 states. [2018-10-14 18:08:57,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:08:57,472 INFO L93 Difference]: Finished difference Result 2372 states and 2426 transitions. [2018-10-14 18:08:57,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-14 18:08:57,472 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 1374 [2018-10-14 18:08:57,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:08:57,482 INFO L225 Difference]: With dead ends: 2372 [2018-10-14 18:08:57,482 INFO L226 Difference]: Without dead ends: 2372 [2018-10-14 18:08:57,484 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1825 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3378, Invalid=7128, Unknown=0, NotChecked=0, Total=10506 [2018-10-14 18:08:57,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2372 states. [2018-10-14 18:08:57,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2372 to 2287. [2018-10-14 18:08:57,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2287 states. [2018-10-14 18:08:57,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2287 states to 2287 states and 2339 transitions. [2018-10-14 18:08:57,504 INFO L78 Accepts]: Start accepts. Automaton has 2287 states and 2339 transitions. Word has length 1374 [2018-10-14 18:08:57,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:08:57,505 INFO L481 AbstractCegarLoop]: Abstraction has 2287 states and 2339 transitions. [2018-10-14 18:08:57,505 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-14 18:08:57,505 INFO L276 IsEmpty]: Start isEmpty. Operand 2287 states and 2339 transitions. [2018-10-14 18:08:57,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1429 [2018-10-14 18:08:57,519 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:08:57,520 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:08:57,520 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:08:57,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:08:57,520 INFO L82 PathProgramCache]: Analyzing trace with hash 67203890, now seen corresponding path program 26 times [2018-10-14 18:08:57,521 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:08:57,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:09:00,546 INFO L134 CoverageAnalysis]: Checked inductivity of 17576 backedges. 0 proven. 17576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:09:00,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:09:00,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-14 18:09:00,548 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-14 18:09:00,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-14 18:09:00,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=783, Invalid=2187, Unknown=0, NotChecked=0, Total=2970 [2018-10-14 18:09:00,548 INFO L87 Difference]: Start difference. First operand 2287 states and 2339 transitions. Second operand 55 states. [2018-10-14 18:09:02,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:09:02,628 INFO L93 Difference]: Finished difference Result 2459 states and 2515 transitions. [2018-10-14 18:09:02,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-14 18:09:02,628 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 1428 [2018-10-14 18:09:02,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:09:02,634 INFO L225 Difference]: With dead ends: 2459 [2018-10-14 18:09:02,634 INFO L226 Difference]: Without dead ends: 2459 [2018-10-14 18:09:02,635 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1976 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3643, Invalid=7699, Unknown=0, NotChecked=0, Total=11342 [2018-10-14 18:09:02,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2459 states. [2018-10-14 18:09:02,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2459 to 2374. [2018-10-14 18:09:02,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2374 states. [2018-10-14 18:09:02,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2374 states to 2374 states and 2428 transitions. [2018-10-14 18:09:02,651 INFO L78 Accepts]: Start accepts. Automaton has 2374 states and 2428 transitions. Word has length 1428 [2018-10-14 18:09:02,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:09:02,651 INFO L481 AbstractCegarLoop]: Abstraction has 2374 states and 2428 transitions. [2018-10-14 18:09:02,652 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-14 18:09:02,652 INFO L276 IsEmpty]: Start isEmpty. Operand 2374 states and 2428 transitions. [2018-10-14 18:09:02,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1483 [2018-10-14 18:09:02,664 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:09:02,665 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:09:02,665 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:09:02,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:09:02,666 INFO L82 PathProgramCache]: Analyzing trace with hash -1678753033, now seen corresponding path program 27 times [2018-10-14 18:09:02,666 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:09:02,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:09:05,503 INFO L134 CoverageAnalysis]: Checked inductivity of 18981 backedges. 0 proven. 18981 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:09:05,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:09:05,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-14 18:09:05,505 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-14 18:09:05,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-14 18:09:05,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=840, Invalid=2352, Unknown=0, NotChecked=0, Total=3192 [2018-10-14 18:09:05,506 INFO L87 Difference]: Start difference. First operand 2374 states and 2428 transitions. Second operand 57 states. [2018-10-14 18:09:07,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:09:07,917 INFO L93 Difference]: Finished difference Result 2546 states and 2604 transitions. [2018-10-14 18:09:07,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-14 18:09:07,917 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 1482 [2018-10-14 18:09:07,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:09:07,921 INFO L225 Difference]: With dead ends: 2546 [2018-10-14 18:09:07,921 INFO L226 Difference]: Without dead ends: 2546 [2018-10-14 18:09:07,922 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2133 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3918, Invalid=8292, Unknown=0, NotChecked=0, Total=12210 [2018-10-14 18:09:07,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2546 states. [2018-10-14 18:09:07,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2546 to 2461. [2018-10-14 18:09:07,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2461 states. [2018-10-14 18:09:07,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2461 states to 2461 states and 2517 transitions. [2018-10-14 18:09:07,937 INFO L78 Accepts]: Start accepts. Automaton has 2461 states and 2517 transitions. Word has length 1482 [2018-10-14 18:09:07,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:09:07,938 INFO L481 AbstractCegarLoop]: Abstraction has 2461 states and 2517 transitions. [2018-10-14 18:09:07,938 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-14 18:09:07,938 INFO L276 IsEmpty]: Start isEmpty. Operand 2461 states and 2517 transitions. [2018-10-14 18:09:07,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1537 [2018-10-14 18:09:07,952 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:09:07,953 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:09:07,953 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:09:07,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:09:07,953 INFO L82 PathProgramCache]: Analyzing trace with hash 875785468, now seen corresponding path program 28 times [2018-10-14 18:09:07,954 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:09:08,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:09:11,046 INFO L134 CoverageAnalysis]: Checked inductivity of 20440 backedges. 0 proven. 20440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:09:11,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:09:11,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-14 18:09:11,047 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-14 18:09:11,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-14 18:09:11,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=899, Invalid=2523, Unknown=0, NotChecked=0, Total=3422 [2018-10-14 18:09:11,048 INFO L87 Difference]: Start difference. First operand 2461 states and 2517 transitions. Second operand 59 states. [2018-10-14 18:09:13,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:09:13,315 INFO L93 Difference]: Finished difference Result 2633 states and 2693 transitions. [2018-10-14 18:09:13,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-14 18:09:13,315 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 1536 [2018-10-14 18:09:13,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:09:13,320 INFO L225 Difference]: With dead ends: 2633 [2018-10-14 18:09:13,320 INFO L226 Difference]: Without dead ends: 2633 [2018-10-14 18:09:13,322 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2296 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4203, Invalid=8907, Unknown=0, NotChecked=0, Total=13110 [2018-10-14 18:09:13,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2633 states. [2018-10-14 18:09:13,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2633 to 2548. [2018-10-14 18:09:13,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2548 states. [2018-10-14 18:09:13,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2548 states to 2548 states and 2606 transitions. [2018-10-14 18:09:13,343 INFO L78 Accepts]: Start accepts. Automaton has 2548 states and 2606 transitions. Word has length 1536 [2018-10-14 18:09:13,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:09:13,345 INFO L481 AbstractCegarLoop]: Abstraction has 2548 states and 2606 transitions. [2018-10-14 18:09:13,345 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-14 18:09:13,345 INFO L276 IsEmpty]: Start isEmpty. Operand 2548 states and 2606 transitions. [2018-10-14 18:09:13,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1591 [2018-10-14 18:09:13,367 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:09:13,367 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:09:13,368 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:09:13,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:09:13,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1059536575, now seen corresponding path program 29 times [2018-10-14 18:09:13,369 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:09:13,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:09:16,963 INFO L134 CoverageAnalysis]: Checked inductivity of 21953 backedges. 0 proven. 21953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:09:16,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:09:16,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-14 18:09:16,965 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-14 18:09:16,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-14 18:09:16,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=960, Invalid=2700, Unknown=0, NotChecked=0, Total=3660 [2018-10-14 18:09:16,966 INFO L87 Difference]: Start difference. First operand 2548 states and 2606 transitions. Second operand 61 states. [2018-10-14 18:09:19,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:09:19,634 INFO L93 Difference]: Finished difference Result 2720 states and 2782 transitions. [2018-10-14 18:09:19,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-14 18:09:19,634 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 1590 [2018-10-14 18:09:19,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:09:19,640 INFO L225 Difference]: With dead ends: 2720 [2018-10-14 18:09:19,640 INFO L226 Difference]: Without dead ends: 2720 [2018-10-14 18:09:19,641 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2465 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4498, Invalid=9544, Unknown=0, NotChecked=0, Total=14042 [2018-10-14 18:09:19,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2720 states. [2018-10-14 18:09:19,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2720 to 2635. [2018-10-14 18:09:19,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2635 states. [2018-10-14 18:09:19,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2635 states to 2635 states and 2695 transitions. [2018-10-14 18:09:19,662 INFO L78 Accepts]: Start accepts. Automaton has 2635 states and 2695 transitions. Word has length 1590 [2018-10-14 18:09:19,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:09:19,663 INFO L481 AbstractCegarLoop]: Abstraction has 2635 states and 2695 transitions. [2018-10-14 18:09:19,663 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-14 18:09:19,663 INFO L276 IsEmpty]: Start isEmpty. Operand 2635 states and 2695 transitions. [2018-10-14 18:09:19,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1645 [2018-10-14 18:09:19,686 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:09:19,687 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:09:19,687 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:09:19,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:09:19,688 INFO L82 PathProgramCache]: Analyzing trace with hash 259133382, now seen corresponding path program 30 times [2018-10-14 18:09:19,688 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:09:19,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:09:23,148 INFO L134 CoverageAnalysis]: Checked inductivity of 23520 backedges. 0 proven. 23520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:09:23,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:09:23,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-14 18:09:23,150 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-14 18:09:23,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-14 18:09:23,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2018-10-14 18:09:23,150 INFO L87 Difference]: Start difference. First operand 2635 states and 2695 transitions. Second operand 63 states. [2018-10-14 18:09:26,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:09:26,116 INFO L93 Difference]: Finished difference Result 2807 states and 2871 transitions. [2018-10-14 18:09:26,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-14 18:09:26,116 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 1644 [2018-10-14 18:09:26,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:09:26,120 INFO L225 Difference]: With dead ends: 2807 [2018-10-14 18:09:26,120 INFO L226 Difference]: Without dead ends: 2807 [2018-10-14 18:09:26,121 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2640 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4803, Invalid=10203, Unknown=0, NotChecked=0, Total=15006 [2018-10-14 18:09:26,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2807 states. [2018-10-14 18:09:26,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2807 to 2722. [2018-10-14 18:09:26,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2722 states. [2018-10-14 18:09:26,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2722 states to 2722 states and 2784 transitions. [2018-10-14 18:09:26,141 INFO L78 Accepts]: Start accepts. Automaton has 2722 states and 2784 transitions. Word has length 1644 [2018-10-14 18:09:26,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:09:26,142 INFO L481 AbstractCegarLoop]: Abstraction has 2722 states and 2784 transitions. [2018-10-14 18:09:26,143 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-14 18:09:26,143 INFO L276 IsEmpty]: Start isEmpty. Operand 2722 states and 2784 transitions. [2018-10-14 18:09:26,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1699 [2018-10-14 18:09:26,167 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:09:26,168 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:09:26,168 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:09:26,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:09:26,168 INFO L82 PathProgramCache]: Analyzing trace with hash -65722229, now seen corresponding path program 31 times [2018-10-14 18:09:26,169 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:09:26,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:09:29,411 INFO L134 CoverageAnalysis]: Checked inductivity of 25141 backedges. 0 proven. 25141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:09:29,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:09:29,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-14 18:09:29,413 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-14 18:09:29,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-14 18:09:29,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1088, Invalid=3072, Unknown=0, NotChecked=0, Total=4160 [2018-10-14 18:09:29,413 INFO L87 Difference]: Start difference. First operand 2722 states and 2784 transitions. Second operand 65 states. [2018-10-14 18:09:32,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:09:32,692 INFO L93 Difference]: Finished difference Result 2894 states and 2960 transitions. [2018-10-14 18:09:32,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-14 18:09:32,693 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 1698 [2018-10-14 18:09:32,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:09:32,696 INFO L225 Difference]: With dead ends: 2894 [2018-10-14 18:09:32,696 INFO L226 Difference]: Without dead ends: 2894 [2018-10-14 18:09:32,697 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2821 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5118, Invalid=10884, Unknown=0, NotChecked=0, Total=16002 [2018-10-14 18:09:32,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2894 states. [2018-10-14 18:09:32,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2894 to 2809. [2018-10-14 18:09:32,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2809 states. [2018-10-14 18:09:32,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2809 states to 2809 states and 2873 transitions. [2018-10-14 18:09:32,718 INFO L78 Accepts]: Start accepts. Automaton has 2809 states and 2873 transitions. Word has length 1698 [2018-10-14 18:09:32,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:09:32,720 INFO L481 AbstractCegarLoop]: Abstraction has 2809 states and 2873 transitions. [2018-10-14 18:09:32,720 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-14 18:09:32,720 INFO L276 IsEmpty]: Start isEmpty. Operand 2809 states and 2873 transitions. [2018-10-14 18:09:32,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1753 [2018-10-14 18:09:32,745 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:09:32,746 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:09:32,746 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:09:32,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:09:32,747 INFO L82 PathProgramCache]: Analyzing trace with hash -430187632, now seen corresponding path program 32 times [2018-10-14 18:09:32,747 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:09:32,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:09:36,150 INFO L134 CoverageAnalysis]: Checked inductivity of 26816 backedges. 0 proven. 26816 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:09:36,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:09:36,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-14 18:09:36,152 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-14 18:09:36,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-14 18:09:36,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1155, Invalid=3267, Unknown=0, NotChecked=0, Total=4422 [2018-10-14 18:09:36,153 INFO L87 Difference]: Start difference. First operand 2809 states and 2873 transitions. Second operand 67 states. [2018-10-14 18:09:39,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:09:39,339 INFO L93 Difference]: Finished difference Result 2981 states and 3049 transitions. [2018-10-14 18:09:39,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-10-14 18:09:39,340 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 1752 [2018-10-14 18:09:39,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:09:39,343 INFO L225 Difference]: With dead ends: 2981 [2018-10-14 18:09:39,343 INFO L226 Difference]: Without dead ends: 2981 [2018-10-14 18:09:39,345 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3008 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5443, Invalid=11587, Unknown=0, NotChecked=0, Total=17030 [2018-10-14 18:09:39,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2981 states. [2018-10-14 18:09:39,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2981 to 2896. [2018-10-14 18:09:39,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2896 states. [2018-10-14 18:09:39,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2896 states to 2896 states and 2962 transitions. [2018-10-14 18:09:39,368 INFO L78 Accepts]: Start accepts. Automaton has 2896 states and 2962 transitions. Word has length 1752 [2018-10-14 18:09:39,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:09:39,369 INFO L481 AbstractCegarLoop]: Abstraction has 2896 states and 2962 transitions. [2018-10-14 18:09:39,369 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-14 18:09:39,370 INFO L276 IsEmpty]: Start isEmpty. Operand 2896 states and 2962 transitions. [2018-10-14 18:09:39,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1807 [2018-10-14 18:09:39,400 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:09:39,401 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:09:39,401 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:09:39,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:09:39,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1717827797, now seen corresponding path program 33 times [2018-10-14 18:09:39,403 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:09:39,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:09:43,525 INFO L134 CoverageAnalysis]: Checked inductivity of 28545 backedges. 0 proven. 28545 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:09:43,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:09:43,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-14 18:09:43,528 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-14 18:09:43,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-14 18:09:43,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1224, Invalid=3468, Unknown=0, NotChecked=0, Total=4692 [2018-10-14 18:09:43,528 INFO L87 Difference]: Start difference. First operand 2896 states and 2962 transitions. Second operand 69 states. [2018-10-14 18:09:46,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:09:46,902 INFO L93 Difference]: Finished difference Result 3068 states and 3138 transitions. [2018-10-14 18:09:46,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-10-14 18:09:46,902 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 1806 [2018-10-14 18:09:46,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:09:46,907 INFO L225 Difference]: With dead ends: 3068 [2018-10-14 18:09:46,907 INFO L226 Difference]: Without dead ends: 3068 [2018-10-14 18:09:46,908 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3201 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5778, Invalid=12312, Unknown=0, NotChecked=0, Total=18090 [2018-10-14 18:09:46,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3068 states. [2018-10-14 18:09:46,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3068 to 2983. [2018-10-14 18:09:46,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2983 states. [2018-10-14 18:09:46,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2983 states to 2983 states and 3051 transitions. [2018-10-14 18:09:46,932 INFO L78 Accepts]: Start accepts. Automaton has 2983 states and 3051 transitions. Word has length 1806 [2018-10-14 18:09:46,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:09:46,933 INFO L481 AbstractCegarLoop]: Abstraction has 2983 states and 3051 transitions. [2018-10-14 18:09:46,933 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-14 18:09:46,933 INFO L276 IsEmpty]: Start isEmpty. Operand 2983 states and 3051 transitions. [2018-10-14 18:09:46,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1861 [2018-10-14 18:09:46,962 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:09:46,963 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:09:46,963 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:09:46,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:09:46,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1104105562, now seen corresponding path program 34 times [2018-10-14 18:09:46,964 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:09:47,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:09:50,922 INFO L134 CoverageAnalysis]: Checked inductivity of 30328 backedges. 0 proven. 30328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:09:50,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:09:50,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-14 18:09:50,924 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-14 18:09:50,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-14 18:09:50,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1295, Invalid=3675, Unknown=0, NotChecked=0, Total=4970 [2018-10-14 18:09:50,925 INFO L87 Difference]: Start difference. First operand 2983 states and 3051 transitions. Second operand 71 states. [2018-10-14 18:09:54,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:09:54,271 INFO L93 Difference]: Finished difference Result 3155 states and 3227 transitions. [2018-10-14 18:09:54,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-10-14 18:09:54,271 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 1860 [2018-10-14 18:09:54,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:09:54,275 INFO L225 Difference]: With dead ends: 3155 [2018-10-14 18:09:54,275 INFO L226 Difference]: Without dead ends: 3155 [2018-10-14 18:09:54,276 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3400 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=6123, Invalid=13059, Unknown=0, NotChecked=0, Total=19182 [2018-10-14 18:09:54,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3155 states. [2018-10-14 18:09:54,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3155 to 3070. [2018-10-14 18:09:54,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3070 states. [2018-10-14 18:09:54,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3070 states to 3070 states and 3140 transitions. [2018-10-14 18:09:54,294 INFO L78 Accepts]: Start accepts. Automaton has 3070 states and 3140 transitions. Word has length 1860 [2018-10-14 18:09:54,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:09:54,295 INFO L481 AbstractCegarLoop]: Abstraction has 3070 states and 3140 transitions. [2018-10-14 18:09:54,295 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-14 18:09:54,295 INFO L276 IsEmpty]: Start isEmpty. Operand 3070 states and 3140 transitions. [2018-10-14 18:09:54,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1915 [2018-10-14 18:09:54,316 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:09:54,316 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:09:54,317 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:09:54,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:09:54,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1597787617, now seen corresponding path program 35 times [2018-10-14 18:09:54,318 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:09:54,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:09:58,594 INFO L134 CoverageAnalysis]: Checked inductivity of 32165 backedges. 0 proven. 32165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:09:58,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:09:58,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-14 18:09:58,595 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-14 18:09:58,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-14 18:09:58,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1368, Invalid=3888, Unknown=0, NotChecked=0, Total=5256 [2018-10-14 18:09:58,596 INFO L87 Difference]: Start difference. First operand 3070 states and 3140 transitions. Second operand 73 states. [2018-10-14 18:10:02,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:10:02,704 INFO L93 Difference]: Finished difference Result 3242 states and 3316 transitions. [2018-10-14 18:10:02,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-10-14 18:10:02,705 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 1914 [2018-10-14 18:10:02,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:10:02,708 INFO L225 Difference]: With dead ends: 3242 [2018-10-14 18:10:02,708 INFO L226 Difference]: Without dead ends: 3242 [2018-10-14 18:10:02,709 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3605 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6478, Invalid=13828, Unknown=0, NotChecked=0, Total=20306 [2018-10-14 18:10:02,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3242 states. [2018-10-14 18:10:02,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3242 to 3157. [2018-10-14 18:10:02,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3157 states. [2018-10-14 18:10:02,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3157 states to 3157 states and 3229 transitions. [2018-10-14 18:10:02,727 INFO L78 Accepts]: Start accepts. Automaton has 3157 states and 3229 transitions. Word has length 1914 [2018-10-14 18:10:02,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:10:02,728 INFO L481 AbstractCegarLoop]: Abstraction has 3157 states and 3229 transitions. [2018-10-14 18:10:02,729 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-14 18:10:02,729 INFO L276 IsEmpty]: Start isEmpty. Operand 3157 states and 3229 transitions. [2018-10-14 18:10:02,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1969 [2018-10-14 18:10:02,751 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:10:02,752 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:10:02,752 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:10:02,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:10:02,753 INFO L82 PathProgramCache]: Analyzing trace with hash -2098532828, now seen corresponding path program 36 times [2018-10-14 18:10:02,753 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:10:02,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:10:07,181 INFO L134 CoverageAnalysis]: Checked inductivity of 34056 backedges. 0 proven. 34056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:10:07,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:10:07,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-14 18:10:07,183 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-14 18:10:07,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-14 18:10:07,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1443, Invalid=4107, Unknown=0, NotChecked=0, Total=5550 [2018-10-14 18:10:07,184 INFO L87 Difference]: Start difference. First operand 3157 states and 3229 transitions. Second operand 75 states. [2018-10-14 18:10:10,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:10:10,893 INFO L93 Difference]: Finished difference Result 3329 states and 3405 transitions. [2018-10-14 18:10:10,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-10-14 18:10:10,893 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 1968 [2018-10-14 18:10:10,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:10:10,896 INFO L225 Difference]: With dead ends: 3329 [2018-10-14 18:10:10,896 INFO L226 Difference]: Without dead ends: 3329 [2018-10-14 18:10:10,897 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3816 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6843, Invalid=14619, Unknown=0, NotChecked=0, Total=21462 [2018-10-14 18:10:10,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3329 states. [2018-10-14 18:10:10,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3329 to 3244. [2018-10-14 18:10:10,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3244 states. [2018-10-14 18:10:10,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3244 states to 3244 states and 3318 transitions. [2018-10-14 18:10:10,916 INFO L78 Accepts]: Start accepts. Automaton has 3244 states and 3318 transitions. Word has length 1968 [2018-10-14 18:10:10,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:10:10,917 INFO L481 AbstractCegarLoop]: Abstraction has 3244 states and 3318 transitions. [2018-10-14 18:10:10,917 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-14 18:10:10,917 INFO L276 IsEmpty]: Start isEmpty. Operand 3244 states and 3318 transitions. [2018-10-14 18:10:10,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2023 [2018-10-14 18:10:10,943 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:10:10,944 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:10:10,944 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:10:10,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:10:10,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1953682537, now seen corresponding path program 37 times [2018-10-14 18:10:10,945 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:10:11,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:10:15,699 INFO L134 CoverageAnalysis]: Checked inductivity of 36001 backedges. 0 proven. 36001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:10:15,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:10:15,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-10-14 18:10:15,701 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-14 18:10:15,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-14 18:10:15,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1520, Invalid=4332, Unknown=0, NotChecked=0, Total=5852 [2018-10-14 18:10:15,702 INFO L87 Difference]: Start difference. First operand 3244 states and 3318 transitions. Second operand 77 states. [2018-10-14 18:10:19,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:10:19,693 INFO L93 Difference]: Finished difference Result 3416 states and 3494 transitions. [2018-10-14 18:10:19,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-10-14 18:10:19,693 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 2022 [2018-10-14 18:10:19,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:10:19,697 INFO L225 Difference]: With dead ends: 3416 [2018-10-14 18:10:19,697 INFO L226 Difference]: Without dead ends: 3416 [2018-10-14 18:10:19,699 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4033 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=7218, Invalid=15432, Unknown=0, NotChecked=0, Total=22650 [2018-10-14 18:10:19,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3416 states. [2018-10-14 18:10:19,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3416 to 3331. [2018-10-14 18:10:19,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3331 states. [2018-10-14 18:10:19,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3331 states to 3331 states and 3407 transitions. [2018-10-14 18:10:19,717 INFO L78 Accepts]: Start accepts. Automaton has 3331 states and 3407 transitions. Word has length 2022 [2018-10-14 18:10:19,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:10:19,718 INFO L481 AbstractCegarLoop]: Abstraction has 3331 states and 3407 transitions. [2018-10-14 18:10:19,718 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-14 18:10:19,718 INFO L276 IsEmpty]: Start isEmpty. Operand 3331 states and 3407 transitions. [2018-10-14 18:10:19,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2077 [2018-10-14 18:10:19,741 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:10:19,742 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:10:19,743 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:10:19,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:10:19,743 INFO L82 PathProgramCache]: Analyzing trace with hash -2096286482, now seen corresponding path program 38 times [2018-10-14 18:10:19,744 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:10:19,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:10:24,669 INFO L134 CoverageAnalysis]: Checked inductivity of 38000 backedges. 0 proven. 38000 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:10:24,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:10:24,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-10-14 18:10:24,670 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-14 18:10:24,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-14 18:10:24,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1599, Invalid=4563, Unknown=0, NotChecked=0, Total=6162 [2018-10-14 18:10:24,671 INFO L87 Difference]: Start difference. First operand 3331 states and 3407 transitions. Second operand 79 states. [2018-10-14 18:10:28,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:10:28,983 INFO L93 Difference]: Finished difference Result 3503 states and 3583 transitions. [2018-10-14 18:10:28,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-10-14 18:10:28,983 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 2076 [2018-10-14 18:10:28,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:10:28,987 INFO L225 Difference]: With dead ends: 3503 [2018-10-14 18:10:28,987 INFO L226 Difference]: Without dead ends: 3503 [2018-10-14 18:10:28,989 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4256 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7603, Invalid=16267, Unknown=0, NotChecked=0, Total=23870 [2018-10-14 18:10:28,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3503 states. [2018-10-14 18:10:29,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3503 to 3418. [2018-10-14 18:10:29,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3418 states. [2018-10-14 18:10:29,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3418 states to 3418 states and 3496 transitions. [2018-10-14 18:10:29,009 INFO L78 Accepts]: Start accepts. Automaton has 3418 states and 3496 transitions. Word has length 2076 [2018-10-14 18:10:29,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:10:29,010 INFO L481 AbstractCegarLoop]: Abstraction has 3418 states and 3496 transitions. [2018-10-14 18:10:29,010 INFO L482 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-14 18:10:29,010 INFO L276 IsEmpty]: Start isEmpty. Operand 3418 states and 3496 transitions. [2018-10-14 18:10:29,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2131 [2018-10-14 18:10:29,034 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:10:29,035 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:10:29,035 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:10:29,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:10:29,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1928322995, now seen corresponding path program 39 times [2018-10-14 18:10:29,036 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:10:29,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:10:34,199 INFO L134 CoverageAnalysis]: Checked inductivity of 40053 backedges. 0 proven. 40053 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:10:34,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:10:34,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-14 18:10:34,200 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-14 18:10:34,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-14 18:10:34,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1680, Invalid=4800, Unknown=0, NotChecked=0, Total=6480 [2018-10-14 18:10:34,201 INFO L87 Difference]: Start difference. First operand 3418 states and 3496 transitions. Second operand 81 states. [2018-10-14 18:10:39,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:10:39,079 INFO L93 Difference]: Finished difference Result 3590 states and 3672 transitions. [2018-10-14 18:10:39,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-10-14 18:10:39,080 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 2130 [2018-10-14 18:10:39,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:10:39,084 INFO L225 Difference]: With dead ends: 3590 [2018-10-14 18:10:39,084 INFO L226 Difference]: Without dead ends: 3590 [2018-10-14 18:10:39,085 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4485 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7998, Invalid=17124, Unknown=0, NotChecked=0, Total=25122 [2018-10-14 18:10:39,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3590 states. [2018-10-14 18:10:39,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3590 to 3505. [2018-10-14 18:10:39,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3505 states. [2018-10-14 18:10:39,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3505 states to 3505 states and 3585 transitions. [2018-10-14 18:10:39,100 INFO L78 Accepts]: Start accepts. Automaton has 3505 states and 3585 transitions. Word has length 2130 [2018-10-14 18:10:39,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:10:39,101 INFO L481 AbstractCegarLoop]: Abstraction has 3505 states and 3585 transitions. [2018-10-14 18:10:39,101 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-14 18:10:39,102 INFO L276 IsEmpty]: Start isEmpty. Operand 3505 states and 3585 transitions. [2018-10-14 18:10:39,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2185 [2018-10-14 18:10:39,127 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:10:39,128 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:10:39,128 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:10:39,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:10:39,129 INFO L82 PathProgramCache]: Analyzing trace with hash 869573816, now seen corresponding path program 40 times [2018-10-14 18:10:39,130 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:10:39,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:10:44,333 INFO L134 CoverageAnalysis]: Checked inductivity of 42160 backedges. 0 proven. 42160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:10:44,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:10:44,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-14 18:10:44,335 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-14 18:10:44,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-14 18:10:44,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1763, Invalid=5043, Unknown=0, NotChecked=0, Total=6806 [2018-10-14 18:10:44,336 INFO L87 Difference]: Start difference. First operand 3505 states and 3585 transitions. Second operand 83 states. [2018-10-14 18:10:49,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:10:49,140 INFO L93 Difference]: Finished difference Result 3677 states and 3761 transitions. [2018-10-14 18:10:49,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-10-14 18:10:49,140 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 2184 [2018-10-14 18:10:49,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:10:49,144 INFO L225 Difference]: With dead ends: 3677 [2018-10-14 18:10:49,144 INFO L226 Difference]: Without dead ends: 3677 [2018-10-14 18:10:49,146 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4720 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=8403, Invalid=18003, Unknown=0, NotChecked=0, Total=26406 [2018-10-14 18:10:49,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3677 states. [2018-10-14 18:10:49,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3677 to 3592. [2018-10-14 18:10:49,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3592 states. [2018-10-14 18:10:49,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3592 states to 3592 states and 3674 transitions. [2018-10-14 18:10:49,163 INFO L78 Accepts]: Start accepts. Automaton has 3592 states and 3674 transitions. Word has length 2184 [2018-10-14 18:10:49,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:10:49,164 INFO L481 AbstractCegarLoop]: Abstraction has 3592 states and 3674 transitions. [2018-10-14 18:10:49,164 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-14 18:10:49,164 INFO L276 IsEmpty]: Start isEmpty. Operand 3592 states and 3674 transitions. [2018-10-14 18:10:49,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2239 [2018-10-14 18:10:49,187 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:10:49,187 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:10:49,188 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:10:49,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:10:49,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1778822147, now seen corresponding path program 41 times [2018-10-14 18:10:49,189 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:10:49,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:10:54,873 INFO L134 CoverageAnalysis]: Checked inductivity of 44321 backedges. 0 proven. 44321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:10:54,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:10:54,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-10-14 18:10:54,875 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-14 18:10:54,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-14 18:10:54,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1848, Invalid=5292, Unknown=0, NotChecked=0, Total=7140 [2018-10-14 18:10:54,876 INFO L87 Difference]: Start difference. First operand 3592 states and 3674 transitions. Second operand 85 states. [2018-10-14 18:11:00,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:11:00,125 INFO L93 Difference]: Finished difference Result 3764 states and 3850 transitions. [2018-10-14 18:11:00,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-10-14 18:11:00,125 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 2238 [2018-10-14 18:11:00,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:11:00,129 INFO L225 Difference]: With dead ends: 3764 [2018-10-14 18:11:00,130 INFO L226 Difference]: Without dead ends: 3764 [2018-10-14 18:11:00,132 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4961 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=8818, Invalid=18904, Unknown=0, NotChecked=0, Total=27722 [2018-10-14 18:11:00,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3764 states. [2018-10-14 18:11:00,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3764 to 3679. [2018-10-14 18:11:00,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3679 states. [2018-10-14 18:11:00,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3679 states to 3679 states and 3763 transitions. [2018-10-14 18:11:00,154 INFO L78 Accepts]: Start accepts. Automaton has 3679 states and 3763 transitions. Word has length 2238 [2018-10-14 18:11:00,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:11:00,155 INFO L481 AbstractCegarLoop]: Abstraction has 3679 states and 3763 transitions. [2018-10-14 18:11:00,155 INFO L482 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-14 18:11:00,155 INFO L276 IsEmpty]: Start isEmpty. Operand 3679 states and 3763 transitions. [2018-10-14 18:11:00,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2293 [2018-10-14 18:11:00,215 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:11:00,216 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:11:00,216 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:11:00,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:11:00,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1059044738, now seen corresponding path program 42 times [2018-10-14 18:11:00,217 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:11:00,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:11:05,872 INFO L134 CoverageAnalysis]: Checked inductivity of 46536 backedges. 0 proven. 46536 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:11:05,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:11:05,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-14 18:11:05,875 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-14 18:11:05,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-14 18:11:05,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1935, Invalid=5547, Unknown=0, NotChecked=0, Total=7482 [2018-10-14 18:11:05,876 INFO L87 Difference]: Start difference. First operand 3679 states and 3763 transitions. Second operand 87 states. [2018-10-14 18:11:11,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:11:11,237 INFO L93 Difference]: Finished difference Result 3851 states and 3939 transitions. [2018-10-14 18:11:11,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-10-14 18:11:11,238 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 2292 [2018-10-14 18:11:11,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:11:11,243 INFO L225 Difference]: With dead ends: 3851 [2018-10-14 18:11:11,243 INFO L226 Difference]: Without dead ends: 3851 [2018-10-14 18:11:11,245 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5208 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=9243, Invalid=19827, Unknown=0, NotChecked=0, Total=29070 [2018-10-14 18:11:11,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3851 states. [2018-10-14 18:11:11,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3851 to 3766. [2018-10-14 18:11:11,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3766 states. [2018-10-14 18:11:11,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3766 states to 3766 states and 3852 transitions. [2018-10-14 18:11:11,266 INFO L78 Accepts]: Start accepts. Automaton has 3766 states and 3852 transitions. Word has length 2292 [2018-10-14 18:11:11,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:11:11,268 INFO L481 AbstractCegarLoop]: Abstraction has 3766 states and 3852 transitions. [2018-10-14 18:11:11,268 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-14 18:11:11,268 INFO L276 IsEmpty]: Start isEmpty. Operand 3766 states and 3852 transitions. [2018-10-14 18:11:11,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2347 [2018-10-14 18:11:11,296 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:11:11,297 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:11:11,297 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:11:11,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:11:11,297 INFO L82 PathProgramCache]: Analyzing trace with hash -544362169, now seen corresponding path program 43 times [2018-10-14 18:11:11,298 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:11:11,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:11:17,215 INFO L134 CoverageAnalysis]: Checked inductivity of 48805 backedges. 0 proven. 48805 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:11:17,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:11:17,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-10-14 18:11:17,217 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-14 18:11:17,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-14 18:11:17,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2024, Invalid=5808, Unknown=0, NotChecked=0, Total=7832 [2018-10-14 18:11:17,217 INFO L87 Difference]: Start difference. First operand 3766 states and 3852 transitions. Second operand 89 states. [2018-10-14 18:11:22,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:11:22,692 INFO L93 Difference]: Finished difference Result 3938 states and 4028 transitions. [2018-10-14 18:11:22,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-10-14 18:11:22,692 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 2346 [2018-10-14 18:11:22,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:11:22,697 INFO L225 Difference]: With dead ends: 3938 [2018-10-14 18:11:22,697 INFO L226 Difference]: Without dead ends: 3938 [2018-10-14 18:11:22,700 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5461 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=9678, Invalid=20772, Unknown=0, NotChecked=0, Total=30450 [2018-10-14 18:11:22,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3938 states. [2018-10-14 18:11:22,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3938 to 3853. [2018-10-14 18:11:22,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3853 states. [2018-10-14 18:11:22,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3853 states to 3853 states and 3941 transitions. [2018-10-14 18:11:22,720 INFO L78 Accepts]: Start accepts. Automaton has 3853 states and 3941 transitions. Word has length 2346 [2018-10-14 18:11:22,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:11:22,721 INFO L481 AbstractCegarLoop]: Abstraction has 3853 states and 3941 transitions. [2018-10-14 18:11:22,722 INFO L482 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-14 18:11:22,722 INFO L276 IsEmpty]: Start isEmpty. Operand 3853 states and 3941 transitions. [2018-10-14 18:11:22,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2401 [2018-10-14 18:11:22,755 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:11:22,756 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:11:22,756 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:11:22,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:11:22,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1492320436, now seen corresponding path program 44 times [2018-10-14 18:11:22,757 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:11:22,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:11:28,938 INFO L134 CoverageAnalysis]: Checked inductivity of 51128 backedges. 0 proven. 51128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:11:28,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:11:28,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-10-14 18:11:28,941 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-14 18:11:28,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-14 18:11:28,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2115, Invalid=6075, Unknown=0, NotChecked=0, Total=8190 [2018-10-14 18:11:28,942 INFO L87 Difference]: Start difference. First operand 3853 states and 3941 transitions. Second operand 91 states. [2018-10-14 18:11:34,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:11:34,814 INFO L93 Difference]: Finished difference Result 4025 states and 4117 transitions. [2018-10-14 18:11:34,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-10-14 18:11:34,815 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 2400 [2018-10-14 18:11:34,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:11:34,818 INFO L225 Difference]: With dead ends: 4025 [2018-10-14 18:11:34,819 INFO L226 Difference]: Without dead ends: 4025 [2018-10-14 18:11:34,821 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5720 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=10123, Invalid=21739, Unknown=0, NotChecked=0, Total=31862 [2018-10-14 18:11:34,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4025 states. [2018-10-14 18:11:34,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4025 to 3940. [2018-10-14 18:11:34,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3940 states. [2018-10-14 18:11:34,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3940 states to 3940 states and 4030 transitions. [2018-10-14 18:11:34,841 INFO L78 Accepts]: Start accepts. Automaton has 3940 states and 4030 transitions. Word has length 2400 [2018-10-14 18:11:34,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:11:34,842 INFO L481 AbstractCegarLoop]: Abstraction has 3940 states and 4030 transitions. [2018-10-14 18:11:34,842 INFO L482 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-14 18:11:34,843 INFO L276 IsEmpty]: Start isEmpty. Operand 3940 states and 4030 transitions. [2018-10-14 18:11:34,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2455 [2018-10-14 18:11:34,872 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:11:34,873 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:11:34,873 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:11:34,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:11:34,874 INFO L82 PathProgramCache]: Analyzing trace with hash -102008943, now seen corresponding path program 45 times [2018-10-14 18:11:34,874 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:11:34,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:11:41,359 INFO L134 CoverageAnalysis]: Checked inductivity of 53505 backedges. 0 proven. 53505 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:11:41,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:11:41,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-14 18:11:41,361 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-14 18:11:41,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-14 18:11:41,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2208, Invalid=6348, Unknown=0, NotChecked=0, Total=8556 [2018-10-14 18:11:41,362 INFO L87 Difference]: Start difference. First operand 3940 states and 4030 transitions. Second operand 93 states. [2018-10-14 18:11:47,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:11:47,600 INFO L93 Difference]: Finished difference Result 4112 states and 4206 transitions. [2018-10-14 18:11:47,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-10-14 18:11:47,601 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 2454 [2018-10-14 18:11:47,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:11:47,606 INFO L225 Difference]: With dead ends: 4112 [2018-10-14 18:11:47,606 INFO L226 Difference]: Without dead ends: 4112 [2018-10-14 18:11:47,609 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5985 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=10578, Invalid=22728, Unknown=0, NotChecked=0, Total=33306 [2018-10-14 18:11:47,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4112 states. [2018-10-14 18:11:47,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4112 to 4027. [2018-10-14 18:11:47,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4027 states. [2018-10-14 18:11:47,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4027 states to 4027 states and 4119 transitions. [2018-10-14 18:11:47,639 INFO L78 Accepts]: Start accepts. Automaton has 4027 states and 4119 transitions. Word has length 2454 [2018-10-14 18:11:47,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:11:47,641 INFO L481 AbstractCegarLoop]: Abstraction has 4027 states and 4119 transitions. [2018-10-14 18:11:47,641 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-14 18:11:47,641 INFO L276 IsEmpty]: Start isEmpty. Operand 4027 states and 4119 transitions. [2018-10-14 18:11:47,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2509 [2018-10-14 18:11:47,687 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:11:47,688 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:11:47,688 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:11:47,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:11:47,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1710942742, now seen corresponding path program 46 times [2018-10-14 18:11:47,690 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:11:47,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:11:54,848 INFO L134 CoverageAnalysis]: Checked inductivity of 55936 backedges. 0 proven. 55936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:11:54,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:11:54,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-10-14 18:11:54,850 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-14 18:11:54,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-14 18:11:54,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2303, Invalid=6627, Unknown=0, NotChecked=0, Total=8930 [2018-10-14 18:11:54,850 INFO L87 Difference]: Start difference. First operand 4027 states and 4119 transitions. Second operand 95 states. [2018-10-14 18:12:01,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:12:01,392 INFO L93 Difference]: Finished difference Result 4199 states and 4295 transitions. [2018-10-14 18:12:01,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-10-14 18:12:01,392 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 2508 [2018-10-14 18:12:01,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:12:01,397 INFO L225 Difference]: With dead ends: 4199 [2018-10-14 18:12:01,398 INFO L226 Difference]: Without dead ends: 4199 [2018-10-14 18:12:01,399 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6256 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=11043, Invalid=23739, Unknown=0, NotChecked=0, Total=34782 [2018-10-14 18:12:01,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4199 states. [2018-10-14 18:12:01,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4199 to 4114. [2018-10-14 18:12:01,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4114 states. [2018-10-14 18:12:01,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4114 states to 4114 states and 4208 transitions. [2018-10-14 18:12:01,418 INFO L78 Accepts]: Start accepts. Automaton has 4114 states and 4208 transitions. Word has length 2508 [2018-10-14 18:12:01,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:12:01,420 INFO L481 AbstractCegarLoop]: Abstraction has 4114 states and 4208 transitions. [2018-10-14 18:12:01,420 INFO L482 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-14 18:12:01,420 INFO L276 IsEmpty]: Start isEmpty. Operand 4114 states and 4208 transitions. [2018-10-14 18:12:01,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2563 [2018-10-14 18:12:01,457 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:12:01,458 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:12:01,458 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:12:01,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:12:01,458 INFO L82 PathProgramCache]: Analyzing trace with hash -678353189, now seen corresponding path program 47 times [2018-10-14 18:12:01,459 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:12:01,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:12:08,820 INFO L134 CoverageAnalysis]: Checked inductivity of 58421 backedges. 0 proven. 58421 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:12:08,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:12:08,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-10-14 18:12:08,823 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-10-14 18:12:08,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-10-14 18:12:08,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2400, Invalid=6912, Unknown=0, NotChecked=0, Total=9312 [2018-10-14 18:12:08,824 INFO L87 Difference]: Start difference. First operand 4114 states and 4208 transitions. Second operand 97 states. [2018-10-14 18:12:15,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:12:15,613 INFO L93 Difference]: Finished difference Result 4286 states and 4384 transitions. [2018-10-14 18:12:15,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-10-14 18:12:15,614 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 2562 [2018-10-14 18:12:15,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:12:15,618 INFO L225 Difference]: With dead ends: 4286 [2018-10-14 18:12:15,618 INFO L226 Difference]: Without dead ends: 4286 [2018-10-14 18:12:15,621 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6533 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=11518, Invalid=24772, Unknown=0, NotChecked=0, Total=36290 [2018-10-14 18:12:15,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4286 states. [2018-10-14 18:12:15,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4286 to 4201. [2018-10-14 18:12:15,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4201 states. [2018-10-14 18:12:15,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4201 states to 4201 states and 4297 transitions. [2018-10-14 18:12:15,651 INFO L78 Accepts]: Start accepts. Automaton has 4201 states and 4297 transitions. Word has length 2562 [2018-10-14 18:12:15,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:12:15,653 INFO L481 AbstractCegarLoop]: Abstraction has 4201 states and 4297 transitions. [2018-10-14 18:12:15,653 INFO L482 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-10-14 18:12:15,653 INFO L276 IsEmpty]: Start isEmpty. Operand 4201 states and 4297 transitions. [2018-10-14 18:12:15,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2617 [2018-10-14 18:12:15,698 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:12:15,699 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:12:15,699 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:12:15,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:12:15,699 INFO L82 PathProgramCache]: Analyzing trace with hash 243793376, now seen corresponding path program 48 times [2018-10-14 18:12:15,700 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:12:15,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:12:22,768 INFO L134 CoverageAnalysis]: Checked inductivity of 60960 backedges. 0 proven. 60960 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:12:22,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:12:22,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-10-14 18:12:22,771 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-10-14 18:12:22,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-10-14 18:12:22,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2499, Invalid=7203, Unknown=0, NotChecked=0, Total=9702 [2018-10-14 18:12:22,772 INFO L87 Difference]: Start difference. First operand 4201 states and 4297 transitions. Second operand 99 states. [2018-10-14 18:12:30,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:12:30,006 INFO L93 Difference]: Finished difference Result 4373 states and 4473 transitions. [2018-10-14 18:12:30,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-10-14 18:12:30,006 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 2616 [2018-10-14 18:12:30,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:12:30,011 INFO L225 Difference]: With dead ends: 4373 [2018-10-14 18:12:30,011 INFO L226 Difference]: Without dead ends: 4373 [2018-10-14 18:12:30,013 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6816 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=12003, Invalid=25827, Unknown=0, NotChecked=0, Total=37830 [2018-10-14 18:12:30,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4373 states. [2018-10-14 18:12:30,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4373 to 4288. [2018-10-14 18:12:30,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4288 states. [2018-10-14 18:12:30,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4288 states to 4288 states and 4386 transitions. [2018-10-14 18:12:30,032 INFO L78 Accepts]: Start accepts. Automaton has 4288 states and 4386 transitions. Word has length 2616 [2018-10-14 18:12:30,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:12:30,033 INFO L481 AbstractCegarLoop]: Abstraction has 4288 states and 4386 transitions. [2018-10-14 18:12:30,034 INFO L482 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-10-14 18:12:30,034 INFO L276 IsEmpty]: Start isEmpty. Operand 4288 states and 4386 transitions. [2018-10-14 18:12:30,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2671 [2018-10-14 18:12:30,071 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:12:30,072 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:12:30,072 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:12:30,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:12:30,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1396522789, now seen corresponding path program 49 times [2018-10-14 18:12:30,073 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:12:30,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:12:39,670 INFO L134 CoverageAnalysis]: Checked inductivity of 63553 backedges. 0 proven. 63553 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:12:39,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:12:39,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-10-14 18:12:39,672 INFO L460 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-10-14 18:12:39,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-10-14 18:12:39,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2600, Invalid=7500, Unknown=0, NotChecked=0, Total=10100 [2018-10-14 18:12:39,673 INFO L87 Difference]: Start difference. First operand 4288 states and 4386 transitions. Second operand 101 states. [2018-10-14 18:12:46,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:12:46,998 INFO L93 Difference]: Finished difference Result 4460 states and 4562 transitions. [2018-10-14 18:12:46,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-10-14 18:12:46,999 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 2670 [2018-10-14 18:12:47,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:12:47,002 INFO L225 Difference]: With dead ends: 4460 [2018-10-14 18:12:47,002 INFO L226 Difference]: Without dead ends: 4460 [2018-10-14 18:12:47,004 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7105 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=12498, Invalid=26904, Unknown=0, NotChecked=0, Total=39402 [2018-10-14 18:12:47,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4460 states. [2018-10-14 18:12:47,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4460 to 4375. [2018-10-14 18:12:47,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4375 states. [2018-10-14 18:12:47,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4375 states to 4375 states and 4475 transitions. [2018-10-14 18:12:47,031 INFO L78 Accepts]: Start accepts. Automaton has 4375 states and 4475 transitions. Word has length 2670 [2018-10-14 18:12:47,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:12:47,033 INFO L481 AbstractCegarLoop]: Abstraction has 4375 states and 4475 transitions. [2018-10-14 18:12:47,033 INFO L482 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-10-14 18:12:47,033 INFO L276 IsEmpty]: Start isEmpty. Operand 4375 states and 4475 transitions. [2018-10-14 18:12:47,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2725 [2018-10-14 18:12:47,076 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:12:47,076 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:12:47,076 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:12:47,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:12:47,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1804778154, now seen corresponding path program 50 times [2018-10-14 18:12:47,077 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:12:47,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:12:55,487 INFO L134 CoverageAnalysis]: Checked inductivity of 66200 backedges. 0 proven. 66200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:12:55,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:12:55,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-10-14 18:12:55,488 INFO L460 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-10-14 18:12:55,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-10-14 18:12:55,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2703, Invalid=7803, Unknown=0, NotChecked=0, Total=10506 [2018-10-14 18:12:55,489 INFO L87 Difference]: Start difference. First operand 4375 states and 4475 transitions. Second operand 103 states. [2018-10-14 18:13:03,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:13:03,274 INFO L93 Difference]: Finished difference Result 4547 states and 4651 transitions. [2018-10-14 18:13:03,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2018-10-14 18:13:03,274 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 2724 [2018-10-14 18:13:03,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:13:03,279 INFO L225 Difference]: With dead ends: 4547 [2018-10-14 18:13:03,279 INFO L226 Difference]: Without dead ends: 4547 [2018-10-14 18:13:03,282 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7400 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=13003, Invalid=28003, Unknown=0, NotChecked=0, Total=41006 [2018-10-14 18:13:03,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4547 states. [2018-10-14 18:13:03,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4547 to 4462. [2018-10-14 18:13:03,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4462 states. [2018-10-14 18:13:03,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4462 states to 4462 states and 4564 transitions. [2018-10-14 18:13:03,305 INFO L78 Accepts]: Start accepts. Automaton has 4462 states and 4564 transitions. Word has length 2724 [2018-10-14 18:13:03,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:13:03,306 INFO L481 AbstractCegarLoop]: Abstraction has 4462 states and 4564 transitions. [2018-10-14 18:13:03,306 INFO L482 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-10-14 18:13:03,307 INFO L276 IsEmpty]: Start isEmpty. Operand 4462 states and 4564 transitions. [2018-10-14 18:13:03,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2779 [2018-10-14 18:13:03,349 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:13:03,350 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:13:03,350 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:13:03,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:13:03,350 INFO L82 PathProgramCache]: Analyzing trace with hash -806469521, now seen corresponding path program 51 times [2018-10-14 18:13:03,351 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:13:03,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:13:11,969 INFO L134 CoverageAnalysis]: Checked inductivity of 68901 backedges. 0 proven. 68901 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:13:11,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:13:11,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-10-14 18:13:11,970 INFO L460 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-10-14 18:13:11,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-10-14 18:13:11,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2808, Invalid=8112, Unknown=0, NotChecked=0, Total=10920 [2018-10-14 18:13:11,971 INFO L87 Difference]: Start difference. First operand 4462 states and 4564 transitions. Second operand 105 states. [2018-10-14 18:13:20,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:13:20,253 INFO L93 Difference]: Finished difference Result 4634 states and 4740 transitions. [2018-10-14 18:13:20,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2018-10-14 18:13:20,254 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 2778 [2018-10-14 18:13:20,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:13:20,260 INFO L225 Difference]: With dead ends: 4634 [2018-10-14 18:13:20,260 INFO L226 Difference]: Without dead ends: 4634 [2018-10-14 18:13:20,264 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7701 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=13518, Invalid=29124, Unknown=0, NotChecked=0, Total=42642 [2018-10-14 18:13:20,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4634 states. [2018-10-14 18:13:20,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4634 to 4549. [2018-10-14 18:13:20,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4549 states. [2018-10-14 18:13:20,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4549 states to 4549 states and 4653 transitions. [2018-10-14 18:13:20,294 INFO L78 Accepts]: Start accepts. Automaton has 4549 states and 4653 transitions. Word has length 2778 [2018-10-14 18:13:20,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:13:20,295 INFO L481 AbstractCegarLoop]: Abstraction has 4549 states and 4653 transitions. [2018-10-14 18:13:20,296 INFO L482 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-10-14 18:13:20,296 INFO L276 IsEmpty]: Start isEmpty. Operand 4549 states and 4653 transitions. [2018-10-14 18:13:20,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2833 [2018-10-14 18:13:20,353 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:13:20,354 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:13:20,354 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:13:20,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:13:20,354 INFO L82 PathProgramCache]: Analyzing trace with hash 540647540, now seen corresponding path program 52 times [2018-10-14 18:13:20,355 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:13:20,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:13:29,702 INFO L134 CoverageAnalysis]: Checked inductivity of 71656 backedges. 0 proven. 71656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:13:29,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:13:29,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-10-14 18:13:29,704 INFO L460 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-10-14 18:13:29,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-10-14 18:13:29,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2915, Invalid=8427, Unknown=0, NotChecked=0, Total=11342 [2018-10-14 18:13:29,705 INFO L87 Difference]: Start difference. First operand 4549 states and 4653 transitions. Second operand 107 states. [2018-10-14 18:13:38,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:13:38,319 INFO L93 Difference]: Finished difference Result 4721 states and 4829 transitions. [2018-10-14 18:13:38,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2018-10-14 18:13:38,319 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 2832 [2018-10-14 18:13:38,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:13:38,323 INFO L225 Difference]: With dead ends: 4721 [2018-10-14 18:13:38,323 INFO L226 Difference]: Without dead ends: 4721 [2018-10-14 18:13:38,325 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8008 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=14043, Invalid=30267, Unknown=0, NotChecked=0, Total=44310 [2018-10-14 18:13:38,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4721 states. [2018-10-14 18:13:38,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4721 to 4636. [2018-10-14 18:13:38,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4636 states. [2018-10-14 18:13:38,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4636 states to 4636 states and 4742 transitions. [2018-10-14 18:13:38,346 INFO L78 Accepts]: Start accepts. Automaton has 4636 states and 4742 transitions. Word has length 2832 [2018-10-14 18:13:38,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:13:38,347 INFO L481 AbstractCegarLoop]: Abstraction has 4636 states and 4742 transitions. [2018-10-14 18:13:38,347 INFO L482 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-10-14 18:13:38,347 INFO L276 IsEmpty]: Start isEmpty. Operand 4636 states and 4742 transitions. [2018-10-14 18:13:38,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2887 [2018-10-14 18:13:38,392 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:13:38,392 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:13:38,392 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:13:38,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:13:38,393 INFO L82 PathProgramCache]: Analyzing trace with hash -656233799, now seen corresponding path program 53 times [2018-10-14 18:13:38,393 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:13:38,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:13:47,347 INFO L134 CoverageAnalysis]: Checked inductivity of 74465 backedges. 0 proven. 74465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:13:47,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:13:47,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-10-14 18:13:47,349 INFO L460 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-10-14 18:13:47,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-10-14 18:13:47,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3024, Invalid=8748, Unknown=0, NotChecked=0, Total=11772 [2018-10-14 18:13:47,350 INFO L87 Difference]: Start difference. First operand 4636 states and 4742 transitions. Second operand 109 states. [2018-10-14 18:13:56,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:13:56,315 INFO L93 Difference]: Finished difference Result 4808 states and 4918 transitions. [2018-10-14 18:13:56,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2018-10-14 18:13:56,316 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 2886 [2018-10-14 18:13:56,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:13:56,321 INFO L225 Difference]: With dead ends: 4808 [2018-10-14 18:13:56,321 INFO L226 Difference]: Without dead ends: 4808 [2018-10-14 18:13:56,324 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8321 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=14578, Invalid=31432, Unknown=0, NotChecked=0, Total=46010 [2018-10-14 18:13:56,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4808 states. [2018-10-14 18:13:56,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4808 to 4723. [2018-10-14 18:13:56,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4723 states. [2018-10-14 18:13:56,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4723 states to 4723 states and 4831 transitions. [2018-10-14 18:13:56,353 INFO L78 Accepts]: Start accepts. Automaton has 4723 states and 4831 transitions. Word has length 2886 [2018-10-14 18:13:56,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:13:56,355 INFO L481 AbstractCegarLoop]: Abstraction has 4723 states and 4831 transitions. [2018-10-14 18:13:56,355 INFO L482 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-10-14 18:13:56,355 INFO L276 IsEmpty]: Start isEmpty. Operand 4723 states and 4831 transitions. [2018-10-14 18:13:56,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2941 [2018-10-14 18:13:56,401 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:13:56,401 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:13:56,401 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:13:56,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:13:56,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1205546814, now seen corresponding path program 54 times [2018-10-14 18:13:56,402 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:13:56,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:14:05,233 INFO L134 CoverageAnalysis]: Checked inductivity of 77328 backedges. 0 proven. 77328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:14:05,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:14:05,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-10-14 18:14:05,235 INFO L460 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-10-14 18:14:05,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-10-14 18:14:05,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3135, Invalid=9075, Unknown=0, NotChecked=0, Total=12210 [2018-10-14 18:14:05,235 INFO L87 Difference]: Start difference. First operand 4723 states and 4831 transitions. Second operand 111 states. [2018-10-14 18:14:14,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:14:14,566 INFO L93 Difference]: Finished difference Result 4895 states and 5007 transitions. [2018-10-14 18:14:14,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2018-10-14 18:14:14,567 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 2940 [2018-10-14 18:14:14,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:14:14,571 INFO L225 Difference]: With dead ends: 4895 [2018-10-14 18:14:14,572 INFO L226 Difference]: Without dead ends: 4895 [2018-10-14 18:14:14,575 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8640 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=15123, Invalid=32619, Unknown=0, NotChecked=0, Total=47742 [2018-10-14 18:14:14,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4895 states. [2018-10-14 18:14:14,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4895 to 4810. [2018-10-14 18:14:14,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4810 states. [2018-10-14 18:14:14,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4810 states to 4810 states and 4920 transitions. [2018-10-14 18:14:14,600 INFO L78 Accepts]: Start accepts. Automaton has 4810 states and 4920 transitions. Word has length 2940 [2018-10-14 18:14:14,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:14:14,602 INFO L481 AbstractCegarLoop]: Abstraction has 4810 states and 4920 transitions. [2018-10-14 18:14:14,602 INFO L482 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-10-14 18:14:14,602 INFO L276 IsEmpty]: Start isEmpty. Operand 4810 states and 4920 transitions. [2018-10-14 18:14:14,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2995 [2018-10-14 18:14:14,646 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:14:14,647 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:14:14,647 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:14:14,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:14:14,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1046938109, now seen corresponding path program 55 times [2018-10-14 18:14:14,648 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:14:14,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:14:24,861 INFO L134 CoverageAnalysis]: Checked inductivity of 80245 backedges. 0 proven. 80245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:14:24,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:14:24,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-10-14 18:14:24,863 INFO L460 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-10-14 18:14:24,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-10-14 18:14:24,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3248, Invalid=9408, Unknown=0, NotChecked=0, Total=12656 [2018-10-14 18:14:24,864 INFO L87 Difference]: Start difference. First operand 4810 states and 4920 transitions. Second operand 113 states. [2018-10-14 18:14:34,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:14:34,282 INFO L93 Difference]: Finished difference Result 4982 states and 5096 transitions. [2018-10-14 18:14:34,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2018-10-14 18:14:34,282 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 2994 [2018-10-14 18:14:34,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:14:34,286 INFO L225 Difference]: With dead ends: 4982 [2018-10-14 18:14:34,286 INFO L226 Difference]: Without dead ends: 4982 [2018-10-14 18:14:34,288 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8965 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=15678, Invalid=33828, Unknown=0, NotChecked=0, Total=49506 [2018-10-14 18:14:34,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4982 states. [2018-10-14 18:14:34,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4982 to 4897. [2018-10-14 18:14:34,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4897 states. [2018-10-14 18:14:34,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4897 states to 4897 states and 5009 transitions. [2018-10-14 18:14:34,310 INFO L78 Accepts]: Start accepts. Automaton has 4897 states and 5009 transitions. Word has length 2994 [2018-10-14 18:14:34,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:14:34,311 INFO L481 AbstractCegarLoop]: Abstraction has 4897 states and 5009 transitions. [2018-10-14 18:14:34,311 INFO L482 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-10-14 18:14:34,311 INFO L276 IsEmpty]: Start isEmpty. Operand 4897 states and 5009 transitions. [2018-10-14 18:14:34,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3049 [2018-10-14 18:14:34,362 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:14:34,362 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:14:34,363 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:14:34,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:14:34,363 INFO L82 PathProgramCache]: Analyzing trace with hash 370534152, now seen corresponding path program 56 times [2018-10-14 18:14:34,364 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:14:34,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:14:44,132 INFO L134 CoverageAnalysis]: Checked inductivity of 83216 backedges. 0 proven. 83216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:14:44,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:14:44,133 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-10-14 18:14:44,134 INFO L460 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-10-14 18:14:44,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-10-14 18:14:44,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3363, Invalid=9747, Unknown=0, NotChecked=0, Total=13110 [2018-10-14 18:14:44,135 INFO L87 Difference]: Start difference. First operand 4897 states and 5009 transitions. Second operand 115 states.