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_7.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-093a8c0 [2018-10-14 18:04:17,970 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-14 18:04:17,972 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-14 18:04:17,984 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-14 18:04:17,984 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-14 18:04:17,985 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-14 18:04:17,988 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-14 18:04:17,991 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-14 18:04:17,992 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-14 18:04:17,998 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-14 18:04:17,999 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-14 18:04:18,002 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-14 18:04:18,003 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-14 18:04:18,004 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-14 18:04:18,007 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-14 18:04:18,010 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-14 18:04:18,011 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-14 18:04:18,016 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-14 18:04:18,020 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-14 18:04:18,022 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-14 18:04:18,023 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-14 18:04:18,028 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-14 18:04:18,030 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-14 18:04:18,030 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-14 18:04:18,031 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-14 18:04:18,034 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-14 18:04:18,035 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-14 18:04:18,036 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-14 18:04:18,036 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-14 18:04:18,037 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-14 18:04:18,038 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-14 18:04:18,038 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-14 18:04:18,039 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-14 18:04:18,039 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-14 18:04:18,040 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-14 18:04:18,040 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-14 18:04:18,041 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-14 18:04:18,051 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-14 18:04:18,052 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-14 18:04:18,052 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-14 18:04:18,053 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-14 18:04:18,053 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-14 18:04:18,053 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-14 18:04:18,054 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-14 18:04:18,054 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-14 18:04:18,055 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-14 18:04:18,055 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-14 18:04:18,055 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-14 18:04:18,055 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-14 18:04:18,055 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-14 18:04:18,056 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-14 18:04:18,056 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-14 18:04:18,104 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-14 18:04:18,127 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-14 18:04:18,135 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-14 18:04:18,137 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-14 18:04:18,137 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-14 18:04:18,138 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_7.bpl [2018-10-14 18:04:18,139 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/20051113-1.c_false-valid-memtrack.i_7.bpl' [2018-10-14 18:04:18,225 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-14 18:04:18,227 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-14 18:04:18,227 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-14 18:04:18,228 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-14 18:04:18,228 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-14 18:04:18,257 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 06:04:18" (1/1) ... [2018-10-14 18:04:18,259 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 06:04:18" (1/1) ... [2018-10-14 18:04:18,277 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 06:04:18" (1/1) ... [2018-10-14 18:04:18,277 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 06:04:18" (1/1) ... [2018-10-14 18:04:18,283 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 06:04:18" (1/1) ... [2018-10-14 18:04:18,288 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 06:04:18" (1/1) ... [2018-10-14 18:04:18,290 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 06:04:18" (1/1) ... [2018-10-14 18:04:18,293 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-14 18:04:18,300 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-14 18:04:18,300 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-14 18:04:18,300 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-14 18:04:18,302 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "20051113-1.c_false-valid-memtrack.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 06:04:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-14 18:04:18,381 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-14 18:04:18,382 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-14 18:04:18,382 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-14 18:04:19,069 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-14 18:04:19,070 INFO L202 PluginConnector]: Adding new model 20051113-1.c_false-valid-memtrack.i_7.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:04:19 BoogieIcfgContainer [2018-10-14 18:04:19,070 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-14 18:04:19,071 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-14 18:04:19,071 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-14 18:04:19,072 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-14 18:04:19,076 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "20051113-1.c_false-valid-memtrack.i_7.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:04:19" (1/1) ... [2018-10-14 18:04:19,086 INFO L137 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-10-14 18:04:19,086 INFO L138 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-10-14 18:04:19,124 INFO L191 apSepIcfgTransformer]: Heap separator: starting loc-array-style preprocessing [2018-10-14 18:04:19,174 INFO L219 apSepIcfgTransformer]: finished MemlocArrayUpdater [2018-10-14 18:04:19,193 INFO L282 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-10-14 18:04:19,262 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=1) [2018-10-14 18:04:28,082 INFO L315 AbstractInterpreter]: Visited 46 different actions 96 times. Merged at 20 different actions 47 times. Widened at 1 different actions 1 times. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. [2018-10-14 18:04:28,087 INFO L306 apSepIcfgTransformer]: finished equality analysis [2018-10-14 18:04:28,091 INFO L318 apSepIcfgTransformer]: Finished detection of select terms ("array reads") [2018-10-14 18:04:28,141 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 18:04:28,237 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select |v_#locv_ULTIMATE.start_write~int_old_#memory_int_2_1_1| |v_ULTIMATE.start_write~int_#ptr.base_6|) at (assume #memory_int == write~int_old_#memory_int[write~int_#ptr.base := write~int_old_#memory_int[write~int_#ptr.base][write~int_#ptr.offset := write~int_#value]];) [2018-10-14 18:04:28,239 INFO L232 HeapPartitionManager]: partitioning result: [2018-10-14 18:04:28,239 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-14 18:04:28,240 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-14 18:04:28,241 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 2 [2018-10-14 18:04:28,242 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-14 18:04:28,243 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-14 18:04:28,243 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 0 [2018-10-14 18:04:28,243 INFO L248 HeapPartitionManager]: # location blocks :0 [2018-10-14 18:04:28,243 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-14 18:04:28,243 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-14 18:04:28,244 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 2 [2018-10-14 18:04:28,244 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-14 18:04:28,244 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-14 18:04:28,244 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 0 [2018-10-14 18:04:28,245 INFO L248 HeapPartitionManager]: # location blocks :0 [2018-10-14 18:04:28,248 INFO L145 ransitionTransformer]: executing heap partitioning transformation [2018-10-14 18:04:28,267 INFO L202 PluginConnector]: Adding new model 20051113-1.c_false-valid-memtrack.i_7.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.10 06:04:28 BasicIcfg [2018-10-14 18:04:28,268 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-14 18:04:28,270 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-14 18:04:28,270 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-14 18:04:28,274 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-14 18:04:28,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "20051113-1.c_false-valid-memtrack.i_7.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 06:04:18" (1/3) ... [2018-10-14 18:04:28,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@710b3a78 and model type 20051113-1.c_false-valid-memtrack.i_7.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 06:04:28, skipping insertion in model container [2018-10-14 18:04:28,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "20051113-1.c_false-valid-memtrack.i_7.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:04:19" (2/3) ... [2018-10-14 18:04:28,277 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@710b3a78 and model type 20051113-1.c_false-valid-memtrack.i_7.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 06:04:28, skipping insertion in model container [2018-10-14 18:04:28,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "20051113-1.c_false-valid-memtrack.i_7.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.10 06:04:28" (3/3) ... [2018-10-14 18:04:28,279 INFO L112 eAbstractionObserver]: Analyzing ICFG memPartitionedIcfg [2018-10-14 18:04:28,290 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-14 18:04:28,300 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-14 18:04:28,320 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-14 18:04:28,354 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-14 18:04:28,355 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-14 18:04:28,355 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-14 18:04:28,355 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-14 18:04:28,355 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-14 18:04:28,356 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-14 18:04:28,357 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-14 18:04:28,357 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-14 18:04:28,357 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-14 18:04:28,371 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-10-14 18:04:28,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-14 18:04:28,379 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:04:28,380 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] [2018-10-14 18:04:28,381 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:04:28,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:04:28,388 INFO L82 PathProgramCache]: Analyzing trace with hash 662125413, now seen corresponding path program 1 times [2018-10-14 18:04:28,458 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:04:28,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:04:28,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:04:28,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 18:04:28,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-14 18:04:28,814 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 18:04:28,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 18:04:28,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-14 18:04:28,831 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 4 states. [2018-10-14 18:04:29,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:04:29,041 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-10-14 18:04:29,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 18:04:29,044 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2018-10-14 18:04:29,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:04:29,057 INFO L225 Difference]: With dead ends: 47 [2018-10-14 18:04:29,057 INFO L226 Difference]: Without dead ends: 47 [2018-10-14 18:04:29,059 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-14 18:04:29,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-14 18:04:29,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2018-10-14 18:04:29,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-14 18:04:29,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-10-14 18:04:29,193 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 41 [2018-10-14 18:04:29,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:04:29,195 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-10-14 18:04:29,195 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 18:04:29,195 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-10-14 18:04:29,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-14 18:04:29,198 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:04:29,198 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:04:29,198 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:04:29,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:04:29,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1324545717, now seen corresponding path program 1 times [2018-10-14 18:04:29,201 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:04:29,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:04:29,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:04:29,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:04:29,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-14 18:04:29,560 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-14 18:04:29,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-14 18:04:29,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-14 18:04:29,561 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 5 states. [2018-10-14 18:04:29,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:04:29,826 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-10-14 18:04:29,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-14 18:04:29,827 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-10-14 18:04:29,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:04:29,829 INFO L225 Difference]: With dead ends: 50 [2018-10-14 18:04:29,829 INFO L226 Difference]: Without dead ends: 50 [2018-10-14 18:04:29,830 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-14 18:04:29,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-10-14 18:04:29,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2018-10-14 18:04:29,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-14 18:04:29,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-10-14 18:04:29,835 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 44 [2018-10-14 18:04:29,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:04:29,836 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-10-14 18:04:29,836 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-14 18:04:29,836 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-10-14 18:04:29,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-14 18:04:29,838 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:04:29,838 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] [2018-10-14 18:04:29,838 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:04:29,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:04:29,839 INFO L82 PathProgramCache]: Analyzing trace with hash 113097061, now seen corresponding path program 2 times [2018-10-14 18:04:29,840 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:04:29,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:04:30,100 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 18:04:30,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:04:30,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-10-14 18:04:30,101 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-14 18:04:30,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-14 18:04:30,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-14 18:04:30,102 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 6 states. [2018-10-14 18:04:30,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:04:30,455 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-10-14 18:04:30,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-14 18:04:30,456 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-10-14 18:04:30,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:04:30,457 INFO L225 Difference]: With dead ends: 53 [2018-10-14 18:04:30,457 INFO L226 Difference]: Without dead ends: 53 [2018-10-14 18:04:30,458 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-10-14 18:04:30,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-14 18:04:30,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2018-10-14 18:04:30,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-14 18:04:30,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-10-14 18:04:30,463 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 47 [2018-10-14 18:04:30,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:04:30,464 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-10-14 18:04:30,464 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-14 18:04:30,464 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-10-14 18:04:30,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-14 18:04:30,465 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:04:30,466 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] [2018-10-14 18:04:30,466 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:04:30,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:04:30,466 INFO L82 PathProgramCache]: Analyzing trace with hash 456374453, now seen corresponding path program 3 times [2018-10-14 18:04:30,467 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:04:30,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:04:30,752 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 18:04:30,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:04:30,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-14 18:04:30,754 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-14 18:04:30,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-14 18:04:30,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-14 18:04:30,754 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 7 states. [2018-10-14 18:04:30,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:04:30,888 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-10-14 18:04:30,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-14 18:04:30,890 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2018-10-14 18:04:30,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:04:30,891 INFO L225 Difference]: With dead ends: 56 [2018-10-14 18:04:30,892 INFO L226 Difference]: Without dead ends: 56 [2018-10-14 18:04:30,892 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 18:04:30,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-10-14 18:04:30,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 54. [2018-10-14 18:04:30,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-10-14 18:04:30,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-10-14 18:04:30,898 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 50 [2018-10-14 18:04:30,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:04:30,898 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-10-14 18:04:30,899 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-14 18:04:30,899 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-10-14 18:04:30,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-14 18:04:30,900 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:04:30,900 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] [2018-10-14 18:04:30,901 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:04:30,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:04:30,901 INFO L82 PathProgramCache]: Analyzing trace with hash 716027749, now seen corresponding path program 4 times [2018-10-14 18:04:30,902 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:04:30,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:04:31,121 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 18:04:31,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:04:31,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-14 18:04:31,122 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-14 18:04:31,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-14 18:04:31,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-10-14 18:04:31,125 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 8 states. [2018-10-14 18:04:31,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:04:31,297 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-10-14 18:04:31,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-14 18:04:31,299 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2018-10-14 18:04:31,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:04:31,300 INFO L225 Difference]: With dead ends: 59 [2018-10-14 18:04:31,300 INFO L226 Difference]: Without dead ends: 59 [2018-10-14 18:04:31,301 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-10-14 18:04:31,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-14 18:04:31,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2018-10-14 18:04:31,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-14 18:04:31,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-10-14 18:04:31,307 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 53 [2018-10-14 18:04:31,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:04:31,308 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-10-14 18:04:31,308 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-14 18:04:31,308 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-10-14 18:04:31,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-14 18:04:31,309 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:04:31,309 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] [2018-10-14 18:04:31,310 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:04:31,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:04:31,310 INFO L82 PathProgramCache]: Analyzing trace with hash 811268789, now seen corresponding path program 5 times [2018-10-14 18:04:31,311 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:04:31,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:04:31,804 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 18:04:31,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:04:31,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-14 18:04:31,805 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-14 18:04:31,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-14 18:04:31,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-10-14 18:04:31,806 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 9 states. [2018-10-14 18:04:32,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:04:32,047 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-10-14 18:04:32,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-14 18:04:32,050 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 56 [2018-10-14 18:04:32,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:04:32,051 INFO L225 Difference]: With dead ends: 62 [2018-10-14 18:04:32,052 INFO L226 Difference]: Without dead ends: 62 [2018-10-14 18:04:32,052 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-10-14 18:04:32,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-10-14 18:04:32,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2018-10-14 18:04:32,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-14 18:04:32,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-10-14 18:04:32,057 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 56 [2018-10-14 18:04:32,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:04:32,058 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-10-14 18:04:32,058 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-14 18:04:32,058 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-10-14 18:04:32,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-10-14 18:04:32,059 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:04:32,060 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] [2018-10-14 18:04:32,060 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:04:32,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:04:32,060 INFO L82 PathProgramCache]: Analyzing trace with hash -836291227, now seen corresponding path program 6 times [2018-10-14 18:04:32,062 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:04:32,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:04:32,295 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 18:04:32,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:04:32,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-14 18:04:32,296 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-14 18:04:32,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-14 18:04:32,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-10-14 18:04:32,296 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 10 states. [2018-10-14 18:04:32,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:04:32,571 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-10-14 18:04:32,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-14 18:04:32,572 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2018-10-14 18:04:32,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:04:32,573 INFO L225 Difference]: With dead ends: 65 [2018-10-14 18:04:32,573 INFO L226 Difference]: Without dead ends: 65 [2018-10-14 18:04:32,573 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-10-14 18:04:32,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-10-14 18:04:32,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2018-10-14 18:04:32,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-14 18:04:32,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-10-14 18:04:32,578 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 59 [2018-10-14 18:04:32,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:04:32,579 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-10-14 18:04:32,579 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-14 18:04:32,579 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-10-14 18:04:32,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-14 18:04:32,580 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:04:32,580 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] [2018-10-14 18:04:32,581 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:04:32,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:04:32,581 INFO L82 PathProgramCache]: Analyzing trace with hash -410469195, now seen corresponding path program 7 times [2018-10-14 18:04:32,582 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:04:32,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:04:32,799 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 18:04:32,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:04:32,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-14 18:04:32,800 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-14 18:04:32,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-14 18:04:32,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2018-10-14 18:04:32,801 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 11 states. [2018-10-14 18:04:32,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:04:32,963 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-10-14 18:04:32,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-14 18:04:32,965 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 62 [2018-10-14 18:04:32,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:04:32,966 INFO L225 Difference]: With dead ends: 68 [2018-10-14 18:04:32,967 INFO L226 Difference]: Without dead ends: 68 [2018-10-14 18:04:32,967 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 18:04:32,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-10-14 18:04:32,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2018-10-14 18:04:32,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-10-14 18:04:32,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-10-14 18:04:32,972 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 62 [2018-10-14 18:04:32,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:04:32,973 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-10-14 18:04:32,973 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-14 18:04:32,973 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-10-14 18:04:32,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-14 18:04:32,974 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:04:32,974 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] [2018-10-14 18:04:32,975 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:04:32,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:04:32,976 INFO L82 PathProgramCache]: Analyzing trace with hash -2079706267, now seen corresponding path program 8 times [2018-10-14 18:04:32,977 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:04:32,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:04:33,248 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 18:04:33,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:04:33,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-14 18:04:33,250 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-14 18:04:33,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-14 18:04:33,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2018-10-14 18:04:33,250 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 12 states. [2018-10-14 18:04:33,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:04:33,530 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-10-14 18:04:33,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-14 18:04:33,531 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 65 [2018-10-14 18:04:33,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:04:33,532 INFO L225 Difference]: With dead ends: 71 [2018-10-14 18:04:33,532 INFO L226 Difference]: Without dead ends: 71 [2018-10-14 18:04:33,533 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-10-14 18:04:33,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-10-14 18:04:33,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2018-10-14 18:04:33,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-10-14 18:04:33,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-10-14 18:04:33,538 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 65 [2018-10-14 18:04:33,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:04:33,538 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-10-14 18:04:33,538 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-14 18:04:33,539 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-10-14 18:04:33,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-14 18:04:33,540 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:04:33,540 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] [2018-10-14 18:04:33,540 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:04:33,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:04:33,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1105002165, now seen corresponding path program 9 times [2018-10-14 18:04:33,542 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:04:33,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:04:33,762 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 18:04:33,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:04:33,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-14 18:04:33,763 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-14 18:04:33,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-14 18:04:33,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2018-10-14 18:04:33,764 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 13 states. [2018-10-14 18:04:33,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:04:33,959 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-10-14 18:04:33,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-14 18:04:33,959 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 68 [2018-10-14 18:04:33,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:04:33,960 INFO L225 Difference]: With dead ends: 74 [2018-10-14 18:04:33,960 INFO L226 Difference]: Without dead ends: 74 [2018-10-14 18:04:33,961 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-10-14 18:04:33,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-14 18:04:33,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2018-10-14 18:04:33,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-10-14 18:04:33,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-10-14 18:04:33,965 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 68 [2018-10-14 18:04:33,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:04:33,966 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-10-14 18:04:33,966 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-14 18:04:33,966 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-10-14 18:04:33,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-10-14 18:04:33,967 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:04:33,967 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] [2018-10-14 18:04:33,968 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:04:33,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:04:33,968 INFO L82 PathProgramCache]: Analyzing trace with hash 926331237, now seen corresponding path program 10 times [2018-10-14 18:04:33,969 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:04:33,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:04:34,191 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 18:04:34,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:04:34,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-14 18:04:34,192 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-14 18:04:34,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-14 18:04:34,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2018-10-14 18:04:34,193 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 14 states. [2018-10-14 18:04:34,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:04:34,374 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-10-14 18:04:34,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-14 18:04:34,374 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2018-10-14 18:04:34,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:04:34,375 INFO L225 Difference]: With dead ends: 77 [2018-10-14 18:04:34,376 INFO L226 Difference]: Without dead ends: 77 [2018-10-14 18:04:34,377 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=221, Invalid=331, Unknown=0, NotChecked=0, Total=552 [2018-10-14 18:04:34,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-10-14 18:04:34,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2018-10-14 18:04:34,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-14 18:04:34,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-10-14 18:04:34,382 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 71 [2018-10-14 18:04:34,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:04:34,382 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-10-14 18:04:34,383 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-14 18:04:34,383 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-10-14 18:04:34,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-14 18:04:34,384 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:04:34,384 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] [2018-10-14 18:04:34,384 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:04:34,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:04:34,385 INFO L82 PathProgramCache]: Analyzing trace with hash -394805067, now seen corresponding path program 11 times [2018-10-14 18:04:34,385 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:04:34,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:04:34,652 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 18:04:34,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:04:34,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-14 18:04:34,653 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-14 18:04:34,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-14 18:04:34,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=116, Unknown=0, NotChecked=0, Total=210 [2018-10-14 18:04:34,654 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 15 states. [2018-10-14 18:04:35,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:04:35,103 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-10-14 18:04:35,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-14 18:04:35,104 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 74 [2018-10-14 18:04:35,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:04:35,105 INFO L225 Difference]: With dead ends: 80 [2018-10-14 18:04:35,105 INFO L226 Difference]: Without dead ends: 80 [2018-10-14 18:04:35,107 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=259, Invalid=391, Unknown=0, NotChecked=0, Total=650 [2018-10-14 18:04:35,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-10-14 18:04:35,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2018-10-14 18:04:35,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-10-14 18:04:35,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-10-14 18:04:35,111 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 74 [2018-10-14 18:04:35,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:04:35,111 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-10-14 18:04:35,112 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-14 18:04:35,112 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-10-14 18:04:35,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-14 18:04:35,113 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:04:35,113 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] [2018-10-14 18:04:35,113 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:04:35,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:04:35,114 INFO L82 PathProgramCache]: Analyzing trace with hash 713863013, now seen corresponding path program 12 times [2018-10-14 18:04:35,114 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:04:35,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:04:35,553 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 18:04:35,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:04:35,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-14 18:04:35,554 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-14 18:04:35,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-14 18:04:35,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=132, Unknown=0, NotChecked=0, Total=240 [2018-10-14 18:04:35,554 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 16 states. [2018-10-14 18:04:35,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:04:35,865 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-10-14 18:04:35,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-14 18:04:35,866 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 77 [2018-10-14 18:04:35,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:04:35,867 INFO L225 Difference]: With dead ends: 83 [2018-10-14 18:04:35,867 INFO L226 Difference]: Without dead ends: 83 [2018-10-14 18:04:35,868 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 18:04:35,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-10-14 18:04:35,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2018-10-14 18:04:35,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-10-14 18:04:35,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-10-14 18:04:35,875 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 77 [2018-10-14 18:04:35,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:04:35,875 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-10-14 18:04:35,876 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-14 18:04:35,876 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-10-14 18:04:35,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-14 18:04:35,877 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:04:35,877 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] [2018-10-14 18:04:35,877 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:04:35,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:04:35,878 INFO L82 PathProgramCache]: Analyzing trace with hash 746128053, now seen corresponding path program 13 times [2018-10-14 18:04:35,878 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:04:35,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:04:36,208 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 18:04:36,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:04:36,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-14 18:04:36,209 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-14 18:04:36,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-14 18:04:36,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=149, Unknown=0, NotChecked=0, Total=272 [2018-10-14 18:04:36,210 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 17 states. [2018-10-14 18:04:36,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:04:36,553 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-10-14 18:04:36,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-14 18:04:36,554 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 80 [2018-10-14 18:04:36,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:04:36,556 INFO L225 Difference]: With dead ends: 86 [2018-10-14 18:04:36,556 INFO L226 Difference]: Without dead ends: 86 [2018-10-14 18:04:36,557 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=344, Invalid=526, Unknown=0, NotChecked=0, Total=870 [2018-10-14 18:04:36,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-10-14 18:04:36,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2018-10-14 18:04:36,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-10-14 18:04:36,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-10-14 18:04:36,560 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 80 [2018-10-14 18:04:36,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:04:36,561 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-10-14 18:04:36,561 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-14 18:04:36,561 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-10-14 18:04:36,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-10-14 18:04:36,562 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:04:36,562 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] [2018-10-14 18:04:36,563 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:04:36,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:04:36,563 INFO L82 PathProgramCache]: Analyzing trace with hash -118739611, now seen corresponding path program 14 times [2018-10-14 18:04:36,564 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:04:36,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:04:36,803 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 18:04:36,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:04:36,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-14 18:04:36,804 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-14 18:04:36,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-14 18:04:36,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=167, Unknown=0, NotChecked=0, Total=306 [2018-10-14 18:04:36,805 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 18 states. [2018-10-14 18:04:37,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:04:37,271 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-10-14 18:04:37,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-14 18:04:37,272 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 83 [2018-10-14 18:04:37,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:04:37,273 INFO L225 Difference]: With dead ends: 89 [2018-10-14 18:04:37,273 INFO L226 Difference]: Without dead ends: 89 [2018-10-14 18:04:37,274 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=391, Invalid=601, Unknown=0, NotChecked=0, Total=992 [2018-10-14 18:04:37,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-10-14 18:04:37,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2018-10-14 18:04:37,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-10-14 18:04:37,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-10-14 18:04:37,276 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 83 [2018-10-14 18:04:37,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:04:37,277 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-10-14 18:04:37,277 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-14 18:04:37,277 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-10-14 18:04:37,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-14 18:04:37,278 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:04:37,278 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] [2018-10-14 18:04:37,278 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:04:37,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:04:37,279 INFO L82 PathProgramCache]: Analyzing trace with hash 117490869, now seen corresponding path program 15 times [2018-10-14 18:04:37,279 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:04:37,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:04:37,513 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 18:04:37,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:04:37,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-14 18:04:37,514 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-14 18:04:37,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-14 18:04:37,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=186, Unknown=0, NotChecked=0, Total=342 [2018-10-14 18:04:37,515 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 19 states. [2018-10-14 18:04:37,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:04:37,955 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-10-14 18:04:37,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-14 18:04:37,957 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 86 [2018-10-14 18:04:37,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:04:37,958 INFO L225 Difference]: With dead ends: 92 [2018-10-14 18:04:37,958 INFO L226 Difference]: Without dead ends: 92 [2018-10-14 18:04:37,959 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=441, Invalid=681, Unknown=0, NotChecked=0, Total=1122 [2018-10-14 18:04:37,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-10-14 18:04:37,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2018-10-14 18:04:37,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-10-14 18:04:37,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-10-14 18:04:37,962 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 86 [2018-10-14 18:04:37,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:04:37,962 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-10-14 18:04:37,962 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-14 18:04:37,963 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-10-14 18:04:37,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-10-14 18:04:37,964 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:04:37,964 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] [2018-10-14 18:04:37,964 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:04:37,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:04:37,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1791677595, now seen corresponding path program 16 times [2018-10-14 18:04:37,965 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:04:37,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:04:38,271 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 18:04:38,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:04:38,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-14 18:04:38,272 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-14 18:04:38,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-14 18:04:38,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=206, Unknown=0, NotChecked=0, Total=380 [2018-10-14 18:04:38,272 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 20 states. [2018-10-14 18:04:38,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:04:38,668 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-10-14 18:04:38,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-14 18:04:38,668 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 89 [2018-10-14 18:04:38,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:04:38,670 INFO L225 Difference]: With dead ends: 95 [2018-10-14 18:04:38,670 INFO L226 Difference]: Without dead ends: 95 [2018-10-14 18:04:38,671 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=494, Invalid=766, Unknown=0, NotChecked=0, Total=1260 [2018-10-14 18:04:38,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-10-14 18:04:38,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2018-10-14 18:04:38,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-10-14 18:04:38,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-10-14 18:04:38,672 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 89 [2018-10-14 18:04:38,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:04:38,673 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-10-14 18:04:38,673 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-14 18:04:38,673 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-10-14 18:04:38,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-10-14 18:04:38,673 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:04:38,674 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] [2018-10-14 18:04:38,674 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:04:38,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:04:38,674 INFO L82 PathProgramCache]: Analyzing trace with hash 422512309, now seen corresponding path program 17 times [2018-10-14 18:04:38,675 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:04:38,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:04:39,611 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 18:04:39,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:04:39,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-14 18:04:39,612 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-14 18:04:39,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-14 18:04:39,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=227, Unknown=0, NotChecked=0, Total=420 [2018-10-14 18:04:39,613 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 21 states. [2018-10-14 18:04:40,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:04:40,019 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-10-14 18:04:40,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-14 18:04:40,020 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 92 [2018-10-14 18:04:40,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:04:40,020 INFO L225 Difference]: With dead ends: 98 [2018-10-14 18:04:40,021 INFO L226 Difference]: Without dead ends: 98 [2018-10-14 18:04:40,021 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=550, Invalid=856, Unknown=0, NotChecked=0, Total=1406 [2018-10-14 18:04:40,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-10-14 18:04:40,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2018-10-14 18:04:40,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-10-14 18:04:40,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-10-14 18:04:40,024 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 92 [2018-10-14 18:04:40,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:04:40,025 INFO L481 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-10-14 18:04:40,025 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-14 18:04:40,025 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-10-14 18:04:40,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-10-14 18:04:40,026 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:04:40,026 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] [2018-10-14 18:04:40,026 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:04:40,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:04:40,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1246210405, now seen corresponding path program 18 times [2018-10-14 18:04:40,027 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:04:40,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:04:40,560 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 18:04:40,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:04:40,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-14 18:04:40,561 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-14 18:04:40,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-14 18:04:40,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=249, Unknown=0, NotChecked=0, Total=462 [2018-10-14 18:04:40,561 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 22 states. [2018-10-14 18:04:41,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:04:41,019 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-10-14 18:04:41,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-14 18:04:41,020 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 95 [2018-10-14 18:04:41,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:04:41,021 INFO L225 Difference]: With dead ends: 101 [2018-10-14 18:04:41,022 INFO L226 Difference]: Without dead ends: 101 [2018-10-14 18:04:41,023 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=609, Invalid=951, Unknown=0, NotChecked=0, Total=1560 [2018-10-14 18:04:41,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-10-14 18:04:41,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2018-10-14 18:04:41,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-10-14 18:04:41,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-10-14 18:04:41,026 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 95 [2018-10-14 18:04:41,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:04:41,027 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-10-14 18:04:41,027 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-14 18:04:41,027 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-10-14 18:04:41,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-10-14 18:04:41,028 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:04:41,028 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] [2018-10-14 18:04:41,028 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:04:41,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:04:41,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1406941003, now seen corresponding path program 19 times [2018-10-14 18:04:41,030 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:04:41,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:04:41,996 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 18:04:41,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:04:41,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-14 18:04:41,997 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-14 18:04:41,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-14 18:04:41,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=272, Unknown=0, NotChecked=0, Total=506 [2018-10-14 18:04:41,998 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 23 states. [2018-10-14 18:04:42,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:04:42,517 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-10-14 18:04:42,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-14 18:04:42,518 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 98 [2018-10-14 18:04:42,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:04:42,519 INFO L225 Difference]: With dead ends: 104 [2018-10-14 18:04:42,519 INFO L226 Difference]: Without dead ends: 104 [2018-10-14 18:04:42,520 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=671, Invalid=1051, Unknown=0, NotChecked=0, Total=1722 [2018-10-14 18:04:42,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-10-14 18:04:42,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2018-10-14 18:04:42,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-10-14 18:04:42,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-10-14 18:04:42,523 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 98 [2018-10-14 18:04:42,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:04:42,524 INFO L481 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-10-14 18:04:42,524 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-14 18:04:42,524 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-10-14 18:04:42,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-10-14 18:04:42,525 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:04:42,525 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] [2018-10-14 18:04:42,525 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:04:42,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:04:42,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1157388443, now seen corresponding path program 20 times [2018-10-14 18:04:42,526 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:04:42,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:04:43,464 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 18:04:43,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:04:43,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-14 18:04:43,465 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-14 18:04:43,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-14 18:04:43,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=296, Unknown=0, NotChecked=0, Total=552 [2018-10-14 18:04:43,466 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 24 states. [2018-10-14 18:04:44,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:04:44,048 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-10-14 18:04:44,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-14 18:04:44,049 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 101 [2018-10-14 18:04:44,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:04:44,050 INFO L225 Difference]: With dead ends: 107 [2018-10-14 18:04:44,050 INFO L226 Difference]: Without dead ends: 107 [2018-10-14 18:04:44,050 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=736, Invalid=1156, Unknown=0, NotChecked=0, Total=1892 [2018-10-14 18:04:44,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-10-14 18:04:44,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2018-10-14 18:04:44,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-10-14 18:04:44,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-10-14 18:04:44,053 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 101 [2018-10-14 18:04:44,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:04:44,053 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-10-14 18:04:44,053 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-14 18:04:44,053 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-10-14 18:04:44,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-10-14 18:04:44,054 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:04:44,054 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] [2018-10-14 18:04:44,054 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:04:44,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:04:44,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1325462859, now seen corresponding path program 21 times [2018-10-14 18:04:44,055 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:04:44,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:04:44,390 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 18:04:44,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:04:44,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-14 18:04:44,390 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-14 18:04:44,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-14 18:04:44,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=321, Unknown=0, NotChecked=0, Total=600 [2018-10-14 18:04:44,391 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 25 states. [2018-10-14 18:04:44,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:04:44,920 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2018-10-14 18:04:44,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-14 18:04:44,922 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 104 [2018-10-14 18:04:44,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:04:44,923 INFO L225 Difference]: With dead ends: 110 [2018-10-14 18:04:44,924 INFO L226 Difference]: Without dead ends: 110 [2018-10-14 18:04:44,925 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=804, Invalid=1266, Unknown=0, NotChecked=0, Total=2070 [2018-10-14 18:04:44,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-10-14 18:04:44,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2018-10-14 18:04:44,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-10-14 18:04:44,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-10-14 18:04:44,928 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 104 [2018-10-14 18:04:44,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:04:44,928 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-10-14 18:04:44,928 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-14 18:04:44,928 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-10-14 18:04:44,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-10-14 18:04:44,929 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:04:44,929 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] [2018-10-14 18:04:44,929 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:04:44,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:04:44,930 INFO L82 PathProgramCache]: Analyzing trace with hash -498522779, now seen corresponding path program 22 times [2018-10-14 18:04:44,930 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:04:44,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:04:45,373 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 18:04:45,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:04:45,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-14 18:04:45,374 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-14 18:04:45,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-14 18:04:45,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=347, Unknown=0, NotChecked=0, Total=650 [2018-10-14 18:04:45,375 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 26 states. [2018-10-14 18:04:45,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:04:45,946 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-10-14 18:04:45,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-14 18:04:45,947 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 107 [2018-10-14 18:04:45,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:04:45,947 INFO L225 Difference]: With dead ends: 113 [2018-10-14 18:04:45,948 INFO L226 Difference]: Without dead ends: 113 [2018-10-14 18:04:45,949 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 18:04:45,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-10-14 18:04:45,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2018-10-14 18:04:45,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-10-14 18:04:45,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-10-14 18:04:45,952 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 107 [2018-10-14 18:04:45,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:04:45,952 INFO L481 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-10-14 18:04:45,952 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-14 18:04:45,952 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-10-14 18:04:45,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-14 18:04:45,953 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:04:45,953 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] [2018-10-14 18:04:45,954 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:04:45,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:04:45,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1059009355, now seen corresponding path program 23 times [2018-10-14 18:04:45,955 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:04:45,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:04:46,482 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 18:04:46,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:04:46,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-14 18:04:46,483 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-14 18:04:46,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-14 18:04:46,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=374, Unknown=0, NotChecked=0, Total=702 [2018-10-14 18:04:46,484 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 27 states. [2018-10-14 18:04:47,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:04:47,059 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2018-10-14 18:04:47,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-14 18:04:47,060 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 110 [2018-10-14 18:04:47,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:04:47,061 INFO L225 Difference]: With dead ends: 116 [2018-10-14 18:04:47,061 INFO L226 Difference]: Without dead ends: 116 [2018-10-14 18:04:47,063 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 18:04:47,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-10-14 18:04:47,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2018-10-14 18:04:47,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-10-14 18:04:47,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2018-10-14 18:04:47,067 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 110 [2018-10-14 18:04:47,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:04:47,067 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2018-10-14 18:04:47,067 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-14 18:04:47,067 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2018-10-14 18:04:47,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-10-14 18:04:47,068 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:04:47,068 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] [2018-10-14 18:04:47,068 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:04:47,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:04:47,069 INFO L82 PathProgramCache]: Analyzing trace with hash 318251877, now seen corresponding path program 24 times [2018-10-14 18:04:47,069 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:04:47,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:04:47,469 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 18:04:47,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:04:47,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-14 18:04:47,470 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-14 18:04:47,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-14 18:04:47,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=402, Unknown=0, NotChecked=0, Total=756 [2018-10-14 18:04:47,471 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 28 states. [2018-10-14 18:04:47,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:04:47,987 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-10-14 18:04:47,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-14 18:04:47,988 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 113 [2018-10-14 18:04:47,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:04:47,989 INFO L225 Difference]: With dead ends: 119 [2018-10-14 18:04:47,989 INFO L226 Difference]: Without dead ends: 119 [2018-10-14 18:04:47,991 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1026, Invalid=1626, Unknown=0, NotChecked=0, Total=2652 [2018-10-14 18:04:47,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-10-14 18:04:47,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2018-10-14 18:04:47,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-10-14 18:04:47,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-10-14 18:04:47,994 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 113 [2018-10-14 18:04:47,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:04:47,994 INFO L481 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-10-14 18:04:47,994 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-14 18:04:47,994 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-10-14 18:04:47,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-14 18:04:47,995 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:04:47,995 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] [2018-10-14 18:04:47,996 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:04:47,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:04:47,996 INFO L82 PathProgramCache]: Analyzing trace with hash 485035701, now seen corresponding path program 25 times [2018-10-14 18:04:47,997 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:04:48,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:04:48,527 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 18:04:48,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:04:48,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-14 18:04:48,528 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-14 18:04:48,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-14 18:04:48,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=381, Invalid=431, Unknown=0, NotChecked=0, Total=812 [2018-10-14 18:04:48,529 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 29 states. [2018-10-14 18:04:49,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:04:49,199 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2018-10-14 18:04:49,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-14 18:04:49,200 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 116 [2018-10-14 18:04:49,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:04:49,201 INFO L225 Difference]: With dead ends: 122 [2018-10-14 18:04:49,201 INFO L226 Difference]: Without dead ends: 122 [2018-10-14 18:04:49,203 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1106, Invalid=1756, Unknown=0, NotChecked=0, Total=2862 [2018-10-14 18:04:49,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-10-14 18:04:49,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2018-10-14 18:04:49,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-10-14 18:04:49,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2018-10-14 18:04:49,206 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 116 [2018-10-14 18:04:49,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:04:49,206 INFO L481 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2018-10-14 18:04:49,206 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-14 18:04:49,206 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2018-10-14 18:04:49,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-10-14 18:04:49,207 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:04:49,207 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] [2018-10-14 18:04:49,207 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:04:49,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:04:49,208 INFO L82 PathProgramCache]: Analyzing trace with hash -135224987, now seen corresponding path program 26 times [2018-10-14 18:04:49,208 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:04:49,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:04:49,756 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 18:04:49,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:04:49,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-14 18:04:49,756 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-14 18:04:49,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-14 18:04:49,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=409, Invalid=461, Unknown=0, NotChecked=0, Total=870 [2018-10-14 18:04:49,757 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 30 states. [2018-10-14 18:04:50,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:04:50,418 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2018-10-14 18:04:50,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-14 18:04:50,419 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 119 [2018-10-14 18:04:50,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:04:50,420 INFO L225 Difference]: With dead ends: 125 [2018-10-14 18:04:50,420 INFO L226 Difference]: Without dead ends: 125 [2018-10-14 18:04:50,421 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1189, Invalid=1891, Unknown=0, NotChecked=0, Total=3080 [2018-10-14 18:04:50,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-10-14 18:04:50,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2018-10-14 18:04:50,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-10-14 18:04:50,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-10-14 18:04:50,423 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 119 [2018-10-14 18:04:50,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:04:50,424 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-10-14 18:04:50,424 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-14 18:04:50,424 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-10-14 18:04:50,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-14 18:04:50,425 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:04:50,425 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] [2018-10-14 18:04:50,425 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:04:50,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:04:50,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1372073803, now seen corresponding path program 27 times [2018-10-14 18:04:50,426 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:04:50,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:04:51,542 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 18:04:51,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:04:51,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-14 18:04:51,543 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-14 18:04:51,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-14 18:04:51,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=438, Invalid=492, Unknown=0, NotChecked=0, Total=930 [2018-10-14 18:04:51,544 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 31 states. [2018-10-14 18:04:52,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:04:52,247 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2018-10-14 18:04:52,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-14 18:04:52,247 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 122 [2018-10-14 18:04:52,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:04:52,248 INFO L225 Difference]: With dead ends: 128 [2018-10-14 18:04:52,248 INFO L226 Difference]: Without dead ends: 128 [2018-10-14 18:04:52,250 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1275, Invalid=2031, Unknown=0, NotChecked=0, Total=3306 [2018-10-14 18:04:52,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-10-14 18:04:52,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2018-10-14 18:04:52,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-10-14 18:04:52,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2018-10-14 18:04:52,253 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 122 [2018-10-14 18:04:52,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:04:52,253 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2018-10-14 18:04:52,253 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-14 18:04:52,253 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2018-10-14 18:04:52,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-14 18:04:52,254 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:04:52,254 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] [2018-10-14 18:04:52,254 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:04:52,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:04:52,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1810718875, now seen corresponding path program 28 times [2018-10-14 18:04:52,255 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:04:52,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:04:52,749 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 18:04:52,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:04:52,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-14 18:04:52,750 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-14 18:04:52,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-14 18:04:52,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=468, Invalid=524, Unknown=0, NotChecked=0, Total=992 [2018-10-14 18:04:52,751 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 32 states. [2018-10-14 18:04:53,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:04:53,549 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-10-14 18:04:53,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-14 18:04:53,550 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 125 [2018-10-14 18:04:53,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:04:53,551 INFO L225 Difference]: With dead ends: 131 [2018-10-14 18:04:53,551 INFO L226 Difference]: Without dead ends: 131 [2018-10-14 18:04:53,552 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 18:04:53,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-10-14 18:04:53,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2018-10-14 18:04:53,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-10-14 18:04:53,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-10-14 18:04:53,556 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 125 [2018-10-14 18:04:53,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:04:53,556 INFO L481 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-10-14 18:04:53,556 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-14 18:04:53,556 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-10-14 18:04:53,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-14 18:04:53,556 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:04:53,557 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] [2018-10-14 18:04:53,557 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:04:53,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:04:53,557 INFO L82 PathProgramCache]: Analyzing trace with hash 99422901, now seen corresponding path program 29 times [2018-10-14 18:04:53,558 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:04:53,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:04:54,134 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 18:04:54,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:04:54,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-14 18:04:54,135 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-14 18:04:54,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-14 18:04:54,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=499, Invalid=557, Unknown=0, NotChecked=0, Total=1056 [2018-10-14 18:04:54,136 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 33 states. [2018-10-14 18:04:55,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:04:55,057 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2018-10-14 18:04:55,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-14 18:04:55,057 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 128 [2018-10-14 18:04:55,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:04:55,058 INFO L225 Difference]: With dead ends: 134 [2018-10-14 18:04:55,058 INFO L226 Difference]: Without dead ends: 134 [2018-10-14 18:04:55,060 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1456, Invalid=2326, Unknown=0, NotChecked=0, Total=3782 [2018-10-14 18:04:55,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-10-14 18:04:55,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2018-10-14 18:04:55,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-10-14 18:04:55,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2018-10-14 18:04:55,062 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 128 [2018-10-14 18:04:55,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:04:55,062 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2018-10-14 18:04:55,062 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-14 18:04:55,062 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2018-10-14 18:04:55,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-10-14 18:04:55,063 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:04:55,063 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] [2018-10-14 18:04:55,063 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:04:55,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:04:55,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1111367013, now seen corresponding path program 30 times [2018-10-14 18:04:55,064 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:04:55,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:04:55,642 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 18:04:55,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:04:55,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-14 18:04:55,643 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-14 18:04:55,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-14 18:04:55,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=531, Invalid=591, Unknown=0, NotChecked=0, Total=1122 [2018-10-14 18:04:55,644 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 34 states. [2018-10-14 18:04:56,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:04:56,509 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2018-10-14 18:04:56,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-14 18:04:56,509 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 131 [2018-10-14 18:04:56,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:04:56,510 INFO L225 Difference]: With dead ends: 137 [2018-10-14 18:04:56,510 INFO L226 Difference]: Without dead ends: 137 [2018-10-14 18:04:56,512 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1551, Invalid=2481, Unknown=0, NotChecked=0, Total=4032 [2018-10-14 18:04:56,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-10-14 18:04:56,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2018-10-14 18:04:56,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-10-14 18:04:56,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2018-10-14 18:04:56,515 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 131 [2018-10-14 18:04:56,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:04:56,516 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2018-10-14 18:04:56,516 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-14 18:04:56,516 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2018-10-14 18:04:56,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-14 18:04:56,517 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:04:56,517 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] [2018-10-14 18:04:56,517 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:04:56,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:04:56,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1562956981, now seen corresponding path program 31 times [2018-10-14 18:04:56,518 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:04:56,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:04:57,760 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 18:04:57,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:04:57,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-14 18:04:57,761 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-14 18:04:57,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-14 18:04:57,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=564, Invalid=626, Unknown=0, NotChecked=0, Total=1190 [2018-10-14 18:04:57,763 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 35 states. [2018-10-14 18:04:58,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:04:58,748 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2018-10-14 18:04:58,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-14 18:04:58,749 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 134 [2018-10-14 18:04:58,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:04:58,750 INFO L225 Difference]: With dead ends: 140 [2018-10-14 18:04:58,750 INFO L226 Difference]: Without dead ends: 140 [2018-10-14 18:04:58,752 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1649, Invalid=2641, Unknown=0, NotChecked=0, Total=4290 [2018-10-14 18:04:58,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-10-14 18:04:58,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 138. [2018-10-14 18:04:58,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-10-14 18:04:58,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2018-10-14 18:04:58,756 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 134 [2018-10-14 18:04:58,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:04:58,757 INFO L481 AbstractCegarLoop]: Abstraction has 138 states and 138 transitions. [2018-10-14 18:04:58,757 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-14 18:04:58,757 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2018-10-14 18:04:58,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-10-14 18:04:58,759 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:04:58,760 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] [2018-10-14 18:04:58,760 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:04:58,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:04:58,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1252844699, now seen corresponding path program 32 times [2018-10-14 18:04:58,761 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:04:58,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:04:59,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 0 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:04:59,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:04:59,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-14 18:04:59,980 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-14 18:04:59,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-14 18:04:59,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=598, Invalid=662, Unknown=0, NotChecked=0, Total=1260 [2018-10-14 18:04:59,981 INFO L87 Difference]: Start difference. First operand 138 states and 138 transitions. Second operand 36 states. [2018-10-14 18:05:00,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:05:00,861 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-10-14 18:05:00,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-14 18:05:00,861 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 137 [2018-10-14 18:05:00,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:05:00,863 INFO L225 Difference]: With dead ends: 143 [2018-10-14 18:05:00,863 INFO L226 Difference]: Without dead ends: 143 [2018-10-14 18:05:00,865 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1750, Invalid=2806, Unknown=0, NotChecked=0, Total=4556 [2018-10-14 18:05:00,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-10-14 18:05:00,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2018-10-14 18:05:00,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-10-14 18:05:00,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-10-14 18:05:00,868 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 137 [2018-10-14 18:05:00,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:05:00,869 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-10-14 18:05:00,869 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-14 18:05:00,869 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-10-14 18:05:00,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-10-14 18:05:00,870 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:05:00,870 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] [2018-10-14 18:05:00,870 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:05:00,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:05:00,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1794435403, now seen corresponding path program 33 times [2018-10-14 18:05:00,871 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:05:00,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:05:01,572 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 18:05:01,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:05:01,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-14 18:05:01,573 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-14 18:05:01,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-14 18:05:01,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=633, Invalid=699, Unknown=0, NotChecked=0, Total=1332 [2018-10-14 18:05:01,574 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 37 states. [2018-10-14 18:05:03,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:05:03,396 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2018-10-14 18:05:03,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-14 18:05:03,396 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 140 [2018-10-14 18:05:03,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:05:03,397 INFO L225 Difference]: With dead ends: 146 [2018-10-14 18:05:03,397 INFO L226 Difference]: Without dead ends: 146 [2018-10-14 18:05:03,398 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1854, Invalid=2976, Unknown=0, NotChecked=0, Total=4830 [2018-10-14 18:05:03,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-10-14 18:05:03,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2018-10-14 18:05:03,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-10-14 18:05:03,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 144 transitions. [2018-10-14 18:05:03,401 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 144 transitions. Word has length 140 [2018-10-14 18:05:03,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:05:03,402 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 144 transitions. [2018-10-14 18:05:03,402 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-14 18:05:03,402 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 144 transitions. [2018-10-14 18:05:03,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-14 18:05:03,402 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:05:03,402 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] [2018-10-14 18:05:03,403 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:05:03,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:05:03,403 INFO L82 PathProgramCache]: Analyzing trace with hash -130967195, now seen corresponding path program 34 times [2018-10-14 18:05:03,403 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:05:03,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:05:04,239 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 18:05:04,240 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:05:04,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-14 18:05:04,240 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-14 18:05:04,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-14 18:05:04,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=669, Invalid=737, Unknown=0, NotChecked=0, Total=1406 [2018-10-14 18:05:04,241 INFO L87 Difference]: Start difference. First operand 144 states and 144 transitions. Second operand 38 states. [2018-10-14 18:05:05,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:05:05,220 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2018-10-14 18:05:05,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-14 18:05:05,221 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 143 [2018-10-14 18:05:05,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:05:05,222 INFO L225 Difference]: With dead ends: 149 [2018-10-14 18:05:05,222 INFO L226 Difference]: Without dead ends: 149 [2018-10-14 18:05:05,223 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 18:05:05,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-10-14 18:05:05,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 147. [2018-10-14 18:05:05,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-10-14 18:05:05,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-10-14 18:05:05,226 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 143 [2018-10-14 18:05:05,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:05:05,226 INFO L481 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-10-14 18:05:05,226 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-14 18:05:05,227 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-10-14 18:05:05,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-10-14 18:05:05,227 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:05:05,228 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] [2018-10-14 18:05:05,228 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:05:05,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:05:05,228 INFO L82 PathProgramCache]: Analyzing trace with hash 917756085, now seen corresponding path program 35 times [2018-10-14 18:05:05,229 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:05:05,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:05:06,772 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 18:05:06,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:05:06,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-14 18:05:06,773 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-14 18:05:06,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-14 18:05:06,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=706, Invalid=776, Unknown=0, NotChecked=0, Total=1482 [2018-10-14 18:05:06,773 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 39 states. [2018-10-14 18:05:07,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:05:07,896 INFO L93 Difference]: Finished difference Result 152 states and 152 transitions. [2018-10-14 18:05:07,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-14 18:05:07,906 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 146 [2018-10-14 18:05:07,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:05:07,907 INFO L225 Difference]: With dead ends: 152 [2018-10-14 18:05:07,907 INFO L226 Difference]: Without dead ends: 152 [2018-10-14 18:05:07,908 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2071, Invalid=3331, Unknown=0, NotChecked=0, Total=5402 [2018-10-14 18:05:07,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-10-14 18:05:07,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2018-10-14 18:05:07,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-10-14 18:05:07,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 150 transitions. [2018-10-14 18:05:07,912 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 150 transitions. Word has length 146 [2018-10-14 18:05:07,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:05:07,912 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 150 transitions. [2018-10-14 18:05:07,912 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-14 18:05:07,912 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 150 transitions. [2018-10-14 18:05:07,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-10-14 18:05:07,913 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:05:07,913 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] [2018-10-14 18:05:07,914 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:05:07,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:05:07,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1840879461, now seen corresponding path program 36 times [2018-10-14 18:05:07,915 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:05:07,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:05:09,044 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 18:05:09,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:05:09,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-14 18:05:09,045 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-14 18:05:09,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-14 18:05:09,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=744, Invalid=816, Unknown=0, NotChecked=0, Total=1560 [2018-10-14 18:05:09,046 INFO L87 Difference]: Start difference. First operand 150 states and 150 transitions. Second operand 40 states. [2018-10-14 18:05:10,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:05:10,263 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-10-14 18:05:10,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-14 18:05:10,264 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 149 [2018-10-14 18:05:10,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:05:10,265 INFO L225 Difference]: With dead ends: 155 [2018-10-14 18:05:10,265 INFO L226 Difference]: Without dead ends: 155 [2018-10-14 18:05:10,266 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2184, Invalid=3516, Unknown=0, NotChecked=0, Total=5700 [2018-10-14 18:05:10,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-10-14 18:05:10,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 153. [2018-10-14 18:05:10,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-10-14 18:05:10,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-10-14 18:05:10,268 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 149 [2018-10-14 18:05:10,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:05:10,269 INFO L481 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-10-14 18:05:10,269 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-14 18:05:10,269 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-10-14 18:05:10,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-10-14 18:05:10,270 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:05:10,270 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] [2018-10-14 18:05:10,270 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:05:10,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:05:10,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1933777589, now seen corresponding path program 37 times [2018-10-14 18:05:10,271 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:05:10,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:05:11,376 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 18:05:11,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:05:11,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-14 18:05:11,377 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-14 18:05:11,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-14 18:05:11,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=783, Invalid=857, Unknown=0, NotChecked=0, Total=1640 [2018-10-14 18:05:11,377 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 41 states. [2018-10-14 18:05:12,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:05:12,556 INFO L93 Difference]: Finished difference Result 158 states and 158 transitions. [2018-10-14 18:05:12,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-14 18:05:12,556 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 152 [2018-10-14 18:05:12,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:05:12,557 INFO L225 Difference]: With dead ends: 158 [2018-10-14 18:05:12,557 INFO L226 Difference]: Without dead ends: 158 [2018-10-14 18:05:12,558 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2300, Invalid=3706, Unknown=0, NotChecked=0, Total=6006 [2018-10-14 18:05:12,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-10-14 18:05:12,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 156. [2018-10-14 18:05:12,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-10-14 18:05:12,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2018-10-14 18:05:12,561 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 152 [2018-10-14 18:05:12,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:05:12,562 INFO L481 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2018-10-14 18:05:12,562 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-14 18:05:12,562 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2018-10-14 18:05:12,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-10-14 18:05:12,563 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:05:12,563 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] [2018-10-14 18:05:12,563 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:05:12,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:05:12,563 INFO L82 PathProgramCache]: Analyzing trace with hash -791997083, now seen corresponding path program 38 times [2018-10-14 18:05:12,564 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:05:12,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:05:13,898 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:05:13,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:05:13,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-14 18:05:13,899 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-14 18:05:13,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-14 18:05:13,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=823, Invalid=899, Unknown=0, NotChecked=0, Total=1722 [2018-10-14 18:05:13,900 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 42 states. [2018-10-14 18:05:15,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:05:15,103 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2018-10-14 18:05:15,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-14 18:05:15,103 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 155 [2018-10-14 18:05:15,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:05:15,105 INFO L225 Difference]: With dead ends: 161 [2018-10-14 18:05:15,105 INFO L226 Difference]: Without dead ends: 161 [2018-10-14 18:05:15,106 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2419, Invalid=3901, Unknown=0, NotChecked=0, Total=6320 [2018-10-14 18:05:15,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-10-14 18:05:15,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2018-10-14 18:05:15,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-10-14 18:05:15,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2018-10-14 18:05:15,109 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 155 [2018-10-14 18:05:15,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:05:15,110 INFO L481 AbstractCegarLoop]: Abstraction has 159 states and 159 transitions. [2018-10-14 18:05:15,110 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-14 18:05:15,110 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 159 transitions. [2018-10-14 18:05:15,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-10-14 18:05:15,111 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:05:15,111 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] [2018-10-14 18:05:15,111 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:05:15,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:05:15,111 INFO L82 PathProgramCache]: Analyzing trace with hash 601414837, now seen corresponding path program 39 times [2018-10-14 18:05:15,112 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:05:15,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:05:16,039 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:05:16,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:05:16,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-14 18:05:16,040 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-14 18:05:16,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-14 18:05:16,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=864, Invalid=942, Unknown=0, NotChecked=0, Total=1806 [2018-10-14 18:05:16,041 INFO L87 Difference]: Start difference. First operand 159 states and 159 transitions. Second operand 43 states. [2018-10-14 18:05:18,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:05:18,322 INFO L93 Difference]: Finished difference Result 164 states and 164 transitions. [2018-10-14 18:05:18,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-14 18:05:18,323 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 158 [2018-10-14 18:05:18,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:05:18,324 INFO L225 Difference]: With dead ends: 164 [2018-10-14 18:05:18,324 INFO L226 Difference]: Without dead ends: 164 [2018-10-14 18:05:18,326 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2541, Invalid=4101, Unknown=0, NotChecked=0, Total=6642 [2018-10-14 18:05:18,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-10-14 18:05:18,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 162. [2018-10-14 18:05:18,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-10-14 18:05:18,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 162 transitions. [2018-10-14 18:05:18,330 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 162 transitions. Word has length 158 [2018-10-14 18:05:18,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:05:18,330 INFO L481 AbstractCegarLoop]: Abstraction has 162 states and 162 transitions. [2018-10-14 18:05:18,330 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-14 18:05:18,330 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2018-10-14 18:05:18,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-10-14 18:05:18,331 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:05:18,331 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] [2018-10-14 18:05:18,332 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:05:18,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:05:18,332 INFO L82 PathProgramCache]: Analyzing trace with hash 877007717, now seen corresponding path program 40 times [2018-10-14 18:05:18,333 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:05:18,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:05:19,276 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:05:19,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:05:19,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-14 18:05:19,277 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-14 18:05:19,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-14 18:05:19,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=906, Invalid=986, Unknown=0, NotChecked=0, Total=1892 [2018-10-14 18:05:19,278 INFO L87 Difference]: Start difference. First operand 162 states and 162 transitions. Second operand 44 states. [2018-10-14 18:05:20,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:05:20,690 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-10-14 18:05:20,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-14 18:05:20,690 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 161 [2018-10-14 18:05:20,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:05:20,691 INFO L225 Difference]: With dead ends: 167 [2018-10-14 18:05:20,691 INFO L226 Difference]: Without dead ends: 167 [2018-10-14 18:05:20,692 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:05:20,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-10-14 18:05:20,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2018-10-14 18:05:20,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-10-14 18:05:20,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-10-14 18:05:20,694 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 161 [2018-10-14 18:05:20,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:05:20,694 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-10-14 18:05:20,694 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-14 18:05:20,694 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-10-14 18:05:20,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-10-14 18:05:20,695 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:05:20,695 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] [2018-10-14 18:05:20,695 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:05:20,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:05:20,695 INFO L82 PathProgramCache]: Analyzing trace with hash -912974155, now seen corresponding path program 41 times [2018-10-14 18:05:20,696 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:05:20,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:05:21,704 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:05:21,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:05:21,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-14 18:05:21,705 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-14 18:05:21,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-14 18:05:21,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=949, Invalid=1031, Unknown=0, NotChecked=0, Total=1980 [2018-10-14 18:05:21,705 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 45 states. [2018-10-14 18:05:23,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:05:23,232 INFO L93 Difference]: Finished difference Result 170 states and 170 transitions. [2018-10-14 18:05:23,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-14 18:05:23,232 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 164 [2018-10-14 18:05:23,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:05:23,234 INFO L225 Difference]: With dead ends: 170 [2018-10-14 18:05:23,239 INFO L226 Difference]: Without dead ends: 170 [2018-10-14 18:05:23,240 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2794, Invalid=4516, Unknown=0, NotChecked=0, Total=7310 [2018-10-14 18:05:23,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-10-14 18:05:23,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 168. [2018-10-14 18:05:23,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-10-14 18:05:23,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 168 transitions. [2018-10-14 18:05:23,242 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 168 transitions. Word has length 164 [2018-10-14 18:05:23,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:05:23,243 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 168 transitions. [2018-10-14 18:05:23,243 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-14 18:05:23,243 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 168 transitions. [2018-10-14 18:05:23,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-10-14 18:05:23,244 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:05:23,244 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] [2018-10-14 18:05:23,244 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:05:23,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:05:23,244 INFO L82 PathProgramCache]: Analyzing trace with hash 51024229, now seen corresponding path program 42 times [2018-10-14 18:05:23,245 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:05:23,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:05:24,407 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:05:24,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:05:24,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-14 18:05:24,408 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-14 18:05:24,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-14 18:05:24,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=993, Invalid=1077, Unknown=0, NotChecked=0, Total=2070 [2018-10-14 18:05:24,409 INFO L87 Difference]: Start difference. First operand 168 states and 168 transitions. Second operand 46 states. [2018-10-14 18:05:25,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:05:25,918 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2018-10-14 18:05:25,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-14 18:05:25,919 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 167 [2018-10-14 18:05:25,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:05:25,920 INFO L225 Difference]: With dead ends: 173 [2018-10-14 18:05:25,920 INFO L226 Difference]: Without dead ends: 173 [2018-10-14 18:05:25,921 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2925, Invalid=4731, Unknown=0, NotChecked=0, Total=7656 [2018-10-14 18:05:25,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-10-14 18:05:25,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2018-10-14 18:05:25,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-10-14 18:05:25,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-10-14 18:05:25,924 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 167 [2018-10-14 18:05:25,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:05:25,925 INFO L481 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-10-14 18:05:25,925 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-14 18:05:25,925 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-10-14 18:05:25,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-14 18:05:25,926 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:05:25,926 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] [2018-10-14 18:05:25,926 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:05:25,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:05:25,926 INFO L82 PathProgramCache]: Analyzing trace with hash -1919426379, now seen corresponding path program 43 times [2018-10-14 18:05:25,927 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:05:25,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:05:26,930 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:05:26,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:05:26,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-14 18:05:26,931 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-14 18:05:26,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-14 18:05:26,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1038, Invalid=1124, Unknown=0, NotChecked=0, Total=2162 [2018-10-14 18:05:26,931 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 47 states. [2018-10-14 18:05:28,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:05:28,590 INFO L93 Difference]: Finished difference Result 176 states and 176 transitions. [2018-10-14 18:05:28,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-14 18:05:28,590 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 170 [2018-10-14 18:05:28,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:05:28,591 INFO L225 Difference]: With dead ends: 176 [2018-10-14 18:05:28,591 INFO L226 Difference]: Without dead ends: 176 [2018-10-14 18:05:28,592 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3059, Invalid=4951, Unknown=0, NotChecked=0, Total=8010 [2018-10-14 18:05:28,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-10-14 18:05:28,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 174. [2018-10-14 18:05:28,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-10-14 18:05:28,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 174 transitions. [2018-10-14 18:05:28,596 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 174 transitions. Word has length 170 [2018-10-14 18:05:28,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:05:28,596 INFO L481 AbstractCegarLoop]: Abstraction has 174 states and 174 transitions. [2018-10-14 18:05:28,596 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-14 18:05:28,596 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 174 transitions. [2018-10-14 18:05:28,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-10-14 18:05:28,597 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:05:28,597 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] [2018-10-14 18:05:28,598 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:05:28,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:05:28,598 INFO L82 PathProgramCache]: Analyzing trace with hash -487579, now seen corresponding path program 44 times [2018-10-14 18:05:28,598 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:05:28,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:05:29,683 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:05:29,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:05:29,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-14 18:05:29,683 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-14 18:05:29,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-14 18:05:29,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1084, Invalid=1172, Unknown=0, NotChecked=0, Total=2256 [2018-10-14 18:05:29,684 INFO L87 Difference]: Start difference. First operand 174 states and 174 transitions. Second operand 48 states. [2018-10-14 18:05:31,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:05:31,222 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-10-14 18:05:31,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-14 18:05:31,223 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 173 [2018-10-14 18:05:31,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:05:31,224 INFO L225 Difference]: With dead ends: 179 [2018-10-14 18:05:31,224 INFO L226 Difference]: Without dead ends: 179 [2018-10-14 18:05:31,224 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 990 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3196, Invalid=5176, Unknown=0, NotChecked=0, Total=8372 [2018-10-14 18:05:31,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-10-14 18:05:31,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2018-10-14 18:05:31,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-10-14 18:05:31,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-10-14 18:05:31,227 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 173 [2018-10-14 18:05:31,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:05:31,227 INFO L481 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-10-14 18:05:31,227 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-14 18:05:31,227 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-10-14 18:05:31,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-10-14 18:05:31,228 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:05:31,228 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] [2018-10-14 18:05:31,228 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:05:31,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:05:31,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1090593461, now seen corresponding path program 45 times [2018-10-14 18:05:31,229 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:05:31,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:05:32,344 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:05:32,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:05:32,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-14 18:05:32,345 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-14 18:05:32,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-14 18:05:32,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1131, Invalid=1221, Unknown=0, NotChecked=0, Total=2352 [2018-10-14 18:05:32,345 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 49 states. [2018-10-14 18:05:33,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:05:33,860 INFO L93 Difference]: Finished difference Result 182 states and 182 transitions. [2018-10-14 18:05:33,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-14 18:05:33,861 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 176 [2018-10-14 18:05:33,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:05:33,862 INFO L225 Difference]: With dead ends: 182 [2018-10-14 18:05:33,862 INFO L226 Difference]: Without dead ends: 182 [2018-10-14 18:05:33,863 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3336, Invalid=5406, Unknown=0, NotChecked=0, Total=8742 [2018-10-14 18:05:33,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-10-14 18:05:33,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2018-10-14 18:05:33,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-10-14 18:05:33,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 180 transitions. [2018-10-14 18:05:33,865 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 180 transitions. Word has length 176 [2018-10-14 18:05:33,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:05:33,865 INFO L481 AbstractCegarLoop]: Abstraction has 180 states and 180 transitions. [2018-10-14 18:05:33,865 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-14 18:05:33,865 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 180 transitions. [2018-10-14 18:05:33,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-14 18:05:33,866 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:05:33,866 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] [2018-10-14 18:05:33,866 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:05:33,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:05:33,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1173359973, now seen corresponding path program 46 times [2018-10-14 18:05:33,867 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:05:33,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:05:35,027 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:05:35,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:05:35,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-14 18:05:35,028 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-14 18:05:35,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-14 18:05:35,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1179, Invalid=1271, Unknown=0, NotChecked=0, Total=2450 [2018-10-14 18:05:35,029 INFO L87 Difference]: Start difference. First operand 180 states and 180 transitions. Second operand 50 states. [2018-10-14 18:05:36,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:05:36,608 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2018-10-14 18:05:36,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-14 18:05:36,609 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 179 [2018-10-14 18:05:36,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:05:36,610 INFO L225 Difference]: With dead ends: 185 [2018-10-14 18:05:36,610 INFO L226 Difference]: Without dead ends: 185 [2018-10-14 18:05:36,612 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1081 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3479, Invalid=5641, Unknown=0, NotChecked=0, Total=9120 [2018-10-14 18:05:36,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-10-14 18:05:36,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 183. [2018-10-14 18:05:36,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-10-14 18:05:36,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2018-10-14 18:05:36,615 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 179 [2018-10-14 18:05:36,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:05:36,615 INFO L481 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2018-10-14 18:05:36,615 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-14 18:05:36,615 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2018-10-14 18:05:36,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-14 18:05:36,616 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:05:36,616 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] [2018-10-14 18:05:36,617 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:05:36,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:05:36,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1559291061, now seen corresponding path program 47 times [2018-10-14 18:05:36,617 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:05:36,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:05:38,114 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:05:38,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:05:38,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-14 18:05:38,115 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-14 18:05:38,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-14 18:05:38,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1228, Invalid=1322, Unknown=0, NotChecked=0, Total=2550 [2018-10-14 18:05:38,116 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 51 states. [2018-10-14 18:05:39,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:05:39,796 INFO L93 Difference]: Finished difference Result 188 states and 188 transitions. [2018-10-14 18:05:39,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-14 18:05:39,797 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 182 [2018-10-14 18:05:39,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:05:39,798 INFO L225 Difference]: With dead ends: 188 [2018-10-14 18:05:39,798 INFO L226 Difference]: Without dead ends: 188 [2018-10-14 18:05:39,799 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3625, Invalid=5881, Unknown=0, NotChecked=0, Total=9506 [2018-10-14 18:05:39,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-10-14 18:05:39,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2018-10-14 18:05:39,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-10-14 18:05:39,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2018-10-14 18:05:39,803 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 182 [2018-10-14 18:05:39,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:05:39,803 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2018-10-14 18:05:39,803 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-14 18:05:39,803 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2018-10-14 18:05:39,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-10-14 18:05:39,804 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:05:39,804 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] [2018-10-14 18:05:39,805 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:05:39,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:05:39,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1204882277, now seen corresponding path program 48 times [2018-10-14 18:05:39,806 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:05:39,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:05:41,481 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:05:41,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:05:41,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-10-14 18:05:41,482 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-14 18:05:41,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-14 18:05:41,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1278, Invalid=1374, Unknown=0, NotChecked=0, Total=2652 [2018-10-14 18:05:41,483 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand 52 states. [2018-10-14 18:05:43,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:05:43,161 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-10-14 18:05:43,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-14 18:05:43,162 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 185 [2018-10-14 18:05:43,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:05:43,163 INFO L225 Difference]: With dead ends: 191 [2018-10-14 18:05:43,164 INFO L226 Difference]: Without dead ends: 191 [2018-10-14 18:05:43,165 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3774, Invalid=6126, Unknown=0, NotChecked=0, Total=9900 [2018-10-14 18:05:43,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-10-14 18:05:43,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 189. [2018-10-14 18:05:43,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-10-14 18:05:43,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2018-10-14 18:05:43,169 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 185 [2018-10-14 18:05:43,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:05:43,169 INFO L481 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2018-10-14 18:05:43,169 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-14 18:05:43,169 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2018-10-14 18:05:43,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-10-14 18:05:43,170 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:05:43,170 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] [2018-10-14 18:05:43,171 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:05:43,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:05:43,171 INFO L82 PathProgramCache]: Analyzing trace with hash 42411701, now seen corresponding path program 49 times [2018-10-14 18:05:43,171 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:05:43,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:05:44,542 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:05:44,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:05:44,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-14 18:05:44,543 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-14 18:05:44,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-14 18:05:44,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1329, Invalid=1427, Unknown=0, NotChecked=0, Total=2756 [2018-10-14 18:05:44,544 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 53 states. [2018-10-14 18:05:46,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:05:46,388 INFO L93 Difference]: Finished difference Result 194 states and 194 transitions. [2018-10-14 18:05:46,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-14 18:05:46,388 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 188 [2018-10-14 18:05:46,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:05:46,390 INFO L225 Difference]: With dead ends: 194 [2018-10-14 18:05:46,390 INFO L226 Difference]: Without dead ends: 194 [2018-10-14 18:05:46,391 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:05:46,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-10-14 18:05:46,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 192. [2018-10-14 18:05:46,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-10-14 18:05:46,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 192 transitions. [2018-10-14 18:05:46,393 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 192 transitions. Word has length 188 [2018-10-14 18:05:46,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:05:46,394 INFO L481 AbstractCegarLoop]: Abstraction has 192 states and 192 transitions. [2018-10-14 18:05:46,394 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-14 18:05:46,394 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 192 transitions. [2018-10-14 18:05:46,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-10-14 18:05:46,395 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:05:46,395 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] [2018-10-14 18:05:46,395 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:05:46,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:05:46,395 INFO L82 PathProgramCache]: Analyzing trace with hash -797210267, now seen corresponding path program 50 times [2018-10-14 18:05:46,396 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:05:46,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:05:47,855 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:05:47,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:05:47,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-10-14 18:05:47,856 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-14 18:05:47,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-14 18:05:47,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1381, Invalid=1481, Unknown=0, NotChecked=0, Total=2862 [2018-10-14 18:05:47,857 INFO L87 Difference]: Start difference. First operand 192 states and 192 transitions. Second operand 54 states. [2018-10-14 18:05:49,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:05:49,795 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2018-10-14 18:05:49,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-14 18:05:49,796 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 191 [2018-10-14 18:05:49,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:05:49,797 INFO L225 Difference]: With dead ends: 197 [2018-10-14 18:05:49,797 INFO L226 Difference]: Without dead ends: 197 [2018-10-14 18:05:49,798 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1275 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4081, Invalid=6631, Unknown=0, NotChecked=0, Total=10712 [2018-10-14 18:05:49,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-10-14 18:05:49,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2018-10-14 18:05:49,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-10-14 18:05:49,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 195 transitions. [2018-10-14 18:05:49,800 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 195 transitions. Word has length 191 [2018-10-14 18:05:49,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:05:49,800 INFO L481 AbstractCegarLoop]: Abstraction has 195 states and 195 transitions. [2018-10-14 18:05:49,800 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-14 18:05:49,801 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 195 transitions. [2018-10-14 18:05:49,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-10-14 18:05:49,802 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:05:49,802 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] [2018-10-14 18:05:49,802 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:05:49,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:05:49,802 INFO L82 PathProgramCache]: Analyzing trace with hash -85727051, now seen corresponding path program 51 times [2018-10-14 18:05:49,803 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:05:49,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:05:51,444 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:05:51,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:05:51,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-14 18:05:51,445 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-14 18:05:51,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-14 18:05:51,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1434, Invalid=1536, Unknown=0, NotChecked=0, Total=2970 [2018-10-14 18:05:51,446 INFO L87 Difference]: Start difference. First operand 195 states and 195 transitions. Second operand 55 states. [2018-10-14 18:05:53,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:05:53,426 INFO L93 Difference]: Finished difference Result 200 states and 200 transitions. [2018-10-14 18:05:53,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-14 18:05:53,426 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 194 [2018-10-14 18:05:53,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:05:53,427 INFO L225 Difference]: With dead ends: 200 [2018-10-14 18:05:53,428 INFO L226 Difference]: Without dead ends: 200 [2018-10-14 18:05:53,429 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1326 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4239, Invalid=6891, Unknown=0, NotChecked=0, Total=11130 [2018-10-14 18:05:53,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-10-14 18:05:53,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 198. [2018-10-14 18:05:53,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-10-14 18:05:53,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 198 transitions. [2018-10-14 18:05:53,432 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 198 transitions. Word has length 194 [2018-10-14 18:05:53,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:05:53,432 INFO L481 AbstractCegarLoop]: Abstraction has 198 states and 198 transitions. [2018-10-14 18:05:53,433 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-14 18:05:53,433 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 198 transitions. [2018-10-14 18:05:53,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-10-14 18:05:53,434 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:05:53,434 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] [2018-10-14 18:05:53,434 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:05:53,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:05:53,434 INFO L82 PathProgramCache]: Analyzing trace with hash 47155045, now seen corresponding path program 52 times [2018-10-14 18:05:53,435 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:05:53,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:05:54,990 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:05:54,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:05:54,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-10-14 18:05:54,990 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-14 18:05:54,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-14 18:05:54,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1488, Invalid=1592, Unknown=0, NotChecked=0, Total=3080 [2018-10-14 18:05:54,991 INFO L87 Difference]: Start difference. First operand 198 states and 198 transitions. Second operand 56 states. [2018-10-14 18:05:57,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:05:57,100 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2018-10-14 18:05:57,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-14 18:05:57,100 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 197 [2018-10-14 18:05:57,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:05:57,102 INFO L225 Difference]: With dead ends: 203 [2018-10-14 18:05:57,102 INFO L226 Difference]: Without dead ends: 203 [2018-10-14 18:05:57,103 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1378 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4400, Invalid=7156, Unknown=0, NotChecked=0, Total=11556 [2018-10-14 18:05:57,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-10-14 18:05:57,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 201. [2018-10-14 18:05:57,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-10-14 18:05:57,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2018-10-14 18:05:57,106 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 197 [2018-10-14 18:05:57,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:05:57,107 INFO L481 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2018-10-14 18:05:57,107 INFO L482 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-14 18:05:57,107 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2018-10-14 18:05:57,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-10-14 18:05:57,108 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:05:57,108 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] [2018-10-14 18:05:57,108 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:05:57,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:05:57,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1222169931, now seen corresponding path program 53 times [2018-10-14 18:05:57,109 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:05:57,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:05:58,617 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:05:58,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:05:58,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-14 18:05:58,618 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-14 18:05:58,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-14 18:05:58,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1543, Invalid=1649, Unknown=0, NotChecked=0, Total=3192 [2018-10-14 18:05:58,618 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 57 states. [2018-10-14 18:06:00,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:06:00,941 INFO L93 Difference]: Finished difference Result 206 states and 206 transitions. [2018-10-14 18:06:00,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-14 18:06:00,942 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 200 [2018-10-14 18:06:00,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:06:00,943 INFO L225 Difference]: With dead ends: 206 [2018-10-14 18:06:00,943 INFO L226 Difference]: Without dead ends: 206 [2018-10-14 18:06:00,943 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1431 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4564, Invalid=7426, Unknown=0, NotChecked=0, Total=11990 [2018-10-14 18:06:00,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-10-14 18:06:00,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 204. [2018-10-14 18:06:00,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-10-14 18:06:00,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 204 transitions. [2018-10-14 18:06:00,946 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 204 transitions. Word has length 200 [2018-10-14 18:06:00,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:06:00,947 INFO L481 AbstractCegarLoop]: Abstraction has 204 states and 204 transitions. [2018-10-14 18:06:00,947 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-14 18:06:00,947 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 204 transitions. [2018-10-14 18:06:00,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-10-14 18:06:00,948 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:06:00,948 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] [2018-10-14 18:06:00,948 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:06:00,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:06:00,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1504511333, now seen corresponding path program 54 times [2018-10-14 18:06:00,949 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:06:00,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:06:02,379 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:06:02,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:06:02,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-10-14 18:06:02,380 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-14 18:06:02,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-14 18:06:02,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1599, Invalid=1707, Unknown=0, NotChecked=0, Total=3306 [2018-10-14 18:06:02,381 INFO L87 Difference]: Start difference. First operand 204 states and 204 transitions. Second operand 58 states. [2018-10-14 18:06:04,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:06:04,548 INFO L93 Difference]: Finished difference Result 209 states and 209 transitions. [2018-10-14 18:06:04,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-14 18:06:04,548 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 203 [2018-10-14 18:06:04,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:06:04,549 INFO L225 Difference]: With dead ends: 209 [2018-10-14 18:06:04,549 INFO L226 Difference]: Without dead ends: 209 [2018-10-14 18:06:04,550 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1485 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4731, Invalid=7701, Unknown=0, NotChecked=0, Total=12432 [2018-10-14 18:06:04,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-10-14 18:06:04,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2018-10-14 18:06:04,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-10-14 18:06:04,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 207 transitions. [2018-10-14 18:06:04,552 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 207 transitions. Word has length 203 [2018-10-14 18:06:04,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:06:04,553 INFO L481 AbstractCegarLoop]: Abstraction has 207 states and 207 transitions. [2018-10-14 18:06:04,553 INFO L482 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-14 18:06:04,553 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 207 transitions. [2018-10-14 18:06:04,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-10-14 18:06:04,553 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:06:04,554 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] [2018-10-14 18:06:04,554 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:06:04,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:06:04,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1349577909, now seen corresponding path program 55 times [2018-10-14 18:06:04,555 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:06:04,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:06:06,444 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:06:06,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:06:06,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-14 18:06:06,445 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-14 18:06:06,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-14 18:06:06,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1656, Invalid=1766, Unknown=0, NotChecked=0, Total=3422 [2018-10-14 18:06:06,445 INFO L87 Difference]: Start difference. First operand 207 states and 207 transitions. Second operand 59 states. [2018-10-14 18:06:08,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:06:08,685 INFO L93 Difference]: Finished difference Result 212 states and 212 transitions. [2018-10-14 18:06:08,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-14 18:06:08,685 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 206 [2018-10-14 18:06:08,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:06:08,686 INFO L225 Difference]: With dead ends: 212 [2018-10-14 18:06:08,686 INFO L226 Difference]: Without dead ends: 212 [2018-10-14 18:06:08,687 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1540 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4901, Invalid=7981, Unknown=0, NotChecked=0, Total=12882 [2018-10-14 18:06:08,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-10-14 18:06:08,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 210. [2018-10-14 18:06:08,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-10-14 18:06:08,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 210 transitions. [2018-10-14 18:06:08,689 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 210 transitions. Word has length 206 [2018-10-14 18:06:08,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:06:08,689 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 210 transitions. [2018-10-14 18:06:08,690 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-14 18:06:08,690 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 210 transitions. [2018-10-14 18:06:08,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-10-14 18:06:08,690 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:06:08,691 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] [2018-10-14 18:06:08,691 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:06:08,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:06:08,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1477180571, now seen corresponding path program 56 times [2018-10-14 18:06:08,692 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:06:08,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:06:10,213 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:06:10,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:06:10,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-10-14 18:06:10,214 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-14 18:06:10,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-14 18:06:10,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1714, Invalid=1826, Unknown=0, NotChecked=0, Total=3540 [2018-10-14 18:06:10,215 INFO L87 Difference]: Start difference. First operand 210 states and 210 transitions. Second operand 60 states. [2018-10-14 18:06:12,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:06:12,639 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2018-10-14 18:06:12,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-14 18:06:12,640 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 209 [2018-10-14 18:06:12,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:06:12,641 INFO L225 Difference]: With dead ends: 215 [2018-10-14 18:06:12,641 INFO L226 Difference]: Without dead ends: 215 [2018-10-14 18:06:12,642 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1596 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5074, Invalid=8266, Unknown=0, NotChecked=0, Total=13340 [2018-10-14 18:06:12,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-10-14 18:06:12,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2018-10-14 18:06:12,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-10-14 18:06:12,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2018-10-14 18:06:12,645 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 209 [2018-10-14 18:06:12,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:06:12,645 INFO L481 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2018-10-14 18:06:12,645 INFO L482 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-14 18:06:12,645 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2018-10-14 18:06:12,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-10-14 18:06:12,646 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:06:12,646 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] [2018-10-14 18:06:12,646 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:06:12,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:06:12,646 INFO L82 PathProgramCache]: Analyzing trace with hash -2015285579, now seen corresponding path program 57 times [2018-10-14 18:06:12,647 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:06:12,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:06:14,666 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:06:14,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:06:14,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-14 18:06:14,667 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-14 18:06:14,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-14 18:06:14,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1773, Invalid=1887, Unknown=0, NotChecked=0, Total=3660 [2018-10-14 18:06:14,668 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 61 states. [2018-10-14 18:06:17,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:06:17,368 INFO L93 Difference]: Finished difference Result 218 states and 218 transitions. [2018-10-14 18:06:17,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-14 18:06:17,368 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 212 [2018-10-14 18:06:17,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:06:17,369 INFO L225 Difference]: With dead ends: 218 [2018-10-14 18:06:17,369 INFO L226 Difference]: Without dead ends: 218 [2018-10-14 18:06:17,370 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1653 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5250, Invalid=8556, Unknown=0, NotChecked=0, Total=13806 [2018-10-14 18:06:17,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-10-14 18:06:17,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 216. [2018-10-14 18:06:17,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-10-14 18:06:17,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 216 transitions. [2018-10-14 18:06:17,373 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 216 transitions. Word has length 212 [2018-10-14 18:06:17,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:06:17,373 INFO L481 AbstractCegarLoop]: Abstraction has 216 states and 216 transitions. [2018-10-14 18:06:17,374 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-14 18:06:17,374 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 216 transitions. [2018-10-14 18:06:17,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-10-14 18:06:17,375 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:06:17,375 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] [2018-10-14 18:06:17,375 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:06:17,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:06:17,376 INFO L82 PathProgramCache]: Analyzing trace with hash 411337061, now seen corresponding path program 58 times [2018-10-14 18:06:17,376 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:06:17,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:06:19,180 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:06:19,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:06:19,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-10-14 18:06:19,181 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-14 18:06:19,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-14 18:06:19,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1833, Invalid=1949, Unknown=0, NotChecked=0, Total=3782 [2018-10-14 18:06:19,182 INFO L87 Difference]: Start difference. First operand 216 states and 216 transitions. Second operand 62 states. [2018-10-14 18:06:21,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:06:21,930 INFO L93 Difference]: Finished difference Result 221 states and 221 transitions. [2018-10-14 18:06:21,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-14 18:06:21,930 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 215 [2018-10-14 18:06:21,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:06:21,931 INFO L225 Difference]: With dead ends: 221 [2018-10-14 18:06:21,931 INFO L226 Difference]: Without dead ends: 221 [2018-10-14 18:06:21,932 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1711 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5429, Invalid=8851, Unknown=0, NotChecked=0, Total=14280 [2018-10-14 18:06:21,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-10-14 18:06:21,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 219. [2018-10-14 18:06:21,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-10-14 18:06:21,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 219 transitions. [2018-10-14 18:06:21,935 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 219 transitions. Word has length 215 [2018-10-14 18:06:21,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:06:21,935 INFO L481 AbstractCegarLoop]: Abstraction has 219 states and 219 transitions. [2018-10-14 18:06:21,935 INFO L482 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-14 18:06:21,936 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 219 transitions. [2018-10-14 18:06:21,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-10-14 18:06:21,937 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:06:21,937 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] [2018-10-14 18:06:21,937 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:06:21,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:06:21,938 INFO L82 PathProgramCache]: Analyzing trace with hash -963120971, now seen corresponding path program 59 times [2018-10-14 18:06:21,938 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:06:21,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:06:23,686 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:06:23,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:06:23,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-14 18:06:23,687 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-14 18:06:23,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-14 18:06:23,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1894, Invalid=2012, Unknown=0, NotChecked=0, Total=3906 [2018-10-14 18:06:23,688 INFO L87 Difference]: Start difference. First operand 219 states and 219 transitions. Second operand 63 states. [2018-10-14 18:06:26,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:06:26,533 INFO L93 Difference]: Finished difference Result 224 states and 224 transitions. [2018-10-14 18:06:26,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-14 18:06:26,534 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 218 [2018-10-14 18:06:26,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:06:26,535 INFO L225 Difference]: With dead ends: 224 [2018-10-14 18:06:26,535 INFO L226 Difference]: Without dead ends: 224 [2018-10-14 18:06:26,536 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:06:26,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-10-14 18:06:26,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 222. [2018-10-14 18:06:26,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-10-14 18:06:26,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 222 transitions. [2018-10-14 18:06:26,538 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 222 transitions. Word has length 218 [2018-10-14 18:06:26,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:06:26,538 INFO L481 AbstractCegarLoop]: Abstraction has 222 states and 222 transitions. [2018-10-14 18:06:26,538 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-14 18:06:26,538 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 222 transitions. [2018-10-14 18:06:26,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-10-14 18:06:26,539 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:06:26,540 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] [2018-10-14 18:06:26,540 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:06:26,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:06:26,540 INFO L82 PathProgramCache]: Analyzing trace with hash 775847781, now seen corresponding path program 60 times [2018-10-14 18:06:26,541 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:06:26,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:06:28,258 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:06:28,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:06:28,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-10-14 18:06:28,259 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-14 18:06:28,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-14 18:06:28,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1956, Invalid=2076, Unknown=0, NotChecked=0, Total=4032 [2018-10-14 18:06:28,260 INFO L87 Difference]: Start difference. First operand 222 states and 222 transitions. Second operand 64 states. [2018-10-14 18:06:30,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:06:30,794 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2018-10-14 18:06:30,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-14 18:06:30,795 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 221 [2018-10-14 18:06:30,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:06:30,796 INFO L225 Difference]: With dead ends: 227 [2018-10-14 18:06:30,796 INFO L226 Difference]: Without dead ends: 227 [2018-10-14 18:06:30,796 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1830 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5796, Invalid=9456, Unknown=0, NotChecked=0, Total=15252 [2018-10-14 18:06:30,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-10-14 18:06:30,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 225. [2018-10-14 18:06:30,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-10-14 18:06:30,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions. [2018-10-14 18:06:30,799 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 221 [2018-10-14 18:06:30,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:06:30,799 INFO L481 AbstractCegarLoop]: Abstraction has 225 states and 225 transitions. [2018-10-14 18:06:30,799 INFO L482 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-14 18:06:30,799 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 225 transitions. [2018-10-14 18:06:30,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-10-14 18:06:30,800 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:06:30,801 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] [2018-10-14 18:06:30,801 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:06:30,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:06:30,801 INFO L82 PathProgramCache]: Analyzing trace with hash 498414261, now seen corresponding path program 61 times [2018-10-14 18:06:30,802 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:06:30,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:06:32,917 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:06:32,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:06:32,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-14 18:06:32,918 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-14 18:06:32,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-14 18:06:32,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2019, Invalid=2141, Unknown=0, NotChecked=0, Total=4160 [2018-10-14 18:06:32,919 INFO L87 Difference]: Start difference. First operand 225 states and 225 transitions. Second operand 65 states. [2018-10-14 18:06:35,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:06:35,517 INFO L93 Difference]: Finished difference Result 230 states and 230 transitions. [2018-10-14 18:06:35,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-14 18:06:35,517 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 224 [2018-10-14 18:06:35,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:06:35,518 INFO L225 Difference]: With dead ends: 230 [2018-10-14 18:06:35,518 INFO L226 Difference]: Without dead ends: 230 [2018-10-14 18:06:35,519 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:06:35,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-10-14 18:06:35,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 228. [2018-10-14 18:06:35,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-10-14 18:06:35,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 228 transitions. [2018-10-14 18:06:35,522 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 228 transitions. Word has length 224 [2018-10-14 18:06:35,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:06:35,522 INFO L481 AbstractCegarLoop]: Abstraction has 228 states and 228 transitions. [2018-10-14 18:06:35,522 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-14 18:06:35,522 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 228 transitions. [2018-10-14 18:06:35,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-10-14 18:06:35,523 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:06:35,523 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] [2018-10-14 18:06:35,523 INFO L424 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:06:35,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:06:35,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1006502555, now seen corresponding path program 62 times [2018-10-14 18:06:35,524 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:06:35,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:06:37,456 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:06:37,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:06:37,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-10-14 18:06:37,456 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-14 18:06:37,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-14 18:06:37,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2083, Invalid=2207, Unknown=0, NotChecked=0, Total=4290 [2018-10-14 18:06:37,458 INFO L87 Difference]: Start difference. First operand 228 states and 228 transitions. Second operand 66 states. [2018-10-14 18:06:40,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:06:40,154 INFO L93 Difference]: Finished difference Result 233 states and 233 transitions. [2018-10-14 18:06:40,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-14 18:06:40,154 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 227 [2018-10-14 18:06:40,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:06:40,155 INFO L225 Difference]: With dead ends: 233 [2018-10-14 18:06:40,155 INFO L226 Difference]: Without dead ends: 233 [2018-10-14 18:06:40,155 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1953 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=6175, Invalid=10081, Unknown=0, NotChecked=0, Total=16256 [2018-10-14 18:06:40,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-10-14 18:06:40,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 231. [2018-10-14 18:06:40,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-10-14 18:06:40,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 231 transitions. [2018-10-14 18:06:40,159 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 231 transitions. Word has length 227 [2018-10-14 18:06:40,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:06:40,159 INFO L481 AbstractCegarLoop]: Abstraction has 231 states and 231 transitions. [2018-10-14 18:06:40,159 INFO L482 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-14 18:06:40,159 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 231 transitions. [2018-10-14 18:06:40,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-10-14 18:06:40,161 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:06:40,161 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] [2018-10-14 18:06:40,161 INFO L424 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:06:40,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:06:40,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1180234933, now seen corresponding path program 63 times [2018-10-14 18:06:40,162 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:06:40,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:06:42,372 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:06:42,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:06:42,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-14 18:06:42,373 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-14 18:06:42,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-14 18:06:42,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2148, Invalid=2274, Unknown=0, NotChecked=0, Total=4422 [2018-10-14 18:06:42,374 INFO L87 Difference]: Start difference. First operand 231 states and 231 transitions. Second operand 67 states. [2018-10-14 18:06:45,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:06:45,185 INFO L93 Difference]: Finished difference Result 236 states and 236 transitions. [2018-10-14 18:06:45,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-14 18:06:45,185 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 230 [2018-10-14 18:06:45,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:06:45,186 INFO L225 Difference]: With dead ends: 236 [2018-10-14 18:06:45,186 INFO L226 Difference]: Without dead ends: 236 [2018-10-14 18:06:45,188 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6369, Invalid=10401, Unknown=0, NotChecked=0, Total=16770 [2018-10-14 18:06:45,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-10-14 18:06:45,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 234. [2018-10-14 18:06:45,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-10-14 18:06:45,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 234 transitions. [2018-10-14 18:06:45,191 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 234 transitions. Word has length 230 [2018-10-14 18:06:45,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:06:45,191 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 234 transitions. [2018-10-14 18:06:45,191 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-14 18:06:45,191 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 234 transitions. [2018-10-14 18:06:45,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-10-14 18:06:45,193 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:06:45,193 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] [2018-10-14 18:06:45,193 INFO L424 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:06:45,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:06:45,193 INFO L82 PathProgramCache]: Analyzing trace with hash 212794213, now seen corresponding path program 64 times [2018-10-14 18:06:45,194 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:06:45,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:06:47,455 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:06:47,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:06:47,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-10-14 18:06:47,456 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-14 18:06:47,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-14 18:06:47,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2214, Invalid=2342, Unknown=0, NotChecked=0, Total=4556 [2018-10-14 18:06:47,457 INFO L87 Difference]: Start difference. First operand 234 states and 234 transitions. Second operand 68 states. [2018-10-14 18:06:50,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:06:50,390 INFO L93 Difference]: Finished difference Result 239 states and 239 transitions. [2018-10-14 18:06:50,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-14 18:06:50,390 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 233 [2018-10-14 18:06:50,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:06:50,391 INFO L225 Difference]: With dead ends: 239 [2018-10-14 18:06:50,391 INFO L226 Difference]: Without dead ends: 239 [2018-10-14 18:06:50,392 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:06:50,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-10-14 18:06:50,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 237. [2018-10-14 18:06:50,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-10-14 18:06:50,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2018-10-14 18:06:50,395 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 233 [2018-10-14 18:06:50,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:06:50,395 INFO L481 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2018-10-14 18:06:50,395 INFO L482 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-14 18:06:50,396 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2018-10-14 18:06:50,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-10-14 18:06:50,397 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:06:50,397 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] [2018-10-14 18:06:50,397 INFO L424 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:06:50,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:06:50,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1583139147, now seen corresponding path program 65 times [2018-10-14 18:06:50,398 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:06:50,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:06:52,694 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:06:52,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:06:52,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-14 18:06:52,694 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-14 18:06:52,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-14 18:06:52,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2281, Invalid=2411, Unknown=0, NotChecked=0, Total=4692 [2018-10-14 18:06:52,695 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 69 states. [2018-10-14 18:06:55,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:06:55,662 INFO L93 Difference]: Finished difference Result 242 states and 242 transitions. [2018-10-14 18:06:55,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-14 18:06:55,662 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 236 [2018-10-14 18:06:55,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:06:55,663 INFO L225 Difference]: With dead ends: 242 [2018-10-14 18:06:55,663 INFO L226 Difference]: Without dead ends: 242 [2018-10-14 18:06:55,665 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2145 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6766, Invalid=11056, Unknown=0, NotChecked=0, Total=17822 [2018-10-14 18:06:55,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-10-14 18:06:55,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 240. [2018-10-14 18:06:55,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-10-14 18:06:55,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 240 transitions. [2018-10-14 18:06:55,668 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 240 transitions. Word has length 236 [2018-10-14 18:06:55,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:06:55,668 INFO L481 AbstractCegarLoop]: Abstraction has 240 states and 240 transitions. [2018-10-14 18:06:55,668 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-14 18:06:55,668 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 240 transitions. [2018-10-14 18:06:55,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-10-14 18:06:55,669 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:06:55,670 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] [2018-10-14 18:06:55,670 INFO L424 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:06:55,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:06:55,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1826260635, now seen corresponding path program 66 times [2018-10-14 18:06:55,671 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:06:55,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:06:57,962 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:06:57,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:06:57,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-10-14 18:06:57,963 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-10-14 18:06:57,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-10-14 18:06:57,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2349, Invalid=2481, Unknown=0, NotChecked=0, Total=4830 [2018-10-14 18:06:57,964 INFO L87 Difference]: Start difference. First operand 240 states and 240 transitions. Second operand 70 states. [2018-10-14 18:07:01,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:07:01,034 INFO L93 Difference]: Finished difference Result 245 states and 245 transitions. [2018-10-14 18:07:01,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-14 18:07:01,035 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 239 [2018-10-14 18:07:01,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:07:01,036 INFO L225 Difference]: With dead ends: 245 [2018-10-14 18:07:01,036 INFO L226 Difference]: Without dead ends: 245 [2018-10-14 18:07:01,037 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2211 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6969, Invalid=11391, Unknown=0, NotChecked=0, Total=18360 [2018-10-14 18:07:01,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-10-14 18:07:01,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 243. [2018-10-14 18:07:01,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-10-14 18:07:01,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 243 transitions. [2018-10-14 18:07:01,039 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 243 transitions. Word has length 239 [2018-10-14 18:07:01,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:07:01,040 INFO L481 AbstractCegarLoop]: Abstraction has 243 states and 243 transitions. [2018-10-14 18:07:01,040 INFO L482 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-10-14 18:07:01,040 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 243 transitions. [2018-10-14 18:07:01,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-10-14 18:07:01,041 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:07:01,041 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] [2018-10-14 18:07:01,041 INFO L424 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:07:01,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:07:01,042 INFO L82 PathProgramCache]: Analyzing trace with hash 951318709, now seen corresponding path program 67 times [2018-10-14 18:07:01,042 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:07:01,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:07:03,413 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:07:03,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:07:03,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-14 18:07:03,414 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-14 18:07:03,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-14 18:07:03,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2418, Invalid=2552, Unknown=0, NotChecked=0, Total=4970 [2018-10-14 18:07:03,415 INFO L87 Difference]: Start difference. First operand 243 states and 243 transitions. Second operand 71 states. [2018-10-14 18:07:06,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:07:06,598 INFO L93 Difference]: Finished difference Result 248 states and 248 transitions. [2018-10-14 18:07:06,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-14 18:07:06,598 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 242 [2018-10-14 18:07:06,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:07:06,599 INFO L225 Difference]: With dead ends: 248 [2018-10-14 18:07:06,600 INFO L226 Difference]: Without dead ends: 248 [2018-10-14 18:07:06,601 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2278 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=7175, Invalid=11731, Unknown=0, NotChecked=0, Total=18906 [2018-10-14 18:07:06,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-10-14 18:07:06,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 246. [2018-10-14 18:07:06,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-10-14 18:07:06,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 246 transitions. [2018-10-14 18:07:06,604 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 246 transitions. Word has length 242 [2018-10-14 18:07:06,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:07:06,604 INFO L481 AbstractCegarLoop]: Abstraction has 246 states and 246 transitions. [2018-10-14 18:07:06,604 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-14 18:07:06,604 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 246 transitions. [2018-10-14 18:07:06,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-10-14 18:07:06,605 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:07:06,606 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] [2018-10-14 18:07:06,606 INFO L424 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:07:06,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:07:06,606 INFO L82 PathProgramCache]: Analyzing trace with hash 977631077, now seen corresponding path program 68 times [2018-10-14 18:07:06,607 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:07:06,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:07:09,016 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:07:09,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:07:09,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-10-14 18:07:09,017 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-14 18:07:09,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-14 18:07:09,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2488, Invalid=2624, Unknown=0, NotChecked=0, Total=5112 [2018-10-14 18:07:09,019 INFO L87 Difference]: Start difference. First operand 246 states and 246 transitions. Second operand 72 states. [2018-10-14 18:07:12,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:07:12,375 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2018-10-14 18:07:12,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-14 18:07:12,376 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 245 [2018-10-14 18:07:12,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:07:12,377 INFO L225 Difference]: With dead ends: 251 [2018-10-14 18:07:12,377 INFO L226 Difference]: Without dead ends: 251 [2018-10-14 18:07:12,378 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2346 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7384, Invalid=12076, Unknown=0, NotChecked=0, Total=19460 [2018-10-14 18:07:12,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-10-14 18:07:12,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 249. [2018-10-14 18:07:12,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-10-14 18:07:12,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions. [2018-10-14 18:07:12,380 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 245 [2018-10-14 18:07:12,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:07:12,380 INFO L481 AbstractCegarLoop]: Abstraction has 249 states and 249 transitions. [2018-10-14 18:07:12,380 INFO L482 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-14 18:07:12,380 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 249 transitions. [2018-10-14 18:07:12,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-10-14 18:07:12,381 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:07:12,381 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] [2018-10-14 18:07:12,381 INFO L424 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:07:12,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:07:12,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1129629003, now seen corresponding path program 69 times [2018-10-14 18:07:12,382 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:07:12,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:07:14,713 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:07:14,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:07:14,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-14 18:07:14,714 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-14 18:07:14,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-14 18:07:14,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2559, Invalid=2697, Unknown=0, NotChecked=0, Total=5256 [2018-10-14 18:07:14,715 INFO L87 Difference]: Start difference. First operand 249 states and 249 transitions. Second operand 73 states. [2018-10-14 18:07:18,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:07:18,244 INFO L93 Difference]: Finished difference Result 254 states and 254 transitions. [2018-10-14 18:07:18,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-14 18:07:18,245 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 248 [2018-10-14 18:07:18,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:07:18,246 INFO L225 Difference]: With dead ends: 254 [2018-10-14 18:07:18,246 INFO L226 Difference]: Without dead ends: 254 [2018-10-14 18:07:18,247 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:07:18,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-10-14 18:07:18,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 252. [2018-10-14 18:07:18,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-10-14 18:07:18,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 252 transitions. [2018-10-14 18:07:18,249 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 252 transitions. Word has length 248 [2018-10-14 18:07:18,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:07:18,249 INFO L481 AbstractCegarLoop]: Abstraction has 252 states and 252 transitions. [2018-10-14 18:07:18,249 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-14 18:07:18,250 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 252 transitions. [2018-10-14 18:07:18,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2018-10-14 18:07:18,250 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:07:18,251 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] [2018-10-14 18:07:18,251 INFO L424 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:07:18,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:07:18,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1022293349, now seen corresponding path program 70 times [2018-10-14 18:07:18,251 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:07:18,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:07:20,493 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:07:20,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:07:20,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-10-14 18:07:20,494 INFO L460 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-10-14 18:07:20,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-10-14 18:07:20,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2631, Invalid=2771, Unknown=0, NotChecked=0, Total=5402 [2018-10-14 18:07:20,495 INFO L87 Difference]: Start difference. First operand 252 states and 252 transitions. Second operand 74 states. [2018-10-14 18:07:24,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:07:24,046 INFO L93 Difference]: Finished difference Result 257 states and 257 transitions. [2018-10-14 18:07:24,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-14 18:07:24,046 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 251 [2018-10-14 18:07:24,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:07:24,047 INFO L225 Difference]: With dead ends: 257 [2018-10-14 18:07:24,047 INFO L226 Difference]: Without dead ends: 257 [2018-10-14 18:07:24,049 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2485 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7811, Invalid=12781, Unknown=0, NotChecked=0, Total=20592 [2018-10-14 18:07:24,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-10-14 18:07:24,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 255. [2018-10-14 18:07:24,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-10-14 18:07:24,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 255 transitions. [2018-10-14 18:07:24,052 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 255 transitions. Word has length 251 [2018-10-14 18:07:24,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:07:24,052 INFO L481 AbstractCegarLoop]: Abstraction has 255 states and 255 transitions. [2018-10-14 18:07:24,052 INFO L482 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-10-14 18:07:24,052 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 255 transitions. [2018-10-14 18:07:24,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-10-14 18:07:24,053 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:07:24,054 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] [2018-10-14 18:07:24,054 INFO L424 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:07:24,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:07:24,054 INFO L82 PathProgramCache]: Analyzing trace with hash -2035745611, now seen corresponding path program 71 times [2018-10-14 18:07:24,055 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:07:24,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:07:26,405 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:07:26,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:07:26,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-14 18:07:26,406 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-14 18:07:26,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-14 18:07:26,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2704, Invalid=2846, Unknown=0, NotChecked=0, Total=5550 [2018-10-14 18:07:26,407 INFO L87 Difference]: Start difference. First operand 255 states and 255 transitions. Second operand 75 states. [2018-10-14 18:07:30,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:07:30,251 INFO L93 Difference]: Finished difference Result 260 states and 260 transitions. [2018-10-14 18:07:30,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-14 18:07:30,251 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 254 [2018-10-14 18:07:30,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:07:30,253 INFO L225 Difference]: With dead ends: 260 [2018-10-14 18:07:30,253 INFO L226 Difference]: Without dead ends: 260 [2018-10-14 18:07:30,254 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2556 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=8029, Invalid=13141, Unknown=0, NotChecked=0, Total=21170 [2018-10-14 18:07:30,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-10-14 18:07:30,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 258. [2018-10-14 18:07:30,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-10-14 18:07:30,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 258 transitions. [2018-10-14 18:07:30,257 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 258 transitions. Word has length 254 [2018-10-14 18:07:30,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:07:30,257 INFO L481 AbstractCegarLoop]: Abstraction has 258 states and 258 transitions. [2018-10-14 18:07:30,257 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-14 18:07:30,258 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 258 transitions. [2018-10-14 18:07:30,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-10-14 18:07:30,259 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:07:30,259 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] [2018-10-14 18:07:30,259 INFO L424 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:07:30,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:07:30,260 INFO L82 PathProgramCache]: Analyzing trace with hash 771879781, now seen corresponding path program 72 times [2018-10-14 18:07:30,260 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:07:30,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:07:33,131 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:07:33,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:07:33,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-10-14 18:07:33,132 INFO L460 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-10-14 18:07:33,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-10-14 18:07:33,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2778, Invalid=2922, Unknown=0, NotChecked=0, Total=5700 [2018-10-14 18:07:33,133 INFO L87 Difference]: Start difference. First operand 258 states and 258 transitions. Second operand 76 states. [2018-10-14 18:07:36,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:07:36,741 INFO L93 Difference]: Finished difference Result 263 states and 263 transitions. [2018-10-14 18:07:36,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-14 18:07:36,741 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 257 [2018-10-14 18:07:36,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:07:36,743 INFO L225 Difference]: With dead ends: 263 [2018-10-14 18:07:36,743 INFO L226 Difference]: Without dead ends: 263 [2018-10-14 18:07:36,744 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2628 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=8250, Invalid=13506, Unknown=0, NotChecked=0, Total=21756 [2018-10-14 18:07:36,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-10-14 18:07:36,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 261. [2018-10-14 18:07:36,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-10-14 18:07:36,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2018-10-14 18:07:36,746 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 257 [2018-10-14 18:07:36,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:07:36,747 INFO L481 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2018-10-14 18:07:36,747 INFO L482 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-10-14 18:07:36,747 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2018-10-14 18:07:36,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-10-14 18:07:36,748 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:07:36,748 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] [2018-10-14 18:07:36,748 INFO L424 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:07:36,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:07:36,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1748156747, now seen corresponding path program 73 times [2018-10-14 18:07:36,749 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:07:36,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:07:39,426 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:07:39,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:07:39,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-10-14 18:07:39,427 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-14 18:07:39,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-14 18:07:39,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2853, Invalid=2999, Unknown=0, NotChecked=0, Total=5852 [2018-10-14 18:07:39,428 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 77 states. [2018-10-14 18:07:43,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:07:43,232 INFO L93 Difference]: Finished difference Result 266 states and 266 transitions. [2018-10-14 18:07:43,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-14 18:07:43,232 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 260 [2018-10-14 18:07:43,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:07:43,233 INFO L225 Difference]: With dead ends: 266 [2018-10-14 18:07:43,233 INFO L226 Difference]: Without dead ends: 266 [2018-10-14 18:07:43,235 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2701 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=8474, Invalid=13876, Unknown=0, NotChecked=0, Total=22350 [2018-10-14 18:07:43,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-10-14 18:07:43,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 264. [2018-10-14 18:07:43,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-10-14 18:07:43,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 264 transitions. [2018-10-14 18:07:43,237 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 264 transitions. Word has length 260 [2018-10-14 18:07:43,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:07:43,237 INFO L481 AbstractCegarLoop]: Abstraction has 264 states and 264 transitions. [2018-10-14 18:07:43,237 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-14 18:07:43,237 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 264 transitions. [2018-10-14 18:07:43,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-10-14 18:07:43,238 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:07:43,238 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] [2018-10-14 18:07:43,238 INFO L424 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:07:43,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:07:43,239 INFO L82 PathProgramCache]: Analyzing trace with hash -128028315, now seen corresponding path program 74 times [2018-10-14 18:07:43,239 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:07:43,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:07:46,206 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:07:46,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:07:46,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-10-14 18:07:46,207 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-14 18:07:46,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-14 18:07:46,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2929, Invalid=3077, Unknown=0, NotChecked=0, Total=6006 [2018-10-14 18:07:46,208 INFO L87 Difference]: Start difference. First operand 264 states and 264 transitions. Second operand 78 states. [2018-10-14 18:07:50,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:07:50,194 INFO L93 Difference]: Finished difference Result 269 states and 269 transitions. [2018-10-14 18:07:50,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-14 18:07:50,194 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 263 [2018-10-14 18:07:50,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:07:50,195 INFO L225 Difference]: With dead ends: 269 [2018-10-14 18:07:50,195 INFO L226 Difference]: Without dead ends: 269 [2018-10-14 18:07:50,196 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2775 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=8701, Invalid=14251, Unknown=0, NotChecked=0, Total=22952 [2018-10-14 18:07:50,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-10-14 18:07:50,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 267. [2018-10-14 18:07:50,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-10-14 18:07:50,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 267 transitions. [2018-10-14 18:07:50,198 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 267 transitions. Word has length 263 [2018-10-14 18:07:50,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:07:50,199 INFO L481 AbstractCegarLoop]: Abstraction has 267 states and 267 transitions. [2018-10-14 18:07:50,199 INFO L482 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-14 18:07:50,199 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 267 transitions. [2018-10-14 18:07:50,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-10-14 18:07:50,200 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:07:50,200 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] [2018-10-14 18:07:50,200 INFO L424 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:07:50,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:07:50,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1724383051, now seen corresponding path program 75 times [2018-10-14 18:07:50,201 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:07:50,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:07:52,786 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:07:52,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:07:52,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-10-14 18:07:52,787 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-14 18:07:52,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-14 18:07:52,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3006, Invalid=3156, Unknown=0, NotChecked=0, Total=6162 [2018-10-14 18:07:52,788 INFO L87 Difference]: Start difference. First operand 267 states and 267 transitions. Second operand 79 states. [2018-10-14 18:07:56,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:07:56,681 INFO L93 Difference]: Finished difference Result 272 states and 272 transitions. [2018-10-14 18:07:56,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-14 18:07:56,681 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 266 [2018-10-14 18:07:56,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:07:56,683 INFO L225 Difference]: With dead ends: 272 [2018-10-14 18:07:56,683 INFO L226 Difference]: Without dead ends: 272 [2018-10-14 18:07:56,686 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2850 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=8931, Invalid=14631, Unknown=0, NotChecked=0, Total=23562 [2018-10-14 18:07:56,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-10-14 18:07:56,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 270. [2018-10-14 18:07:56,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-10-14 18:07:56,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 270 transitions. [2018-10-14 18:07:56,688 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 270 transitions. Word has length 266 [2018-10-14 18:07:56,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:07:56,689 INFO L481 AbstractCegarLoop]: Abstraction has 270 states and 270 transitions. [2018-10-14 18:07:56,689 INFO L482 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-14 18:07:56,689 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 270 transitions. [2018-10-14 18:07:56,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-10-14 18:07:56,690 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:07:56,690 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] [2018-10-14 18:07:56,690 INFO L424 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:07:56,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:07:56,690 INFO L82 PathProgramCache]: Analyzing trace with hash -555454619, now seen corresponding path program 76 times [2018-10-14 18:07:56,691 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:07:56,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:07:59,671 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:07:59,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:07:59,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-10-14 18:07:59,672 INFO L460 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-10-14 18:07:59,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-10-14 18:07:59,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3084, Invalid=3236, Unknown=0, NotChecked=0, Total=6320 [2018-10-14 18:07:59,673 INFO L87 Difference]: Start difference. First operand 270 states and 270 transitions. Second operand 80 states. [2018-10-14 18:08:03,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:08:03,889 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2018-10-14 18:08:03,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-14 18:08:03,889 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 269 [2018-10-14 18:08:03,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:08:03,890 INFO L225 Difference]: With dead ends: 275 [2018-10-14 18:08:03,891 INFO L226 Difference]: Without dead ends: 275 [2018-10-14 18:08:03,892 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2926 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=9164, Invalid=15016, Unknown=0, NotChecked=0, Total=24180 [2018-10-14 18:08:03,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-10-14 18:08:03,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 273. [2018-10-14 18:08:03,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-10-14 18:08:03,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions. [2018-10-14 18:08:03,895 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 269 [2018-10-14 18:08:03,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:08:03,895 INFO L481 AbstractCegarLoop]: Abstraction has 273 states and 273 transitions. [2018-10-14 18:08:03,896 INFO L482 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-10-14 18:08:03,896 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 273 transitions. [2018-10-14 18:08:03,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-10-14 18:08:03,896 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:08:03,897 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] [2018-10-14 18:08:03,897 INFO L424 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:08:03,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:08:03,897 INFO L82 PathProgramCache]: Analyzing trace with hash -603372875, now seen corresponding path program 77 times [2018-10-14 18:08:03,898 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:08:03,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:08:06,693 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:08:06,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:08:06,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-14 18:08:06,694 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-14 18:08:06,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-14 18:08:06,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3163, Invalid=3317, Unknown=0, NotChecked=0, Total=6480 [2018-10-14 18:08:06,696 INFO L87 Difference]: Start difference. First operand 273 states and 273 transitions. Second operand 81 states. [2018-10-14 18:08:10,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:08:10,999 INFO L93 Difference]: Finished difference Result 278 states and 278 transitions. [2018-10-14 18:08:10,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-14 18:08:10,999 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 272 [2018-10-14 18:08:10,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:08:11,000 INFO L225 Difference]: With dead ends: 278 [2018-10-14 18:08:11,000 INFO L226 Difference]: Without dead ends: 278 [2018-10-14 18:08:11,002 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3003 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=9400, Invalid=15406, Unknown=0, NotChecked=0, Total=24806 [2018-10-14 18:08:11,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-10-14 18:08:11,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 276. [2018-10-14 18:08:11,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-10-14 18:08:11,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 276 transitions. [2018-10-14 18:08:11,004 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 276 transitions. Word has length 272 [2018-10-14 18:08:11,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:08:11,004 INFO L481 AbstractCegarLoop]: Abstraction has 276 states and 276 transitions. [2018-10-14 18:08:11,004 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-14 18:08:11,004 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 276 transitions. [2018-10-14 18:08:11,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-10-14 18:08:11,005 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:08:11,006 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] [2018-10-14 18:08:11,006 INFO L424 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:08:11,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:08:11,006 INFO L82 PathProgramCache]: Analyzing trace with hash 2087972197, now seen corresponding path program 78 times [2018-10-14 18:08:11,006 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:08:11,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:08:14,090 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:08:14,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:08:14,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-10-14 18:08:14,091 INFO L460 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-10-14 18:08:14,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-10-14 18:08:14,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3243, Invalid=3399, Unknown=0, NotChecked=0, Total=6642 [2018-10-14 18:08:14,092 INFO L87 Difference]: Start difference. First operand 276 states and 276 transitions. Second operand 82 states. [2018-10-14 18:08:18,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:08:18,215 INFO L93 Difference]: Finished difference Result 281 states and 281 transitions. [2018-10-14 18:08:18,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-14 18:08:18,216 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 275 [2018-10-14 18:08:18,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:08:18,217 INFO L225 Difference]: With dead ends: 281 [2018-10-14 18:08:18,217 INFO L226 Difference]: Without dead ends: 281 [2018-10-14 18:08:18,218 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3081 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=9639, Invalid=15801, Unknown=0, NotChecked=0, Total=25440 [2018-10-14 18:08:18,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-10-14 18:08:18,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 279. [2018-10-14 18:08:18,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-10-14 18:08:18,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 279 transitions. [2018-10-14 18:08:18,221 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 279 transitions. Word has length 275 [2018-10-14 18:08:18,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:08:18,221 INFO L481 AbstractCegarLoop]: Abstraction has 279 states and 279 transitions. [2018-10-14 18:08:18,221 INFO L482 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-10-14 18:08:18,221 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 279 transitions. [2018-10-14 18:08:18,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-10-14 18:08:18,222 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:08:18,222 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] [2018-10-14 18:08:18,222 INFO L424 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:08:18,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:08:18,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1499530421, now seen corresponding path program 79 times [2018-10-14 18:08:18,223 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:08:18,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:08:21,365 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:08:21,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:08:21,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-14 18:08:21,366 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-14 18:08:21,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-14 18:08:21,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3324, Invalid=3482, Unknown=0, NotChecked=0, Total=6806 [2018-10-14 18:08:21,367 INFO L87 Difference]: Start difference. First operand 279 states and 279 transitions. Second operand 83 states. [2018-10-14 18:08:25,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:08:25,756 INFO L93 Difference]: Finished difference Result 284 states and 284 transitions. [2018-10-14 18:08:25,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-10-14 18:08:25,756 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 278 [2018-10-14 18:08:25,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:08:25,757 INFO L225 Difference]: With dead ends: 284 [2018-10-14 18:08:25,757 INFO L226 Difference]: Without dead ends: 284 [2018-10-14 18:08:25,758 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3160 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=9881, Invalid=16201, Unknown=0, NotChecked=0, Total=26082 [2018-10-14 18:08:25,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-10-14 18:08:25,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 282. [2018-10-14 18:08:25,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-10-14 18:08:25,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 282 transitions. [2018-10-14 18:08:25,760 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 282 transitions. Word has length 278 [2018-10-14 18:08:25,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:08:25,761 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 282 transitions. [2018-10-14 18:08:25,761 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-14 18:08:25,761 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 282 transitions. [2018-10-14 18:08:25,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2018-10-14 18:08:25,762 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:08:25,762 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] [2018-10-14 18:08:25,762 INFO L424 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:08:25,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:08:25,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1007883419, now seen corresponding path program 80 times [2018-10-14 18:08:25,763 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:08:25,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:08:28,797 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:08:28,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:08:28,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-10-14 18:08:28,798 INFO L460 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-10-14 18:08:28,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-10-14 18:08:28,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3406, Invalid=3566, Unknown=0, NotChecked=0, Total=6972 [2018-10-14 18:08:28,799 INFO L87 Difference]: Start difference. First operand 282 states and 282 transitions. Second operand 84 states. [2018-10-14 18:08:33,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:08:33,125 INFO L93 Difference]: Finished difference Result 287 states and 287 transitions. [2018-10-14 18:08:33,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-14 18:08:33,125 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 281 [2018-10-14 18:08:33,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:08:33,126 INFO L225 Difference]: With dead ends: 287 [2018-10-14 18:08:33,127 INFO L226 Difference]: Without dead ends: 287 [2018-10-14 18:08:33,127 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3240 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=10126, Invalid=16606, Unknown=0, NotChecked=0, Total=26732 [2018-10-14 18:08:33,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-10-14 18:08:33,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 285. [2018-10-14 18:08:33,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-10-14 18:08:33,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 285 transitions. [2018-10-14 18:08:33,130 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 285 transitions. Word has length 281 [2018-10-14 18:08:33,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:08:33,130 INFO L481 AbstractCegarLoop]: Abstraction has 285 states and 285 transitions. [2018-10-14 18:08:33,130 INFO L482 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-10-14 18:08:33,130 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 285 transitions. [2018-10-14 18:08:33,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-10-14 18:08:33,131 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:08:33,131 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] [2018-10-14 18:08:33,131 INFO L424 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:08:33,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:08:33,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1302378827, now seen corresponding path program 81 times [2018-10-14 18:08:33,132 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:08:33,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:08:36,413 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:08:36,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:08:36,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-10-14 18:08:36,414 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-14 18:08:36,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-14 18:08:36,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3489, Invalid=3651, Unknown=0, NotChecked=0, Total=7140 [2018-10-14 18:08:36,415 INFO L87 Difference]: Start difference. First operand 285 states and 285 transitions. Second operand 85 states. [2018-10-14 18:08:41,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:08:41,046 INFO L93 Difference]: Finished difference Result 290 states and 290 transitions. [2018-10-14 18:08:41,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-14 18:08:41,047 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 284 [2018-10-14 18:08:41,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:08:41,048 INFO L225 Difference]: With dead ends: 290 [2018-10-14 18:08:41,048 INFO L226 Difference]: Without dead ends: 290 [2018-10-14 18:08:41,049 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3321 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=10374, Invalid=17016, Unknown=0, NotChecked=0, Total=27390 [2018-10-14 18:08:41,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-10-14 18:08:41,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 288. [2018-10-14 18:08:41,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-10-14 18:08:41,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 288 transitions. [2018-10-14 18:08:41,051 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 288 transitions. Word has length 284 [2018-10-14 18:08:41,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:08:41,051 INFO L481 AbstractCegarLoop]: Abstraction has 288 states and 288 transitions. [2018-10-14 18:08:41,051 INFO L482 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-14 18:08:41,051 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 288 transitions. [2018-10-14 18:08:41,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-10-14 18:08:41,052 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:08:41,052 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] [2018-10-14 18:08:41,053 INFO L424 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:08:41,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:08:41,053 INFO L82 PathProgramCache]: Analyzing trace with hash 3107173, now seen corresponding path program 82 times [2018-10-14 18:08:41,053 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:08:41,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:08:44,093 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:08:44,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:08:44,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-10-14 18:08:44,094 INFO L460 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-10-14 18:08:44,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-10-14 18:08:44,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3573, Invalid=3737, Unknown=0, NotChecked=0, Total=7310 [2018-10-14 18:08:44,095 INFO L87 Difference]: Start difference. First operand 288 states and 288 transitions. Second operand 86 states. [2018-10-14 18:08:48,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:08:48,512 INFO L93 Difference]: Finished difference Result 293 states and 293 transitions. [2018-10-14 18:08:48,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-10-14 18:08:48,512 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 287 [2018-10-14 18:08:48,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:08:48,514 INFO L225 Difference]: With dead ends: 293 [2018-10-14 18:08:48,514 INFO L226 Difference]: Without dead ends: 293 [2018-10-14 18:08:48,515 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3403 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=10625, Invalid=17431, Unknown=0, NotChecked=0, Total=28056 [2018-10-14 18:08:48,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-10-14 18:08:48,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 291. [2018-10-14 18:08:48,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-10-14 18:08:48,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 291 transitions. [2018-10-14 18:08:48,517 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 291 transitions. Word has length 287 [2018-10-14 18:08:48,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:08:48,517 INFO L481 AbstractCegarLoop]: Abstraction has 291 states and 291 transitions. [2018-10-14 18:08:48,517 INFO L482 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-10-14 18:08:48,517 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 291 transitions. [2018-10-14 18:08:48,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2018-10-14 18:08:48,518 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:08:48,518 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] [2018-10-14 18:08:48,519 INFO L424 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:08:48,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:08:48,519 INFO L82 PathProgramCache]: Analyzing trace with hash 807667893, now seen corresponding path program 83 times [2018-10-14 18:08:48,519 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:08:48,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:08:51,856 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:08:51,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:08:51,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-14 18:08:51,857 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-14 18:08:51,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-14 18:08:51,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3658, Invalid=3824, Unknown=0, NotChecked=0, Total=7482 [2018-10-14 18:08:51,858 INFO L87 Difference]: Start difference. First operand 291 states and 291 transitions. Second operand 87 states. [2018-10-14 18:08:56,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:08:56,643 INFO L93 Difference]: Finished difference Result 296 states and 296 transitions. [2018-10-14 18:08:56,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-14 18:08:56,644 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 290 [2018-10-14 18:08:56,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:08:56,645 INFO L225 Difference]: With dead ends: 296 [2018-10-14 18:08:56,645 INFO L226 Difference]: Without dead ends: 296 [2018-10-14 18:08:56,646 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3486 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=10879, Invalid=17851, Unknown=0, NotChecked=0, Total=28730 [2018-10-14 18:08:56,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-10-14 18:08:56,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 294. [2018-10-14 18:08:56,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-10-14 18:08:56,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 294 transitions. [2018-10-14 18:08:56,649 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 294 transitions. Word has length 290 [2018-10-14 18:08:56,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:08:56,649 INFO L481 AbstractCegarLoop]: Abstraction has 294 states and 294 transitions. [2018-10-14 18:08:56,649 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-14 18:08:56,649 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 294 transitions. [2018-10-14 18:08:56,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2018-10-14 18:08:56,650 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:08:56,650 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] [2018-10-14 18:08:56,650 INFO L424 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:08:56,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:08:56,651 INFO L82 PathProgramCache]: Analyzing trace with hash -736401563, now seen corresponding path program 84 times [2018-10-14 18:08:56,651 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:08:56,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:09:00,119 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:09:00,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:09:00,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-10-14 18:09:00,120 INFO L460 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-10-14 18:09:00,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-10-14 18:09:00,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3744, Invalid=3912, Unknown=0, NotChecked=0, Total=7656 [2018-10-14 18:09:00,122 INFO L87 Difference]: Start difference. First operand 294 states and 294 transitions. Second operand 88 states. [2018-10-14 18:09:04,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:09:04,660 INFO L93 Difference]: Finished difference Result 299 states and 299 transitions. [2018-10-14 18:09:04,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-10-14 18:09:04,660 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 293 [2018-10-14 18:09:04,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:09:04,662 INFO L225 Difference]: With dead ends: 299 [2018-10-14 18:09:04,662 INFO L226 Difference]: Without dead ends: 299 [2018-10-14 18:09:04,664 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:09:04,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-10-14 18:09:04,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 297. [2018-10-14 18:09:04,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-10-14 18:09:04,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 297 transitions. [2018-10-14 18:09:04,667 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 297 transitions. Word has length 293 [2018-10-14 18:09:04,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:09:04,667 INFO L481 AbstractCegarLoop]: Abstraction has 297 states and 297 transitions. [2018-10-14 18:09:04,668 INFO L482 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-10-14 18:09:04,668 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 297 transitions. [2018-10-14 18:09:04,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-10-14 18:09:04,669 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:09:04,669 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] [2018-10-14 18:09:04,669 INFO L424 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:09:04,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:09:04,670 INFO L82 PathProgramCache]: Analyzing trace with hash -1009825099, now seen corresponding path program 85 times [2018-10-14 18:09:04,670 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:09:04,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:09:08,051 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:09:08,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:09:08,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-10-14 18:09:08,052 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-14 18:09:08,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-14 18:09:08,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3831, Invalid=4001, Unknown=0, NotChecked=0, Total=7832 [2018-10-14 18:09:08,053 INFO L87 Difference]: Start difference. First operand 297 states and 297 transitions. Second operand 89 states. [2018-10-14 18:09:13,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:09:13,047 INFO L93 Difference]: Finished difference Result 302 states and 302 transitions. [2018-10-14 18:09:13,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-10-14 18:09:13,047 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 296 [2018-10-14 18:09:13,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:09:13,048 INFO L225 Difference]: With dead ends: 302 [2018-10-14 18:09:13,048 INFO L226 Difference]: Without dead ends: 302 [2018-10-14 18:09:13,050 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3655 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=11396, Invalid=18706, Unknown=0, NotChecked=0, Total=30102 [2018-10-14 18:09:13,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-10-14 18:09:13,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 300. [2018-10-14 18:09:13,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-10-14 18:09:13,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 300 transitions. [2018-10-14 18:09:13,053 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 300 transitions. Word has length 296 [2018-10-14 18:09:13,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:09:13,053 INFO L481 AbstractCegarLoop]: Abstraction has 300 states and 300 transitions. [2018-10-14 18:09:13,054 INFO L482 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-14 18:09:13,054 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 300 transitions. [2018-10-14 18:09:13,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2018-10-14 18:09:13,055 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:09:13,055 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] [2018-10-14 18:09:13,055 INFO L424 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:09:13,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:09:13,055 INFO L82 PathProgramCache]: Analyzing trace with hash 982574437, now seen corresponding path program 86 times [2018-10-14 18:09:13,056 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:09:13,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:09:16,679 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:09:16,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:09:16,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-10-14 18:09:16,680 INFO L460 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-10-14 18:09:16,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-10-14 18:09:16,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3919, Invalid=4091, Unknown=0, NotChecked=0, Total=8010 [2018-10-14 18:09:16,682 INFO L87 Difference]: Start difference. First operand 300 states and 300 transitions. Second operand 90 states. [2018-10-14 18:09:21,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:09:21,949 INFO L93 Difference]: Finished difference Result 305 states and 305 transitions. [2018-10-14 18:09:21,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-14 18:09:21,949 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 299 [2018-10-14 18:09:21,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:09:21,950 INFO L225 Difference]: With dead ends: 305 [2018-10-14 18:09:21,950 INFO L226 Difference]: Without dead ends: 305 [2018-10-14 18:09:21,951 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3741 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=11659, Invalid=19141, Unknown=0, NotChecked=0, Total=30800 [2018-10-14 18:09:21,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-10-14 18:09:21,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 303. [2018-10-14 18:09:21,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-10-14 18:09:21,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 303 transitions. [2018-10-14 18:09:21,953 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 303 transitions. Word has length 299 [2018-10-14 18:09:21,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:09:21,954 INFO L481 AbstractCegarLoop]: Abstraction has 303 states and 303 transitions. [2018-10-14 18:09:21,954 INFO L482 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-10-14 18:09:21,954 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 303 transitions. [2018-10-14 18:09:21,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-10-14 18:09:21,955 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:09:21,955 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] [2018-10-14 18:09:21,955 INFO L424 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:09:21,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:09:21,955 INFO L82 PathProgramCache]: Analyzing trace with hash 109120693, now seen corresponding path program 87 times [2018-10-14 18:09:21,956 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:09:21,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:09:25,616 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:09:25,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:09:25,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-10-14 18:09:25,617 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-14 18:09:25,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-14 18:09:25,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4008, Invalid=4182, Unknown=0, NotChecked=0, Total=8190 [2018-10-14 18:09:25,618 INFO L87 Difference]: Start difference. First operand 303 states and 303 transitions. Second operand 91 states. [2018-10-14 18:09:30,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:09:30,671 INFO L93 Difference]: Finished difference Result 308 states and 308 transitions. [2018-10-14 18:09:30,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-10-14 18:09:30,671 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 302 [2018-10-14 18:09:30,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:09:30,672 INFO L225 Difference]: With dead ends: 308 [2018-10-14 18:09:30,672 INFO L226 Difference]: Without dead ends: 308 [2018-10-14 18:09:30,674 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3828 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=11925, Invalid=19581, Unknown=0, NotChecked=0, Total=31506 [2018-10-14 18:09:30,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-10-14 18:09:30,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 306. [2018-10-14 18:09:30,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-10-14 18:09:30,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 306 transitions. [2018-10-14 18:09:30,676 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 306 transitions. Word has length 302 [2018-10-14 18:09:30,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:09:30,676 INFO L481 AbstractCegarLoop]: Abstraction has 306 states and 306 transitions. [2018-10-14 18:09:30,677 INFO L482 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-14 18:09:30,677 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 306 transitions. [2018-10-14 18:09:30,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2018-10-14 18:09:30,678 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:09:30,678 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] [2018-10-14 18:09:30,678 INFO L424 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:09:30,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:09:30,678 INFO L82 PathProgramCache]: Analyzing trace with hash -2039487643, now seen corresponding path program 88 times [2018-10-14 18:09:30,679 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:09:30,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:09:34,161 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:09:34,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:09:34,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-10-14 18:09:34,162 INFO L460 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-10-14 18:09:34,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-10-14 18:09:34,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4098, Invalid=4274, Unknown=0, NotChecked=0, Total=8372 [2018-10-14 18:09:34,163 INFO L87 Difference]: Start difference. First operand 306 states and 306 transitions. Second operand 92 states. [2018-10-14 18:09:39,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:09:39,336 INFO L93 Difference]: Finished difference Result 311 states and 311 transitions. [2018-10-14 18:09:39,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-10-14 18:09:39,336 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 305 [2018-10-14 18:09:39,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:09:39,337 INFO L225 Difference]: With dead ends: 311 [2018-10-14 18:09:39,337 INFO L226 Difference]: Without dead ends: 311 [2018-10-14 18:09:39,338 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3916 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=12194, Invalid=20026, Unknown=0, NotChecked=0, Total=32220 [2018-10-14 18:09:39,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-10-14 18:09:39,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 309. [2018-10-14 18:09:39,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-10-14 18:09:39,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 309 transitions. [2018-10-14 18:09:39,341 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 309 transitions. Word has length 305 [2018-10-14 18:09:39,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:09:39,341 INFO L481 AbstractCegarLoop]: Abstraction has 309 states and 309 transitions. [2018-10-14 18:09:39,341 INFO L482 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-10-14 18:09:39,341 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 309 transitions. [2018-10-14 18:09:39,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-10-14 18:09:39,342 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:09:39,342 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] [2018-10-14 18:09:39,343 INFO L424 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:09:39,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:09:39,343 INFO L82 PathProgramCache]: Analyzing trace with hash 962154165, now seen corresponding path program 89 times [2018-10-14 18:09:39,343 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:09:39,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:09:43,277 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:09:43,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:09:43,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-14 18:09:43,277 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-14 18:09:43,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-14 18:09:43,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4189, Invalid=4367, Unknown=0, NotChecked=0, Total=8556 [2018-10-14 18:09:43,279 INFO L87 Difference]: Start difference. First operand 309 states and 309 transitions. Second operand 93 states. [2018-10-14 18:09:48,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:09:48,524 INFO L93 Difference]: Finished difference Result 314 states and 314 transitions. [2018-10-14 18:09:48,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-14 18:09:48,524 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 308 [2018-10-14 18:09:48,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:09:48,525 INFO L225 Difference]: With dead ends: 314 [2018-10-14 18:09:48,526 INFO L226 Difference]: Without dead ends: 314 [2018-10-14 18:09:48,527 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4005 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=12466, Invalid=20476, Unknown=0, NotChecked=0, Total=32942 [2018-10-14 18:09:48,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-10-14 18:09:48,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 312. [2018-10-14 18:09:48,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2018-10-14 18:09:48,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 312 transitions. [2018-10-14 18:09:48,530 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 312 transitions. Word has length 308 [2018-10-14 18:09:48,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:09:48,530 INFO L481 AbstractCegarLoop]: Abstraction has 312 states and 312 transitions. [2018-10-14 18:09:48,530 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-14 18:09:48,530 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 312 transitions. [2018-10-14 18:09:48,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2018-10-14 18:09:48,531 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:09:48,531 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] [2018-10-14 18:09:48,531 INFO L424 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:09:48,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:09:48,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1654153573, now seen corresponding path program 90 times [2018-10-14 18:09:48,532 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:09:48,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:09:52,459 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:09:52,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:09:52,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-10-14 18:09:52,460 INFO L460 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-10-14 18:09:52,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-10-14 18:09:52,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4281, Invalid=4461, Unknown=0, NotChecked=0, Total=8742 [2018-10-14 18:09:52,461 INFO L87 Difference]: Start difference. First operand 312 states and 312 transitions. Second operand 94 states. [2018-10-14 18:09:57,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:09:57,863 INFO L93 Difference]: Finished difference Result 317 states and 317 transitions. [2018-10-14 18:09:57,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-10-14 18:09:57,863 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 311 [2018-10-14 18:09:57,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:09:57,865 INFO L225 Difference]: With dead ends: 317 [2018-10-14 18:09:57,865 INFO L226 Difference]: Without dead ends: 317 [2018-10-14 18:09:57,866 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4095 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=12741, Invalid=20931, Unknown=0, NotChecked=0, Total=33672 [2018-10-14 18:09:57,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-10-14 18:09:57,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 315. [2018-10-14 18:09:57,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-10-14 18:09:57,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 315 transitions. [2018-10-14 18:09:57,869 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 315 transitions. Word has length 311 [2018-10-14 18:09:57,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:09:57,869 INFO L481 AbstractCegarLoop]: Abstraction has 315 states and 315 transitions. [2018-10-14 18:09:57,869 INFO L482 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-10-14 18:09:57,869 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 315 transitions. [2018-10-14 18:09:57,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-10-14 18:09:57,870 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:09:57,870 INFO L375 BasicCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:09:57,871 INFO L424 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:09:57,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:09:57,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1165496501, now seen corresponding path program 91 times [2018-10-14 18:09:57,872 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:09:57,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:10:01,828 INFO L134 CoverageAnalysis]: Checked inductivity of 12376 backedges. 0 proven. 12376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:10:01,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:10:01,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-10-14 18:10:01,829 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-14 18:10:01,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-14 18:10:01,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4374, Invalid=4556, Unknown=0, NotChecked=0, Total=8930 [2018-10-14 18:10:01,830 INFO L87 Difference]: Start difference. First operand 315 states and 315 transitions. Second operand 95 states. [2018-10-14 18:10:07,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:10:07,465 INFO L93 Difference]: Finished difference Result 320 states and 320 transitions. [2018-10-14 18:10:07,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-10-14 18:10:07,465 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 314 [2018-10-14 18:10:07,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:10:07,467 INFO L225 Difference]: With dead ends: 320 [2018-10-14 18:10:07,467 INFO L226 Difference]: Without dead ends: 320 [2018-10-14 18:10:07,468 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4186 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=13019, Invalid=21391, Unknown=0, NotChecked=0, Total=34410 [2018-10-14 18:10:07,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-10-14 18:10:07,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 318. [2018-10-14 18:10:07,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-10-14 18:10:07,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 318 transitions. [2018-10-14 18:10:07,471 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 318 transitions. Word has length 314 [2018-10-14 18:10:07,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:10:07,471 INFO L481 AbstractCegarLoop]: Abstraction has 318 states and 318 transitions. [2018-10-14 18:10:07,471 INFO L482 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-14 18:10:07,472 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 318 transitions. [2018-10-14 18:10:07,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-10-14 18:10:07,473 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:10:07,473 INFO L375 BasicCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:10:07,473 INFO L424 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:10:07,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:10:07,473 INFO L82 PathProgramCache]: Analyzing trace with hash -773169307, now seen corresponding path program 92 times [2018-10-14 18:10:07,474 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:10:07,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:10:11,427 INFO L134 CoverageAnalysis]: Checked inductivity of 12650 backedges. 0 proven. 12650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:10:11,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:10:11,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-10-14 18:10:11,428 INFO L460 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-10-14 18:10:11,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-10-14 18:10:11,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4468, Invalid=4652, Unknown=0, NotChecked=0, Total=9120 [2018-10-14 18:10:11,429 INFO L87 Difference]: Start difference. First operand 318 states and 318 transitions. Second operand 96 states. [2018-10-14 18:10:17,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:10:17,002 INFO L93 Difference]: Finished difference Result 323 states and 323 transitions. [2018-10-14 18:10:17,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-14 18:10:17,002 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 317 [2018-10-14 18:10:17,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:10:17,003 INFO L225 Difference]: With dead ends: 323 [2018-10-14 18:10:17,003 INFO L226 Difference]: Without dead ends: 323 [2018-10-14 18:10:17,005 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4278 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=13300, Invalid=21856, Unknown=0, NotChecked=0, Total=35156 [2018-10-14 18:10:17,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-10-14 18:10:17,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 321. [2018-10-14 18:10:17,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-10-14 18:10:17,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 321 transitions. [2018-10-14 18:10:17,008 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 321 transitions. Word has length 317 [2018-10-14 18:10:17,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:10:17,008 INFO L481 AbstractCegarLoop]: Abstraction has 321 states and 321 transitions. [2018-10-14 18:10:17,008 INFO L482 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-10-14 18:10:17,009 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 321 transitions. [2018-10-14 18:10:17,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2018-10-14 18:10:17,010 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:10:17,010 INFO L375 BasicCegarLoop]: trace histogram [93, 93, 93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:10:17,010 INFO L424 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:10:17,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:10:17,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1141026123, now seen corresponding path program 93 times [2018-10-14 18:10:17,011 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:10:17,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:10:20,986 INFO L134 CoverageAnalysis]: Checked inductivity of 12927 backedges. 0 proven. 12927 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:10:20,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:10:20,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-10-14 18:10:20,987 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-10-14 18:10:20,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-10-14 18:10:20,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4563, Invalid=4749, Unknown=0, NotChecked=0, Total=9312 [2018-10-14 18:10:20,988 INFO L87 Difference]: Start difference. First operand 321 states and 321 transitions. Second operand 97 states. [2018-10-14 18:10:27,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:10:27,031 INFO L93 Difference]: Finished difference Result 324 states and 324 transitions. [2018-10-14 18:10:27,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-10-14 18:10:27,032 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 320 [2018-10-14 18:10:27,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:10:27,033 INFO L225 Difference]: With dead ends: 324 [2018-10-14 18:10:27,033 INFO L226 Difference]: Without dead ends: 324 [2018-10-14 18:10:27,035 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4371 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=13584, Invalid=22326, Unknown=0, NotChecked=0, Total=35910 [2018-10-14 18:10:27,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-10-14 18:10:27,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2018-10-14 18:10:27,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2018-10-14 18:10:27,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 324 transitions. [2018-10-14 18:10:27,038 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 324 transitions. Word has length 320 [2018-10-14 18:10:27,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:10:27,038 INFO L481 AbstractCegarLoop]: Abstraction has 324 states and 324 transitions. [2018-10-14 18:10:27,038 INFO L482 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-10-14 18:10:27,038 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 324 transitions. [2018-10-14 18:10:27,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2018-10-14 18:10:27,039 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:10:27,039 INFO L375 BasicCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:10:27,040 INFO L424 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:10:27,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:10:27,040 INFO L82 PathProgramCache]: Analyzing trace with hash 793107813, now seen corresponding path program 94 times [2018-10-14 18:10:27,040 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:10:27,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:10:27,492 INFO L134 CoverageAnalysis]: Checked inductivity of 13207 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13207 trivial. 0 not checked. [2018-10-14 18:10:27,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 18:10:27,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-14 18:10:27,493 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-14 18:10:27,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-14 18:10:27,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-14 18:10:27,494 INFO L87 Difference]: Start difference. First operand 324 states and 324 transitions. Second operand 8 states. [2018-10-14 18:10:27,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:10:27,895 INFO L93 Difference]: Finished difference Result 322 states and 322 transitions. [2018-10-14 18:10:27,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-14 18:10:27,895 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 323 [2018-10-14 18:10:27,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:10:27,896 INFO L225 Difference]: With dead ends: 322 [2018-10-14 18:10:27,896 INFO L226 Difference]: Without dead ends: 0 [2018-10-14 18:10:27,896 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-10-14 18:10:27,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-14 18:10:27,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-14 18:10:27,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-14 18:10:27,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-14 18:10:27,897 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 323 [2018-10-14 18:10:27,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:10:27,897 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-14 18:10:27,897 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-14 18:10:27,898 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-14 18:10:27,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-14 18:10:27,902 INFO L202 PluginConnector]: Adding new model 20051113-1.c_false-valid-memtrack.i_7.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 06:10:27 BasicIcfg [2018-10-14 18:10:27,902 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-14 18:10:27,903 INFO L168 Benchmark]: Toolchain (without parser) took 369678.04 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 967.8 MB). Free memory was 1.4 GB in the beginning and 2.4 GB in the end (delta: -906.6 MB). Peak memory consumption was 61.2 MB. Max. memory is 7.1 GB. [2018-10-14 18:10:27,904 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-14 18:10:27,905 INFO L168 Benchmark]: Boogie Preprocessor took 71.62 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-14 18:10:27,905 INFO L168 Benchmark]: RCFGBuilder took 771.04 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-14 18:10:27,906 INFO L168 Benchmark]: IcfgTransformer took 9197.68 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 440.9 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -350.3 MB). Peak memory consumption was 90.6 MB. Max. memory is 7.1 GB. [2018-10-14 18:10:27,906 INFO L168 Benchmark]: TraceAbstraction took 359632.91 ms. Allocated memory was 2.0 GB in the beginning and 2.5 GB in the end (delta: 526.9 MB). Free memory was 1.8 GB in the beginning and 2.4 GB in the end (delta: -577.5 MB). There was no memory consumed. Max. memory is 7.1 GB. [2018-10-14 18:10:27,909 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 71.62 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 771.04 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * IcfgTransformer took 9197.68 ms. Allocated memory was 1.5 GB in the beginning and 2.0 GB in the end (delta: 440.9 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -350.3 MB). Peak memory consumption was 90.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 359632.91 ms. Allocated memory was 2.0 GB in the beginning and 2.5 GB in the end (delta: 526.9 MB). Free memory was 1.8 GB in the beginning and 2.4 GB in the end (delta: -577.5 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 44 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 3 LocStat_NO_SUPPORTING_EQUALITIES : 888 LocStat_NO_SUPPORTING_DISEQUALITIES : 164 LocStat_NO_DISJUNCTIONS : -88 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 46 TransStat_MAX_WEQGRAPH_SIZE : 3 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 55 TransStat_NO_SUPPORTING_DISEQUALITIES : 1 TransStat_NO_DISJUNCTIONS : 46 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqPostOperator statistics APPLY_NORMAL(MILLISECONDS) : 5908.41 APPLY_RETURN(MILLISECONDS) : 0.00 #APPLY_NORMAL : 98 #APPLY_RETURN : 0 * Results from de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: - StatisticsResult: Abstract Interpretation statistics Visited 46 different actions 96 times. Merged at 20 different actions 47 times. Widened at 1 different actions 1 times. Found 2 fixpoints after 2 different actions. Largest state had 0 variables. - StatisticsResult: HeapSeparatorStatistics #COUNT_NEW_ARRAY_VARS_[#memory_int, ULTIMATE.start_write~int_old_#memory_int] : 0 COUNT_ARRAY_WRITES_for_[#memory_int, ULTIMATE.start_write~int_old_#memory_int]_at_dim_0 : null COUNT_BLOCKS_for_[#memory_int, ULTIMATE.start_write~int_old_#memory_int]_at_dim_0 : null COUNT_ARRAY_WRITES_for_[#memory_int, ULTIMATE.start_write~int_old_#memory_int]_at_dim_1 : 2 COUNT_BLOCKS_for_[#memory_int, ULTIMATE.start_write~int_old_#memory_int]_at_dim_1 : 1 COUNT_ARRAY_READS for [#memory_int, ULTIMATE.start_write~int_old_#memory_int] : null * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 94]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 46 locations, 1 error locations. SAFE Result, 359.5s OverallTime, 95 OverallIterations, 94 TraceHistogramMax, 205.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3697 SDtfs, 19949 SDslu, 111937 SDs, 0 SdLazy, 24646 SolverSat, 4616 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 23.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9130 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 8940 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138419 ImplicationChecksByTransitivity, 317.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=324occurred in iteration=94, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 95 MinimizatonAttempts, 186 StatesRemovedByMinimization, 93 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 147.4s InterpolantComputationTime, 17290 NumberOfCodeBlocks, 17290 NumberOfCodeBlocksAsserted, 95 NumberOfCheckSat, 17195 ConstructedInterpolants, 0 QuantifiedInterpolants, 16869075 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 95 InterpolantComputations, 2 PerfectInterpolantSequences, 13207/419710 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_7.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-Benchmark-0-2018-10-14_18-10-27-922.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_7.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-VPDomainBenchmark-0-2018-10-14_18-10-27-922.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_7.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-BenchmarkWithCounters-0-2018-10-14_18-10-27-922.csv The toolchain threw an exception: class java.lang.RuntimeException: java.lang.IllegalAccessException: Class de.uni_freiburg.informatik.ultimate.util.csv.SimpleCsvProvider can not access a member of class de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.AbsIntBenchmark with modifiers "private" RESULT: An exception occured during the execution of Ultimate: The toolchain threw an exception java.lang.RuntimeException: java.lang.IllegalAccessException: Class de.uni_freiburg.informatik.ultimate.util.csv.SimpleCsvProvider can not access a member of class de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.AbsIntBenchmark with modifiers "private" at de.uni_freiburg.informatik.ultimate.util.csv.SimpleCsvProvider.constructCsvProviderReflectively(SimpleCsvProvider.java:283) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.AbsIntBenchmark.createCsvProvider(AbsIntBenchmark.java:42) at de.uni_freiburg.informatik.ultimate.cli.CommandLineController.writeCsvLogs(CommandLineController.java:342) at de.uni_freiburg.informatik.ultimate.cli.CommandLineController.displayToolchainResults(CommandLineController.java:325) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:343) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.lang.IllegalAccessException: Class de.uni_freiburg.informatik.ultimate.util.csv.SimpleCsvProvider can not access a member of class de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.AbsIntBenchmark with modifiers "private" at sun.reflect.Reflection.ensureMemberAccess(Reflection.java:102) at java.lang.reflect.AccessibleObject.slowCheckMemberAccess(AccessibleObject.java:296) at java.lang.reflect.AccessibleObject.checkAccess(AccessibleObject.java:288) at java.lang.reflect.Field.get(Field.java:390) at de.uni_freiburg.informatik.ultimate.util.csv.SimpleCsvProvider.constructCsvProviderReflectively(SimpleCsvProvider.java:275) ... 6 more Received shutdown request...