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/20051113-1.c_false-valid-memtrack.i_17.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-093a8c0 [2018-10-14 17:56:25,194 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-14 17:56:25,196 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-14 17:56:25,209 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-14 17:56:25,209 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-14 17:56:25,210 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-14 17:56:25,211 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-14 17:56:25,213 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-14 17:56:25,215 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-14 17:56:25,216 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-14 17:56:25,216 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-14 17:56:25,217 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-14 17:56:25,218 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-14 17:56:25,219 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-14 17:56:25,220 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-14 17:56:25,222 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-14 17:56:25,223 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-14 17:56:25,228 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-14 17:56:25,230 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-14 17:56:25,236 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-14 17:56:25,239 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-14 17:56:25,241 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-14 17:56:25,245 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-14 17:56:25,245 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-14 17:56:25,246 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-14 17:56:25,247 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-14 17:56:25,251 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-14 17:56:25,252 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-14 17:56:25,252 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-14 17:56:25,256 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-14 17:56:25,257 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-14 17:56:25,257 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-14 17:56:25,259 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-14 17:56:25,259 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-14 17:56:25,260 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-14 17:56:25,261 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-14 17:56:25,261 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 17:56:25,278 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-14 17:56:25,278 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-14 17:56:25,279 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-14 17:56:25,279 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-14 17:56:25,280 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-14 17:56:25,280 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-14 17:56:25,282 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-14 17:56:25,282 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-14 17:56:25,282 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-14 17:56:25,283 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-14 17:56:25,283 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-14 17:56:25,284 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-14 17:56:25,284 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-14 17:56:25,285 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-14 17:56:25,285 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-14 17:56:25,360 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-14 17:56:25,377 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-14 17:56:25,384 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-14 17:56:25,385 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-14 17:56:25,386 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-14 17:56:25,387 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/20051113-1.c_false-valid-memtrack.i_17.bpl [2018-10-14 17:56:25,387 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/20051113-1.c_false-valid-memtrack.i_17.bpl' [2018-10-14 17:56:25,468 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-14 17:56:25,469 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-14 17:56:25,470 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-14 17:56:25,470 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-14 17:56:25,471 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-14 17:56:25,499 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_17.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 05:56:25" (1/1) ... [2018-10-14 17:56:25,501 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_17.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 05:56:25" (1/1) ... [2018-10-14 17:56:25,517 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_17.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 05:56:25" (1/1) ... [2018-10-14 17:56:25,518 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_17.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 05:56:25" (1/1) ... [2018-10-14 17:56:25,524 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_17.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 05:56:25" (1/1) ... [2018-10-14 17:56:25,526 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_17.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 05:56:25" (1/1) ... [2018-10-14 17:56:25,528 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_17.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 05:56:25" (1/1) ... [2018-10-14 17:56:25,531 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-14 17:56:25,532 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-14 17:56:25,532 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-14 17:56:25,532 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-14 17:56:25,533 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "20051113-1.c_false-valid-memtrack.i_17.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 05:56:25" (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 17:56:25,610 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-14 17:56:25,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-14 17:56:25,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-14 17:56:26,317 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-14 17:56:26,318 INFO L202 PluginConnector]: Adding new model 20051113-1.c_false-valid-memtrack.i_17.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:56:26 BoogieIcfgContainer [2018-10-14 17:56:26,318 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-14 17:56:26,318 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-14 17:56:26,318 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-14 17:56:26,320 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-14 17:56:26,323 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "20051113-1.c_false-valid-memtrack.i_17.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:56:26" (1/1) ... [2018-10-14 17:56:26,332 INFO L137 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-10-14 17:56:26,332 INFO L138 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-10-14 17:56:26,376 INFO L191 apSepIcfgTransformer]: Heap separator: starting loc-array-style preprocessing [2018-10-14 17:56:26,437 INFO L219 apSepIcfgTransformer]: finished MemlocArrayUpdater [2018-10-14 17:56:26,455 INFO L282 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-10-14 17:56:26,527 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=1) [2018-10-14 17:59:12,599 INFO L315 AbstractInterpreter]: Visited 86 different actions 177 times. Merged at 60 different actions 88 times. Widened at 1 different actions 1 times. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2018-10-14 17:59:12,602 INFO L306 apSepIcfgTransformer]: finished equality analysis [2018-10-14 17:59:12,607 INFO L318 apSepIcfgTransformer]: Finished detection of select terms ("array reads") [2018-10-14 17:59:13,127 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select |v_#locv_#memory_int_2_1_1| |v_ULTIMATE.start_#Ultimate.C_memset_#ptr.base_6|) at (#memory_int := #memory_int[#Ultimate.C_memset_#ptr.base := #memory_int[#Ultimate.C_memset_#ptr.base][#Ultimate.C_memset_#t~loopctr16 + #Ultimate.C_memset_#ptr.offset := #Ultimate.C_memset_#value]];) [2018-10-14 17:59:13,356 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 17:59:13,359 INFO L232 HeapPartitionManager]: partitioning result: [2018-10-14 17:59:13,359 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-14 17:59:13,359 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-14 17:59:13,360 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 7 [2018-10-14 17:59:13,360 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-14 17:59:13,360 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-14 17:59:13,360 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 0 [2018-10-14 17:59:13,360 INFO L248 HeapPartitionManager]: # location blocks :0 [2018-10-14 17:59:13,361 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-14 17:59:13,361 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-14 17:59:13,361 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 7 [2018-10-14 17:59:13,361 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-14 17:59:13,361 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-14 17:59:13,362 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 0 [2018-10-14 17:59:13,362 INFO L248 HeapPartitionManager]: # location blocks :0 [2018-10-14 17:59:13,363 INFO L145 ransitionTransformer]: executing heap partitioning transformation [2018-10-14 17:59:13,387 INFO L202 PluginConnector]: Adding new model 20051113-1.c_false-valid-memtrack.i_17.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.10 05:59:13 BasicIcfg [2018-10-14 17:59:13,387 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-14 17:59:13,392 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-14 17:59:13,392 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-14 17:59:13,401 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-14 17:59:13,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "20051113-1.c_false-valid-memtrack.i_17.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 05:56:25" (1/3) ... [2018-10-14 17:59:13,406 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b3e9818 and model type 20051113-1.c_false-valid-memtrack.i_17.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:59:13, skipping insertion in model container [2018-10-14 17:59:13,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "20051113-1.c_false-valid-memtrack.i_17.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:56:26" (2/3) ... [2018-10-14 17:59:13,406 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b3e9818 and model type 20051113-1.c_false-valid-memtrack.i_17.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 05:59:13, skipping insertion in model container [2018-10-14 17:59:13,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "20051113-1.c_false-valid-memtrack.i_17.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.10 05:59:13" (3/3) ... [2018-10-14 17:59:13,408 INFO L112 eAbstractionObserver]: Analyzing ICFG memPartitionedIcfg [2018-10-14 17:59:13,418 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-14 17:59:13,430 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-14 17:59:13,447 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-14 17:59:13,472 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-14 17:59:13,473 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-14 17:59:13,473 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-14 17:59:13,474 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-14 17:59:13,474 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-14 17:59:13,474 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-14 17:59:13,474 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-14 17:59:13,474 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-14 17:59:13,475 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-14 17:59:13,487 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states. [2018-10-14 17:59:13,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-10-14 17:59:13,495 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:59:13,496 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, 1, 1, 1] [2018-10-14 17:59:13,497 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:59:13,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:59:13,502 INFO L82 PathProgramCache]: Analyzing trace with hash 338651377, now seen corresponding path program 1 times [2018-10-14 17:59:13,556 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:59:13,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:59:13,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:59:13,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 17:59:13,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-14 17:59:13,826 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 17:59:13,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 17:59:13,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-14 17:59:13,843 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 4 states. [2018-10-14 17:59:14,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:59:14,046 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-10-14 17:59:14,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 17:59:14,051 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-10-14 17:59:14,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:59:14,066 INFO L225 Difference]: With dead ends: 87 [2018-10-14 17:59:14,066 INFO L226 Difference]: Without dead ends: 87 [2018-10-14 17:59:14,068 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-14 17:59:14,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-10-14 17:59:14,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2018-10-14 17:59:14,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-14 17:59:14,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-10-14 17:59:14,122 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 81 [2018-10-14 17:59:14,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:59:14,123 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-10-14 17:59:14,123 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 17:59:14,123 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-10-14 17:59:14,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-14 17:59:14,130 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:59:14,130 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, 1, 1, 1, 1, 1, 1] [2018-10-14 17:59:14,130 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:59:14,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:59:14,131 INFO L82 PathProgramCache]: Analyzing trace with hash -82992695, now seen corresponding path program 1 times [2018-10-14 17:59:14,132 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:59:14,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:59:14,364 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 17:59:14,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:59:14,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-14 17:59:14,366 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-14 17:59:14,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-14 17:59:14,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-14 17:59:14,369 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 5 states. [2018-10-14 17:59:14,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:59:14,584 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-10-14 17:59:14,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-14 17:59:14,584 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2018-10-14 17:59:14,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:59:14,587 INFO L225 Difference]: With dead ends: 90 [2018-10-14 17:59:14,587 INFO L226 Difference]: Without dead ends: 90 [2018-10-14 17:59:14,588 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-14 17:59:14,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-10-14 17:59:14,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2018-10-14 17:59:14,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-10-14 17:59:14,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-10-14 17:59:14,596 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 84 [2018-10-14 17:59:14,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:59:14,597 INFO L481 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-10-14 17:59:14,597 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-14 17:59:14,597 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-10-14 17:59:14,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-14 17:59:14,598 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:59:14,599 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:59:14,599 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:59:14,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:59:14,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1497799153, now seen corresponding path program 2 times [2018-10-14 17:59:14,601 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:59:14,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:59:14,749 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:59:14,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:59:14,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-10-14 17:59:14,750 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-14 17:59:14,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-14 17:59:14,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-14 17:59:14,751 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 6 states. [2018-10-14 17:59:14,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:59:14,846 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-10-14 17:59:14,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-14 17:59:14,847 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 87 [2018-10-14 17:59:14,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:59:14,848 INFO L225 Difference]: With dead ends: 93 [2018-10-14 17:59:14,848 INFO L226 Difference]: Without dead ends: 93 [2018-10-14 17:59:14,849 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-10-14 17:59:14,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-10-14 17:59:14,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2018-10-14 17:59:14,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-10-14 17:59:14,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-10-14 17:59:14,857 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 87 [2018-10-14 17:59:14,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:59:14,857 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-10-14 17:59:14,857 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-14 17:59:14,857 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-10-14 17:59:14,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-14 17:59:14,859 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:59:14,859 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:59:14,859 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:59:14,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:59:14,860 INFO L82 PathProgramCache]: Analyzing trace with hash 551342281, now seen corresponding path program 3 times [2018-10-14 17:59:14,861 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:59:14,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:59:15,053 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:59:15,054 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:59:15,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-14 17:59:15,055 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-14 17:59:15,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-14 17:59:15,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-14 17:59:15,056 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 7 states. [2018-10-14 17:59:15,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:59:15,281 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-10-14 17:59:15,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-14 17:59:15,282 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 90 [2018-10-14 17:59:15,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:59:15,283 INFO L225 Difference]: With dead ends: 96 [2018-10-14 17:59:15,283 INFO L226 Difference]: Without dead ends: 96 [2018-10-14 17:59:15,283 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-10-14 17:59:15,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-10-14 17:59:15,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2018-10-14 17:59:15,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-10-14 17:59:15,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-10-14 17:59:15,290 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 90 [2018-10-14 17:59:15,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:59:15,290 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-10-14 17:59:15,290 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-14 17:59:15,290 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-10-14 17:59:15,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-10-14 17:59:15,292 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:59:15,292 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:59:15,292 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:59:15,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:59:15,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1114966769, now seen corresponding path program 4 times [2018-10-14 17:59:15,294 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:59:15,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:59:15,424 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:59:15,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:59:15,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-14 17:59:15,425 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-14 17:59:15,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-14 17:59:15,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-10-14 17:59:15,426 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 8 states. [2018-10-14 17:59:15,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:59:15,606 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-10-14 17:59:15,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-14 17:59:15,609 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 93 [2018-10-14 17:59:15,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:59:15,610 INFO L225 Difference]: With dead ends: 99 [2018-10-14 17:59:15,610 INFO L226 Difference]: Without dead ends: 99 [2018-10-14 17:59:15,611 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-10-14 17:59:15,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-10-14 17:59:15,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2018-10-14 17:59:15,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-10-14 17:59:15,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-10-14 17:59:15,626 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 93 [2018-10-14 17:59:15,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:59:15,626 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-10-14 17:59:15,626 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-14 17:59:15,626 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-10-14 17:59:15,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-14 17:59:15,631 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:59:15,631 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:59:15,631 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:59:15,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:59:15,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1270038583, now seen corresponding path program 5 times [2018-10-14 17:59:15,632 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:59:15,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:59:16,129 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:59:16,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:59:16,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-14 17:59:16,131 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-14 17:59:16,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-14 17:59:16,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-10-14 17:59:16,131 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 9 states. [2018-10-14 17:59:16,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:59:16,287 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-10-14 17:59:16,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-14 17:59:16,289 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2018-10-14 17:59:16,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:59:16,290 INFO L225 Difference]: With dead ends: 102 [2018-10-14 17:59:16,291 INFO L226 Difference]: Without dead ends: 102 [2018-10-14 17:59:16,291 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-10-14 17:59:16,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-10-14 17:59:16,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2018-10-14 17:59:16,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-10-14 17:59:16,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-10-14 17:59:16,299 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 96 [2018-10-14 17:59:16,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:59:16,299 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-10-14 17:59:16,299 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-14 17:59:16,300 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-10-14 17:59:16,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-14 17:59:16,301 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:59:16,301 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:59:16,301 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:59:16,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:59:16,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1320502287, now seen corresponding path program 6 times [2018-10-14 17:59:16,302 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:59:16,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:59:16,452 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:59:16,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:59:16,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-14 17:59:16,453 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-14 17:59:16,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-14 17:59:16,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-10-14 17:59:16,454 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 10 states. [2018-10-14 17:59:16,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:59:16,676 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-10-14 17:59:16,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-14 17:59:16,679 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 99 [2018-10-14 17:59:16,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:59:16,680 INFO L225 Difference]: With dead ends: 105 [2018-10-14 17:59:16,680 INFO L226 Difference]: Without dead ends: 105 [2018-10-14 17:59:16,681 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-10-14 17:59:16,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-10-14 17:59:16,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2018-10-14 17:59:16,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-10-14 17:59:16,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-10-14 17:59:16,686 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 99 [2018-10-14 17:59:16,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:59:16,686 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-10-14 17:59:16,686 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-14 17:59:16,686 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-10-14 17:59:16,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-14 17:59:16,688 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:59:16,688 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:59:16,688 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:59:16,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:59:16,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1446154551, now seen corresponding path program 7 times [2018-10-14 17:59:16,689 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:59:16,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:59:16,897 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:59:16,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:59:16,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-14 17:59:16,898 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-14 17:59:16,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-14 17:59:16,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2018-10-14 17:59:16,899 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 11 states. [2018-10-14 17:59:17,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:59:17,047 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-10-14 17:59:17,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-14 17:59:17,048 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 102 [2018-10-14 17:59:17,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:59:17,049 INFO L225 Difference]: With dead ends: 108 [2018-10-14 17:59:17,049 INFO L226 Difference]: Without dead ends: 108 [2018-10-14 17:59:17,049 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-10-14 17:59:17,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-10-14 17:59:17,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2018-10-14 17:59:17,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-10-14 17:59:17,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-10-14 17:59:17,055 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 102 [2018-10-14 17:59:17,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:59:17,056 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-10-14 17:59:17,056 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-14 17:59:17,056 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-10-14 17:59:17,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-10-14 17:59:17,057 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:59:17,058 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:59:17,058 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:59:17,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:59:17,058 INFO L82 PathProgramCache]: Analyzing trace with hash 458730737, now seen corresponding path program 8 times [2018-10-14 17:59:17,059 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:59:17,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:59:17,236 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:59:17,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:59:17,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-14 17:59:17,236 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-14 17:59:17,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-14 17:59:17,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2018-10-14 17:59:17,237 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 12 states. [2018-10-14 17:59:17,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:59:17,416 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-10-14 17:59:17,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-14 17:59:17,421 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 105 [2018-10-14 17:59:17,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:59:17,422 INFO L225 Difference]: With dead ends: 111 [2018-10-14 17:59:17,422 INFO L226 Difference]: Without dead ends: 111 [2018-10-14 17:59:17,423 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-10-14 17:59:17,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-10-14 17:59:17,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 109. [2018-10-14 17:59:17,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-10-14 17:59:17,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-10-14 17:59:17,435 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 105 [2018-10-14 17:59:17,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:59:17,435 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-10-14 17:59:17,435 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-14 17:59:17,435 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-10-14 17:59:17,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-14 17:59:17,441 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:59:17,441 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:59:17,441 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:59:17,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:59:17,442 INFO L82 PathProgramCache]: Analyzing trace with hash -506536503, now seen corresponding path program 9 times [2018-10-14 17:59:17,443 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:59:17,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:59:17,892 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:59:17,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:59:17,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-14 17:59:17,893 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-14 17:59:17,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-14 17:59:17,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2018-10-14 17:59:17,894 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 13 states. [2018-10-14 17:59:18,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:59:18,102 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-10-14 17:59:18,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-14 17:59:18,109 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 108 [2018-10-14 17:59:18,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:59:18,110 INFO L225 Difference]: With dead ends: 114 [2018-10-14 17:59:18,110 INFO L226 Difference]: Without dead ends: 114 [2018-10-14 17:59:18,111 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-10-14 17:59:18,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-10-14 17:59:18,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 112. [2018-10-14 17:59:18,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-10-14 17:59:18,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-10-14 17:59:18,117 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 108 [2018-10-14 17:59:18,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:59:18,117 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-10-14 17:59:18,117 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-14 17:59:18,117 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-10-14 17:59:18,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-10-14 17:59:18,121 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:59:18,121 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:59:18,121 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:59:18,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:59:18,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1976836623, now seen corresponding path program 10 times [2018-10-14 17:59:18,123 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:59:18,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:59:18,596 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:59:18,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:59:18,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-14 17:59:18,597 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-14 17:59:18,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-14 17:59:18,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2018-10-14 17:59:18,597 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 14 states. [2018-10-14 17:59:18,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:59:18,815 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-10-14 17:59:18,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-14 17:59:18,822 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 111 [2018-10-14 17:59:18,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:59:18,823 INFO L225 Difference]: With dead ends: 117 [2018-10-14 17:59:18,823 INFO L226 Difference]: Without dead ends: 117 [2018-10-14 17:59:18,824 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=221, Invalid=331, Unknown=0, NotChecked=0, Total=552 [2018-10-14 17:59:18,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-10-14 17:59:18,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-10-14 17:59:18,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-10-14 17:59:18,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-10-14 17:59:18,827 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 111 [2018-10-14 17:59:18,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:59:18,828 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-10-14 17:59:18,828 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-14 17:59:18,828 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-10-14 17:59:18,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-10-14 17:59:18,829 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:59:18,830 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:59:18,831 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:59:18,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:59:18,831 INFO L82 PathProgramCache]: Analyzing trace with hash 683740361, now seen corresponding path program 11 times [2018-10-14 17:59:18,834 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:59:18,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:59:19,137 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:59:19,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:59:19,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-14 17:59:19,138 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-14 17:59:19,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-14 17:59:19,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=116, Unknown=0, NotChecked=0, Total=210 [2018-10-14 17:59:19,138 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 15 states. [2018-10-14 17:59:19,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:59:19,382 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2018-10-14 17:59:19,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-14 17:59:19,383 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 114 [2018-10-14 17:59:19,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:59:19,384 INFO L225 Difference]: With dead ends: 120 [2018-10-14 17:59:19,384 INFO L226 Difference]: Without dead ends: 120 [2018-10-14 17:59:19,385 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=259, Invalid=391, Unknown=0, NotChecked=0, Total=650 [2018-10-14 17:59:19,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-10-14 17:59:19,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2018-10-14 17:59:19,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-10-14 17:59:19,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2018-10-14 17:59:19,389 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 114 [2018-10-14 17:59:19,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:59:19,393 INFO L481 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2018-10-14 17:59:19,394 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-14 17:59:19,395 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2018-10-14 17:59:19,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-10-14 17:59:19,396 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:59:19,396 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:59:19,396 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:59:19,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:59:19,397 INFO L82 PathProgramCache]: Analyzing trace with hash -1688776975, now seen corresponding path program 12 times [2018-10-14 17:59:19,398 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:59:19,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:59:19,815 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:59:19,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:59:19,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-14 17:59:19,816 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-14 17:59:19,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-14 17:59:19,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=132, Unknown=0, NotChecked=0, Total=240 [2018-10-14 17:59:19,817 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 16 states. [2018-10-14 17:59:20,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:59:20,115 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-10-14 17:59:20,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-14 17:59:20,116 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 117 [2018-10-14 17:59:20,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:59:20,117 INFO L225 Difference]: With dead ends: 123 [2018-10-14 17:59:20,117 INFO L226 Difference]: Without dead ends: 123 [2018-10-14 17:59:20,117 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=300, Invalid=456, Unknown=0, NotChecked=0, Total=756 [2018-10-14 17:59:20,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-10-14 17:59:20,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2018-10-14 17:59:20,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-10-14 17:59:20,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-10-14 17:59:20,122 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 117 [2018-10-14 17:59:20,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:59:20,123 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-10-14 17:59:20,124 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-14 17:59:20,124 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-10-14 17:59:20,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-14 17:59:20,125 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:59:20,125 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:59:20,125 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:59:20,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:59:20,126 INFO L82 PathProgramCache]: Analyzing trace with hash 924056521, now seen corresponding path program 13 times [2018-10-14 17:59:20,126 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:59:20,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:59:20,360 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:59:20,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:59:20,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-14 17:59:20,361 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-14 17:59:20,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-14 17:59:20,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=149, Unknown=0, NotChecked=0, Total=272 [2018-10-14 17:59:20,361 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 17 states. [2018-10-14 17:59:20,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:59:20,679 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2018-10-14 17:59:20,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-14 17:59:20,680 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 120 [2018-10-14 17:59:20,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:59:20,681 INFO L225 Difference]: With dead ends: 126 [2018-10-14 17:59:20,681 INFO L226 Difference]: Without dead ends: 126 [2018-10-14 17:59:20,681 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=344, Invalid=526, Unknown=0, NotChecked=0, Total=870 [2018-10-14 17:59:20,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-10-14 17:59:20,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 124. [2018-10-14 17:59:20,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-10-14 17:59:20,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2018-10-14 17:59:20,685 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 120 [2018-10-14 17:59:20,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:59:20,685 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2018-10-14 17:59:20,685 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-14 17:59:20,685 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2018-10-14 17:59:20,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-10-14 17:59:20,686 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:59:20,686 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:59:20,687 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:59:20,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:59:20,687 INFO L82 PathProgramCache]: Analyzing trace with hash -2140536847, now seen corresponding path program 14 times [2018-10-14 17:59:20,688 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:59:20,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:59:21,015 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:59:21,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:59:21,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-14 17:59:21,016 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-14 17:59:21,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-14 17:59:21,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=167, Unknown=0, NotChecked=0, Total=306 [2018-10-14 17:59:21,017 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 18 states. [2018-10-14 17:59:21,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:59:21,406 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-10-14 17:59:21,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-14 17:59:21,410 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 123 [2018-10-14 17:59:21,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:59:21,411 INFO L225 Difference]: With dead ends: 129 [2018-10-14 17:59:21,411 INFO L226 Difference]: Without dead ends: 129 [2018-10-14 17:59:21,412 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=391, Invalid=601, Unknown=0, NotChecked=0, Total=992 [2018-10-14 17:59:21,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-10-14 17:59:21,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127. [2018-10-14 17:59:21,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-10-14 17:59:21,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2018-10-14 17:59:21,415 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 123 [2018-10-14 17:59:21,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:59:21,415 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2018-10-14 17:59:21,415 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-14 17:59:21,415 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2018-10-14 17:59:21,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-10-14 17:59:21,416 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:59:21,416 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:59:21,416 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:59:21,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:59:21,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1321751863, now seen corresponding path program 15 times [2018-10-14 17:59:21,418 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:59:21,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:59:21,833 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:59:21,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:59:21,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-14 17:59:21,834 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-14 17:59:21,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-14 17:59:21,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=186, Unknown=0, NotChecked=0, Total=342 [2018-10-14 17:59:21,835 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 19 states. [2018-10-14 17:59:22,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:59:22,185 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2018-10-14 17:59:22,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-14 17:59:22,186 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 126 [2018-10-14 17:59:22,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:59:22,186 INFO L225 Difference]: With dead ends: 132 [2018-10-14 17:59:22,186 INFO L226 Difference]: Without dead ends: 132 [2018-10-14 17:59:22,187 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=441, Invalid=681, Unknown=0, NotChecked=0, Total=1122 [2018-10-14 17:59:22,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-10-14 17:59:22,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2018-10-14 17:59:22,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-10-14 17:59:22,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2018-10-14 17:59:22,191 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 126 [2018-10-14 17:59:22,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:59:22,191 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2018-10-14 17:59:22,191 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-14 17:59:22,191 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2018-10-14 17:59:22,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-10-14 17:59:22,192 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:59:22,192 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:59:22,192 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:59:22,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:59:22,193 INFO L82 PathProgramCache]: Analyzing trace with hash -17567503, now seen corresponding path program 16 times [2018-10-14 17:59:22,193 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:59:22,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:59:23,344 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:59:23,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:59:23,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-14 17:59:23,345 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-14 17:59:23,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-14 17:59:23,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=206, Unknown=0, NotChecked=0, Total=380 [2018-10-14 17:59:23,346 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 20 states. [2018-10-14 17:59:23,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:59:23,717 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-10-14 17:59:23,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-14 17:59:23,718 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 129 [2018-10-14 17:59:23,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:59:23,719 INFO L225 Difference]: With dead ends: 135 [2018-10-14 17:59:23,719 INFO L226 Difference]: Without dead ends: 135 [2018-10-14 17:59:23,720 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=494, Invalid=766, Unknown=0, NotChecked=0, Total=1260 [2018-10-14 17:59:23,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-10-14 17:59:23,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2018-10-14 17:59:23,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-10-14 17:59:23,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-10-14 17:59:23,723 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 129 [2018-10-14 17:59:23,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:59:23,723 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-10-14 17:59:23,724 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-14 17:59:23,724 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-10-14 17:59:23,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-14 17:59:23,724 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:59:23,725 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:59:23,725 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:59:23,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:59:23,725 INFO L82 PathProgramCache]: Analyzing trace with hash 664541641, now seen corresponding path program 17 times [2018-10-14 17:59:23,726 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:59:23,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:59:24,028 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 0 proven. 425 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:59:24,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:59:24,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-14 17:59:24,028 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-14 17:59:24,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-14 17:59:24,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=227, Unknown=0, NotChecked=0, Total=420 [2018-10-14 17:59:24,029 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 21 states. [2018-10-14 17:59:24,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:59:24,392 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2018-10-14 17:59:24,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-14 17:59:24,400 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 132 [2018-10-14 17:59:24,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:59:24,401 INFO L225 Difference]: With dead ends: 138 [2018-10-14 17:59:24,401 INFO L226 Difference]: Without dead ends: 138 [2018-10-14 17:59:24,402 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=550, Invalid=856, Unknown=0, NotChecked=0, Total=1406 [2018-10-14 17:59:24,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-10-14 17:59:24,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2018-10-14 17:59:24,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-10-14 17:59:24,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2018-10-14 17:59:24,405 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 132 [2018-10-14 17:59:24,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:59:24,405 INFO L481 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2018-10-14 17:59:24,405 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-14 17:59:24,405 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2018-10-14 17:59:24,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-14 17:59:24,406 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:59:24,406 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:59:24,406 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:59:24,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:59:24,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1887773169, now seen corresponding path program 18 times [2018-10-14 17:59:24,407 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:59:24,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:59:25,344 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 0 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:59:25,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:59:25,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-14 17:59:25,345 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-14 17:59:25,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-14 17:59:25,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=249, Unknown=0, NotChecked=0, Total=462 [2018-10-14 17:59:25,346 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 22 states. [2018-10-14 17:59:25,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:59:25,808 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-10-14 17:59:25,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-14 17:59:25,808 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 135 [2018-10-14 17:59:25,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:59:25,809 INFO L225 Difference]: With dead ends: 141 [2018-10-14 17:59:25,809 INFO L226 Difference]: Without dead ends: 141 [2018-10-14 17:59:25,810 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=609, Invalid=951, Unknown=0, NotChecked=0, Total=1560 [2018-10-14 17:59:25,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-10-14 17:59:25,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2018-10-14 17:59:25,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-10-14 17:59:25,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2018-10-14 17:59:25,813 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 135 [2018-10-14 17:59:25,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:59:25,813 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2018-10-14 17:59:25,813 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-14 17:59:25,814 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2018-10-14 17:59:25,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-10-14 17:59:25,814 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:59:25,814 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:59:25,815 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:59:25,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:59:25,815 INFO L82 PathProgramCache]: Analyzing trace with hash 380717257, now seen corresponding path program 19 times [2018-10-14 17:59:25,816 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:59:25,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:59:26,495 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:59:26,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:59:26,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-14 17:59:26,496 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-14 17:59:26,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-14 17:59:26,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=272, Unknown=0, NotChecked=0, Total=506 [2018-10-14 17:59:26,497 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 23 states. [2018-10-14 17:59:26,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:59:26,904 INFO L93 Difference]: Finished difference Result 144 states and 144 transitions. [2018-10-14 17:59:26,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-14 17:59:26,904 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 138 [2018-10-14 17:59:26,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:59:26,906 INFO L225 Difference]: With dead ends: 144 [2018-10-14 17:59:26,906 INFO L226 Difference]: Without dead ends: 144 [2018-10-14 17:59:26,907 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=671, Invalid=1051, Unknown=0, NotChecked=0, Total=1722 [2018-10-14 17:59:26,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-10-14 17:59:26,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2018-10-14 17:59:26,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-10-14 17:59:26,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2018-10-14 17:59:26,911 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 138 [2018-10-14 17:59:26,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:59:26,911 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2018-10-14 17:59:26,911 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-14 17:59:26,911 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2018-10-14 17:59:26,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-10-14 17:59:26,912 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:59:26,912 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:59:26,912 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:59:26,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:59:26,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1028812047, now seen corresponding path program 20 times [2018-10-14 17:59:26,913 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:59:26,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:59:27,626 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:59:27,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:59:27,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-14 17:59:27,627 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-14 17:59:27,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-14 17:59:27,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=296, Unknown=0, NotChecked=0, Total=552 [2018-10-14 17:59:27,628 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand 24 states. [2018-10-14 17:59:28,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:59:28,195 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-10-14 17:59:28,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-14 17:59:28,195 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 141 [2018-10-14 17:59:28,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:59:28,196 INFO L225 Difference]: With dead ends: 147 [2018-10-14 17:59:28,196 INFO L226 Difference]: Without dead ends: 147 [2018-10-14 17:59:28,197 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=736, Invalid=1156, Unknown=0, NotChecked=0, Total=1892 [2018-10-14 17:59:28,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-10-14 17:59:28,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2018-10-14 17:59:28,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-10-14 17:59:28,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-10-14 17:59:28,200 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 141 [2018-10-14 17:59:28,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:59:28,201 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-10-14 17:59:28,201 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-14 17:59:28,201 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-10-14 17:59:28,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-14 17:59:28,202 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:59:28,202 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:59:28,202 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:59:28,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:59:28,202 INFO L82 PathProgramCache]: Analyzing trace with hash -421054519, now seen corresponding path program 21 times [2018-10-14 17:59:28,203 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:59:28,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:59:28,687 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:59:28,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:59:28,687 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-14 17:59:28,688 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-14 17:59:28,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-14 17:59:28,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=321, Unknown=0, NotChecked=0, Total=600 [2018-10-14 17:59:28,688 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 25 states. [2018-10-14 17:59:29,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:59:29,191 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2018-10-14 17:59:29,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-14 17:59:29,195 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 144 [2018-10-14 17:59:29,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:59:29,195 INFO L225 Difference]: With dead ends: 150 [2018-10-14 17:59:29,196 INFO L226 Difference]: Without dead ends: 150 [2018-10-14 17:59:29,196 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=804, Invalid=1266, Unknown=0, NotChecked=0, Total=2070 [2018-10-14 17:59:29,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-10-14 17:59:29,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 148. [2018-10-14 17:59:29,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-10-14 17:59:29,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2018-10-14 17:59:29,198 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 144 [2018-10-14 17:59:29,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:59:29,199 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2018-10-14 17:59:29,199 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-14 17:59:29,199 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2018-10-14 17:59:29,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-10-14 17:59:29,199 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:59:29,199 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:59:29,200 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:59:29,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:59:29,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1996309489, now seen corresponding path program 22 times [2018-10-14 17:59:29,200 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:59:29,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:59:29,657 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:59:29,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:59:29,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-14 17:59:29,658 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-14 17:59:29,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-14 17:59:29,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=347, Unknown=0, NotChecked=0, Total=650 [2018-10-14 17:59:29,659 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 26 states. [2018-10-14 17:59:30,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:59:30,231 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-10-14 17:59:30,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-14 17:59:30,231 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 147 [2018-10-14 17:59:30,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:59:30,232 INFO L225 Difference]: With dead ends: 153 [2018-10-14 17:59:30,232 INFO L226 Difference]: Without dead ends: 153 [2018-10-14 17:59:30,233 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=875, Invalid=1381, Unknown=0, NotChecked=0, Total=2256 [2018-10-14 17:59:30,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-10-14 17:59:30,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2018-10-14 17:59:30,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-10-14 17:59:30,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-10-14 17:59:30,235 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 147 [2018-10-14 17:59:30,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:59:30,236 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-10-14 17:59:30,236 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-14 17:59:30,236 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-10-14 17:59:30,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-14 17:59:30,236 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:59:30,237 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:59:30,237 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:59:30,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:59:30,237 INFO L82 PathProgramCache]: Analyzing trace with hash -324147511, now seen corresponding path program 23 times [2018-10-14 17:59:30,238 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:59:30,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:59:30,699 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 0 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:59:30,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:59:30,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-14 17:59:30,700 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-14 17:59:30,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-14 17:59:30,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=374, Unknown=0, NotChecked=0, Total=702 [2018-10-14 17:59:30,701 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 27 states. [2018-10-14 17:59:31,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:59:31,465 INFO L93 Difference]: Finished difference Result 156 states and 156 transitions. [2018-10-14 17:59:31,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-14 17:59:31,465 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 150 [2018-10-14 17:59:31,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:59:31,466 INFO L225 Difference]: With dead ends: 156 [2018-10-14 17:59:31,466 INFO L226 Difference]: Without dead ends: 156 [2018-10-14 17:59:31,467 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=949, Invalid=1501, Unknown=0, NotChecked=0, Total=2450 [2018-10-14 17:59:31,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-10-14 17:59:31,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 154. [2018-10-14 17:59:31,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-10-14 17:59:31,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 154 transitions. [2018-10-14 17:59:31,471 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 154 transitions. Word has length 150 [2018-10-14 17:59:31,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:59:31,471 INFO L481 AbstractCegarLoop]: Abstraction has 154 states and 154 transitions. [2018-10-14 17:59:31,471 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-14 17:59:31,471 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 154 transitions. [2018-10-14 17:59:31,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-10-14 17:59:31,472 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:59:31,472 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:59:31,472 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:59:31,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:59:31,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1560005391, now seen corresponding path program 24 times [2018-10-14 17:59:31,473 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:59:31,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:59:33,685 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 0 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:59:33,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:59:33,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-14 17:59:33,686 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-14 17:59:33,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-14 17:59:33,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=402, Unknown=0, NotChecked=0, Total=756 [2018-10-14 17:59:33,686 INFO L87 Difference]: Start difference. First operand 154 states and 154 transitions. Second operand 28 states. [2018-10-14 17:59:34,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:59:34,316 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-10-14 17:59:34,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-14 17:59:34,317 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 153 [2018-10-14 17:59:34,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:59:34,318 INFO L225 Difference]: With dead ends: 159 [2018-10-14 17:59:34,318 INFO L226 Difference]: Without dead ends: 159 [2018-10-14 17:59:34,319 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1026, Invalid=1626, Unknown=0, NotChecked=0, Total=2652 [2018-10-14 17:59:34,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-10-14 17:59:34,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2018-10-14 17:59:34,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-10-14 17:59:34,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-10-14 17:59:34,321 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 153 [2018-10-14 17:59:34,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:59:34,322 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-10-14 17:59:34,322 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-14 17:59:34,322 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-10-14 17:59:34,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-10-14 17:59:34,323 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:59:34,323 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:59:34,323 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:59:34,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:59:34,324 INFO L82 PathProgramCache]: Analyzing trace with hash 1752520137, now seen corresponding path program 25 times [2018-10-14 17:59:34,324 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:59:34,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:59:34,987 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 0 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:59:34,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:59:34,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-14 17:59:34,988 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-14 17:59:34,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-14 17:59:34,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=381, Invalid=431, Unknown=0, NotChecked=0, Total=812 [2018-10-14 17:59:34,989 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 29 states. [2018-10-14 17:59:35,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:59:35,684 INFO L93 Difference]: Finished difference Result 162 states and 162 transitions. [2018-10-14 17:59:35,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-14 17:59:35,687 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 156 [2018-10-14 17:59:35,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:59:35,688 INFO L225 Difference]: With dead ends: 162 [2018-10-14 17:59:35,688 INFO L226 Difference]: Without dead ends: 162 [2018-10-14 17:59:35,689 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1106, Invalid=1756, Unknown=0, NotChecked=0, Total=2862 [2018-10-14 17:59:35,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-10-14 17:59:35,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2018-10-14 17:59:35,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-10-14 17:59:35,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 160 transitions. [2018-10-14 17:59:35,693 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 160 transitions. Word has length 156 [2018-10-14 17:59:35,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:59:35,693 INFO L481 AbstractCegarLoop]: Abstraction has 160 states and 160 transitions. [2018-10-14 17:59:35,693 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-14 17:59:35,693 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 160 transitions. [2018-10-14 17:59:35,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-10-14 17:59:35,694 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:59:35,694 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:59:35,694 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:59:35,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:59:35,695 INFO L82 PathProgramCache]: Analyzing trace with hash -263035407, now seen corresponding path program 26 times [2018-10-14 17:59:35,695 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:59:35,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:59:36,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 0 proven. 1001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:59:36,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:59:36,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-14 17:59:36,801 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-14 17:59:36,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-14 17:59:36,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=409, Invalid=461, Unknown=0, NotChecked=0, Total=870 [2018-10-14 17:59:36,802 INFO L87 Difference]: Start difference. First operand 160 states and 160 transitions. Second operand 30 states. [2018-10-14 17:59:37,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:59:37,422 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2018-10-14 17:59:37,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-14 17:59:37,425 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 159 [2018-10-14 17:59:37,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:59:37,426 INFO L225 Difference]: With dead ends: 165 [2018-10-14 17:59:37,426 INFO L226 Difference]: Without dead ends: 165 [2018-10-14 17:59:37,427 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1189, Invalid=1891, Unknown=0, NotChecked=0, Total=3080 [2018-10-14 17:59:37,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-10-14 17:59:37,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 163. [2018-10-14 17:59:37,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-10-14 17:59:37,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2018-10-14 17:59:37,430 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 159 [2018-10-14 17:59:37,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:59:37,430 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2018-10-14 17:59:37,431 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-14 17:59:37,431 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2018-10-14 17:59:37,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-10-14 17:59:37,431 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:59:37,432 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:59:37,432 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:59:37,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:59:37,432 INFO L82 PathProgramCache]: Analyzing trace with hash -2035448631, now seen corresponding path program 27 times [2018-10-14 17:59:37,433 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:59:37,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:59:38,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 0 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:59:38,025 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:59:38,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-14 17:59:38,026 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-14 17:59:38,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-14 17:59:38,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=438, Invalid=492, Unknown=0, NotChecked=0, Total=930 [2018-10-14 17:59:38,027 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 31 states. [2018-10-14 17:59:39,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:59:39,262 INFO L93 Difference]: Finished difference Result 168 states and 168 transitions. [2018-10-14 17:59:39,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-14 17:59:39,262 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 162 [2018-10-14 17:59:39,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:59:39,263 INFO L225 Difference]: With dead ends: 168 [2018-10-14 17:59:39,263 INFO L226 Difference]: Without dead ends: 168 [2018-10-14 17:59:39,264 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1275, Invalid=2031, Unknown=0, NotChecked=0, Total=3306 [2018-10-14 17:59:39,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-10-14 17:59:39,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 166. [2018-10-14 17:59:39,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-10-14 17:59:39,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2018-10-14 17:59:39,270 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 162 [2018-10-14 17:59:39,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:59:39,271 INFO L481 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2018-10-14 17:59:39,271 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-14 17:59:39,271 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2018-10-14 17:59:39,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-10-14 17:59:39,272 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:59:39,272 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:59:39,272 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:59:39,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:59:39,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1669867791, now seen corresponding path program 28 times [2018-10-14 17:59:39,273 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:59:39,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:59:39,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 0 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:59:39,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:59:39,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-14 17:59:39,838 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-14 17:59:39,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-14 17:59:39,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=468, Invalid=524, Unknown=0, NotChecked=0, Total=992 [2018-10-14 17:59:39,839 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 32 states. [2018-10-14 17:59:40,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:59:40,593 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-10-14 17:59:40,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-14 17:59:40,594 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 165 [2018-10-14 17:59:40,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:59:40,595 INFO L225 Difference]: With dead ends: 171 [2018-10-14 17:59:40,595 INFO L226 Difference]: Without dead ends: 171 [2018-10-14 17:59:40,596 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1364, Invalid=2176, Unknown=0, NotChecked=0, Total=3540 [2018-10-14 17:59:40,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-10-14 17:59:40,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2018-10-14 17:59:40,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-10-14 17:59:40,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2018-10-14 17:59:40,600 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 165 [2018-10-14 17:59:40,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:59:40,600 INFO L481 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2018-10-14 17:59:40,600 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-14 17:59:40,600 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2018-10-14 17:59:40,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-10-14 17:59:40,601 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:59:40,601 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:59:40,602 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:59:40,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:59:40,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1606841289, now seen corresponding path program 29 times [2018-10-14 17:59:40,603 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:59:40,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:59:41,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 0 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:59:41,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:59:41,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-14 17:59:41,246 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-14 17:59:41,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-14 17:59:41,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=499, Invalid=557, Unknown=0, NotChecked=0, Total=1056 [2018-10-14 17:59:41,247 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 33 states. [2018-10-14 17:59:42,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:59:42,273 INFO L93 Difference]: Finished difference Result 174 states and 174 transitions. [2018-10-14 17:59:42,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-14 17:59:42,274 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 168 [2018-10-14 17:59:42,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:59:42,275 INFO L225 Difference]: With dead ends: 174 [2018-10-14 17:59:42,275 INFO L226 Difference]: Without dead ends: 174 [2018-10-14 17:59:42,276 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1456, Invalid=2326, Unknown=0, NotChecked=0, Total=3782 [2018-10-14 17:59:42,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-10-14 17:59:42,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 172. [2018-10-14 17:59:42,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-10-14 17:59:42,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2018-10-14 17:59:42,279 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 168 [2018-10-14 17:59:42,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:59:42,280 INFO L481 AbstractCegarLoop]: Abstraction has 172 states and 172 transitions. [2018-10-14 17:59:42,280 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-14 17:59:42,280 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 172 transitions. [2018-10-14 17:59:42,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-10-14 17:59:42,281 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:59:42,281 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:59:42,281 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:59:42,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:59:42,282 INFO L82 PathProgramCache]: Analyzing trace with hash 2030340081, now seen corresponding path program 30 times [2018-10-14 17:59:42,282 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:59:42,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:59:43,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 0 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:59:43,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:59:43,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-14 17:59:43,630 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-14 17:59:43,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-14 17:59:43,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=531, Invalid=591, Unknown=0, NotChecked=0, Total=1122 [2018-10-14 17:59:43,631 INFO L87 Difference]: Start difference. First operand 172 states and 172 transitions. Second operand 34 states. [2018-10-14 17:59:44,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:59:44,573 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2018-10-14 17:59:44,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-14 17:59:44,573 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 171 [2018-10-14 17:59:44,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:59:44,574 INFO L225 Difference]: With dead ends: 177 [2018-10-14 17:59:44,574 INFO L226 Difference]: Without dead ends: 177 [2018-10-14 17:59:44,576 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1551, Invalid=2481, Unknown=0, NotChecked=0, Total=4032 [2018-10-14 17:59:44,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-10-14 17:59:44,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2018-10-14 17:59:44,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-10-14 17:59:44,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2018-10-14 17:59:44,581 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 171 [2018-10-14 17:59:44,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:59:44,581 INFO L481 AbstractCegarLoop]: Abstraction has 175 states and 175 transitions. [2018-10-14 17:59:44,581 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-14 17:59:44,581 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 175 transitions. [2018-10-14 17:59:44,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-10-14 17:59:44,582 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:59:44,582 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:59:44,582 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:59:44,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:59:44,583 INFO L82 PathProgramCache]: Analyzing trace with hash -131063095, now seen corresponding path program 31 times [2018-10-14 17:59:44,583 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:59:44,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:59:45,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:59:45,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:59:45,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-14 17:59:45,369 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-14 17:59:45,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-14 17:59:45,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=564, Invalid=626, Unknown=0, NotChecked=0, Total=1190 [2018-10-14 17:59:45,370 INFO L87 Difference]: Start difference. First operand 175 states and 175 transitions. Second operand 35 states. [2018-10-14 17:59:46,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:59:46,316 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2018-10-14 17:59:46,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-14 17:59:46,317 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 174 [2018-10-14 17:59:46,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:59:46,317 INFO L225 Difference]: With dead ends: 180 [2018-10-14 17:59:46,318 INFO L226 Difference]: Without dead ends: 180 [2018-10-14 17:59:46,319 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1649, Invalid=2641, Unknown=0, NotChecked=0, Total=4290 [2018-10-14 17:59:46,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-10-14 17:59:46,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 178. [2018-10-14 17:59:46,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-10-14 17:59:46,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 178 transitions. [2018-10-14 17:59:46,322 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 178 transitions. Word has length 174 [2018-10-14 17:59:46,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:59:46,322 INFO L481 AbstractCegarLoop]: Abstraction has 178 states and 178 transitions. [2018-10-14 17:59:46,322 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-14 17:59:46,322 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 178 transitions. [2018-10-14 17:59:46,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-10-14 17:59:46,323 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:59:46,323 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:59:46,323 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:59:46,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:59:46,323 INFO L82 PathProgramCache]: Analyzing trace with hash -343377679, now seen corresponding path program 32 times [2018-10-14 17:59:46,324 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:59:46,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:59:47,160 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 17:59:47,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:59:47,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-14 17:59:47,161 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-14 17:59:47,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-14 17:59:47,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=598, Invalid=662, Unknown=0, NotChecked=0, Total=1260 [2018-10-14 17:59:47,162 INFO L87 Difference]: Start difference. First operand 178 states and 178 transitions. Second operand 36 states. [2018-10-14 17:59:48,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:59:48,180 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-10-14 17:59:48,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-14 17:59:48,187 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 177 [2018-10-14 17:59:48,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:59:48,188 INFO L225 Difference]: With dead ends: 183 [2018-10-14 17:59:48,188 INFO L226 Difference]: Without dead ends: 183 [2018-10-14 17:59:48,189 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1750, Invalid=2806, Unknown=0, NotChecked=0, Total=4556 [2018-10-14 17:59:48,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-10-14 17:59:48,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 181. [2018-10-14 17:59:48,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-10-14 17:59:48,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-10-14 17:59:48,192 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 177 [2018-10-14 17:59:48,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:59:48,192 INFO L481 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-10-14 17:59:48,192 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-14 17:59:48,193 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-10-14 17:59:48,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-14 17:59:48,193 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:59:48,194 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:59:48,194 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:59:48,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:59:48,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1079677385, now seen corresponding path program 33 times [2018-10-14 17:59:48,195 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:59:48,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:59:48,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 0 proven. 1617 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:59:48,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:59:48,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-14 17:59:48,992 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-14 17:59:48,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-14 17:59:48,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=633, Invalid=699, Unknown=0, NotChecked=0, Total=1332 [2018-10-14 17:59:48,993 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 37 states. [2018-10-14 17:59:50,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:59:50,028 INFO L93 Difference]: Finished difference Result 186 states and 186 transitions. [2018-10-14 17:59:50,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-14 17:59:50,028 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 180 [2018-10-14 17:59:50,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:59:50,029 INFO L225 Difference]: With dead ends: 186 [2018-10-14 17:59:50,029 INFO L226 Difference]: Without dead ends: 186 [2018-10-14 17:59:50,030 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1854, Invalid=2976, Unknown=0, NotChecked=0, Total=4830 [2018-10-14 17:59:50,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-10-14 17:59:50,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2018-10-14 17:59:50,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-10-14 17:59:50,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 184 transitions. [2018-10-14 17:59:50,032 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 184 transitions. Word has length 180 [2018-10-14 17:59:50,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:59:50,032 INFO L481 AbstractCegarLoop]: Abstraction has 184 states and 184 transitions. [2018-10-14 17:59:50,032 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-14 17:59:50,032 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 184 transitions. [2018-10-14 17:59:50,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-10-14 17:59:50,033 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:59:50,033 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:59:50,033 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:59:50,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:59:50,033 INFO L82 PathProgramCache]: Analyzing trace with hash -309089807, now seen corresponding path program 34 times [2018-10-14 17:59:50,034 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:59:50,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:59:50,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 0 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:59:50,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:59:50,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-14 17:59:50,806 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-14 17:59:50,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-14 17:59:50,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=669, Invalid=737, Unknown=0, NotChecked=0, Total=1406 [2018-10-14 17:59:50,807 INFO L87 Difference]: Start difference. First operand 184 states and 184 transitions. Second operand 38 states. [2018-10-14 17:59:51,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:59:51,912 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2018-10-14 17:59:51,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-14 17:59:51,918 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 183 [2018-10-14 17:59:51,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:59:51,919 INFO L225 Difference]: With dead ends: 189 [2018-10-14 17:59:51,919 INFO L226 Difference]: Without dead ends: 189 [2018-10-14 17:59:51,920 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1961, Invalid=3151, Unknown=0, NotChecked=0, Total=5112 [2018-10-14 17:59:51,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-10-14 17:59:51,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 187. [2018-10-14 17:59:51,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-10-14 17:59:51,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2018-10-14 17:59:51,923 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 183 [2018-10-14 17:59:51,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:59:51,924 INFO L481 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2018-10-14 17:59:51,924 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-14 17:59:51,924 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2018-10-14 17:59:51,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-10-14 17:59:51,925 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:59:51,925 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:59:51,925 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:59:51,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:59:51,926 INFO L82 PathProgramCache]: Analyzing trace with hash 347455689, now seen corresponding path program 35 times [2018-10-14 17:59:51,926 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:59:51,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:59:52,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 0 proven. 1820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:59:52,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:59:52,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-14 17:59:52,630 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-14 17:59:52,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-14 17:59:52,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=706, Invalid=776, Unknown=0, NotChecked=0, Total=1482 [2018-10-14 17:59:52,631 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 39 states. [2018-10-14 17:59:53,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:59:53,912 INFO L93 Difference]: Finished difference Result 192 states and 192 transitions. [2018-10-14 17:59:53,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-14 17:59:53,912 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 186 [2018-10-14 17:59:53,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:59:53,914 INFO L225 Difference]: With dead ends: 192 [2018-10-14 17:59:53,914 INFO L226 Difference]: Without dead ends: 192 [2018-10-14 17:59:53,915 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2071, Invalid=3331, Unknown=0, NotChecked=0, Total=5402 [2018-10-14 17:59:53,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-10-14 17:59:53,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 190. [2018-10-14 17:59:53,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-10-14 17:59:53,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 190 transitions. [2018-10-14 17:59:53,918 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 190 transitions. Word has length 186 [2018-10-14 17:59:53,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:59:53,918 INFO L481 AbstractCegarLoop]: Abstraction has 190 states and 190 transitions. [2018-10-14 17:59:53,918 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-14 17:59:53,918 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 190 transitions. [2018-10-14 17:59:53,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-10-14 17:59:53,919 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:59:53,919 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:59:53,920 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:59:53,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:59:53,920 INFO L82 PathProgramCache]: Analyzing trace with hash 213261041, now seen corresponding path program 36 times [2018-10-14 17:59:53,921 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:59:53,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:59:56,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 0 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:59:56,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:59:56,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-14 17:59:56,256 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-14 17:59:56,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-14 17:59:56,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=744, Invalid=816, Unknown=0, NotChecked=0, Total=1560 [2018-10-14 17:59:56,257 INFO L87 Difference]: Start difference. First operand 190 states and 190 transitions. Second operand 40 states. [2018-10-14 17:59:57,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:59:57,487 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-10-14 17:59:57,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-14 17:59:57,487 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 189 [2018-10-14 17:59:57,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:59:57,488 INFO L225 Difference]: With dead ends: 195 [2018-10-14 17:59:57,488 INFO L226 Difference]: Without dead ends: 195 [2018-10-14 17:59:57,489 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2184, Invalid=3516, Unknown=0, NotChecked=0, Total=5700 [2018-10-14 17:59:57,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-10-14 17:59:57,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 193. [2018-10-14 17:59:57,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-10-14 17:59:57,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2018-10-14 17:59:57,492 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 189 [2018-10-14 17:59:57,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:59:57,492 INFO L481 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2018-10-14 17:59:57,493 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-14 17:59:57,493 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2018-10-14 17:59:57,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-10-14 17:59:57,494 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:59:57,494 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:59:57,494 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:59:57,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:59:57,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1035055049, now seen corresponding path program 37 times [2018-10-14 17:59:57,495 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:59:57,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:59:58,360 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 0 proven. 2035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:59:58,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:59:58,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-14 17:59:58,361 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-14 17:59:58,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-14 17:59:58,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=783, Invalid=857, Unknown=0, NotChecked=0, Total=1640 [2018-10-14 17:59:58,361 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 41 states. [2018-10-14 17:59:59,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:59:59,542 INFO L93 Difference]: Finished difference Result 198 states and 198 transitions. [2018-10-14 17:59:59,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-14 17:59:59,543 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 192 [2018-10-14 17:59:59,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:59:59,544 INFO L225 Difference]: With dead ends: 198 [2018-10-14 17:59:59,544 INFO L226 Difference]: Without dead ends: 198 [2018-10-14 17:59:59,544 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2300, Invalid=3706, Unknown=0, NotChecked=0, Total=6006 [2018-10-14 17:59:59,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-10-14 17:59:59,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 196. [2018-10-14 17:59:59,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-10-14 17:59:59,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2018-10-14 17:59:59,547 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 192 [2018-10-14 17:59:59,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:59:59,547 INFO L481 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2018-10-14 17:59:59,548 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-14 17:59:59,548 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2018-10-14 17:59:59,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-10-14 17:59:59,549 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:59:59,549 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:59:59,549 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:59:59,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:59:59,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1786760177, now seen corresponding path program 38 times [2018-10-14 17:59:59,550 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:59:59,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:00:00,816 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 0 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:00:00,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:00:00,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-14 18:00:00,816 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-14 18:00:00,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-14 18:00:00,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=823, Invalid=899, Unknown=0, NotChecked=0, Total=1722 [2018-10-14 18:00:00,817 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 42 states. [2018-10-14 18:00:03,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:00:03,919 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2018-10-14 18:00:03,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-14 18:00:03,920 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 195 [2018-10-14 18:00:03,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:00:03,920 INFO L225 Difference]: With dead ends: 201 [2018-10-14 18:00:03,921 INFO L226 Difference]: Without dead ends: 201 [2018-10-14 18:00:03,922 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2419, Invalid=3901, Unknown=0, NotChecked=0, Total=6320 [2018-10-14 18:00:03,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-10-14 18:00:03,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2018-10-14 18:00:03,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-10-14 18:00:03,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 199 transitions. [2018-10-14 18:00:03,925 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 199 transitions. Word has length 195 [2018-10-14 18:00:03,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:00:03,925 INFO L481 AbstractCegarLoop]: Abstraction has 199 states and 199 transitions. [2018-10-14 18:00:03,925 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-14 18:00:03,925 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 199 transitions. [2018-10-14 18:00:03,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-10-14 18:00:03,926 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:00:03,926 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:03,926 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:00:03,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:00:03,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1874747081, now seen corresponding path program 39 times [2018-10-14 18:00:03,927 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:00:03,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:00:05,449 INFO L134 CoverageAnalysis]: Checked inductivity of 2262 backedges. 0 proven. 2262 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:00:05,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:00:05,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-14 18:00:05,450 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-14 18:00:05,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-14 18:00:05,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=864, Invalid=942, Unknown=0, NotChecked=0, Total=1806 [2018-10-14 18:00:05,451 INFO L87 Difference]: Start difference. First operand 199 states and 199 transitions. Second operand 43 states. [2018-10-14 18:00:06,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:00:06,802 INFO L93 Difference]: Finished difference Result 204 states and 204 transitions. [2018-10-14 18:00:06,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-14 18:00:06,802 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 198 [2018-10-14 18:00:06,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:00:06,803 INFO L225 Difference]: With dead ends: 204 [2018-10-14 18:00:06,803 INFO L226 Difference]: Without dead ends: 204 [2018-10-14 18:00:06,804 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2541, Invalid=4101, Unknown=0, NotChecked=0, Total=6642 [2018-10-14 18:00:06,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-10-14 18:00:06,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 202. [2018-10-14 18:00:06,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-10-14 18:00:06,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 202 transitions. [2018-10-14 18:00:06,806 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 202 transitions. Word has length 198 [2018-10-14 18:00:06,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:00:06,807 INFO L481 AbstractCegarLoop]: Abstraction has 202 states and 202 transitions. [2018-10-14 18:00:06,807 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-14 18:00:06,807 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 202 transitions. [2018-10-14 18:00:06,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-10-14 18:00:06,808 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:00:06,808 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:06,808 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:00:06,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:00:06,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1132413711, now seen corresponding path program 40 times [2018-10-14 18:00:06,809 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:00:06,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:00:07,900 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 2380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:00:07,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:00:07,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-14 18:00:07,901 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-14 18:00:07,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-14 18:00:07,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=906, Invalid=986, Unknown=0, NotChecked=0, Total=1892 [2018-10-14 18:00:07,901 INFO L87 Difference]: Start difference. First operand 202 states and 202 transitions. Second operand 44 states. [2018-10-14 18:00:09,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:00:09,310 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2018-10-14 18:00:09,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-14 18:00:09,319 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 201 [2018-10-14 18:00:09,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:00:09,320 INFO L225 Difference]: With dead ends: 207 [2018-10-14 18:00:09,320 INFO L226 Difference]: Without dead ends: 207 [2018-10-14 18:00:09,321 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2666, Invalid=4306, Unknown=0, NotChecked=0, Total=6972 [2018-10-14 18:00:09,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-10-14 18:00:09,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 205. [2018-10-14 18:00:09,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-10-14 18:00:09,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2018-10-14 18:00:09,324 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 201 [2018-10-14 18:00:09,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:00:09,324 INFO L481 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2018-10-14 18:00:09,324 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-14 18:00:09,324 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2018-10-14 18:00:09,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-10-14 18:00:09,325 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:00:09,326 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:09,326 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:00:09,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:00:09,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1263259081, now seen corresponding path program 41 times [2018-10-14 18:00:09,327 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:00:09,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:00:10,327 INFO L134 CoverageAnalysis]: Checked inductivity of 2501 backedges. 0 proven. 2501 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:00:10,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:00:10,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-14 18:00:10,328 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-14 18:00:10,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-14 18:00:10,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=949, Invalid=1031, Unknown=0, NotChecked=0, Total=1980 [2018-10-14 18:00:10,329 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 45 states. [2018-10-14 18:00:11,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:00:11,819 INFO L93 Difference]: Finished difference Result 210 states and 210 transitions. [2018-10-14 18:00:11,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-14 18:00:11,819 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 204 [2018-10-14 18:00:11,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:00:11,820 INFO L225 Difference]: With dead ends: 210 [2018-10-14 18:00:11,820 INFO L226 Difference]: Without dead ends: 210 [2018-10-14 18:00:11,821 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2794, Invalid=4516, Unknown=0, NotChecked=0, Total=7310 [2018-10-14 18:00:11,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-10-14 18:00:11,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 208. [2018-10-14 18:00:11,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-10-14 18:00:11,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 208 transitions. [2018-10-14 18:00:11,824 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 208 transitions. Word has length 204 [2018-10-14 18:00:11,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:00:11,824 INFO L481 AbstractCegarLoop]: Abstraction has 208 states and 208 transitions. [2018-10-14 18:00:11,825 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-14 18:00:11,825 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 208 transitions. [2018-10-14 18:00:11,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-10-14 18:00:11,826 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:00:11,826 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:11,826 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:00:11,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:00:11,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1279847921, now seen corresponding path program 42 times [2018-10-14 18:00:11,827 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:00:11,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:00:13,476 INFO L134 CoverageAnalysis]: Checked inductivity of 2625 backedges. 0 proven. 2625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:00:13,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:00:13,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-14 18:00:13,477 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-14 18:00:13,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-14 18:00:13,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=993, Invalid=1077, Unknown=0, NotChecked=0, Total=2070 [2018-10-14 18:00:13,479 INFO L87 Difference]: Start difference. First operand 208 states and 208 transitions. Second operand 46 states. [2018-10-14 18:00:14,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:00:14,957 INFO L93 Difference]: Finished difference Result 213 states and 213 transitions. [2018-10-14 18:00:14,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-14 18:00:14,957 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 207 [2018-10-14 18:00:14,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:00:14,958 INFO L225 Difference]: With dead ends: 213 [2018-10-14 18:00:14,958 INFO L226 Difference]: Without dead ends: 213 [2018-10-14 18:00:14,959 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2925, Invalid=4731, Unknown=0, NotChecked=0, Total=7656 [2018-10-14 18:00:14,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-10-14 18:00:14,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211. [2018-10-14 18:00:14,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-10-14 18:00:14,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2018-10-14 18:00:14,961 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 207 [2018-10-14 18:00:14,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:00:14,962 INFO L481 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2018-10-14 18:00:14,962 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-14 18:00:14,962 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2018-10-14 18:00:14,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-10-14 18:00:14,962 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:00:14,963 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:14,963 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:00:14,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:00:14,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1556741321, now seen corresponding path program 43 times [2018-10-14 18:00:14,964 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:00:14,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:00:16,096 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 0 proven. 2752 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:00:16,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:00:16,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-14 18:00:16,097 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-14 18:00:16,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-14 18:00:16,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1038, Invalid=1124, Unknown=0, NotChecked=0, Total=2162 [2018-10-14 18:00:16,097 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 47 states. [2018-10-14 18:00:17,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:00:17,689 INFO L93 Difference]: Finished difference Result 216 states and 216 transitions. [2018-10-14 18:00:17,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-14 18:00:17,690 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 210 [2018-10-14 18:00:17,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:00:17,691 INFO L225 Difference]: With dead ends: 216 [2018-10-14 18:00:17,691 INFO L226 Difference]: Without dead ends: 216 [2018-10-14 18:00:17,692 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3059, Invalid=4951, Unknown=0, NotChecked=0, Total=8010 [2018-10-14 18:00:17,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-10-14 18:00:17,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 214. [2018-10-14 18:00:17,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-10-14 18:00:17,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 214 transitions. [2018-10-14 18:00:17,695 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 214 transitions. Word has length 210 [2018-10-14 18:00:17,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:00:17,695 INFO L481 AbstractCegarLoop]: Abstraction has 214 states and 214 transitions. [2018-10-14 18:00:17,695 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-14 18:00:17,695 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 214 transitions. [2018-10-14 18:00:17,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-10-14 18:00:17,696 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:00:17,696 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:17,697 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:00:17,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:00:17,697 INFO L82 PathProgramCache]: Analyzing trace with hash -144154895, now seen corresponding path program 44 times [2018-10-14 18:00:17,698 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:00:17,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:00:18,823 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 0 proven. 2882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:00:18,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:00:18,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-14 18:00:18,824 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-14 18:00:18,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-14 18:00:18,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1084, Invalid=1172, Unknown=0, NotChecked=0, Total=2256 [2018-10-14 18:00:18,824 INFO L87 Difference]: Start difference. First operand 214 states and 214 transitions. Second operand 48 states. [2018-10-14 18:00:20,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:00:20,300 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2018-10-14 18:00:20,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-14 18:00:20,300 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 213 [2018-10-14 18:00:20,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:00:20,301 INFO L225 Difference]: With dead ends: 219 [2018-10-14 18:00:20,301 INFO L226 Difference]: Without dead ends: 219 [2018-10-14 18:00:20,302 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 990 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3196, Invalid=5176, Unknown=0, NotChecked=0, Total=8372 [2018-10-14 18:00:20,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-10-14 18:00:20,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 217. [2018-10-14 18:00:20,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-10-14 18:00:20,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2018-10-14 18:00:20,305 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 213 [2018-10-14 18:00:20,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:00:20,305 INFO L481 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2018-10-14 18:00:20,305 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-14 18:00:20,305 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2018-10-14 18:00:20,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-10-14 18:00:20,306 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:00:20,307 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:20,307 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:00:20,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:00:20,307 INFO L82 PathProgramCache]: Analyzing trace with hash 480832457, now seen corresponding path program 45 times [2018-10-14 18:00:20,308 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:00:20,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:00:21,487 INFO L134 CoverageAnalysis]: Checked inductivity of 3015 backedges. 0 proven. 3015 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:00:21,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:00:21,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-14 18:00:21,488 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-14 18:00:21,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-14 18:00:21,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1131, Invalid=1221, Unknown=0, NotChecked=0, Total=2352 [2018-10-14 18:00:21,488 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 49 states. [2018-10-14 18:00:23,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:00:23,148 INFO L93 Difference]: Finished difference Result 222 states and 222 transitions. [2018-10-14 18:00:23,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-14 18:00:23,149 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 216 [2018-10-14 18:00:23,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:00:23,150 INFO L225 Difference]: With dead ends: 222 [2018-10-14 18:00:23,150 INFO L226 Difference]: Without dead ends: 222 [2018-10-14 18:00:23,151 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3336, Invalid=5406, Unknown=0, NotChecked=0, Total=8742 [2018-10-14 18:00:23,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-10-14 18:00:23,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 220. [2018-10-14 18:00:23,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-10-14 18:00:23,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 220 transitions. [2018-10-14 18:00:23,153 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 220 transitions. Word has length 216 [2018-10-14 18:00:23,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:00:23,153 INFO L481 AbstractCegarLoop]: Abstraction has 220 states and 220 transitions. [2018-10-14 18:00:23,153 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-14 18:00:23,153 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 220 transitions. [2018-10-14 18:00:23,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-10-14 18:00:23,154 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:00:23,154 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:23,155 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:00:23,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:00:23,155 INFO L82 PathProgramCache]: Analyzing trace with hash 795807729, now seen corresponding path program 46 times [2018-10-14 18:00:23,155 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:00:23,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:00:24,817 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:00:24,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:00:24,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-14 18:00:24,817 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-14 18:00:24,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-14 18:00:24,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1179, Invalid=1271, Unknown=0, NotChecked=0, Total=2450 [2018-10-14 18:00:24,818 INFO L87 Difference]: Start difference. First operand 220 states and 220 transitions. Second operand 50 states. [2018-10-14 18:00:26,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:00:26,431 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2018-10-14 18:00:26,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-14 18:00:26,431 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 219 [2018-10-14 18:00:26,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:00:26,432 INFO L225 Difference]: With dead ends: 225 [2018-10-14 18:00:26,433 INFO L226 Difference]: Without dead ends: 225 [2018-10-14 18:00:26,433 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1081 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3479, Invalid=5641, Unknown=0, NotChecked=0, Total=9120 [2018-10-14 18:00:26,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-10-14 18:00:26,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 223. [2018-10-14 18:00:26,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-10-14 18:00:26,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 223 transitions. [2018-10-14 18:00:26,436 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 223 transitions. Word has length 219 [2018-10-14 18:00:26,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:00:26,436 INFO L481 AbstractCegarLoop]: Abstraction has 223 states and 223 transitions. [2018-10-14 18:00:26,436 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-14 18:00:26,436 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 223 transitions. [2018-10-14 18:00:26,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-10-14 18:00:26,437 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:00:26,437 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:26,437 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:00:26,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:00:26,437 INFO L82 PathProgramCache]: Analyzing trace with hash -279405879, now seen corresponding path program 47 times [2018-10-14 18:00:26,438 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:00:26,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:00:28,221 INFO L134 CoverageAnalysis]: Checked inductivity of 3290 backedges. 0 proven. 3290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:00:28,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:00:28,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-14 18:00:28,222 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-14 18:00:28,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-14 18:00:28,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1228, Invalid=1322, Unknown=0, NotChecked=0, Total=2550 [2018-10-14 18:00:28,222 INFO L87 Difference]: Start difference. First operand 223 states and 223 transitions. Second operand 51 states. [2018-10-14 18:00:30,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:00:30,015 INFO L93 Difference]: Finished difference Result 228 states and 228 transitions. [2018-10-14 18:00:30,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-14 18:00:30,015 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 222 [2018-10-14 18:00:30,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:00:30,016 INFO L225 Difference]: With dead ends: 228 [2018-10-14 18:00:30,016 INFO L226 Difference]: Without dead ends: 228 [2018-10-14 18:00:30,016 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3625, Invalid=5881, Unknown=0, NotChecked=0, Total=9506 [2018-10-14 18:00:30,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-10-14 18:00:30,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 226. [2018-10-14 18:00:30,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-10-14 18:00:30,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 226 transitions. [2018-10-14 18:00:30,020 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 226 transitions. Word has length 222 [2018-10-14 18:00:30,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:00:30,020 INFO L481 AbstractCegarLoop]: Abstraction has 226 states and 226 transitions. [2018-10-14 18:00:30,020 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-14 18:00:30,020 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 226 transitions. [2018-10-14 18:00:30,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-10-14 18:00:30,021 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:00:30,022 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:30,022 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:00:30,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:00:30,022 INFO L82 PathProgramCache]: Analyzing trace with hash -101908239, now seen corresponding path program 48 times [2018-10-14 18:00:30,023 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:00:30,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:00:31,251 INFO L134 CoverageAnalysis]: Checked inductivity of 3432 backedges. 0 proven. 3432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:00:31,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:00:31,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-10-14 18:00:31,251 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-14 18:00:31,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-14 18:00:31,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1278, Invalid=1374, Unknown=0, NotChecked=0, Total=2652 [2018-10-14 18:00:31,253 INFO L87 Difference]: Start difference. First operand 226 states and 226 transitions. Second operand 52 states. [2018-10-14 18:00:33,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:00:33,177 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2018-10-14 18:00:33,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-14 18:00:33,177 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 225 [2018-10-14 18:00:33,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:00:33,178 INFO L225 Difference]: With dead ends: 231 [2018-10-14 18:00:33,178 INFO L226 Difference]: Without dead ends: 231 [2018-10-14 18:00:33,179 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3774, Invalid=6126, Unknown=0, NotChecked=0, Total=9900 [2018-10-14 18:00:33,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-10-14 18:00:33,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 229. [2018-10-14 18:00:33,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-10-14 18:00:33,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2018-10-14 18:00:33,183 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 225 [2018-10-14 18:00:33,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:00:33,183 INFO L481 AbstractCegarLoop]: Abstraction has 229 states and 229 transitions. [2018-10-14 18:00:33,183 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-14 18:00:33,183 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 229 transitions. [2018-10-14 18:00:33,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-10-14 18:00:33,184 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:00:33,185 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:33,185 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:00:33,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:00:33,185 INFO L82 PathProgramCache]: Analyzing trace with hash 625543625, now seen corresponding path program 49 times [2018-10-14 18:00:33,186 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:00:33,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:00:34,524 INFO L134 CoverageAnalysis]: Checked inductivity of 3577 backedges. 0 proven. 3577 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:00:34,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:00:34,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-14 18:00:34,525 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-14 18:00:34,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-14 18:00:34,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1329, Invalid=1427, Unknown=0, NotChecked=0, Total=2756 [2018-10-14 18:00:34,526 INFO L87 Difference]: Start difference. First operand 229 states and 229 transitions. Second operand 53 states. [2018-10-14 18:00:36,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:00:36,430 INFO L93 Difference]: Finished difference Result 234 states and 234 transitions. [2018-10-14 18:00:36,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-14 18:00:36,430 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 228 [2018-10-14 18:00:36,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:00:36,431 INFO L225 Difference]: With dead ends: 234 [2018-10-14 18:00:36,431 INFO L226 Difference]: Without dead ends: 234 [2018-10-14 18:00:36,432 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3926, Invalid=6376, Unknown=0, NotChecked=0, Total=10302 [2018-10-14 18:00:36,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-10-14 18:00:36,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 232. [2018-10-14 18:00:36,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-10-14 18:00:36,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 232 transitions. [2018-10-14 18:00:36,434 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 232 transitions. Word has length 228 [2018-10-14 18:00:36,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:00:36,435 INFO L481 AbstractCegarLoop]: Abstraction has 232 states and 232 transitions. [2018-10-14 18:00:36,435 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-14 18:00:36,435 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 232 transitions. [2018-10-14 18:00:36,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-10-14 18:00:36,435 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:00:36,436 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:36,436 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:00:36,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:00:36,436 INFO L82 PathProgramCache]: Analyzing trace with hash -260951567, now seen corresponding path program 50 times [2018-10-14 18:00:36,437 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:00:36,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:00:38,068 INFO L134 CoverageAnalysis]: Checked inductivity of 3725 backedges. 0 proven. 3725 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:00:38,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:00:38,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-10-14 18:00:38,069 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-14 18:00:38,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-14 18:00:38,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1381, Invalid=1481, Unknown=0, NotChecked=0, Total=2862 [2018-10-14 18:00:38,070 INFO L87 Difference]: Start difference. First operand 232 states and 232 transitions. Second operand 54 states. [2018-10-14 18:00:40,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:00:40,055 INFO L93 Difference]: Finished difference Result 237 states and 237 transitions. [2018-10-14 18:00:40,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-14 18:00:40,055 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 231 [2018-10-14 18:00:40,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:00:40,056 INFO L225 Difference]: With dead ends: 237 [2018-10-14 18:00:40,056 INFO L226 Difference]: Without dead ends: 237 [2018-10-14 18:00:40,057 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1275 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4081, Invalid=6631, Unknown=0, NotChecked=0, Total=10712 [2018-10-14 18:00:40,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-10-14 18:00:40,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 235. [2018-10-14 18:00:40,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-10-14 18:00:40,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 235 transitions. [2018-10-14 18:00:40,059 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 235 transitions. Word has length 231 [2018-10-14 18:00:40,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:00:40,060 INFO L481 AbstractCegarLoop]: Abstraction has 235 states and 235 transitions. [2018-10-14 18:00:40,060 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-14 18:00:40,060 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 235 transitions. [2018-10-14 18:00:40,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-10-14 18:00:40,061 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:00:40,061 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:40,061 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:00:40,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:00:40,062 INFO L82 PathProgramCache]: Analyzing trace with hash -85313335, now seen corresponding path program 51 times [2018-10-14 18:00:40,062 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:00:40,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:00:41,474 INFO L134 CoverageAnalysis]: Checked inductivity of 3876 backedges. 0 proven. 3876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:00:41,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:00:41,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-14 18:00:41,475 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-14 18:00:41,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-14 18:00:41,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1434, Invalid=1536, Unknown=0, NotChecked=0, Total=2970 [2018-10-14 18:00:41,476 INFO L87 Difference]: Start difference. First operand 235 states and 235 transitions. Second operand 55 states. [2018-10-14 18:00:43,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:00:43,644 INFO L93 Difference]: Finished difference Result 240 states and 240 transitions. [2018-10-14 18:00:43,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-14 18:00:43,644 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 234 [2018-10-14 18:00:43,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:00:43,645 INFO L225 Difference]: With dead ends: 240 [2018-10-14 18:00:43,645 INFO L226 Difference]: Without dead ends: 240 [2018-10-14 18:00:43,646 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1326 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4239, Invalid=6891, Unknown=0, NotChecked=0, Total=11130 [2018-10-14 18:00:43,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-10-14 18:00:43,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 238. [2018-10-14 18:00:43,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-10-14 18:00:43,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 238 transitions. [2018-10-14 18:00:43,649 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 238 transitions. Word has length 234 [2018-10-14 18:00:43,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:00:43,649 INFO L481 AbstractCegarLoop]: Abstraction has 238 states and 238 transitions. [2018-10-14 18:00:43,650 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-14 18:00:43,650 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 238 transitions. [2018-10-14 18:00:43,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-10-14 18:00:43,650 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:00:43,651 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:43,651 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:00:43,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:00:43,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1083089649, now seen corresponding path program 52 times [2018-10-14 18:00:43,652 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:00:43,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:00:45,278 INFO L134 CoverageAnalysis]: Checked inductivity of 4030 backedges. 0 proven. 4030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:00:45,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:00:45,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-10-14 18:00:45,279 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-14 18:00:45,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-14 18:00:45,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1488, Invalid=1592, Unknown=0, NotChecked=0, Total=3080 [2018-10-14 18:00:45,280 INFO L87 Difference]: Start difference. First operand 238 states and 238 transitions. Second operand 56 states. [2018-10-14 18:00:47,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:00:47,388 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2018-10-14 18:00:47,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-14 18:00:47,388 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 237 [2018-10-14 18:00:47,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:00:47,389 INFO L225 Difference]: With dead ends: 243 [2018-10-14 18:00:47,389 INFO L226 Difference]: Without dead ends: 243 [2018-10-14 18:00:47,390 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1378 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4400, Invalid=7156, Unknown=0, NotChecked=0, Total=11556 [2018-10-14 18:00:47,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-10-14 18:00:47,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 241. [2018-10-14 18:00:47,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-10-14 18:00:47,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2018-10-14 18:00:47,393 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 237 [2018-10-14 18:00:47,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:00:47,394 INFO L481 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2018-10-14 18:00:47,394 INFO L482 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-14 18:00:47,394 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2018-10-14 18:00:47,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-10-14 18:00:47,395 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:00:47,395 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:47,396 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:00:47,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:00:47,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1733548087, now seen corresponding path program 53 times [2018-10-14 18:00:47,396 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:00:47,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:00:49,118 INFO L134 CoverageAnalysis]: Checked inductivity of 4187 backedges. 0 proven. 4187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:00:49,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:00:49,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-14 18:00:49,119 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-14 18:00:49,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-14 18:00:49,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1543, Invalid=1649, Unknown=0, NotChecked=0, Total=3192 [2018-10-14 18:00:49,120 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 57 states. [2018-10-14 18:00:51,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:00:51,315 INFO L93 Difference]: Finished difference Result 246 states and 246 transitions. [2018-10-14 18:00:51,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-14 18:00:51,316 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 240 [2018-10-14 18:00:51,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:00:51,317 INFO L225 Difference]: With dead ends: 246 [2018-10-14 18:00:51,317 INFO L226 Difference]: Without dead ends: 246 [2018-10-14 18:00:51,318 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1431 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4564, Invalid=7426, Unknown=0, NotChecked=0, Total=11990 [2018-10-14 18:00:51,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-10-14 18:00:51,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 244. [2018-10-14 18:00:51,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-10-14 18:00:51,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 244 transitions. [2018-10-14 18:00:51,320 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 244 transitions. Word has length 240 [2018-10-14 18:00:51,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:00:51,321 INFO L481 AbstractCegarLoop]: Abstraction has 244 states and 244 transitions. [2018-10-14 18:00:51,321 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-14 18:00:51,321 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 244 transitions. [2018-10-14 18:00:51,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-10-14 18:00:51,322 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:00:51,323 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:51,323 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:00:51,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:00:51,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1412279311, now seen corresponding path program 54 times [2018-10-14 18:00:51,324 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:00:51,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:00:52,990 INFO L134 CoverageAnalysis]: Checked inductivity of 4347 backedges. 0 proven. 4347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:00:52,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:00:52,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-10-14 18:00:52,991 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-14 18:00:52,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-14 18:00:52,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1599, Invalid=1707, Unknown=0, NotChecked=0, Total=3306 [2018-10-14 18:00:52,992 INFO L87 Difference]: Start difference. First operand 244 states and 244 transitions. Second operand 58 states. [2018-10-14 18:00:55,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:00:55,182 INFO L93 Difference]: Finished difference Result 249 states and 249 transitions. [2018-10-14 18:00:55,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-14 18:00:55,182 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 243 [2018-10-14 18:00:55,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:00:55,184 INFO L225 Difference]: With dead ends: 249 [2018-10-14 18:00:55,184 INFO L226 Difference]: Without dead ends: 249 [2018-10-14 18:00:55,185 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1485 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4731, Invalid=7701, Unknown=0, NotChecked=0, Total=12432 [2018-10-14 18:00:55,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-10-14 18:00:55,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 247. [2018-10-14 18:00:55,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-10-14 18:00:55,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 247 transitions. [2018-10-14 18:00:55,188 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 247 transitions. Word has length 243 [2018-10-14 18:00:55,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:00:55,188 INFO L481 AbstractCegarLoop]: Abstraction has 247 states and 247 transitions. [2018-10-14 18:00:55,188 INFO L482 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-14 18:00:55,188 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 247 transitions. [2018-10-14 18:00:55,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-10-14 18:00:55,190 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:00:55,190 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:55,190 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:00:55,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:00:55,190 INFO L82 PathProgramCache]: Analyzing trace with hash 318691017, now seen corresponding path program 55 times [2018-10-14 18:00:55,191 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:00:55,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:00:56,784 INFO L134 CoverageAnalysis]: Checked inductivity of 4510 backedges. 0 proven. 4510 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:00:56,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:00:56,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-14 18:00:56,785 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-14 18:00:56,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-14 18:00:56,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1656, Invalid=1766, Unknown=0, NotChecked=0, Total=3422 [2018-10-14 18:00:56,786 INFO L87 Difference]: Start difference. First operand 247 states and 247 transitions. Second operand 59 states. [2018-10-14 18:00:59,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:00:59,135 INFO L93 Difference]: Finished difference Result 252 states and 252 transitions. [2018-10-14 18:00:59,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-14 18:00:59,135 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 246 [2018-10-14 18:00:59,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:00:59,136 INFO L225 Difference]: With dead ends: 252 [2018-10-14 18:00:59,136 INFO L226 Difference]: Without dead ends: 252 [2018-10-14 18:00:59,137 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1540 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4901, Invalid=7981, Unknown=0, NotChecked=0, Total=12882 [2018-10-14 18:00:59,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-10-14 18:00:59,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 250. [2018-10-14 18:00:59,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-10-14 18:00:59,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 250 transitions. [2018-10-14 18:00:59,140 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 250 transitions. Word has length 246 [2018-10-14 18:00:59,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:00:59,140 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 250 transitions. [2018-10-14 18:00:59,140 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-14 18:00:59,140 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 250 transitions. [2018-10-14 18:00:59,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-10-14 18:00:59,141 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:00:59,142 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:00:59,142 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:00:59,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:00:59,142 INFO L82 PathProgramCache]: Analyzing trace with hash -2016590607, now seen corresponding path program 56 times [2018-10-14 18:00:59,143 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:00:59,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:01:00,761 INFO L134 CoverageAnalysis]: Checked inductivity of 4676 backedges. 0 proven. 4676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:01:00,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:01:00,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-10-14 18:01:00,762 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-14 18:01:00,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-14 18:01:00,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1714, Invalid=1826, Unknown=0, NotChecked=0, Total=3540 [2018-10-14 18:01:00,763 INFO L87 Difference]: Start difference. First operand 250 states and 250 transitions. Second operand 60 states. [2018-10-14 18:01:03,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:01:03,197 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2018-10-14 18:01:03,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-14 18:01:03,197 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 249 [2018-10-14 18:01:03,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:01:03,198 INFO L225 Difference]: With dead ends: 255 [2018-10-14 18:01:03,198 INFO L226 Difference]: Without dead ends: 255 [2018-10-14 18:01:03,199 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1596 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5074, Invalid=8266, Unknown=0, NotChecked=0, Total=13340 [2018-10-14 18:01:03,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-10-14 18:01:03,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 253. [2018-10-14 18:01:03,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-10-14 18:01:03,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2018-10-14 18:01:03,202 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 249 [2018-10-14 18:01:03,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:01:03,203 INFO L481 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2018-10-14 18:01:03,203 INFO L482 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-14 18:01:03,203 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2018-10-14 18:01:03,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-10-14 18:01:03,204 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:01:03,204 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:03,205 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:01:03,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:01:03,205 INFO L82 PathProgramCache]: Analyzing trace with hash 1783776713, now seen corresponding path program 57 times [2018-10-14 18:01:03,206 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:01:03,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:01:04,974 INFO L134 CoverageAnalysis]: Checked inductivity of 4845 backedges. 0 proven. 4845 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:01:04,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:01:04,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-14 18:01:04,975 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-14 18:01:04,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-14 18:01:04,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1773, Invalid=1887, Unknown=0, NotChecked=0, Total=3660 [2018-10-14 18:01:04,976 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 61 states. [2018-10-14 18:01:07,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:01:07,593 INFO L93 Difference]: Finished difference Result 258 states and 258 transitions. [2018-10-14 18:01:07,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-14 18:01:07,593 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 252 [2018-10-14 18:01:07,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:01:07,594 INFO L225 Difference]: With dead ends: 258 [2018-10-14 18:01:07,594 INFO L226 Difference]: Without dead ends: 258 [2018-10-14 18:01:07,595 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1653 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5250, Invalid=8556, Unknown=0, NotChecked=0, Total=13806 [2018-10-14 18:01:07,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-10-14 18:01:07,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2018-10-14 18:01:07,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-10-14 18:01:07,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 256 transitions. [2018-10-14 18:01:07,598 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 256 transitions. Word has length 252 [2018-10-14 18:01:07,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:01:07,598 INFO L481 AbstractCegarLoop]: Abstraction has 256 states and 256 transitions. [2018-10-14 18:01:07,598 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-14 18:01:07,598 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 256 transitions. [2018-10-14 18:01:07,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-10-14 18:01:07,599 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:01:07,600 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:07,600 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:01:07,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:01:07,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1106283023, now seen corresponding path program 58 times [2018-10-14 18:01:07,601 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:01:07,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:01:09,832 INFO L134 CoverageAnalysis]: Checked inductivity of 5017 backedges. 0 proven. 5017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:01:09,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:01:09,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-10-14 18:01:09,833 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-14 18:01:09,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-14 18:01:09,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1833, Invalid=1949, Unknown=0, NotChecked=0, Total=3782 [2018-10-14 18:01:09,834 INFO L87 Difference]: Start difference. First operand 256 states and 256 transitions. Second operand 62 states. [2018-10-14 18:01:12,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:01:12,373 INFO L93 Difference]: Finished difference Result 261 states and 261 transitions. [2018-10-14 18:01:12,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-14 18:01:12,373 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 255 [2018-10-14 18:01:12,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:01:12,374 INFO L225 Difference]: With dead ends: 261 [2018-10-14 18:01:12,374 INFO L226 Difference]: Without dead ends: 261 [2018-10-14 18:01:12,375 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1711 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5429, Invalid=8851, Unknown=0, NotChecked=0, Total=14280 [2018-10-14 18:01:12,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-10-14 18:01:12,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 259. [2018-10-14 18:01:12,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-10-14 18:01:12,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 259 transitions. [2018-10-14 18:01:12,377 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 259 transitions. Word has length 255 [2018-10-14 18:01:12,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:01:12,377 INFO L481 AbstractCegarLoop]: Abstraction has 259 states and 259 transitions. [2018-10-14 18:01:12,378 INFO L482 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-14 18:01:12,378 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 259 transitions. [2018-10-14 18:01:12,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-10-14 18:01:12,378 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:01:12,379 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:12,379 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:01:12,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:01:12,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1961462583, now seen corresponding path program 59 times [2018-10-14 18:01:12,379 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:01:12,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:01:14,287 INFO L134 CoverageAnalysis]: Checked inductivity of 5192 backedges. 0 proven. 5192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:01:14,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:01:14,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-14 18:01:14,288 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-14 18:01:14,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-14 18:01:14,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1894, Invalid=2012, Unknown=0, NotChecked=0, Total=3906 [2018-10-14 18:01:14,289 INFO L87 Difference]: Start difference. First operand 259 states and 259 transitions. Second operand 63 states. [2018-10-14 18:01:16,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:01:16,962 INFO L93 Difference]: Finished difference Result 264 states and 264 transitions. [2018-10-14 18:01:16,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-14 18:01:16,962 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 258 [2018-10-14 18:01:16,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:01:16,963 INFO L225 Difference]: With dead ends: 264 [2018-10-14 18:01:16,963 INFO L226 Difference]: Without dead ends: 264 [2018-10-14 18:01:16,965 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1770 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5611, Invalid=9151, Unknown=0, NotChecked=0, Total=14762 [2018-10-14 18:01:16,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-10-14 18:01:16,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2018-10-14 18:01:16,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-10-14 18:01:16,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 262 transitions. [2018-10-14 18:01:16,967 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 262 transitions. Word has length 258 [2018-10-14 18:01:16,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:01:16,967 INFO L481 AbstractCegarLoop]: Abstraction has 262 states and 262 transitions. [2018-10-14 18:01:16,967 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-14 18:01:16,967 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 262 transitions. [2018-10-14 18:01:16,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-10-14 18:01:16,968 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:01:16,968 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:16,968 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:01:16,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:01:16,968 INFO L82 PathProgramCache]: Analyzing trace with hash -869734671, now seen corresponding path program 60 times [2018-10-14 18:01:16,969 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:01:16,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:01:19,019 INFO L134 CoverageAnalysis]: Checked inductivity of 5370 backedges. 0 proven. 5370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:01:19,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:01:19,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-10-14 18:01:19,020 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-14 18:01:19,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-14 18:01:19,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1956, Invalid=2076, Unknown=0, NotChecked=0, Total=4032 [2018-10-14 18:01:19,021 INFO L87 Difference]: Start difference. First operand 262 states and 262 transitions. Second operand 64 states. [2018-10-14 18:01:21,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:01:21,588 INFO L93 Difference]: Finished difference Result 267 states and 267 transitions. [2018-10-14 18:01:21,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-14 18:01:21,588 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 261 [2018-10-14 18:01:21,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:01:21,589 INFO L225 Difference]: With dead ends: 267 [2018-10-14 18:01:21,589 INFO L226 Difference]: Without dead ends: 267 [2018-10-14 18:01:21,590 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1830 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5796, Invalid=9456, Unknown=0, NotChecked=0, Total=15252 [2018-10-14 18:01:21,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-10-14 18:01:21,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 265. [2018-10-14 18:01:21,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-10-14 18:01:21,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 265 transitions. [2018-10-14 18:01:21,593 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 265 transitions. Word has length 261 [2018-10-14 18:01:21,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:01:21,593 INFO L481 AbstractCegarLoop]: Abstraction has 265 states and 265 transitions. [2018-10-14 18:01:21,593 INFO L482 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-14 18:01:21,594 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 265 transitions. [2018-10-14 18:01:21,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-10-14 18:01:21,595 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:01:21,595 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:21,595 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:01:21,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:01:21,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1304126409, now seen corresponding path program 61 times [2018-10-14 18:01:21,596 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:01:21,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:01:23,537 INFO L134 CoverageAnalysis]: Checked inductivity of 5551 backedges. 0 proven. 5551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:01:23,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:01:23,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-14 18:01:23,538 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-14 18:01:23,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-14 18:01:23,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2019, Invalid=2141, Unknown=0, NotChecked=0, Total=4160 [2018-10-14 18:01:23,539 INFO L87 Difference]: Start difference. First operand 265 states and 265 transitions. Second operand 65 states. [2018-10-14 18:01:26,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:01:26,446 INFO L93 Difference]: Finished difference Result 270 states and 270 transitions. [2018-10-14 18:01:26,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-14 18:01:26,446 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 264 [2018-10-14 18:01:26,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:01:26,447 INFO L225 Difference]: With dead ends: 270 [2018-10-14 18:01:26,447 INFO L226 Difference]: Without dead ends: 270 [2018-10-14 18:01:26,448 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1891 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5984, Invalid=9766, Unknown=0, NotChecked=0, Total=15750 [2018-10-14 18:01:26,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-10-14 18:01:26,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 268. [2018-10-14 18:01:26,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-10-14 18:01:26,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 268 transitions. [2018-10-14 18:01:26,451 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 268 transitions. Word has length 264 [2018-10-14 18:01:26,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:01:26,451 INFO L481 AbstractCegarLoop]: Abstraction has 268 states and 268 transitions. [2018-10-14 18:01:26,452 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-14 18:01:26,452 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 268 transitions. [2018-10-14 18:01:26,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-10-14 18:01:26,453 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:01:26,453 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:26,453 INFO L424 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:01:26,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:01:26,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1012295695, now seen corresponding path program 62 times [2018-10-14 18:01:26,454 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:01:26,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:01:28,398 INFO L134 CoverageAnalysis]: Checked inductivity of 5735 backedges. 0 proven. 5735 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:01:28,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:01:28,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-10-14 18:01:28,399 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-14 18:01:28,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-14 18:01:28,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2083, Invalid=2207, Unknown=0, NotChecked=0, Total=4290 [2018-10-14 18:01:28,400 INFO L87 Difference]: Start difference. First operand 268 states and 268 transitions. Second operand 66 states. [2018-10-14 18:01:31,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:01:31,288 INFO L93 Difference]: Finished difference Result 273 states and 273 transitions. [2018-10-14 18:01:31,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-14 18:01:31,289 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 267 [2018-10-14 18:01:31,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:01:31,290 INFO L225 Difference]: With dead ends: 273 [2018-10-14 18:01:31,290 INFO L226 Difference]: Without dead ends: 273 [2018-10-14 18:01:31,291 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1953 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6175, Invalid=10081, Unknown=0, NotChecked=0, Total=16256 [2018-10-14 18:01:31,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-10-14 18:01:31,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 271. [2018-10-14 18:01:31,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-10-14 18:01:31,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 271 transitions. [2018-10-14 18:01:31,293 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 271 transitions. Word has length 267 [2018-10-14 18:01:31,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:01:31,293 INFO L481 AbstractCegarLoop]: Abstraction has 271 states and 271 transitions. [2018-10-14 18:01:31,294 INFO L482 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-14 18:01:31,294 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 271 transitions. [2018-10-14 18:01:31,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-10-14 18:01:31,294 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:01:31,295 INFO L375 BasicCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:31,295 INFO L424 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:01:31,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:01:31,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1991316169, now seen corresponding path program 63 times [2018-10-14 18:01:31,296 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:01:31,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:01:33,332 INFO L134 CoverageAnalysis]: Checked inductivity of 5922 backedges. 0 proven. 5922 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:01:33,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:01:33,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-14 18:01:33,333 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-14 18:01:33,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-14 18:01:33,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2148, Invalid=2274, Unknown=0, NotChecked=0, Total=4422 [2018-10-14 18:01:33,334 INFO L87 Difference]: Start difference. First operand 271 states and 271 transitions. Second operand 67 states. [2018-10-14 18:01:36,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:01:36,260 INFO L93 Difference]: Finished difference Result 276 states and 276 transitions. [2018-10-14 18:01:36,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-14 18:01:36,260 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 270 [2018-10-14 18:01:36,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:01:36,261 INFO L225 Difference]: With dead ends: 276 [2018-10-14 18:01:36,261 INFO L226 Difference]: Without dead ends: 276 [2018-10-14 18:01:36,263 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6369, Invalid=10401, Unknown=0, NotChecked=0, Total=16770 [2018-10-14 18:01:36,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-10-14 18:01:36,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 274. [2018-10-14 18:01:36,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-10-14 18:01:36,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 274 transitions. [2018-10-14 18:01:36,265 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 274 transitions. Word has length 270 [2018-10-14 18:01:36,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:01:36,265 INFO L481 AbstractCegarLoop]: Abstraction has 274 states and 274 transitions. [2018-10-14 18:01:36,265 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-14 18:01:36,265 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 274 transitions. [2018-10-14 18:01:36,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2018-10-14 18:01:36,266 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:01:36,267 INFO L375 BasicCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:36,267 INFO L424 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:01:36,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:01:36,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1243711729, now seen corresponding path program 64 times [2018-10-14 18:01:36,267 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:01:36,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:01:38,366 INFO L134 CoverageAnalysis]: Checked inductivity of 6112 backedges. 0 proven. 6112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:01:38,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:01:38,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-10-14 18:01:38,367 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-14 18:01:38,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-14 18:01:38,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2214, Invalid=2342, Unknown=0, NotChecked=0, Total=4556 [2018-10-14 18:01:38,368 INFO L87 Difference]: Start difference. First operand 274 states and 274 transitions. Second operand 68 states. [2018-10-14 18:01:41,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:01:41,547 INFO L93 Difference]: Finished difference Result 279 states and 279 transitions. [2018-10-14 18:01:41,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-14 18:01:41,548 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 273 [2018-10-14 18:01:41,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:01:41,549 INFO L225 Difference]: With dead ends: 279 [2018-10-14 18:01:41,549 INFO L226 Difference]: Without dead ends: 279 [2018-10-14 18:01:41,550 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2080 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6566, Invalid=10726, Unknown=0, NotChecked=0, Total=17292 [2018-10-14 18:01:41,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-10-14 18:01:41,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 277. [2018-10-14 18:01:41,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-10-14 18:01:41,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2018-10-14 18:01:41,552 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 273 [2018-10-14 18:01:41,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:01:41,553 INFO L481 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2018-10-14 18:01:41,553 INFO L482 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-14 18:01:41,553 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2018-10-14 18:01:41,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-10-14 18:01:41,554 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:01:41,554 INFO L375 BasicCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:41,554 INFO L424 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:01:41,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:01:41,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1234730551, now seen corresponding path program 65 times [2018-10-14 18:01:41,555 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:01:41,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:01:43,748 INFO L134 CoverageAnalysis]: Checked inductivity of 6305 backedges. 0 proven. 6305 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:01:43,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:01:43,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-14 18:01:43,749 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-14 18:01:43,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-14 18:01:43,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2281, Invalid=2411, Unknown=0, NotChecked=0, Total=4692 [2018-10-14 18:01:43,750 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 69 states. [2018-10-14 18:01:46,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:01:46,956 INFO L93 Difference]: Finished difference Result 282 states and 282 transitions. [2018-10-14 18:01:46,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-14 18:01:46,963 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 276 [2018-10-14 18:01:46,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:01:46,964 INFO L225 Difference]: With dead ends: 282 [2018-10-14 18:01:46,964 INFO L226 Difference]: Without dead ends: 282 [2018-10-14 18:01:46,966 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2145 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6766, Invalid=11056, Unknown=0, NotChecked=0, Total=17822 [2018-10-14 18:01:46,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-10-14 18:01:46,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 280. [2018-10-14 18:01:46,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-10-14 18:01:46,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 280 transitions. [2018-10-14 18:01:46,969 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 280 transitions. Word has length 276 [2018-10-14 18:01:46,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:01:46,969 INFO L481 AbstractCegarLoop]: Abstraction has 280 states and 280 transitions. [2018-10-14 18:01:46,970 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-14 18:01:46,970 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 280 transitions. [2018-10-14 18:01:46,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-10-14 18:01:46,971 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:01:46,971 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:46,971 INFO L424 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:01:46,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:01:46,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1725908495, now seen corresponding path program 66 times [2018-10-14 18:01:46,972 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:01:46,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:01:49,110 INFO L134 CoverageAnalysis]: Checked inductivity of 6501 backedges. 0 proven. 6501 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:01:49,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:01:49,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-10-14 18:01:49,111 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-10-14 18:01:49,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-10-14 18:01:49,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2349, Invalid=2481, Unknown=0, NotChecked=0, Total=4830 [2018-10-14 18:01:49,112 INFO L87 Difference]: Start difference. First operand 280 states and 280 transitions. Second operand 70 states. [2018-10-14 18:01:52,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:01:52,418 INFO L93 Difference]: Finished difference Result 285 states and 285 transitions. [2018-10-14 18:01:52,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-14 18:01:52,418 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 279 [2018-10-14 18:01:52,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:01:52,419 INFO L225 Difference]: With dead ends: 285 [2018-10-14 18:01:52,419 INFO L226 Difference]: Without dead ends: 285 [2018-10-14 18:01:52,421 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2211 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6969, Invalid=11391, Unknown=0, NotChecked=0, Total=18360 [2018-10-14 18:01:52,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-10-14 18:01:52,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 283. [2018-10-14 18:01:52,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-10-14 18:01:52,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 283 transitions. [2018-10-14 18:01:52,423 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 283 transitions. Word has length 279 [2018-10-14 18:01:52,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:01:52,423 INFO L481 AbstractCegarLoop]: Abstraction has 283 states and 283 transitions. [2018-10-14 18:01:52,423 INFO L482 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-10-14 18:01:52,423 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 283 transitions. [2018-10-14 18:01:52,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-10-14 18:01:52,424 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:01:52,424 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:52,425 INFO L424 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:01:52,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:01:52,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1454460727, now seen corresponding path program 67 times [2018-10-14 18:01:52,425 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:01:52,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:01:54,682 INFO L134 CoverageAnalysis]: Checked inductivity of 6700 backedges. 0 proven. 6700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:01:54,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:01:54,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-14 18:01:54,683 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-14 18:01:54,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-14 18:01:54,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2418, Invalid=2552, Unknown=0, NotChecked=0, Total=4970 [2018-10-14 18:01:54,684 INFO L87 Difference]: Start difference. First operand 283 states and 283 transitions. Second operand 71 states. [2018-10-14 18:01:58,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:01:58,054 INFO L93 Difference]: Finished difference Result 288 states and 288 transitions. [2018-10-14 18:01:58,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-14 18:01:58,054 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 282 [2018-10-14 18:01:58,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:01:58,055 INFO L225 Difference]: With dead ends: 288 [2018-10-14 18:01:58,055 INFO L226 Difference]: Without dead ends: 288 [2018-10-14 18:01:58,056 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2278 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=7175, Invalid=11731, Unknown=0, NotChecked=0, Total=18906 [2018-10-14 18:01:58,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-10-14 18:01:58,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 286. [2018-10-14 18:01:58,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-10-14 18:01:58,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 286 transitions. [2018-10-14 18:01:58,059 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 286 transitions. Word has length 282 [2018-10-14 18:01:58,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:01:58,059 INFO L481 AbstractCegarLoop]: Abstraction has 286 states and 286 transitions. [2018-10-14 18:01:58,059 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-14 18:01:58,060 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 286 transitions. [2018-10-14 18:01:58,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-10-14 18:01:58,061 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:01:58,061 INFO L375 BasicCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:58,061 INFO L424 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:01:58,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:01:58,062 INFO L82 PathProgramCache]: Analyzing trace with hash 2117544689, now seen corresponding path program 68 times [2018-10-14 18:01:58,062 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:01:58,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:02:00,428 INFO L134 CoverageAnalysis]: Checked inductivity of 6902 backedges. 0 proven. 6902 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:02:00,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:02:00,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-10-14 18:02:00,429 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-14 18:02:00,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-14 18:02:00,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2488, Invalid=2624, Unknown=0, NotChecked=0, Total=5112 [2018-10-14 18:02:00,430 INFO L87 Difference]: Start difference. First operand 286 states and 286 transitions. Second operand 72 states. [2018-10-14 18:02:03,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:02:03,847 INFO L93 Difference]: Finished difference Result 291 states and 291 transitions. [2018-10-14 18:02:03,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-14 18:02:03,848 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 285 [2018-10-14 18:02:03,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:02:03,849 INFO L225 Difference]: With dead ends: 291 [2018-10-14 18:02:03,849 INFO L226 Difference]: Without dead ends: 291 [2018-10-14 18:02:03,850 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2346 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7384, Invalid=12076, Unknown=0, NotChecked=0, Total=19460 [2018-10-14 18:02:03,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-10-14 18:02:03,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 289. [2018-10-14 18:02:03,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-10-14 18:02:03,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 289 transitions. [2018-10-14 18:02:03,853 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 289 transitions. Word has length 285 [2018-10-14 18:02:03,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:02:03,853 INFO L481 AbstractCegarLoop]: Abstraction has 289 states and 289 transitions. [2018-10-14 18:02:03,853 INFO L482 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-14 18:02:03,853 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 289 transitions. [2018-10-14 18:02:03,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-10-14 18:02:03,854 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:02:03,854 INFO L375 BasicCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:03,854 INFO L424 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:02:03,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:02:03,855 INFO L82 PathProgramCache]: Analyzing trace with hash -673800247, now seen corresponding path program 69 times [2018-10-14 18:02:03,855 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:02:03,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:02:06,298 INFO L134 CoverageAnalysis]: Checked inductivity of 7107 backedges. 0 proven. 7107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:02:06,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:02:06,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-14 18:02:06,299 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-14 18:02:06,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-14 18:02:06,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2559, Invalid=2697, Unknown=0, NotChecked=0, Total=5256 [2018-10-14 18:02:06,300 INFO L87 Difference]: Start difference. First operand 289 states and 289 transitions. Second operand 73 states. [2018-10-14 18:02:09,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:02:09,592 INFO L93 Difference]: Finished difference Result 294 states and 294 transitions. [2018-10-14 18:02:09,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-14 18:02:09,592 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 288 [2018-10-14 18:02:09,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:02:09,593 INFO L225 Difference]: With dead ends: 294 [2018-10-14 18:02:09,594 INFO L226 Difference]: Without dead ends: 294 [2018-10-14 18:02:09,595 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2415 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7596, Invalid=12426, Unknown=0, NotChecked=0, Total=20022 [2018-10-14 18:02:09,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-10-14 18:02:09,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 292. [2018-10-14 18:02:09,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-10-14 18:02:09,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 292 transitions. [2018-10-14 18:02:09,597 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 292 transitions. Word has length 288 [2018-10-14 18:02:09,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:02:09,597 INFO L481 AbstractCegarLoop]: Abstraction has 292 states and 292 transitions. [2018-10-14 18:02:09,597 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-14 18:02:09,597 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 292 transitions. [2018-10-14 18:02:09,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2018-10-14 18:02:09,598 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:02:09,598 INFO L375 BasicCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:09,599 INFO L424 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:02:09,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:02:09,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1525996529, now seen corresponding path program 70 times [2018-10-14 18:02:09,599 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:02:09,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:02:12,071 INFO L134 CoverageAnalysis]: Checked inductivity of 7315 backedges. 0 proven. 7315 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:02:12,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:02:12,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-10-14 18:02:12,072 INFO L460 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-10-14 18:02:12,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-10-14 18:02:12,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2631, Invalid=2771, Unknown=0, NotChecked=0, Total=5402 [2018-10-14 18:02:12,073 INFO L87 Difference]: Start difference. First operand 292 states and 292 transitions. Second operand 74 states. [2018-10-14 18:02:15,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:02:15,612 INFO L93 Difference]: Finished difference Result 297 states and 297 transitions. [2018-10-14 18:02:15,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-14 18:02:15,612 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 291 [2018-10-14 18:02:15,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:02:15,613 INFO L225 Difference]: With dead ends: 297 [2018-10-14 18:02:15,614 INFO L226 Difference]: Without dead ends: 297 [2018-10-14 18:02:15,615 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2485 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=7811, Invalid=12781, Unknown=0, NotChecked=0, Total=20592 [2018-10-14 18:02:15,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-10-14 18:02:15,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 295. [2018-10-14 18:02:15,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-10-14 18:02:15,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 295 transitions. [2018-10-14 18:02:15,618 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 295 transitions. Word has length 291 [2018-10-14 18:02:15,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:02:15,618 INFO L481 AbstractCegarLoop]: Abstraction has 295 states and 295 transitions. [2018-10-14 18:02:15,618 INFO L482 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-10-14 18:02:15,619 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 295 transitions. [2018-10-14 18:02:15,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-10-14 18:02:15,619 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:02:15,620 INFO L375 BasicCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:15,620 INFO L424 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:02:15,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:02:15,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1234219319, now seen corresponding path program 71 times [2018-10-14 18:02:15,621 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:02:15,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:02:18,110 INFO L134 CoverageAnalysis]: Checked inductivity of 7526 backedges. 0 proven. 7526 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:02:18,111 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:02:18,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-14 18:02:18,111 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-14 18:02:18,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-14 18:02:18,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2704, Invalid=2846, Unknown=0, NotChecked=0, Total=5550 [2018-10-14 18:02:18,112 INFO L87 Difference]: Start difference. First operand 295 states and 295 transitions. Second operand 75 states. [2018-10-14 18:02:21,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:02:21,871 INFO L93 Difference]: Finished difference Result 300 states and 300 transitions. [2018-10-14 18:02:21,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-14 18:02:21,871 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 294 [2018-10-14 18:02:21,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:02:21,873 INFO L225 Difference]: With dead ends: 300 [2018-10-14 18:02:21,873 INFO L226 Difference]: Without dead ends: 300 [2018-10-14 18:02:21,874 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2556 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8029, Invalid=13141, Unknown=0, NotChecked=0, Total=21170 [2018-10-14 18:02:21,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-10-14 18:02:21,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 298. [2018-10-14 18:02:21,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-10-14 18:02:21,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 298 transitions. [2018-10-14 18:02:21,876 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 298 transitions. Word has length 294 [2018-10-14 18:02:21,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:02:21,877 INFO L481 AbstractCegarLoop]: Abstraction has 298 states and 298 transitions. [2018-10-14 18:02:21,877 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-14 18:02:21,877 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 298 transitions. [2018-10-14 18:02:21,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-10-14 18:02:21,878 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:02:21,878 INFO L375 BasicCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:21,878 INFO L424 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:02:21,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:02:21,878 INFO L82 PathProgramCache]: Analyzing trace with hash 619302129, now seen corresponding path program 72 times [2018-10-14 18:02:21,879 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:02:21,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:02:24,394 INFO L134 CoverageAnalysis]: Checked inductivity of 7740 backedges. 0 proven. 7740 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:02:24,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:02:24,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-10-14 18:02:24,395 INFO L460 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-10-14 18:02:24,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-10-14 18:02:24,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2778, Invalid=2922, Unknown=0, NotChecked=0, Total=5700 [2018-10-14 18:02:24,396 INFO L87 Difference]: Start difference. First operand 298 states and 298 transitions. Second operand 76 states. [2018-10-14 18:02:28,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:02:28,061 INFO L93 Difference]: Finished difference Result 303 states and 303 transitions. [2018-10-14 18:02:28,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-14 18:02:28,062 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 297 [2018-10-14 18:02:28,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:02:28,063 INFO L225 Difference]: With dead ends: 303 [2018-10-14 18:02:28,064 INFO L226 Difference]: Without dead ends: 303 [2018-10-14 18:02:28,065 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2628 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=8250, Invalid=13506, Unknown=0, NotChecked=0, Total=21756 [2018-10-14 18:02:28,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-10-14 18:02:28,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 301. [2018-10-14 18:02:28,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-10-14 18:02:28,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2018-10-14 18:02:28,068 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 297 [2018-10-14 18:02:28,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:02:28,068 INFO L481 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2018-10-14 18:02:28,068 INFO L482 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-10-14 18:02:28,068 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2018-10-14 18:02:28,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-10-14 18:02:28,069 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:02:28,069 INFO L375 BasicCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:28,069 INFO L424 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:02:28,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:02:28,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1517765175, now seen corresponding path program 73 times [2018-10-14 18:02:28,070 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:02:28,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:02:30,728 INFO L134 CoverageAnalysis]: Checked inductivity of 7957 backedges. 0 proven. 7957 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:02:30,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:02:30,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-10-14 18:02:30,728 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-14 18:02:30,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-14 18:02:30,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2853, Invalid=2999, Unknown=0, NotChecked=0, Total=5852 [2018-10-14 18:02:30,729 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 77 states. [2018-10-14 18:02:34,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:02:34,512 INFO L93 Difference]: Finished difference Result 306 states and 306 transitions. [2018-10-14 18:02:34,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-14 18:02:34,512 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 300 [2018-10-14 18:02:34,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:02:34,514 INFO L225 Difference]: With dead ends: 306 [2018-10-14 18:02:34,514 INFO L226 Difference]: Without dead ends: 306 [2018-10-14 18:02:34,515 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2701 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=8474, Invalid=13876, Unknown=0, NotChecked=0, Total=22350 [2018-10-14 18:02:34,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-10-14 18:02:34,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2018-10-14 18:02:34,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-10-14 18:02:34,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 304 transitions. [2018-10-14 18:02:34,518 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 304 transitions. Word has length 300 [2018-10-14 18:02:34,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:02:34,518 INFO L481 AbstractCegarLoop]: Abstraction has 304 states and 304 transitions. [2018-10-14 18:02:34,518 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-14 18:02:34,518 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 304 transitions. [2018-10-14 18:02:34,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-10-14 18:02:34,519 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:02:34,519 INFO L375 BasicCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:34,519 INFO L424 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:02:34,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:02:34,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1705377265, now seen corresponding path program 74 times [2018-10-14 18:02:34,520 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:02:34,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:02:37,263 INFO L134 CoverageAnalysis]: Checked inductivity of 8177 backedges. 0 proven. 8177 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:02:37,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:02:37,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-10-14 18:02:37,264 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-14 18:02:37,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-14 18:02:37,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2929, Invalid=3077, Unknown=0, NotChecked=0, Total=6006 [2018-10-14 18:02:37,265 INFO L87 Difference]: Start difference. First operand 304 states and 304 transitions. Second operand 78 states. [2018-10-14 18:02:41,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:02:41,319 INFO L93 Difference]: Finished difference Result 309 states and 309 transitions. [2018-10-14 18:02:41,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-14 18:02:41,320 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 303 [2018-10-14 18:02:41,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:02:41,321 INFO L225 Difference]: With dead ends: 309 [2018-10-14 18:02:41,321 INFO L226 Difference]: Without dead ends: 309 [2018-10-14 18:02:41,322 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2775 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=8701, Invalid=14251, Unknown=0, NotChecked=0, Total=22952 [2018-10-14 18:02:41,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-10-14 18:02:41,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 307. [2018-10-14 18:02:41,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-10-14 18:02:41,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 307 transitions. [2018-10-14 18:02:41,325 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 307 transitions. Word has length 303 [2018-10-14 18:02:41,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:02:41,325 INFO L481 AbstractCegarLoop]: Abstraction has 307 states and 307 transitions. [2018-10-14 18:02:41,325 INFO L482 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-14 18:02:41,325 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 307 transitions. [2018-10-14 18:02:41,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-10-14 18:02:41,326 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:02:41,326 INFO L375 BasicCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:41,327 INFO L424 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:02:41,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:02:41,327 INFO L82 PathProgramCache]: Analyzing trace with hash -242029367, now seen corresponding path program 75 times [2018-10-14 18:02:41,327 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:02:41,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:02:44,074 INFO L134 CoverageAnalysis]: Checked inductivity of 8400 backedges. 0 proven. 8400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:02:44,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:02:44,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-10-14 18:02:44,075 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-14 18:02:44,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-14 18:02:44,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3006, Invalid=3156, Unknown=0, NotChecked=0, Total=6162 [2018-10-14 18:02:44,076 INFO L87 Difference]: Start difference. First operand 307 states and 307 transitions. Second operand 79 states. [2018-10-14 18:02:48,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:02:48,220 INFO L93 Difference]: Finished difference Result 312 states and 312 transitions. [2018-10-14 18:02:48,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-14 18:02:48,220 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 306 [2018-10-14 18:02:48,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:02:48,221 INFO L225 Difference]: With dead ends: 312 [2018-10-14 18:02:48,221 INFO L226 Difference]: Without dead ends: 312 [2018-10-14 18:02:48,223 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2850 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=8931, Invalid=14631, Unknown=0, NotChecked=0, Total=23562 [2018-10-14 18:02:48,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-10-14 18:02:48,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 310. [2018-10-14 18:02:48,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-10-14 18:02:48,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 310 transitions. [2018-10-14 18:02:48,225 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 310 transitions. Word has length 306 [2018-10-14 18:02:48,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:02:48,226 INFO L481 AbstractCegarLoop]: Abstraction has 310 states and 310 transitions. [2018-10-14 18:02:48,226 INFO L482 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-14 18:02:48,226 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 310 transitions. [2018-10-14 18:02:48,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2018-10-14 18:02:48,227 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:02:48,228 INFO L375 BasicCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:48,228 INFO L424 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:02:48,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:02:48,228 INFO L82 PathProgramCache]: Analyzing trace with hash 985231089, now seen corresponding path program 76 times [2018-10-14 18:02:48,229 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:02:48,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:02:51,217 INFO L134 CoverageAnalysis]: Checked inductivity of 8626 backedges. 0 proven. 8626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:02:51,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:02:51,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-10-14 18:02:51,218 INFO L460 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-10-14 18:02:51,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-10-14 18:02:51,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3084, Invalid=3236, Unknown=0, NotChecked=0, Total=6320 [2018-10-14 18:02:51,220 INFO L87 Difference]: Start difference. First operand 310 states and 310 transitions. Second operand 80 states. [2018-10-14 18:02:55,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:02:55,104 INFO L93 Difference]: Finished difference Result 315 states and 315 transitions. [2018-10-14 18:02:55,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-14 18:02:55,104 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 309 [2018-10-14 18:02:55,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:02:55,105 INFO L225 Difference]: With dead ends: 315 [2018-10-14 18:02:55,105 INFO L226 Difference]: Without dead ends: 315 [2018-10-14 18:02:55,107 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2926 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=9164, Invalid=15016, Unknown=0, NotChecked=0, Total=24180 [2018-10-14 18:02:55,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-10-14 18:02:55,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 313. [2018-10-14 18:02:55,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-10-14 18:02:55,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 313 transitions. [2018-10-14 18:02:55,110 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 313 transitions. Word has length 309 [2018-10-14 18:02:55,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:02:55,110 INFO L481 AbstractCegarLoop]: Abstraction has 313 states and 313 transitions. [2018-10-14 18:02:55,110 INFO L482 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-10-14 18:02:55,111 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 313 transitions. [2018-10-14 18:02:55,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-10-14 18:02:55,111 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:02:55,112 INFO L375 BasicCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:55,112 INFO L424 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:02:55,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:02:55,112 INFO L82 PathProgramCache]: Analyzing trace with hash -755115063, now seen corresponding path program 77 times [2018-10-14 18:02:55,113 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:02:55,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:02:58,321 INFO L134 CoverageAnalysis]: Checked inductivity of 8855 backedges. 0 proven. 8855 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:02:58,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:02:58,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-14 18:02:58,322 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-14 18:02:58,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-14 18:02:58,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3163, Invalid=3317, Unknown=0, NotChecked=0, Total=6480 [2018-10-14 18:02:58,323 INFO L87 Difference]: Start difference. First operand 313 states and 313 transitions. Second operand 81 states. [2018-10-14 18:03:02,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:03:02,732 INFO L93 Difference]: Finished difference Result 318 states and 318 transitions. [2018-10-14 18:03:02,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-14 18:03:02,732 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 312 [2018-10-14 18:03:02,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:03:02,734 INFO L225 Difference]: With dead ends: 318 [2018-10-14 18:03:02,734 INFO L226 Difference]: Without dead ends: 318 [2018-10-14 18:03:02,734 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3003 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=9400, Invalid=15406, Unknown=0, NotChecked=0, Total=24806 [2018-10-14 18:03:02,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-10-14 18:03:02,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 316. [2018-10-14 18:03:02,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-10-14 18:03:02,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 316 transitions. [2018-10-14 18:03:02,737 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 316 transitions. Word has length 312 [2018-10-14 18:03:02,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:03:02,737 INFO L481 AbstractCegarLoop]: Abstraction has 316 states and 316 transitions. [2018-10-14 18:03:02,737 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-14 18:03:02,737 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 316 transitions. [2018-10-14 18:03:02,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2018-10-14 18:03:02,738 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:03:02,738 INFO L375 BasicCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:02,739 INFO L424 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:03:02,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:03:02,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1437868017, now seen corresponding path program 78 times [2018-10-14 18:03:02,739 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:03:02,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:03:05,661 INFO L134 CoverageAnalysis]: Checked inductivity of 9087 backedges. 0 proven. 9087 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:03:05,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:03:05,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-10-14 18:03:05,662 INFO L460 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-10-14 18:03:05,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-10-14 18:03:05,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3243, Invalid=3399, Unknown=0, NotChecked=0, Total=6642 [2018-10-14 18:03:05,663 INFO L87 Difference]: Start difference. First operand 316 states and 316 transitions. Second operand 82 states. [2018-10-14 18:03:10,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:03:10,123 INFO L93 Difference]: Finished difference Result 321 states and 321 transitions. [2018-10-14 18:03:10,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-14 18:03:10,123 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 315 [2018-10-14 18:03:10,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:03:10,124 INFO L225 Difference]: With dead ends: 321 [2018-10-14 18:03:10,124 INFO L226 Difference]: Without dead ends: 321 [2018-10-14 18:03:10,126 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3081 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=9639, Invalid=15801, Unknown=0, NotChecked=0, Total=25440 [2018-10-14 18:03:10,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-10-14 18:03:10,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 319. [2018-10-14 18:03:10,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-10-14 18:03:10,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 319 transitions. [2018-10-14 18:03:10,129 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 319 transitions. Word has length 315 [2018-10-14 18:03:10,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:03:10,129 INFO L481 AbstractCegarLoop]: Abstraction has 319 states and 319 transitions. [2018-10-14 18:03:10,129 INFO L482 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-10-14 18:03:10,130 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 319 transitions. [2018-10-14 18:03:10,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2018-10-14 18:03:10,131 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:03:10,131 INFO L375 BasicCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:10,131 INFO L424 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:03:10,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:03:10,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1849264841, now seen corresponding path program 79 times [2018-10-14 18:03:10,132 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:03:10,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:03:13,358 INFO L134 CoverageAnalysis]: Checked inductivity of 9322 backedges. 0 proven. 9322 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:03:13,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:03:13,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-14 18:03:13,359 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-14 18:03:13,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-14 18:03:13,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3324, Invalid=3482, Unknown=0, NotChecked=0, Total=6806 [2018-10-14 18:03:13,360 INFO L87 Difference]: Start difference. First operand 319 states and 319 transitions. Second operand 83 states. [2018-10-14 18:03:17,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:03:17,845 INFO L93 Difference]: Finished difference Result 324 states and 324 transitions. [2018-10-14 18:03:17,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-10-14 18:03:17,845 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 318 [2018-10-14 18:03:17,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:03:17,846 INFO L225 Difference]: With dead ends: 324 [2018-10-14 18:03:17,846 INFO L226 Difference]: Without dead ends: 324 [2018-10-14 18:03:17,849 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3160 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=9881, Invalid=16201, Unknown=0, NotChecked=0, Total=26082 [2018-10-14 18:03:17,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-10-14 18:03:17,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 322. [2018-10-14 18:03:17,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2018-10-14 18:03:17,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 322 transitions. [2018-10-14 18:03:17,852 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 322 transitions. Word has length 318 [2018-10-14 18:03:17,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:03:17,853 INFO L481 AbstractCegarLoop]: Abstraction has 322 states and 322 transitions. [2018-10-14 18:03:17,853 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-14 18:03:17,853 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 322 transitions. [2018-10-14 18:03:17,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2018-10-14 18:03:17,854 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:03:17,854 INFO L375 BasicCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:17,855 INFO L424 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:03:17,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:03:17,855 INFO L82 PathProgramCache]: Analyzing trace with hash -64614159, now seen corresponding path program 80 times [2018-10-14 18:03:17,856 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:03:17,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:03:21,039 INFO L134 CoverageAnalysis]: Checked inductivity of 9560 backedges. 0 proven. 9560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:03:21,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:03:21,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-10-14 18:03:21,040 INFO L460 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-10-14 18:03:21,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-10-14 18:03:21,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3406, Invalid=3566, Unknown=0, NotChecked=0, Total=6972 [2018-10-14 18:03:21,041 INFO L87 Difference]: Start difference. First operand 322 states and 322 transitions. Second operand 84 states. [2018-10-14 18:03:25,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:03:25,670 INFO L93 Difference]: Finished difference Result 327 states and 327 transitions. [2018-10-14 18:03:25,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-14 18:03:25,670 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 321 [2018-10-14 18:03:25,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:03:25,671 INFO L225 Difference]: With dead ends: 327 [2018-10-14 18:03:25,671 INFO L226 Difference]: Without dead ends: 327 [2018-10-14 18:03:25,672 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3240 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=10126, Invalid=16606, Unknown=0, NotChecked=0, Total=26732 [2018-10-14 18:03:25,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-10-14 18:03:25,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 325. [2018-10-14 18:03:25,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-10-14 18:03:25,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 325 transitions. [2018-10-14 18:03:25,675 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 325 transitions. Word has length 321 [2018-10-14 18:03:25,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:03:25,675 INFO L481 AbstractCegarLoop]: Abstraction has 325 states and 325 transitions. [2018-10-14 18:03:25,675 INFO L482 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-10-14 18:03:25,675 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 325 transitions. [2018-10-14 18:03:25,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-10-14 18:03:25,676 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:03:25,676 INFO L375 BasicCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:25,677 INFO L424 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:03:25,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:03:25,677 INFO L82 PathProgramCache]: Analyzing trace with hash -743048759, now seen corresponding path program 81 times [2018-10-14 18:03:25,677 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:03:25,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:03:28,837 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 0 proven. 9801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:03:28,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:03:28,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-10-14 18:03:28,838 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-14 18:03:28,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-14 18:03:28,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3489, Invalid=3651, Unknown=0, NotChecked=0, Total=7140 [2018-10-14 18:03:28,839 INFO L87 Difference]: Start difference. First operand 325 states and 325 transitions. Second operand 85 states. [2018-10-14 18:03:33,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:03:33,444 INFO L93 Difference]: Finished difference Result 330 states and 330 transitions. [2018-10-14 18:03:33,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-14 18:03:33,444 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 324 [2018-10-14 18:03:33,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:03:33,446 INFO L225 Difference]: With dead ends: 330 [2018-10-14 18:03:33,446 INFO L226 Difference]: Without dead ends: 330 [2018-10-14 18:03:33,448 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3321 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=10374, Invalid=17016, Unknown=0, NotChecked=0, Total=27390 [2018-10-14 18:03:33,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-10-14 18:03:33,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 328. [2018-10-14 18:03:33,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-10-14 18:03:33,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 328 transitions. [2018-10-14 18:03:33,451 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 328 transitions. Word has length 324 [2018-10-14 18:03:33,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:03:33,451 INFO L481 AbstractCegarLoop]: Abstraction has 328 states and 328 transitions. [2018-10-14 18:03:33,451 INFO L482 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-14 18:03:33,451 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 328 transitions. [2018-10-14 18:03:33,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-10-14 18:03:33,452 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:03:33,452 INFO L375 BasicCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:33,452 INFO L424 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:03:33,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:03:33,453 INFO L82 PathProgramCache]: Analyzing trace with hash 127877617, now seen corresponding path program 82 times [2018-10-14 18:03:33,453 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:03:33,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:03:36,746 INFO L134 CoverageAnalysis]: Checked inductivity of 10045 backedges. 0 proven. 10045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:03:36,747 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:03:36,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-10-14 18:03:36,747 INFO L460 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-10-14 18:03:36,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-10-14 18:03:36,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3573, Invalid=3737, Unknown=0, NotChecked=0, Total=7310 [2018-10-14 18:03:36,748 INFO L87 Difference]: Start difference. First operand 328 states and 328 transitions. Second operand 86 states. [2018-10-14 18:03:41,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:03:41,500 INFO L93 Difference]: Finished difference Result 333 states and 333 transitions. [2018-10-14 18:03:41,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-10-14 18:03:41,500 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 327 [2018-10-14 18:03:41,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:03:41,501 INFO L225 Difference]: With dead ends: 333 [2018-10-14 18:03:41,501 INFO L226 Difference]: Without dead ends: 333 [2018-10-14 18:03:41,503 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3403 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=10625, Invalid=17431, Unknown=0, NotChecked=0, Total=28056 [2018-10-14 18:03:41,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-10-14 18:03:41,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 331. [2018-10-14 18:03:41,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-10-14 18:03:41,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 331 transitions. [2018-10-14 18:03:41,507 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 331 transitions. Word has length 327 [2018-10-14 18:03:41,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:03:41,507 INFO L481 AbstractCegarLoop]: Abstraction has 331 states and 331 transitions. [2018-10-14 18:03:41,507 INFO L482 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-10-14 18:03:41,507 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 331 transitions. [2018-10-14 18:03:41,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-10-14 18:03:41,508 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:03:41,508 INFO L375 BasicCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:41,508 INFO L424 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:03:41,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:03:41,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1890103, now seen corresponding path program 83 times [2018-10-14 18:03:41,509 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:03:41,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:03:44,820 INFO L134 CoverageAnalysis]: Checked inductivity of 10292 backedges. 0 proven. 10292 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:03:44,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:03:44,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-14 18:03:44,821 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-14 18:03:44,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-14 18:03:44,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3658, Invalid=3824, Unknown=0, NotChecked=0, Total=7482 [2018-10-14 18:03:44,822 INFO L87 Difference]: Start difference. First operand 331 states and 331 transitions. Second operand 87 states. [2018-10-14 18:03:49,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:03:49,635 INFO L93 Difference]: Finished difference Result 336 states and 336 transitions. [2018-10-14 18:03:49,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-14 18:03:49,636 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 330 [2018-10-14 18:03:49,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:03:49,637 INFO L225 Difference]: With dead ends: 336 [2018-10-14 18:03:49,637 INFO L226 Difference]: Without dead ends: 336 [2018-10-14 18:03:49,639 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3486 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=10879, Invalid=17851, Unknown=0, NotChecked=0, Total=28730 [2018-10-14 18:03:49,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-10-14 18:03:49,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 334. [2018-10-14 18:03:49,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-10-14 18:03:49,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 334 transitions. [2018-10-14 18:03:49,641 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 334 transitions. Word has length 330 [2018-10-14 18:03:49,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:03:49,641 INFO L481 AbstractCegarLoop]: Abstraction has 334 states and 334 transitions. [2018-10-14 18:03:49,641 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-14 18:03:49,642 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 334 transitions. [2018-10-14 18:03:49,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2018-10-14 18:03:49,643 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:03:49,643 INFO L375 BasicCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:49,643 INFO L424 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:03:49,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:03:49,643 INFO L82 PathProgramCache]: Analyzing trace with hash -441470223, now seen corresponding path program 84 times [2018-10-14 18:03:49,644 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:03:49,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:03:52,981 INFO L134 CoverageAnalysis]: Checked inductivity of 10542 backedges. 0 proven. 10542 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:03:52,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:03:52,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-10-14 18:03:52,982 INFO L460 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-10-14 18:03:52,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-10-14 18:03:52,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3744, Invalid=3912, Unknown=0, NotChecked=0, Total=7656 [2018-10-14 18:03:52,984 INFO L87 Difference]: Start difference. First operand 334 states and 334 transitions. Second operand 88 states. [2018-10-14 18:03:57,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:03:57,906 INFO L93 Difference]: Finished difference Result 339 states and 339 transitions. [2018-10-14 18:03:57,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-10-14 18:03:57,907 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 333 [2018-10-14 18:03:57,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:03:57,908 INFO L225 Difference]: With dead ends: 339 [2018-10-14 18:03:57,908 INFO L226 Difference]: Without dead ends: 339 [2018-10-14 18:03:57,910 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3570 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=11136, Invalid=18276, Unknown=0, NotChecked=0, Total=29412 [2018-10-14 18:03:57,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-10-14 18:03:57,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 337. [2018-10-14 18:03:57,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-10-14 18:03:57,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 337 transitions. [2018-10-14 18:03:57,913 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 337 transitions. Word has length 333 [2018-10-14 18:03:57,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:03:57,914 INFO L481 AbstractCegarLoop]: Abstraction has 337 states and 337 transitions. [2018-10-14 18:03:57,914 INFO L482 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-10-14 18:03:57,914 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 337 transitions. [2018-10-14 18:03:57,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2018-10-14 18:03:57,915 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:03:57,915 INFO L375 BasicCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:57,916 INFO L424 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:03:57,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:03:57,916 INFO L82 PathProgramCache]: Analyzing trace with hash -617539639, now seen corresponding path program 85 times [2018-10-14 18:03:57,917 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:03:57,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:04:01,349 INFO L134 CoverageAnalysis]: Checked inductivity of 10795 backedges. 0 proven. 10795 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:04:01,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:04:01,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-10-14 18:04:01,350 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-14 18:04:01,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-14 18:04:01,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3831, Invalid=4001, Unknown=0, NotChecked=0, Total=7832 [2018-10-14 18:04:01,352 INFO L87 Difference]: Start difference. First operand 337 states and 337 transitions. Second operand 89 states. [2018-10-14 18:04:06,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:04:06,295 INFO L93 Difference]: Finished difference Result 342 states and 342 transitions. [2018-10-14 18:04:06,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-10-14 18:04:06,295 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 336 [2018-10-14 18:04:06,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:04:06,296 INFO L225 Difference]: With dead ends: 342 [2018-10-14 18:04:06,296 INFO L226 Difference]: Without dead ends: 342 [2018-10-14 18:04:06,299 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3655 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=11396, Invalid=18706, Unknown=0, NotChecked=0, Total=30102 [2018-10-14 18:04:06,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-10-14 18:04:06,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 340. [2018-10-14 18:04:06,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-10-14 18:04:06,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 340 transitions. [2018-10-14 18:04:06,303 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 340 transitions. Word has length 336 [2018-10-14 18:04:06,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:04:06,303 INFO L481 AbstractCegarLoop]: Abstraction has 340 states and 340 transitions. [2018-10-14 18:04:06,303 INFO L482 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-14 18:04:06,303 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 340 transitions. [2018-10-14 18:04:06,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2018-10-14 18:04:06,305 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:04:06,305 INFO L375 BasicCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:06,305 INFO L424 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:04:06,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:04:06,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1746443279, now seen corresponding path program 86 times [2018-10-14 18:04:06,306 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:04:06,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:04:09,918 INFO L134 CoverageAnalysis]: Checked inductivity of 11051 backedges. 0 proven. 11051 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:04:09,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:04:09,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-10-14 18:04:09,919 INFO L460 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-10-14 18:04:09,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-10-14 18:04:09,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3919, Invalid=4091, Unknown=0, NotChecked=0, Total=8010 [2018-10-14 18:04:09,920 INFO L87 Difference]: Start difference. First operand 340 states and 340 transitions. Second operand 90 states. [2018-10-14 18:04:15,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:04:15,172 INFO L93 Difference]: Finished difference Result 345 states and 345 transitions. [2018-10-14 18:04:15,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-14 18:04:15,172 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 339 [2018-10-14 18:04:15,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:04:15,173 INFO L225 Difference]: With dead ends: 345 [2018-10-14 18:04:15,174 INFO L226 Difference]: Without dead ends: 345 [2018-10-14 18:04:15,176 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3741 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=11659, Invalid=19141, Unknown=0, NotChecked=0, Total=30800 [2018-10-14 18:04:15,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2018-10-14 18:04:15,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 343. [2018-10-14 18:04:15,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-10-14 18:04:15,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 343 transitions. [2018-10-14 18:04:15,179 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 343 transitions. Word has length 339 [2018-10-14 18:04:15,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:04:15,179 INFO L481 AbstractCegarLoop]: Abstraction has 343 states and 343 transitions. [2018-10-14 18:04:15,179 INFO L482 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-10-14 18:04:15,179 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 343 transitions. [2018-10-14 18:04:15,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2018-10-14 18:04:15,180 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:04:15,180 INFO L375 BasicCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:15,181 INFO L424 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:04:15,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:04:15,181 INFO L82 PathProgramCache]: Analyzing trace with hash 974112457, now seen corresponding path program 87 times [2018-10-14 18:04:15,181 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:04:15,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:04:18,789 INFO L134 CoverageAnalysis]: Checked inductivity of 11310 backedges. 0 proven. 11310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:04:18,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:04:18,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-10-14 18:04:18,790 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-14 18:04:18,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-14 18:04:18,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4008, Invalid=4182, Unknown=0, NotChecked=0, Total=8190 [2018-10-14 18:04:18,792 INFO L87 Difference]: Start difference. First operand 343 states and 343 transitions. Second operand 91 states. [2018-10-14 18:04:23,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:04:23,982 INFO L93 Difference]: Finished difference Result 348 states and 348 transitions. [2018-10-14 18:04:23,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-10-14 18:04:23,982 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 342 [2018-10-14 18:04:23,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:04:23,983 INFO L225 Difference]: With dead ends: 348 [2018-10-14 18:04:23,983 INFO L226 Difference]: Without dead ends: 348 [2018-10-14 18:04:23,985 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3828 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=11925, Invalid=19581, Unknown=0, NotChecked=0, Total=31506 [2018-10-14 18:04:23,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2018-10-14 18:04:23,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 346. [2018-10-14 18:04:23,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-10-14 18:04:23,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 346 transitions. [2018-10-14 18:04:23,988 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 346 transitions. Word has length 342 [2018-10-14 18:04:23,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:04:23,988 INFO L481 AbstractCegarLoop]: Abstraction has 346 states and 346 transitions. [2018-10-14 18:04:23,988 INFO L482 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-14 18:04:23,988 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 346 transitions. [2018-10-14 18:04:23,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2018-10-14 18:04:23,989 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:04:23,989 INFO L375 BasicCegarLoop]: trace histogram [88, 88, 88, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:23,990 INFO L424 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:04:23,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:04:23,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1277799183, now seen corresponding path program 88 times [2018-10-14 18:04:23,990 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:04:24,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:04:27,659 INFO L134 CoverageAnalysis]: Checked inductivity of 11572 backedges. 0 proven. 11572 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:04:27,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:04:27,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-10-14 18:04:27,660 INFO L460 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-10-14 18:04:27,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-10-14 18:04:27,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4098, Invalid=4274, Unknown=0, NotChecked=0, Total=8372 [2018-10-14 18:04:27,662 INFO L87 Difference]: Start difference. First operand 346 states and 346 transitions. Second operand 92 states. [2018-10-14 18:04:33,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:04:33,116 INFO L93 Difference]: Finished difference Result 351 states and 351 transitions. [2018-10-14 18:04:33,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-10-14 18:04:33,116 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 345 [2018-10-14 18:04:33,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:04:33,118 INFO L225 Difference]: With dead ends: 351 [2018-10-14 18:04:33,118 INFO L226 Difference]: Without dead ends: 351 [2018-10-14 18:04:33,121 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3916 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=12194, Invalid=20026, Unknown=0, NotChecked=0, Total=32220 [2018-10-14 18:04:33,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-10-14 18:04:33,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 349. [2018-10-14 18:04:33,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-10-14 18:04:33,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 349 transitions. [2018-10-14 18:04:33,124 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 349 transitions. Word has length 345 [2018-10-14 18:04:33,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:04:33,125 INFO L481 AbstractCegarLoop]: Abstraction has 349 states and 349 transitions. [2018-10-14 18:04:33,125 INFO L482 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-10-14 18:04:33,125 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 349 transitions. [2018-10-14 18:04:33,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2018-10-14 18:04:33,126 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:04:33,126 INFO L375 BasicCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:33,126 INFO L424 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:04:33,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:04:33,127 INFO L82 PathProgramCache]: Analyzing trace with hash -588302903, now seen corresponding path program 89 times [2018-10-14 18:04:33,127 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:04:33,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:04:36,952 INFO L134 CoverageAnalysis]: Checked inductivity of 11837 backedges. 0 proven. 11837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:04:36,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:04:36,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-14 18:04:36,953 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-14 18:04:36,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-14 18:04:36,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4189, Invalid=4367, Unknown=0, NotChecked=0, Total=8556 [2018-10-14 18:04:36,955 INFO L87 Difference]: Start difference. First operand 349 states and 349 transitions. Second operand 93 states. [2018-10-14 18:04:42,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:04:42,207 INFO L93 Difference]: Finished difference Result 354 states and 354 transitions. [2018-10-14 18:04:42,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-14 18:04:42,208 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 348 [2018-10-14 18:04:42,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:04:42,209 INFO L225 Difference]: With dead ends: 354 [2018-10-14 18:04:42,209 INFO L226 Difference]: Without dead ends: 354 [2018-10-14 18:04:42,212 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4005 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=12466, Invalid=20476, Unknown=0, NotChecked=0, Total=32942 [2018-10-14 18:04:42,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-10-14 18:04:42,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 352. [2018-10-14 18:04:42,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2018-10-14 18:04:42,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 352 transitions. [2018-10-14 18:04:42,215 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 352 transitions. Word has length 348 [2018-10-14 18:04:42,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:04:42,215 INFO L481 AbstractCegarLoop]: Abstraction has 352 states and 352 transitions. [2018-10-14 18:04:42,215 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-14 18:04:42,215 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 352 transitions. [2018-10-14 18:04:42,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2018-10-14 18:04:42,216 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:04:42,217 INFO L375 BasicCegarLoop]: trace histogram [90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:42,217 INFO L424 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:04:42,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:04:42,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1661765105, now seen corresponding path program 90 times [2018-10-14 18:04:42,218 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:04:42,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:04:46,070 INFO L134 CoverageAnalysis]: Checked inductivity of 12105 backedges. 0 proven. 12105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:04:46,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:04:46,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-10-14 18:04:46,071 INFO L460 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-10-14 18:04:46,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-10-14 18:04:46,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4281, Invalid=4461, Unknown=0, NotChecked=0, Total=8742 [2018-10-14 18:04:46,072 INFO L87 Difference]: Start difference. First operand 352 states and 352 transitions. Second operand 94 states.