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_9.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-b8f97f7-m [2018-10-10 16:20:02,145 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 16:20:02,147 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 16:20:02,160 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 16:20:02,160 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 16:20:02,162 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 16:20:02,164 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 16:20:02,167 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 16:20:02,168 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 16:20:02,171 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 16:20:02,172 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 16:20:02,172 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 16:20:02,173 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 16:20:02,177 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 16:20:02,179 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 16:20:02,185 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 16:20:02,186 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 16:20:02,191 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 16:20:02,193 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 16:20:02,196 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 16:20:02,198 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 16:20:02,199 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 16:20:02,202 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 16:20:02,202 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 16:20:02,202 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 16:20:02,203 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 16:20:02,204 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 16:20:02,205 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 16:20:02,206 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 16:20:02,207 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 16:20:02,207 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 16:20:02,208 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 16:20:02,208 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 16:20:02,208 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 16:20:02,211 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 16:20:02,211 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 16:20:02,212 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-10 16:20:02,232 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 16:20:02,232 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 16:20:02,234 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-10 16:20:02,234 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-10 16:20:02,234 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-10 16:20:02,235 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-10 16:20:02,236 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 16:20:02,236 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-10 16:20:02,236 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 16:20:02,236 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-10 16:20:02,236 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-10 16:20:02,237 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-10 16:20:02,237 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-10 16:20:02,238 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-10 16:20:02,239 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-10 16:20:02,286 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 16:20:02,299 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 16:20:02,303 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 16:20:02,304 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-10 16:20:02,305 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-10 16:20:02,306 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_9.bpl [2018-10-10 16:20:02,306 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/20051113-1.c_false-valid-memtrack.i_9.bpl' [2018-10-10 16:20:02,364 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 16:20:02,366 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-10 16:20:02,366 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 16:20:02,366 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 16:20:02,366 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 16:20:02,389 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:20:02" (1/1) ... [2018-10-10 16:20:02,391 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:20:02" (1/1) ... [2018-10-10 16:20:02,403 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:20:02" (1/1) ... [2018-10-10 16:20:02,404 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:20:02" (1/1) ... [2018-10-10 16:20:02,409 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:20:02" (1/1) ... [2018-10-10 16:20:02,411 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:20:02" (1/1) ... [2018-10-10 16:20:02,412 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:20:02" (1/1) ... [2018-10-10 16:20:02,414 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 16:20:02,415 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 16:20:02,415 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 16:20:02,416 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 16:20:02,416 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "20051113-1.c_false-valid-memtrack.i_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:20:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-10 16:20:02,491 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-10 16:20:02,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 16:20:02,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 16:20:02,981 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 16:20:02,982 INFO L202 PluginConnector]: Adding new model 20051113-1.c_false-valid-memtrack.i_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 04:20:02 BoogieIcfgContainer [2018-10-10 16:20:02,982 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 16:20:02,983 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-10 16:20:02,983 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-10 16:20:02,984 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-10 16:20:02,987 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "20051113-1.c_false-valid-memtrack.i_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 04:20:02" (1/1) ... [2018-10-10 16:20:02,997 INFO L137 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-10-10 16:20:02,997 INFO L138 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-10-10 16:20:03,040 INFO L191 apSepIcfgTransformer]: Heap separator: starting loc-array-style preprocessing [2018-10-10 16:20:03,085 INFO L217 apSepIcfgTransformer]: finished MemlocArrayUpdater [2018-10-10 16:20:03,102 INFO L280 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-10-10 16:20:03,198 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=1) [2018-10-10 16:20:22,281 INFO L315 AbstractInterpreter]: Visited 54 different actions 113 times. Merged at 28 different actions 56 times. Widened at 1 different actions 1 times. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2018-10-10 16:20:22,284 INFO L304 apSepIcfgTransformer]: finished equality analysis [2018-10-10 16:20:22,288 INFO L316 apSepIcfgTransformer]: Finished detection of select terms ("array reads") [2018-10-10 16:20:22,331 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-10 16:20:22,551 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select |v_#locv_ULTIMATE.start_write~int_old_#memory_int_2_1_1| |v_ULTIMATE.start_write~int_#ptr.base_6|) at (assume #memory_int == write~int_old_#memory_int[write~int_#ptr.base := write~int_old_#memory_int[write~int_#ptr.base][write~int_#ptr.offset := write~int_#value]];) [2018-10-10 16:20:22,553 INFO L232 HeapPartitionManager]: partitioning result: [2018-10-10 16:20:22,553 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-10 16:20:22,554 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-10 16:20:22,554 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 3 [2018-10-10 16:20:22,554 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-10 16:20:22,554 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-10 16:20:22,554 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 0 [2018-10-10 16:20:22,555 INFO L248 HeapPartitionManager]: # location blocks :0 [2018-10-10 16:20:22,555 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-10 16:20:22,555 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-10 16:20:22,555 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 3 [2018-10-10 16:20:22,555 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-10 16:20:22,556 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-10 16:20:22,556 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 0 [2018-10-10 16:20:22,556 INFO L248 HeapPartitionManager]: # location blocks :0 [2018-10-10 16:20:22,558 INFO L145 ransitionTransformer]: executing heap partitioning transformation [2018-10-10 16:20:22,574 INFO L202 PluginConnector]: Adding new model 20051113-1.c_false-valid-memtrack.i_9.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.10 04:20:22 BasicIcfg [2018-10-10 16:20:22,574 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-10 16:20:22,575 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 16:20:22,575 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 16:20:22,579 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 16:20:22,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "20051113-1.c_false-valid-memtrack.i_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:20:02" (1/3) ... [2018-10-10 16:20:22,581 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d100c68 and model type 20051113-1.c_false-valid-memtrack.i_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 04:20:22, skipping insertion in model container [2018-10-10 16:20:22,581 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "20051113-1.c_false-valid-memtrack.i_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 04:20:02" (2/3) ... [2018-10-10 16:20:22,582 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d100c68 and model type 20051113-1.c_false-valid-memtrack.i_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 04:20:22, skipping insertion in model container [2018-10-10 16:20:22,582 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "20051113-1.c_false-valid-memtrack.i_9.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.10 04:20:22" (3/3) ... [2018-10-10 16:20:22,583 INFO L112 eAbstractionObserver]: Analyzing ICFG memPartitionedIcfg [2018-10-10 16:20:22,596 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-10 16:20:22,606 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-10 16:20:22,625 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-10 16:20:22,653 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 16:20:22,654 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 16:20:22,655 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 16:20:22,655 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-10 16:20:22,655 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 16:20:22,655 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 16:20:22,656 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 16:20:22,656 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 16:20:22,656 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 16:20:22,673 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-10-10 16:20:22,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-10 16:20:22,682 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:20:22,683 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:20:22,684 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:20:22,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:20:22,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1610550143, now seen corresponding path program 1 times [2018-10-10 16:20:22,760 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:20:22,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:20:23,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:20:23,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 16:20:23,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 16:20:23,128 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-10 16:20:23,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-10 16:20:23,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-10 16:20:23,146 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 4 states. [2018-10-10 16:20:23,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:20:23,352 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-10-10 16:20:23,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-10 16:20:23,356 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-10-10 16:20:23,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:20:23,448 INFO L225 Difference]: With dead ends: 55 [2018-10-10 16:20:23,449 INFO L226 Difference]: Without dead ends: 55 [2018-10-10 16:20:23,455 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-10 16:20:23,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-10 16:20:23,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2018-10-10 16:20:23,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-10 16:20:23,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-10-10 16:20:23,497 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 49 [2018-10-10 16:20:23,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:20:23,497 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-10-10 16:20:23,498 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-10 16:20:23,498 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-10-10 16:20:23,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-10 16:20:23,499 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:20:23,500 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:20:23,500 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:20:23,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:20:23,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1204472391, now seen corresponding path program 1 times [2018-10-10 16:20:23,502 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:20:23,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:20:23,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:20:23,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:20:23,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-10 16:20:23,656 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 16:20:23,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 16:20:23,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-10 16:20:23,657 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 5 states. [2018-10-10 16:20:23,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:20:23,900 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-10-10 16:20:23,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-10 16:20:23,901 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-10-10 16:20:23,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:20:23,903 INFO L225 Difference]: With dead ends: 58 [2018-10-10 16:20:23,903 INFO L226 Difference]: Without dead ends: 58 [2018-10-10 16:20:23,906 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-10 16:20:23,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-10-10 16:20:23,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2018-10-10 16:20:23,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-10-10 16:20:23,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-10-10 16:20:23,916 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 52 [2018-10-10 16:20:23,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:20:23,917 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-10-10 16:20:23,917 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 16:20:23,917 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-10-10 16:20:23,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-10 16:20:23,919 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:20:23,922 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:20:23,923 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:20:23,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:20:23,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1629931905, now seen corresponding path program 2 times [2018-10-10 16:20:23,924 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:20:23,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:20:24,135 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-10 16:20:24,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:20:24,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-10-10 16:20:24,137 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 16:20:24,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 16:20:24,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-10 16:20:24,138 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 6 states. [2018-10-10 16:20:24,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:20:24,341 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-10-10 16:20:24,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 16:20:24,342 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2018-10-10 16:20:24,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:20:24,343 INFO L225 Difference]: With dead ends: 61 [2018-10-10 16:20:24,344 INFO L226 Difference]: Without dead ends: 61 [2018-10-10 16:20:24,344 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-10-10 16:20:24,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-10-10 16:20:24,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2018-10-10 16:20:24,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-10 16:20:24,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-10-10 16:20:24,350 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 55 [2018-10-10 16:20:24,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:20:24,351 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-10-10 16:20:24,351 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 16:20:24,351 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-10-10 16:20:24,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-10 16:20:24,354 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:20:24,358 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:20:24,358 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:20:24,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:20:24,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1983692615, now seen corresponding path program 3 times [2018-10-10 16:20:24,359 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:20:24,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:20:24,562 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-10 16:20:24,563 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:20:24,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-10 16:20:24,563 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 16:20:24,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 16:20:24,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-10 16:20:24,564 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 7 states. [2018-10-10 16:20:24,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:20:24,668 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-10-10 16:20:24,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-10 16:20:24,672 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2018-10-10 16:20:24,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:20:24,673 INFO L225 Difference]: With dead ends: 64 [2018-10-10 16:20:24,673 INFO L226 Difference]: Without dead ends: 64 [2018-10-10 16:20:24,674 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-10-10 16:20:24,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-10-10 16:20:24,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2018-10-10 16:20:24,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-10-10 16:20:24,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-10-10 16:20:24,679 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 58 [2018-10-10 16:20:24,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:20:24,680 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-10-10 16:20:24,680 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 16:20:24,680 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-10-10 16:20:24,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-10-10 16:20:24,681 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:20:24,681 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:20:24,682 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:20:24,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:20:24,682 INFO L82 PathProgramCache]: Analyzing trace with hash -2116493695, now seen corresponding path program 4 times [2018-10-10 16:20:24,683 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:20:24,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:20:24,834 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-10 16:20:24,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:20:24,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-10 16:20:24,835 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 16:20:24,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 16:20:24,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-10-10 16:20:24,835 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 8 states. [2018-10-10 16:20:25,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:20:25,048 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-10-10 16:20:25,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 16:20:25,050 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 61 [2018-10-10 16:20:25,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:20:25,051 INFO L225 Difference]: With dead ends: 67 [2018-10-10 16:20:25,051 INFO L226 Difference]: Without dead ends: 67 [2018-10-10 16:20:25,054 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-10-10 16:20:25,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-10-10 16:20:25,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2018-10-10 16:20:25,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-10-10 16:20:25,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-10-10 16:20:25,066 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 61 [2018-10-10 16:20:25,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:20:25,066 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-10-10 16:20:25,067 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 16:20:25,067 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-10-10 16:20:25,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-10 16:20:25,069 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:20:25,069 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:20:25,070 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:20:25,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:20:25,070 INFO L82 PathProgramCache]: Analyzing trace with hash 1566378937, now seen corresponding path program 5 times [2018-10-10 16:20:25,072 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:20:25,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:20:25,316 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-10 16:20:25,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:20:25,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-10 16:20:25,317 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 16:20:25,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 16:20:25,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-10-10 16:20:25,318 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 9 states. [2018-10-10 16:20:25,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:20:25,858 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-10-10 16:20:25,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-10 16:20:25,859 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2018-10-10 16:20:25,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:20:25,860 INFO L225 Difference]: With dead ends: 70 [2018-10-10 16:20:25,860 INFO L226 Difference]: Without dead ends: 70 [2018-10-10 16:20:25,861 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-10-10 16:20:25,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-10-10 16:20:25,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2018-10-10 16:20:25,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-10-10 16:20:25,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-10-10 16:20:25,866 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 64 [2018-10-10 16:20:25,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:20:25,866 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-10-10 16:20:25,867 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 16:20:25,867 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-10-10 16:20:25,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-10 16:20:25,868 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:20:25,868 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:20:25,868 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:20:25,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:20:25,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1209584767, now seen corresponding path program 6 times [2018-10-10 16:20:25,870 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:20:25,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:20:26,037 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-10 16:20:26,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:20:26,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-10 16:20:26,038 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 16:20:26,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 16:20:26,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-10-10 16:20:26,039 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 10 states. [2018-10-10 16:20:26,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:20:26,300 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-10-10 16:20:26,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 16:20:26,306 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2018-10-10 16:20:26,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:20:26,307 INFO L225 Difference]: With dead ends: 73 [2018-10-10 16:20:26,307 INFO L226 Difference]: Without dead ends: 73 [2018-10-10 16:20:26,308 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-10 16:20:26,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-10-10 16:20:26,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2018-10-10 16:20:26,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-10-10 16:20:26,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-10-10 16:20:26,313 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 67 [2018-10-10 16:20:26,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:20:26,313 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-10-10 16:20:26,313 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 16:20:26,313 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-10-10 16:20:26,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-10-10 16:20:26,314 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:20:26,315 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:20:26,315 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:20:26,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:20:26,315 INFO L82 PathProgramCache]: Analyzing trace with hash -349006151, now seen corresponding path program 7 times [2018-10-10 16:20:26,316 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:20:26,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:20:26,543 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-10 16:20:26,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:20:26,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-10 16:20:26,544 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-10 16:20:26,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-10 16:20:26,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2018-10-10 16:20:26,545 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 11 states. [2018-10-10 16:20:26,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:20:26,740 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-10-10 16:20:26,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 16:20:26,744 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 70 [2018-10-10 16:20:26,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:20:26,745 INFO L225 Difference]: With dead ends: 76 [2018-10-10 16:20:26,745 INFO L226 Difference]: Without dead ends: 76 [2018-10-10 16:20:26,746 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-10-10 16:20:26,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-10-10 16:20:26,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2018-10-10 16:20:26,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-10-10 16:20:26,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-10-10 16:20:26,751 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 70 [2018-10-10 16:20:26,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:20:26,751 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-10-10 16:20:26,751 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-10 16:20:26,752 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-10-10 16:20:26,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-10 16:20:26,753 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:20:26,753 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:20:26,753 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:20:26,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:20:26,754 INFO L82 PathProgramCache]: Analyzing trace with hash 488753281, now seen corresponding path program 8 times [2018-10-10 16:20:26,755 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:20:26,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:20:26,907 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-10 16:20:26,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:20:26,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-10 16:20:26,908 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 16:20:26,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 16:20:26,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2018-10-10 16:20:26,909 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 12 states. [2018-10-10 16:20:27,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:20:27,061 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-10-10 16:20:27,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-10 16:20:27,062 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 73 [2018-10-10 16:20:27,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:20:27,063 INFO L225 Difference]: With dead ends: 79 [2018-10-10 16:20:27,063 INFO L226 Difference]: Without dead ends: 79 [2018-10-10 16:20:27,064 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-10-10 16:20:27,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-10-10 16:20:27,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2018-10-10 16:20:27,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-10-10 16:20:27,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-10-10 16:20:27,070 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 73 [2018-10-10 16:20:27,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:20:27,070 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-10-10 16:20:27,070 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 16:20:27,071 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-10-10 16:20:27,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-10 16:20:27,072 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:20:27,072 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:20:27,072 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:20:27,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:20:27,073 INFO L82 PathProgramCache]: Analyzing trace with hash 125034937, now seen corresponding path program 9 times [2018-10-10 16:20:27,073 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:20:27,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:20:27,270 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-10 16:20:27,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:20:27,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-10 16:20:27,273 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-10 16:20:27,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-10 16:20:27,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2018-10-10 16:20:27,274 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 13 states. [2018-10-10 16:20:27,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:20:27,519 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-10-10 16:20:27,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-10 16:20:27,520 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 76 [2018-10-10 16:20:27,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:20:27,521 INFO L225 Difference]: With dead ends: 82 [2018-10-10 16:20:27,521 INFO L226 Difference]: Without dead ends: 82 [2018-10-10 16:20:27,522 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-10 16:20:27,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-10-10 16:20:27,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2018-10-10 16:20:27,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-10-10 16:20:27,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-10-10 16:20:27,529 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 76 [2018-10-10 16:20:27,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:20:27,529 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-10-10 16:20:27,529 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-10 16:20:27,529 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-10-10 16:20:27,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-10 16:20:27,531 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:20:27,531 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:20:27,531 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:20:27,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:20:27,531 INFO L82 PathProgramCache]: Analyzing trace with hash 794336641, now seen corresponding path program 10 times [2018-10-10 16:20:27,532 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:20:27,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:20:27,702 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-10 16:20:27,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:20:27,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-10 16:20:27,703 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-10 16:20:27,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-10 16:20:27,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2018-10-10 16:20:27,703 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 14 states. [2018-10-10 16:20:28,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:20:28,103 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-10-10 16:20:28,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-10 16:20:28,104 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 79 [2018-10-10 16:20:28,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:20:28,105 INFO L225 Difference]: With dead ends: 85 [2018-10-10 16:20:28,105 INFO L226 Difference]: Without dead ends: 85 [2018-10-10 16:20:28,106 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-10 16:20:28,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-10 16:20:28,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2018-10-10 16:20:28,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-10-10 16:20:28,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-10-10 16:20:28,110 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 79 [2018-10-10 16:20:28,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:20:28,110 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-10-10 16:20:28,110 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-10 16:20:28,111 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-10-10 16:20:28,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-10 16:20:28,119 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:20:28,119 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:20:28,120 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:20:28,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:20:28,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1571754823, now seen corresponding path program 11 times [2018-10-10 16:20:28,121 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:20:28,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:20:28,485 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-10 16:20:28,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:20:28,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-10 16:20:28,486 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-10 16:20:28,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-10 16:20:28,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=116, Unknown=0, NotChecked=0, Total=210 [2018-10-10 16:20:28,487 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 15 states. [2018-10-10 16:20:28,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:20:28,733 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-10-10 16:20:28,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-10 16:20:28,734 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 82 [2018-10-10 16:20:28,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:20:28,735 INFO L225 Difference]: With dead ends: 88 [2018-10-10 16:20:28,735 INFO L226 Difference]: Without dead ends: 88 [2018-10-10 16:20:28,736 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=259, Invalid=391, Unknown=0, NotChecked=0, Total=650 [2018-10-10 16:20:28,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-10-10 16:20:28,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2018-10-10 16:20:28,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-10-10 16:20:28,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-10-10 16:20:28,740 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 82 [2018-10-10 16:20:28,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:20:28,741 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-10-10 16:20:28,741 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-10 16:20:28,741 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-10-10 16:20:28,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-10 16:20:28,742 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:20:28,742 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:20:28,742 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:20:28,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:20:28,743 INFO L82 PathProgramCache]: Analyzing trace with hash -799296895, now seen corresponding path program 12 times [2018-10-10 16:20:28,744 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:20:28,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:20:29,041 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-10 16:20:29,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:20:29,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-10 16:20:29,042 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-10 16:20:29,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-10 16:20:29,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=132, Unknown=0, NotChecked=0, Total=240 [2018-10-10 16:20:29,043 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 16 states. [2018-10-10 16:20:29,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:20:29,385 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-10-10 16:20:29,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-10 16:20:29,386 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 85 [2018-10-10 16:20:29,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:20:29,386 INFO L225 Difference]: With dead ends: 91 [2018-10-10 16:20:29,387 INFO L226 Difference]: Without dead ends: 91 [2018-10-10 16:20:29,387 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=300, Invalid=456, Unknown=0, NotChecked=0, Total=756 [2018-10-10 16:20:29,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-10-10 16:20:29,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2018-10-10 16:20:29,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-10-10 16:20:29,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-10-10 16:20:29,390 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 85 [2018-10-10 16:20:29,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:20:29,390 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-10-10 16:20:29,390 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-10 16:20:29,391 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-10-10 16:20:29,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-10 16:20:29,392 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:20:29,392 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:20:29,392 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:20:29,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:20:29,392 INFO L82 PathProgramCache]: Analyzing trace with hash -939935815, now seen corresponding path program 13 times [2018-10-10 16:20:29,393 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:20:29,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:20:29,843 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-10 16:20:29,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:20:29,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-10 16:20:29,844 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-10 16:20:29,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-10 16:20:29,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=149, Unknown=0, NotChecked=0, Total=272 [2018-10-10 16:20:29,845 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 17 states. [2018-10-10 16:20:30,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:20:30,322 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-10-10 16:20:30,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-10 16:20:30,322 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 88 [2018-10-10 16:20:30,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:20:30,324 INFO L225 Difference]: With dead ends: 94 [2018-10-10 16:20:30,324 INFO L226 Difference]: Without dead ends: 94 [2018-10-10 16:20:30,325 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-10 16:20:30,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-10-10 16:20:30,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2018-10-10 16:20:30,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-10-10 16:20:30,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-10-10 16:20:30,328 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 88 [2018-10-10 16:20:30,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:20:30,328 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-10-10 16:20:30,328 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-10 16:20:30,329 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-10-10 16:20:30,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-10 16:20:30,329 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:20:30,330 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:20:30,330 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:20:30,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:20:30,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1174079361, now seen corresponding path program 14 times [2018-10-10 16:20:30,331 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:20:30,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:20:30,625 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-10 16:20:30,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:20:30,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-10 16:20:30,626 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-10 16:20:30,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-10 16:20:30,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=167, Unknown=0, NotChecked=0, Total=306 [2018-10-10 16:20:30,626 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 18 states. [2018-10-10 16:20:30,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:20:30,967 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-10-10 16:20:30,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-10 16:20:30,968 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 91 [2018-10-10 16:20:30,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:20:30,968 INFO L225 Difference]: With dead ends: 97 [2018-10-10 16:20:30,969 INFO L226 Difference]: Without dead ends: 97 [2018-10-10 16:20:30,969 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=391, Invalid=601, Unknown=0, NotChecked=0, Total=992 [2018-10-10 16:20:30,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-10-10 16:20:30,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2018-10-10 16:20:30,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-10-10 16:20:30,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-10-10 16:20:30,973 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 91 [2018-10-10 16:20:30,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:20:30,973 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-10-10 16:20:30,973 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-10 16:20:30,973 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-10-10 16:20:30,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-10 16:20:30,974 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:20:30,974 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:20:30,974 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:20:30,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:20:30,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1600240967, now seen corresponding path program 15 times [2018-10-10 16:20:30,976 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:20:30,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:20:31,890 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-10 16:20:31,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:20:31,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-10 16:20:31,891 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-10 16:20:31,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-10 16:20:31,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=186, Unknown=0, NotChecked=0, Total=342 [2018-10-10 16:20:31,893 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 19 states. [2018-10-10 16:20:32,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:20:32,228 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-10-10 16:20:32,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-10 16:20:32,231 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 94 [2018-10-10 16:20:32,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:20:32,232 INFO L225 Difference]: With dead ends: 100 [2018-10-10 16:20:32,232 INFO L226 Difference]: Without dead ends: 100 [2018-10-10 16:20:32,233 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=441, Invalid=681, Unknown=0, NotChecked=0, Total=1122 [2018-10-10 16:20:32,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-10-10 16:20:32,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2018-10-10 16:20:32,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-10-10 16:20:32,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-10-10 16:20:32,236 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 94 [2018-10-10 16:20:32,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:20:32,236 INFO L481 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-10-10 16:20:32,236 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-10 16:20:32,237 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-10-10 16:20:32,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-10-10 16:20:32,237 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:20:32,237 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:20:32,238 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:20:32,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:20:32,238 INFO L82 PathProgramCache]: Analyzing trace with hash 973511809, now seen corresponding path program 16 times [2018-10-10 16:20:32,239 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:20:32,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:20:33,261 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-10 16:20:33,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:20:33,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-10 16:20:33,262 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-10 16:20:33,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-10 16:20:33,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=206, Unknown=0, NotChecked=0, Total=380 [2018-10-10 16:20:33,263 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 20 states. [2018-10-10 16:20:33,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:20:33,604 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-10-10 16:20:33,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-10 16:20:33,604 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 97 [2018-10-10 16:20:33,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:20:33,605 INFO L225 Difference]: With dead ends: 103 [2018-10-10 16:20:33,605 INFO L226 Difference]: Without dead ends: 103 [2018-10-10 16:20:33,607 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=494, Invalid=766, Unknown=0, NotChecked=0, Total=1260 [2018-10-10 16:20:33,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-10-10 16:20:33,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2018-10-10 16:20:33,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-10-10 16:20:33,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-10-10 16:20:33,609 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 97 [2018-10-10 16:20:33,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:20:33,609 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-10-10 16:20:33,610 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-10 16:20:33,610 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-10-10 16:20:33,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-10 16:20:33,610 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:20:33,610 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:20:33,610 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:20:33,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:20:33,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1886293433, now seen corresponding path program 17 times [2018-10-10 16:20:33,611 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:20:33,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:20:34,026 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-10 16:20:34,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:20:34,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-10 16:20:34,027 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-10 16:20:34,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-10 16:20:34,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=227, Unknown=0, NotChecked=0, Total=420 [2018-10-10 16:20:34,028 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 21 states. [2018-10-10 16:20:34,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:20:34,392 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-10-10 16:20:34,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-10 16:20:34,399 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 100 [2018-10-10 16:20:34,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:20:34,400 INFO L225 Difference]: With dead ends: 106 [2018-10-10 16:20:34,400 INFO L226 Difference]: Without dead ends: 106 [2018-10-10 16:20:34,401 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=550, Invalid=856, Unknown=0, NotChecked=0, Total=1406 [2018-10-10 16:20:34,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-10-10 16:20:34,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2018-10-10 16:20:34,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-10-10 16:20:34,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-10-10 16:20:34,403 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 100 [2018-10-10 16:20:34,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:20:34,404 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-10-10 16:20:34,404 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-10 16:20:34,404 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-10-10 16:20:34,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-10 16:20:34,405 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:20:34,405 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:20:34,405 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:20:34,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:20:34,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1169264255, now seen corresponding path program 18 times [2018-10-10 16:20:34,406 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:20:34,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:20:34,937 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-10 16:20:34,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:20:34,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-10 16:20:34,938 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-10 16:20:34,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-10 16:20:34,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=249, Unknown=0, NotChecked=0, Total=462 [2018-10-10 16:20:34,939 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 22 states. [2018-10-10 16:20:35,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:20:35,406 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-10-10 16:20:35,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-10 16:20:35,406 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 103 [2018-10-10 16:20:35,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:20:35,408 INFO L225 Difference]: With dead ends: 109 [2018-10-10 16:20:35,408 INFO L226 Difference]: Without dead ends: 109 [2018-10-10 16:20:35,409 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-10 16:20:35,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-10-10 16:20:35,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2018-10-10 16:20:35,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-10-10 16:20:35,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-10-10 16:20:35,412 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 103 [2018-10-10 16:20:35,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:20:35,413 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-10-10 16:20:35,413 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-10 16:20:35,413 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-10-10 16:20:35,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-10 16:20:35,413 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:20:35,413 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:20:35,414 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:20:35,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:20:35,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1751476039, now seen corresponding path program 19 times [2018-10-10 16:20:35,415 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:20:35,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:20:36,002 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-10 16:20:36,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:20:36,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-10 16:20:36,003 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-10 16:20:36,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-10 16:20:36,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=272, Unknown=0, NotChecked=0, Total=506 [2018-10-10 16:20:36,004 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 23 states. [2018-10-10 16:20:36,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:20:36,415 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2018-10-10 16:20:36,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-10 16:20:36,416 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 106 [2018-10-10 16:20:36,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:20:36,417 INFO L225 Difference]: With dead ends: 112 [2018-10-10 16:20:36,417 INFO L226 Difference]: Without dead ends: 112 [2018-10-10 16:20:36,418 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=671, Invalid=1051, Unknown=0, NotChecked=0, Total=1722 [2018-10-10 16:20:36,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-10-10 16:20:36,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2018-10-10 16:20:36,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-10-10 16:20:36,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-10-10 16:20:36,421 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 106 [2018-10-10 16:20:36,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:20:36,422 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-10-10 16:20:36,422 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-10 16:20:36,422 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-10-10 16:20:36,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-10 16:20:36,422 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:20:36,422 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:20:36,423 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:20:36,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:20:36,423 INFO L82 PathProgramCache]: Analyzing trace with hash 950175361, now seen corresponding path program 20 times [2018-10-10 16:20:36,424 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:20:36,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:20:37,391 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-10 16:20:37,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:20:37,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-10 16:20:37,393 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-10 16:20:37,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-10 16:20:37,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=296, Unknown=0, NotChecked=0, Total=552 [2018-10-10 16:20:37,393 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 24 states. [2018-10-10 16:20:37,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:20:37,927 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-10-10 16:20:37,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-10 16:20:37,928 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 109 [2018-10-10 16:20:37,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:20:37,929 INFO L225 Difference]: With dead ends: 115 [2018-10-10 16:20:37,930 INFO L226 Difference]: Without dead ends: 115 [2018-10-10 16:20:37,931 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-10 16:20:37,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-10-10 16:20:37,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2018-10-10 16:20:37,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-10-10 16:20:37,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-10-10 16:20:37,934 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 109 [2018-10-10 16:20:37,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:20:37,934 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-10-10 16:20:37,934 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-10 16:20:37,934 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-10-10 16:20:37,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-10 16:20:37,935 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:20:37,935 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:20:37,936 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:20:37,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:20:37,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1840094279, now seen corresponding path program 21 times [2018-10-10 16:20:37,937 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:20:37,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:20:38,290 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-10 16:20:38,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:20:38,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-10 16:20:38,291 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-10 16:20:38,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-10 16:20:38,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=321, Unknown=0, NotChecked=0, Total=600 [2018-10-10 16:20:38,292 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 25 states. [2018-10-10 16:20:38,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:20:38,788 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2018-10-10 16:20:38,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-10 16:20:38,791 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 112 [2018-10-10 16:20:38,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:20:38,792 INFO L225 Difference]: With dead ends: 118 [2018-10-10 16:20:38,792 INFO L226 Difference]: Without dead ends: 118 [2018-10-10 16:20:38,793 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-10 16:20:38,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-10-10 16:20:38,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2018-10-10 16:20:38,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-10-10 16:20:38,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2018-10-10 16:20:38,796 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 112 [2018-10-10 16:20:38,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:20:38,796 INFO L481 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2018-10-10 16:20:38,796 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-10 16:20:38,796 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2018-10-10 16:20:38,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-10 16:20:38,797 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:20:38,797 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:20:38,798 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:20:38,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:20:38,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1965892735, now seen corresponding path program 22 times [2018-10-10 16:20:38,799 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:20:38,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:20:39,246 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-10 16:20:39,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:20:39,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-10 16:20:39,247 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-10 16:20:39,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-10 16:20:39,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=347, Unknown=0, NotChecked=0, Total=650 [2018-10-10 16:20:39,248 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 26 states. [2018-10-10 16:20:39,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:20:39,943 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-10-10 16:20:39,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-10 16:20:39,944 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 115 [2018-10-10 16:20:39,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:20:39,944 INFO L225 Difference]: With dead ends: 121 [2018-10-10 16:20:39,945 INFO L226 Difference]: Without dead ends: 121 [2018-10-10 16:20:39,945 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=875, Invalid=1381, Unknown=0, NotChecked=0, Total=2256 [2018-10-10 16:20:39,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-10-10 16:20:39,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2018-10-10 16:20:39,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-10-10 16:20:39,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2018-10-10 16:20:39,948 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 115 [2018-10-10 16:20:39,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:20:39,948 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2018-10-10 16:20:39,949 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-10 16:20:39,949 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2018-10-10 16:20:39,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-10 16:20:39,949 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:20:39,950 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:20:39,950 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:20:39,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:20:39,950 INFO L82 PathProgramCache]: Analyzing trace with hash -121246023, now seen corresponding path program 23 times [2018-10-10 16:20:39,951 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:20:39,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:20:40,348 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-10 16:20:40,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:20:40,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-10 16:20:40,349 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-10 16:20:40,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-10 16:20:40,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=374, Unknown=0, NotChecked=0, Total=702 [2018-10-10 16:20:40,349 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 27 states. [2018-10-10 16:20:40,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:20:40,889 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2018-10-10 16:20:40,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-10 16:20:40,890 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 118 [2018-10-10 16:20:40,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:20:40,891 INFO L225 Difference]: With dead ends: 124 [2018-10-10 16:20:40,891 INFO L226 Difference]: Without dead ends: 124 [2018-10-10 16:20:40,892 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=949, Invalid=1501, Unknown=0, NotChecked=0, Total=2450 [2018-10-10 16:20:40,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-10-10 16:20:40,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2018-10-10 16:20:40,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-10-10 16:20:40,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2018-10-10 16:20:40,894 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 118 [2018-10-10 16:20:40,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:20:40,894 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2018-10-10 16:20:40,894 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-10 16:20:40,895 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2018-10-10 16:20:40,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-10 16:20:40,895 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:20:40,895 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:20:40,896 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:20:40,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:20:40,896 INFO L82 PathProgramCache]: Analyzing trace with hash -357601151, now seen corresponding path program 24 times [2018-10-10 16:20:40,897 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:20:40,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:20:41,309 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-10 16:20:41,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:20:41,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-10 16:20:41,310 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-10 16:20:41,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-10 16:20:41,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=402, Unknown=0, NotChecked=0, Total=756 [2018-10-10 16:20:41,310 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 28 states. [2018-10-10 16:20:42,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:20:42,149 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-10-10 16:20:42,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-10 16:20:42,150 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 121 [2018-10-10 16:20:42,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:20:42,151 INFO L225 Difference]: With dead ends: 127 [2018-10-10 16:20:42,151 INFO L226 Difference]: Without dead ends: 127 [2018-10-10 16:20:42,152 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1026, Invalid=1626, Unknown=0, NotChecked=0, Total=2652 [2018-10-10 16:20:42,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-10-10 16:20:42,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2018-10-10 16:20:42,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-10-10 16:20:42,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-10-10 16:20:42,155 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 121 [2018-10-10 16:20:42,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:20:42,155 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-10-10 16:20:42,155 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-10 16:20:42,155 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-10-10 16:20:42,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-10 16:20:42,155 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:20:42,156 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:20:42,156 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:20:42,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:20:42,156 INFO L82 PathProgramCache]: Analyzing trace with hash 2133146041, now seen corresponding path program 25 times [2018-10-10 16:20:42,157 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:20:42,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:20:42,607 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-10 16:20:42,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:20:42,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-10 16:20:42,607 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-10 16:20:42,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-10 16:20:42,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=381, Invalid=431, Unknown=0, NotChecked=0, Total=812 [2018-10-10 16:20:42,608 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 29 states. [2018-10-10 16:20:43,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:20:43,253 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2018-10-10 16:20:43,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-10 16:20:43,253 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 124 [2018-10-10 16:20:43,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:20:43,254 INFO L225 Difference]: With dead ends: 130 [2018-10-10 16:20:43,255 INFO L226 Difference]: Without dead ends: 130 [2018-10-10 16:20:43,256 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1106, Invalid=1756, Unknown=0, NotChecked=0, Total=2862 [2018-10-10 16:20:43,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-10-10 16:20:43,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 128. [2018-10-10 16:20:43,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-10-10 16:20:43,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2018-10-10 16:20:43,259 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 124 [2018-10-10 16:20:43,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:20:43,259 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2018-10-10 16:20:43,260 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-10 16:20:43,260 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2018-10-10 16:20:43,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-10 16:20:43,260 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:20:43,260 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:20:43,261 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:20:43,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:20:43,261 INFO L82 PathProgramCache]: Analyzing trace with hash -167230079, now seen corresponding path program 26 times [2018-10-10 16:20:43,262 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:20:43,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:20:43,814 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-10 16:20:43,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:20:43,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-10 16:20:43,814 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-10 16:20:43,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-10 16:20:43,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=409, Invalid=461, Unknown=0, NotChecked=0, Total=870 [2018-10-10 16:20:43,815 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 30 states. [2018-10-10 16:20:44,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:20:44,546 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2018-10-10 16:20:44,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-10 16:20:44,546 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 127 [2018-10-10 16:20:44,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:20:44,548 INFO L225 Difference]: With dead ends: 133 [2018-10-10 16:20:44,548 INFO L226 Difference]: Without dead ends: 133 [2018-10-10 16:20:44,549 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-10 16:20:44,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-10-10 16:20:44,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2018-10-10 16:20:44,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-10-10 16:20:44,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-10-10 16:20:44,551 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 127 [2018-10-10 16:20:44,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:20:44,552 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-10-10 16:20:44,552 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-10 16:20:44,552 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-10-10 16:20:44,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-10 16:20:44,553 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:20:44,553 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:20:44,553 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:20:44,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:20:44,553 INFO L82 PathProgramCache]: Analyzing trace with hash -174046023, now seen corresponding path program 27 times [2018-10-10 16:20:44,554 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:20:44,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:20:45,051 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-10 16:20:45,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:20:45,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-10 16:20:45,052 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-10 16:20:45,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-10 16:20:45,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=438, Invalid=492, Unknown=0, NotChecked=0, Total=930 [2018-10-10 16:20:45,053 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 31 states. [2018-10-10 16:20:45,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:20:45,800 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2018-10-10 16:20:45,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-10 16:20:45,801 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 130 [2018-10-10 16:20:45,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:20:45,801 INFO L225 Difference]: With dead ends: 136 [2018-10-10 16:20:45,802 INFO L226 Difference]: Without dead ends: 136 [2018-10-10 16:20:45,803 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1275, Invalid=2031, Unknown=0, NotChecked=0, Total=3306 [2018-10-10 16:20:45,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-10-10 16:20:45,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2018-10-10 16:20:45,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-10-10 16:20:45,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 134 transitions. [2018-10-10 16:20:45,805 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 134 transitions. Word has length 130 [2018-10-10 16:20:45,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:20:45,805 INFO L481 AbstractCegarLoop]: Abstraction has 134 states and 134 transitions. [2018-10-10 16:20:45,805 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-10 16:20:45,805 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2018-10-10 16:20:45,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-10-10 16:20:45,806 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:20:45,806 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:20:45,806 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:20:45,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:20:45,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1364370815, now seen corresponding path program 28 times [2018-10-10 16:20:45,807 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:20:45,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:20:46,326 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-10 16:20:46,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:20:46,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-10 16:20:46,327 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-10 16:20:46,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-10 16:20:46,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=468, Invalid=524, Unknown=0, NotChecked=0, Total=992 [2018-10-10 16:20:46,328 INFO L87 Difference]: Start difference. First operand 134 states and 134 transitions. Second operand 32 states. [2018-10-10 16:20:47,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:20:47,416 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-10-10 16:20:47,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-10 16:20:47,416 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 133 [2018-10-10 16:20:47,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:20:47,417 INFO L225 Difference]: With dead ends: 139 [2018-10-10 16:20:47,417 INFO L226 Difference]: Without dead ends: 139 [2018-10-10 16:20:47,419 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1364, Invalid=2176, Unknown=0, NotChecked=0, Total=3540 [2018-10-10 16:20:47,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-10-10 16:20:47,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 137. [2018-10-10 16:20:47,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-10-10 16:20:47,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-10-10 16:20:47,422 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 133 [2018-10-10 16:20:47,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:20:47,423 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-10-10 16:20:47,423 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-10 16:20:47,423 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-10-10 16:20:47,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-10 16:20:47,424 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:20:47,424 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:20:47,424 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:20:47,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:20:47,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1214713785, now seen corresponding path program 29 times [2018-10-10 16:20:47,425 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:20:47,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:20:48,099 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-10 16:20:48,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:20:48,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-10 16:20:48,100 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-10 16:20:48,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-10 16:20:48,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=499, Invalid=557, Unknown=0, NotChecked=0, Total=1056 [2018-10-10 16:20:48,101 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 33 states. [2018-10-10 16:20:49,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:20:49,032 INFO L93 Difference]: Finished difference Result 142 states and 142 transitions. [2018-10-10 16:20:49,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-10 16:20:49,033 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 136 [2018-10-10 16:20:49,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:20:49,034 INFO L225 Difference]: With dead ends: 142 [2018-10-10 16:20:49,034 INFO L226 Difference]: Without dead ends: 142 [2018-10-10 16:20:49,037 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1456, Invalid=2326, Unknown=0, NotChecked=0, Total=3782 [2018-10-10 16:20:49,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-10-10 16:20:49,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2018-10-10 16:20:49,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-10-10 16:20:49,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 140 transitions. [2018-10-10 16:20:49,040 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 140 transitions. Word has length 136 [2018-10-10 16:20:49,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:20:49,041 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 140 transitions. [2018-10-10 16:20:49,041 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-10 16:20:49,041 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 140 transitions. [2018-10-10 16:20:49,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-10 16:20:49,041 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:20:49,042 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:20:49,042 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:20:49,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:20:49,042 INFO L82 PathProgramCache]: Analyzing trace with hash 2054074241, now seen corresponding path program 30 times [2018-10-10 16:20:49,043 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:20:49,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:20:49,684 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-10 16:20:49,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:20:49,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-10 16:20:49,684 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-10 16:20:49,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-10 16:20:49,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=531, Invalid=591, Unknown=0, NotChecked=0, Total=1122 [2018-10-10 16:20:49,685 INFO L87 Difference]: Start difference. First operand 140 states and 140 transitions. Second operand 34 states. [2018-10-10 16:20:50,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:20:50,494 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2018-10-10 16:20:50,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-10 16:20:50,495 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 139 [2018-10-10 16:20:50,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:20:50,496 INFO L225 Difference]: With dead ends: 145 [2018-10-10 16:20:50,496 INFO L226 Difference]: Without dead ends: 145 [2018-10-10 16:20:50,498 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1551, Invalid=2481, Unknown=0, NotChecked=0, Total=4032 [2018-10-10 16:20:50,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-10-10 16:20:50,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2018-10-10 16:20:50,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-10-10 16:20:50,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-10-10 16:20:50,502 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 139 [2018-10-10 16:20:50,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:20:50,502 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-10-10 16:20:50,503 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-10 16:20:50,503 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-10-10 16:20:50,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-10 16:20:50,503 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:20:50,504 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:20:50,504 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:20:50,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:20:50,504 INFO L82 PathProgramCache]: Analyzing trace with hash 2141821625, now seen corresponding path program 31 times [2018-10-10 16:20:50,505 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:20:50,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:20:51,668 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-10 16:20:51,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:20:51,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-10 16:20:51,669 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-10 16:20:51,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-10 16:20:51,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=564, Invalid=626, Unknown=0, NotChecked=0, Total=1190 [2018-10-10 16:20:51,670 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 35 states. [2018-10-10 16:20:52,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:20:52,738 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2018-10-10 16:20:52,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-10 16:20:52,739 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 142 [2018-10-10 16:20:52,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:20:52,740 INFO L225 Difference]: With dead ends: 148 [2018-10-10 16:20:52,741 INFO L226 Difference]: Without dead ends: 148 [2018-10-10 16:20:52,743 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1649, Invalid=2641, Unknown=0, NotChecked=0, Total=4290 [2018-10-10 16:20:52,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-10-10 16:20:52,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 146. [2018-10-10 16:20:52,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-10-10 16:20:52,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2018-10-10 16:20:52,746 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 142 [2018-10-10 16:20:52,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:20:52,746 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2018-10-10 16:20:52,746 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-10 16:20:52,746 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2018-10-10 16:20:52,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-10-10 16:20:52,747 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:20:52,747 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:20:52,747 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:20:52,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:20:52,748 INFO L82 PathProgramCache]: Analyzing trace with hash 589055105, now seen corresponding path program 32 times [2018-10-10 16:20:52,748 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:20:52,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:20:53,529 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-10 16:20:53,530 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:20:53,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-10 16:20:53,530 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-10 16:20:53,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-10 16:20:53,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=598, Invalid=662, Unknown=0, NotChecked=0, Total=1260 [2018-10-10 16:20:53,532 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 36 states. [2018-10-10 16:20:55,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:20:55,123 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-10-10 16:20:55,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-10 16:20:55,124 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 145 [2018-10-10 16:20:55,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:20:55,125 INFO L225 Difference]: With dead ends: 151 [2018-10-10 16:20:55,125 INFO L226 Difference]: Without dead ends: 151 [2018-10-10 16:20:55,127 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1750, Invalid=2806, Unknown=0, NotChecked=0, Total=4556 [2018-10-10 16:20:55,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-10-10 16:20:55,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 149. [2018-10-10 16:20:55,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-10-10 16:20:55,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-10-10 16:20:55,130 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 145 [2018-10-10 16:20:55,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:20:55,131 INFO L481 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2018-10-10 16:20:55,131 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-10 16:20:55,131 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-10-10 16:20:55,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-10 16:20:55,132 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:20:55,132 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:20:55,132 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:20:55,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:20:55,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1080564295, now seen corresponding path program 33 times [2018-10-10 16:20:55,133 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:20:55,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:20:56,702 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-10 16:20:56,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:20:56,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-10 16:20:56,703 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-10 16:20:56,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-10 16:20:56,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=633, Invalid=699, Unknown=0, NotChecked=0, Total=1332 [2018-10-10 16:20:56,704 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 37 states. [2018-10-10 16:20:57,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:20:57,959 INFO L93 Difference]: Finished difference Result 154 states and 154 transitions. [2018-10-10 16:20:57,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-10 16:20:57,960 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 148 [2018-10-10 16:20:57,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:20:57,961 INFO L225 Difference]: With dead ends: 154 [2018-10-10 16:20:57,961 INFO L226 Difference]: Without dead ends: 154 [2018-10-10 16:20:57,962 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1854, Invalid=2976, Unknown=0, NotChecked=0, Total=4830 [2018-10-10 16:20:57,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-10-10 16:20:57,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 152. [2018-10-10 16:20:57,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-10-10 16:20:57,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2018-10-10 16:20:57,965 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 148 [2018-10-10 16:20:57,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:20:57,965 INFO L481 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2018-10-10 16:20:57,965 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-10 16:20:57,965 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2018-10-10 16:20:57,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-10 16:20:57,966 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:20:57,967 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:20:57,967 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:20:57,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:20:57,967 INFO L82 PathProgramCache]: Analyzing trace with hash -695854719, now seen corresponding path program 34 times [2018-10-10 16:20:57,968 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:20:57,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:20:59,038 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-10 16:20:59,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:20:59,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-10 16:20:59,039 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-10 16:20:59,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-10 16:20:59,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=669, Invalid=737, Unknown=0, NotChecked=0, Total=1406 [2018-10-10 16:20:59,040 INFO L87 Difference]: Start difference. First operand 152 states and 152 transitions. Second operand 38 states. [2018-10-10 16:21:00,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:21:00,057 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2018-10-10 16:21:00,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-10 16:21:00,058 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 151 [2018-10-10 16:21:00,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:21:00,059 INFO L225 Difference]: With dead ends: 157 [2018-10-10 16:21:00,059 INFO L226 Difference]: Without dead ends: 157 [2018-10-10 16:21:00,059 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1961, Invalid=3151, Unknown=0, NotChecked=0, Total=5112 [2018-10-10 16:21:00,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-10-10 16:21:00,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 155. [2018-10-10 16:21:00,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-10-10 16:21:00,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2018-10-10 16:21:00,062 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 151 [2018-10-10 16:21:00,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:21:00,062 INFO L481 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2018-10-10 16:21:00,062 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-10 16:21:00,063 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2018-10-10 16:21:00,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-10 16:21:00,063 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:21:00,064 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:21:00,064 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:21:00,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:21:00,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1214378169, now seen corresponding path program 35 times [2018-10-10 16:21:00,065 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:21:00,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:21:00,813 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-10 16:21:00,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:21:00,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-10 16:21:00,814 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-10 16:21:00,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-10 16:21:00,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=706, Invalid=776, Unknown=0, NotChecked=0, Total=1482 [2018-10-10 16:21:00,815 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 39 states. [2018-10-10 16:21:01,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:21:01,945 INFO L93 Difference]: Finished difference Result 160 states and 160 transitions. [2018-10-10 16:21:01,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-10 16:21:01,946 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 154 [2018-10-10 16:21:01,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:21:01,947 INFO L225 Difference]: With dead ends: 160 [2018-10-10 16:21:01,947 INFO L226 Difference]: Without dead ends: 160 [2018-10-10 16:21:01,948 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2071, Invalid=3331, Unknown=0, NotChecked=0, Total=5402 [2018-10-10 16:21:01,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-10-10 16:21:01,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2018-10-10 16:21:01,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-10-10 16:21:01,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 158 transitions. [2018-10-10 16:21:01,951 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 158 transitions. Word has length 154 [2018-10-10 16:21:01,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:21:01,951 INFO L481 AbstractCegarLoop]: Abstraction has 158 states and 158 transitions. [2018-10-10 16:21:01,951 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-10 16:21:01,951 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 158 transitions. [2018-10-10 16:21:01,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-10-10 16:21:01,952 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:21:01,952 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:21:01,952 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:21:01,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:21:01,952 INFO L82 PathProgramCache]: Analyzing trace with hash 645672577, now seen corresponding path program 36 times [2018-10-10 16:21:01,953 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:21:01,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:21:03,222 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-10 16:21:03,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:21:03,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-10 16:21:03,222 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-10 16:21:03,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-10 16:21:03,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=744, Invalid=816, Unknown=0, NotChecked=0, Total=1560 [2018-10-10 16:21:03,223 INFO L87 Difference]: Start difference. First operand 158 states and 158 transitions. Second operand 40 states. [2018-10-10 16:21:04,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:21:04,237 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-10-10 16:21:04,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-10 16:21:04,238 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 157 [2018-10-10 16:21:04,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:21:04,239 INFO L225 Difference]: With dead ends: 163 [2018-10-10 16:21:04,240 INFO L226 Difference]: Without dead ends: 163 [2018-10-10 16:21:04,240 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2184, Invalid=3516, Unknown=0, NotChecked=0, Total=5700 [2018-10-10 16:21:04,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-10-10 16:21:04,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 161. [2018-10-10 16:21:04,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-10-10 16:21:04,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-10-10 16:21:04,244 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 157 [2018-10-10 16:21:04,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:21:04,244 INFO L481 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-10-10 16:21:04,244 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-10 16:21:04,244 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-10-10 16:21:04,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-10 16:21:04,245 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:21:04,245 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:21:04,245 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:21:04,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:21:04,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1983364025, now seen corresponding path program 37 times [2018-10-10 16:21:04,246 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:21:04,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:21:05,085 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-10 16:21:05,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:21:05,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-10 16:21:05,086 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-10 16:21:05,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-10 16:21:05,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=783, Invalid=857, Unknown=0, NotChecked=0, Total=1640 [2018-10-10 16:21:05,087 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 41 states. [2018-10-10 16:21:06,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:21:06,307 INFO L93 Difference]: Finished difference Result 166 states and 166 transitions. [2018-10-10 16:21:06,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-10 16:21:06,307 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 160 [2018-10-10 16:21:06,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:21:06,308 INFO L225 Difference]: With dead ends: 166 [2018-10-10 16:21:06,308 INFO L226 Difference]: Without dead ends: 166 [2018-10-10 16:21:06,309 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2300, Invalid=3706, Unknown=0, NotChecked=0, Total=6006 [2018-10-10 16:21:06,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-10-10 16:21:06,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2018-10-10 16:21:06,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-10-10 16:21:06,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 164 transitions. [2018-10-10 16:21:06,311 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 164 transitions. Word has length 160 [2018-10-10 16:21:06,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:21:06,311 INFO L481 AbstractCegarLoop]: Abstraction has 164 states and 164 transitions. [2018-10-10 16:21:06,312 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-10 16:21:06,312 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 164 transitions. [2018-10-10 16:21:06,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-10-10 16:21:06,312 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:21:06,312 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:21:06,312 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:21:06,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:21:06,313 INFO L82 PathProgramCache]: Analyzing trace with hash 147751809, now seen corresponding path program 38 times [2018-10-10 16:21:06,313 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:21:06,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:21:07,178 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-10 16:21:07,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:21:07,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-10 16:21:07,179 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-10 16:21:07,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-10 16:21:07,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=823, Invalid=899, Unknown=0, NotChecked=0, Total=1722 [2018-10-10 16:21:07,179 INFO L87 Difference]: Start difference. First operand 164 states and 164 transitions. Second operand 42 states. [2018-10-10 16:21:08,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:21:08,652 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2018-10-10 16:21:08,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-10 16:21:08,652 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 163 [2018-10-10 16:21:08,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:21:08,653 INFO L225 Difference]: With dead ends: 169 [2018-10-10 16:21:08,653 INFO L226 Difference]: Without dead ends: 169 [2018-10-10 16:21:08,654 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2419, Invalid=3901, Unknown=0, NotChecked=0, Total=6320 [2018-10-10 16:21:08,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-10-10 16:21:08,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 167. [2018-10-10 16:21:08,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-10-10 16:21:08,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2018-10-10 16:21:08,657 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 163 [2018-10-10 16:21:08,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:21:08,658 INFO L481 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2018-10-10 16:21:08,658 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-10 16:21:08,658 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2018-10-10 16:21:08,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-10-10 16:21:08,659 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:21:08,659 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:21:08,659 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:21:08,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:21:08,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1052162375, now seen corresponding path program 39 times [2018-10-10 16:21:08,660 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:21:08,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:21:09,617 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-10 16:21:09,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:21:09,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-10 16:21:09,618 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-10 16:21:09,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-10 16:21:09,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=864, Invalid=942, Unknown=0, NotChecked=0, Total=1806 [2018-10-10 16:21:09,618 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 43 states. [2018-10-10 16:21:10,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:21:10,846 INFO L93 Difference]: Finished difference Result 172 states and 172 transitions. [2018-10-10 16:21:10,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-10 16:21:10,847 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 166 [2018-10-10 16:21:10,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:21:10,847 INFO L225 Difference]: With dead ends: 172 [2018-10-10 16:21:10,848 INFO L226 Difference]: Without dead ends: 172 [2018-10-10 16:21:10,849 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2541, Invalid=4101, Unknown=0, NotChecked=0, Total=6642 [2018-10-10 16:21:10,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-10-10 16:21:10,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 170. [2018-10-10 16:21:10,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-10-10 16:21:10,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 170 transitions. [2018-10-10 16:21:10,853 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 170 transitions. Word has length 166 [2018-10-10 16:21:10,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:21:10,853 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 170 transitions. [2018-10-10 16:21:10,854 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-10 16:21:10,854 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 170 transitions. [2018-10-10 16:21:10,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-10-10 16:21:10,854 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:21:10,855 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:21:10,855 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:21:10,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:21:10,855 INFO L82 PathProgramCache]: Analyzing trace with hash -682813311, now seen corresponding path program 40 times [2018-10-10 16:21:10,856 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:21:10,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:21:11,807 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 2380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:21:11,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:21:11,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-10 16:21:11,807 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-10 16:21:11,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-10 16:21:11,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=906, Invalid=986, Unknown=0, NotChecked=0, Total=1892 [2018-10-10 16:21:11,808 INFO L87 Difference]: Start difference. First operand 170 states and 170 transitions. Second operand 44 states. [2018-10-10 16:21:16,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:21:16,739 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-10-10 16:21:16,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-10 16:21:16,740 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 169 [2018-10-10 16:21:16,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:21:16,741 INFO L225 Difference]: With dead ends: 175 [2018-10-10 16:21:16,741 INFO L226 Difference]: Without dead ends: 175 [2018-10-10 16:21:16,742 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=2666, Invalid=4306, Unknown=0, NotChecked=0, Total=6972 [2018-10-10 16:21:16,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-10-10 16:21:16,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 173. [2018-10-10 16:21:16,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-10-10 16:21:16,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-10-10 16:21:16,744 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 169 [2018-10-10 16:21:16,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:21:16,744 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-10-10 16:21:16,744 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-10 16:21:16,744 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-10-10 16:21:16,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-10 16:21:16,745 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:21:16,745 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:21:16,746 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:21:16,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:21:16,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1111060039, now seen corresponding path program 41 times [2018-10-10 16:21:16,746 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:21:16,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:21:18,028 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-10 16:21:18,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:21:18,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-10 16:21:18,028 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-10 16:21:18,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-10 16:21:18,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=949, Invalid=1031, Unknown=0, NotChecked=0, Total=1980 [2018-10-10 16:21:18,029 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 45 states. [2018-10-10 16:21:19,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:21:19,575 INFO L93 Difference]: Finished difference Result 178 states and 178 transitions. [2018-10-10 16:21:19,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-10 16:21:19,576 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 172 [2018-10-10 16:21:19,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:21:19,577 INFO L225 Difference]: With dead ends: 178 [2018-10-10 16:21:19,577 INFO L226 Difference]: Without dead ends: 178 [2018-10-10 16:21:19,577 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2794, Invalid=4516, Unknown=0, NotChecked=0, Total=7310 [2018-10-10 16:21:19,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-10-10 16:21:19,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 176. [2018-10-10 16:21:19,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-10-10 16:21:19,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2018-10-10 16:21:19,580 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 172 [2018-10-10 16:21:19,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:21:19,580 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2018-10-10 16:21:19,580 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-10 16:21:19,580 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2018-10-10 16:21:19,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-10-10 16:21:19,581 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:21:19,581 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:21:19,581 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:21:19,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:21:19,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1338502529, now seen corresponding path program 42 times [2018-10-10 16:21:19,582 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:21:19,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:21:20,562 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-10 16:21:20,562 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:21:20,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-10 16:21:20,563 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-10 16:21:20,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-10 16:21:20,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=993, Invalid=1077, Unknown=0, NotChecked=0, Total=2070 [2018-10-10 16:21:20,564 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 46 states. [2018-10-10 16:21:21,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:21:21,980 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2018-10-10 16:21:21,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-10 16:21:21,980 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 175 [2018-10-10 16:21:21,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:21:21,981 INFO L225 Difference]: With dead ends: 181 [2018-10-10 16:21:21,981 INFO L226 Difference]: Without dead ends: 181 [2018-10-10 16:21:21,983 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2925, Invalid=4731, Unknown=0, NotChecked=0, Total=7656 [2018-10-10 16:21:21,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-10-10 16:21:21,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 179. [2018-10-10 16:21:21,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-10-10 16:21:21,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2018-10-10 16:21:21,986 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 179 transitions. Word has length 175 [2018-10-10 16:21:21,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:21:21,986 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 179 transitions. [2018-10-10 16:21:21,986 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-10 16:21:21,986 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 179 transitions. [2018-10-10 16:21:21,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-10 16:21:21,988 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:21:21,988 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:21:21,988 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:21:21,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:21:21,988 INFO L82 PathProgramCache]: Analyzing trace with hash 467639481, now seen corresponding path program 43 times [2018-10-10 16:21:21,989 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:21:21,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:21:23,370 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-10 16:21:23,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:21:23,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-10 16:21:23,371 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-10 16:21:23,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-10 16:21:23,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1038, Invalid=1124, Unknown=0, NotChecked=0, Total=2162 [2018-10-10 16:21:23,372 INFO L87 Difference]: Start difference. First operand 179 states and 179 transitions. Second operand 47 states. [2018-10-10 16:21:25,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:21:25,022 INFO L93 Difference]: Finished difference Result 184 states and 184 transitions. [2018-10-10 16:21:25,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-10 16:21:25,022 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 178 [2018-10-10 16:21:25,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:21:25,023 INFO L225 Difference]: With dead ends: 184 [2018-10-10 16:21:25,023 INFO L226 Difference]: Without dead ends: 184 [2018-10-10 16:21:25,024 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3059, Invalid=4951, Unknown=0, NotChecked=0, Total=8010 [2018-10-10 16:21:25,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-10-10 16:21:25,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 182. [2018-10-10 16:21:25,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-10-10 16:21:25,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 182 transitions. [2018-10-10 16:21:25,026 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 182 transitions. Word has length 178 [2018-10-10 16:21:25,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:21:25,026 INFO L481 AbstractCegarLoop]: Abstraction has 182 states and 182 transitions. [2018-10-10 16:21:25,027 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-10 16:21:25,027 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 182 transitions. [2018-10-10 16:21:25,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-10-10 16:21:25,027 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:21:25,027 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:21:25,028 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:21:25,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:21:25,028 INFO L82 PathProgramCache]: Analyzing trace with hash -1810955647, now seen corresponding path program 44 times [2018-10-10 16:21:25,028 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:21:25,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:21:26,097 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-10 16:21:26,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:21:26,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-10 16:21:26,097 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-10 16:21:26,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-10 16:21:26,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1084, Invalid=1172, Unknown=0, NotChecked=0, Total=2256 [2018-10-10 16:21:26,098 INFO L87 Difference]: Start difference. First operand 182 states and 182 transitions. Second operand 48 states. [2018-10-10 16:21:27,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:21:27,756 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2018-10-10 16:21:27,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-10 16:21:27,756 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 181 [2018-10-10 16:21:27,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:21:27,757 INFO L225 Difference]: With dead ends: 187 [2018-10-10 16:21:27,757 INFO L226 Difference]: Without dead ends: 187 [2018-10-10 16:21:27,759 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 990 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3196, Invalid=5176, Unknown=0, NotChecked=0, Total=8372 [2018-10-10 16:21:27,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-10-10 16:21:27,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2018-10-10 16:21:27,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-10-10 16:21:27,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2018-10-10 16:21:27,762 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 181 [2018-10-10 16:21:27,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:21:27,762 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2018-10-10 16:21:27,763 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-10 16:21:27,763 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2018-10-10 16:21:27,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-10 16:21:27,764 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:21:27,764 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:21:27,764 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:21:27,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:21:27,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1480300615, now seen corresponding path program 45 times [2018-10-10 16:21:27,765 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:21:27,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:21:29,664 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-10 16:21:29,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:21:29,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-10 16:21:29,665 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-10 16:21:29,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-10 16:21:29,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1131, Invalid=1221, Unknown=0, NotChecked=0, Total=2352 [2018-10-10 16:21:29,665 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 49 states. [2018-10-10 16:21:31,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:21:31,322 INFO L93 Difference]: Finished difference Result 190 states and 190 transitions. [2018-10-10 16:21:31,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-10 16:21:31,323 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 184 [2018-10-10 16:21:31,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:21:31,324 INFO L225 Difference]: With dead ends: 190 [2018-10-10 16:21:31,324 INFO L226 Difference]: Without dead ends: 190 [2018-10-10 16:21:31,325 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3336, Invalid=5406, Unknown=0, NotChecked=0, Total=8742 [2018-10-10 16:21:31,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-10-10 16:21:31,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 188. [2018-10-10 16:21:31,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-10-10 16:21:31,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 188 transitions. [2018-10-10 16:21:31,328 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 188 transitions. Word has length 184 [2018-10-10 16:21:31,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:21:31,328 INFO L481 AbstractCegarLoop]: Abstraction has 188 states and 188 transitions. [2018-10-10 16:21:31,328 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-10 16:21:31,328 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 188 transitions. [2018-10-10 16:21:31,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-10-10 16:21:31,329 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:21:31,330 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:21:31,330 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:21:31,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:21:31,330 INFO L82 PathProgramCache]: Analyzing trace with hash 703747969, now seen corresponding path program 46 times [2018-10-10 16:21:31,331 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:21:31,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:21:32,849 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-10 16:21:32,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:21:32,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-10 16:21:32,850 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-10 16:21:32,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-10 16:21:32,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1179, Invalid=1271, Unknown=0, NotChecked=0, Total=2450 [2018-10-10 16:21:32,851 INFO L87 Difference]: Start difference. First operand 188 states and 188 transitions. Second operand 50 states. [2018-10-10 16:21:34,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:21:34,702 INFO L93 Difference]: Finished difference Result 193 states and 193 transitions. [2018-10-10 16:21:34,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-10 16:21:34,703 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 187 [2018-10-10 16:21:34,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:21:34,704 INFO L225 Difference]: With dead ends: 193 [2018-10-10 16:21:34,704 INFO L226 Difference]: Without dead ends: 193 [2018-10-10 16:21:34,704 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1081 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3479, Invalid=5641, Unknown=0, NotChecked=0, Total=9120 [2018-10-10 16:21:34,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-10-10 16:21:34,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 191. [2018-10-10 16:21:34,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-10-10 16:21:34,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2018-10-10 16:21:34,708 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 187 [2018-10-10 16:21:34,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:21:34,708 INFO L481 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2018-10-10 16:21:34,708 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-10 16:21:34,708 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2018-10-10 16:21:34,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-10 16:21:34,709 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:21:34,710 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:21:34,710 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:21:34,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:21:34,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1235546809, now seen corresponding path program 47 times [2018-10-10 16:21:34,711 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:21:34,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:21:35,948 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-10 16:21:35,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:21:35,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-10 16:21:35,949 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-10 16:21:35,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-10 16:21:35,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1228, Invalid=1322, Unknown=0, NotChecked=0, Total=2550 [2018-10-10 16:21:35,949 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 51 states. [2018-10-10 16:21:37,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:21:37,667 INFO L93 Difference]: Finished difference Result 196 states and 196 transitions. [2018-10-10 16:21:37,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-10 16:21:37,667 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 190 [2018-10-10 16:21:37,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:21:37,668 INFO L225 Difference]: With dead ends: 196 [2018-10-10 16:21:37,668 INFO L226 Difference]: Without dead ends: 196 [2018-10-10 16:21:37,669 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3625, Invalid=5881, Unknown=0, NotChecked=0, Total=9506 [2018-10-10 16:21:37,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-10-10 16:21:37,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 194. [2018-10-10 16:21:37,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-10-10 16:21:37,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 194 transitions. [2018-10-10 16:21:37,672 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 194 transitions. Word has length 190 [2018-10-10 16:21:37,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:21:37,672 INFO L481 AbstractCegarLoop]: Abstraction has 194 states and 194 transitions. [2018-10-10 16:21:37,672 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-10 16:21:37,673 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 194 transitions. [2018-10-10 16:21:37,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-10-10 16:21:37,673 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:21:37,673 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:21:37,674 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:21:37,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:21:37,674 INFO L82 PathProgramCache]: Analyzing trace with hash -79565695, now seen corresponding path program 48 times [2018-10-10 16:21:37,674 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:21:37,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:21:39,346 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-10 16:21:39,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:21:39,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-10-10 16:21:39,347 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-10 16:21:39,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-10 16:21:39,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1278, Invalid=1374, Unknown=0, NotChecked=0, Total=2652 [2018-10-10 16:21:39,348 INFO L87 Difference]: Start difference. First operand 194 states and 194 transitions. Second operand 52 states. [2018-10-10 16:21:41,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:21:41,026 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2018-10-10 16:21:41,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-10 16:21:41,027 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 193 [2018-10-10 16:21:41,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:21:41,028 INFO L225 Difference]: With dead ends: 199 [2018-10-10 16:21:41,028 INFO L226 Difference]: Without dead ends: 199 [2018-10-10 16:21:41,029 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-10 16:21:41,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-10-10 16:21:41,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 197. [2018-10-10 16:21:41,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-10-10 16:21:41,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2018-10-10 16:21:41,032 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 193 [2018-10-10 16:21:41,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:21:41,033 INFO L481 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2018-10-10 16:21:41,033 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-10 16:21:41,033 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2018-10-10 16:21:41,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-10-10 16:21:41,033 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:21:41,034 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:21:41,034 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:21:41,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:21:41,034 INFO L82 PathProgramCache]: Analyzing trace with hash 95501753, now seen corresponding path program 49 times [2018-10-10 16:21:41,035 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:21:41,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:21:42,434 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-10 16:21:42,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:21:42,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-10 16:21:42,435 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-10 16:21:42,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-10 16:21:42,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1329, Invalid=1427, Unknown=0, NotChecked=0, Total=2756 [2018-10-10 16:21:42,436 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 53 states. [2018-10-10 16:21:44,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:21:44,519 INFO L93 Difference]: Finished difference Result 202 states and 202 transitions. [2018-10-10 16:21:44,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-10 16:21:44,519 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 196 [2018-10-10 16:21:44,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:21:44,520 INFO L225 Difference]: With dead ends: 202 [2018-10-10 16:21:44,520 INFO L226 Difference]: Without dead ends: 202 [2018-10-10 16:21:44,521 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3926, Invalid=6376, Unknown=0, NotChecked=0, Total=10302 [2018-10-10 16:21:44,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-10-10 16:21:44,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 200. [2018-10-10 16:21:44,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-10-10 16:21:44,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 200 transitions. [2018-10-10 16:21:44,524 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 200 transitions. Word has length 196 [2018-10-10 16:21:44,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:21:44,524 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 200 transitions. [2018-10-10 16:21:44,524 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-10 16:21:44,524 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 200 transitions. [2018-10-10 16:21:44,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-10 16:21:44,525 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:21:44,526 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:21:44,526 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:21:44,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:21:44,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1439547777, now seen corresponding path program 50 times [2018-10-10 16:21:44,527 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:21:44,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:21:46,312 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-10 16:21:46,312 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:21:46,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-10-10 16:21:46,312 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-10 16:21:46,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-10 16:21:46,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1381, Invalid=1481, Unknown=0, NotChecked=0, Total=2862 [2018-10-10 16:21:46,313 INFO L87 Difference]: Start difference. First operand 200 states and 200 transitions. Second operand 54 states. [2018-10-10 16:21:48,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:21:48,192 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2018-10-10 16:21:48,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-10 16:21:48,193 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 199 [2018-10-10 16:21:48,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:21:48,196 INFO L225 Difference]: With dead ends: 205 [2018-10-10 16:21:48,196 INFO L226 Difference]: Without dead ends: 205 [2018-10-10 16:21:48,197 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1275 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4081, Invalid=6631, Unknown=0, NotChecked=0, Total=10712 [2018-10-10 16:21:48,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-10-10 16:21:48,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 203. [2018-10-10 16:21:48,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-10-10 16:21:48,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 203 transitions. [2018-10-10 16:21:48,208 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 203 transitions. Word has length 199 [2018-10-10 16:21:48,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:21:48,208 INFO L481 AbstractCegarLoop]: Abstraction has 203 states and 203 transitions. [2018-10-10 16:21:48,208 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-10 16:21:48,208 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 203 transitions. [2018-10-10 16:21:48,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-10-10 16:21:48,209 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:21:48,209 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:21:48,210 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:21:48,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:21:48,210 INFO L82 PathProgramCache]: Analyzing trace with hash -65451847, now seen corresponding path program 51 times [2018-10-10 16:21:48,211 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:21:48,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:21:49,743 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-10 16:21:49,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:21:49,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-10 16:21:49,744 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-10 16:21:49,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-10 16:21:49,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1434, Invalid=1536, Unknown=0, NotChecked=0, Total=2970 [2018-10-10 16:21:49,745 INFO L87 Difference]: Start difference. First operand 203 states and 203 transitions. Second operand 55 states. [2018-10-10 16:21:51,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:21:51,654 INFO L93 Difference]: Finished difference Result 208 states and 208 transitions. [2018-10-10 16:21:51,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-10 16:21:51,654 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 202 [2018-10-10 16:21:51,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:21:51,655 INFO L225 Difference]: With dead ends: 208 [2018-10-10 16:21:51,655 INFO L226 Difference]: Without dead ends: 208 [2018-10-10 16:21:51,656 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1326 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4239, Invalid=6891, Unknown=0, NotChecked=0, Total=11130 [2018-10-10 16:21:51,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-10-10 16:21:51,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 206. [2018-10-10 16:21:51,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-10-10 16:21:51,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 206 transitions. [2018-10-10 16:21:51,660 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 206 transitions. Word has length 202 [2018-10-10 16:21:51,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:21:51,660 INFO L481 AbstractCegarLoop]: Abstraction has 206 states and 206 transitions. [2018-10-10 16:21:51,660 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-10 16:21:51,660 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 206 transitions. [2018-10-10 16:21:51,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-10-10 16:21:51,661 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:21:51,662 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:21:51,662 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:21:51,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:21:51,662 INFO L82 PathProgramCache]: Analyzing trace with hash -345647487, now seen corresponding path program 52 times [2018-10-10 16:21:51,663 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:21:51,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:21:52,976 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-10 16:21:52,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:21:52,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-10-10 16:21:52,977 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-10 16:21:52,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-10 16:21:52,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1488, Invalid=1592, Unknown=0, NotChecked=0, Total=3080 [2018-10-10 16:21:52,978 INFO L87 Difference]: Start difference. First operand 206 states and 206 transitions. Second operand 56 states. [2018-10-10 16:21:55,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:21:55,375 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2018-10-10 16:21:55,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-10 16:21:55,376 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 205 [2018-10-10 16:21:55,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:21:55,377 INFO L225 Difference]: With dead ends: 211 [2018-10-10 16:21:55,377 INFO L226 Difference]: Without dead ends: 211 [2018-10-10 16:21:55,378 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1378 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4400, Invalid=7156, Unknown=0, NotChecked=0, Total=11556 [2018-10-10 16:21:55,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-10-10 16:21:55,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2018-10-10 16:21:55,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-10-10 16:21:55,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2018-10-10 16:21:55,380 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 205 [2018-10-10 16:21:55,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:21:55,381 INFO L481 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2018-10-10 16:21:55,381 INFO L482 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-10 16:21:55,381 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2018-10-10 16:21:55,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-10-10 16:21:55,382 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:21:55,382 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:21:55,382 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:21:55,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:21:55,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1762464697, now seen corresponding path program 53 times [2018-10-10 16:21:55,383 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:21:55,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:21:56,778 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-10 16:21:56,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:21:56,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-10 16:21:56,779 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-10 16:21:56,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-10 16:21:56,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1543, Invalid=1649, Unknown=0, NotChecked=0, Total=3192 [2018-10-10 16:21:56,779 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 57 states. [2018-10-10 16:21:58,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:21:58,990 INFO L93 Difference]: Finished difference Result 214 states and 214 transitions. [2018-10-10 16:21:58,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-10 16:21:58,990 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 208 [2018-10-10 16:21:58,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:21:58,991 INFO L225 Difference]: With dead ends: 214 [2018-10-10 16:21:58,991 INFO L226 Difference]: Without dead ends: 214 [2018-10-10 16:21:58,992 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1431 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4564, Invalid=7426, Unknown=0, NotChecked=0, Total=11990 [2018-10-10 16:21:58,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-10-10 16:21:58,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 212. [2018-10-10 16:21:58,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-10-10 16:21:58,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 212 transitions. [2018-10-10 16:21:58,994 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 212 transitions. Word has length 208 [2018-10-10 16:21:58,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:21:58,995 INFO L481 AbstractCegarLoop]: Abstraction has 212 states and 212 transitions. [2018-10-10 16:21:58,995 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-10 16:21:58,995 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 212 transitions. [2018-10-10 16:21:58,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-10-10 16:21:58,995 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:21:58,996 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:21:58,996 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:21:58,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:21:58,996 INFO L82 PathProgramCache]: Analyzing trace with hash -774231167, now seen corresponding path program 54 times [2018-10-10 16:21:58,996 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:21:59,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:00,475 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-10 16:22:00,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:00,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-10-10 16:22:00,475 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-10 16:22:00,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-10 16:22:00,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1599, Invalid=1707, Unknown=0, NotChecked=0, Total=3306 [2018-10-10 16:22:00,476 INFO L87 Difference]: Start difference. First operand 212 states and 212 transitions. Second operand 58 states. [2018-10-10 16:22:02,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:02,613 INFO L93 Difference]: Finished difference Result 217 states and 217 transitions. [2018-10-10 16:22:02,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-10 16:22:02,613 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 211 [2018-10-10 16:22:02,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:02,614 INFO L225 Difference]: With dead ends: 217 [2018-10-10 16:22:02,614 INFO L226 Difference]: Without dead ends: 217 [2018-10-10 16:22:02,615 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-10 16:22:02,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-10-10 16:22:02,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 215. [2018-10-10 16:22:02,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-10-10 16:22:02,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 215 transitions. [2018-10-10 16:22:02,618 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 215 transitions. Word has length 211 [2018-10-10 16:22:02,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:02,618 INFO L481 AbstractCegarLoop]: Abstraction has 215 states and 215 transitions. [2018-10-10 16:22:02,618 INFO L482 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-10 16:22:02,618 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 215 transitions. [2018-10-10 16:22:02,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-10-10 16:22:02,619 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:02,620 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:22:02,620 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:02,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:02,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1531142471, now seen corresponding path program 55 times [2018-10-10 16:22:02,620 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:02,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:04,397 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-10 16:22:04,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:04,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-10 16:22:04,397 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-10 16:22:04,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-10 16:22:04,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1656, Invalid=1766, Unknown=0, NotChecked=0, Total=3422 [2018-10-10 16:22:04,398 INFO L87 Difference]: Start difference. First operand 215 states and 215 transitions. Second operand 59 states. [2018-10-10 16:22:06,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:06,613 INFO L93 Difference]: Finished difference Result 220 states and 220 transitions. [2018-10-10 16:22:06,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-10 16:22:06,614 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 214 [2018-10-10 16:22:06,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:06,615 INFO L225 Difference]: With dead ends: 220 [2018-10-10 16:22:06,615 INFO L226 Difference]: Without dead ends: 220 [2018-10-10 16:22:06,615 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1540 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4901, Invalid=7981, Unknown=0, NotChecked=0, Total=12882 [2018-10-10 16:22:06,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-10-10 16:22:06,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 218. [2018-10-10 16:22:06,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-10-10 16:22:06,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 218 transitions. [2018-10-10 16:22:06,618 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 218 transitions. Word has length 214 [2018-10-10 16:22:06,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:06,618 INFO L481 AbstractCegarLoop]: Abstraction has 218 states and 218 transitions. [2018-10-10 16:22:06,618 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-10 16:22:06,618 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 218 transitions. [2018-10-10 16:22:06,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-10-10 16:22:06,619 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:06,620 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:22:06,620 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:06,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:06,620 INFO L82 PathProgramCache]: Analyzing trace with hash -2097495935, now seen corresponding path program 56 times [2018-10-10 16:22:06,621 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:06,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:08,198 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-10 16:22:08,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:08,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-10-10 16:22:08,198 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-10 16:22:08,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-10 16:22:08,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1714, Invalid=1826, Unknown=0, NotChecked=0, Total=3540 [2018-10-10 16:22:08,199 INFO L87 Difference]: Start difference. First operand 218 states and 218 transitions. Second operand 60 states. [2018-10-10 16:22:10,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:10,651 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2018-10-10 16:22:10,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-10 16:22:10,652 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 217 [2018-10-10 16:22:10,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:10,653 INFO L225 Difference]: With dead ends: 223 [2018-10-10 16:22:10,653 INFO L226 Difference]: Without dead ends: 223 [2018-10-10 16:22:10,654 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1596 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5074, Invalid=8266, Unknown=0, NotChecked=0, Total=13340 [2018-10-10 16:22:10,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-10-10 16:22:10,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 221. [2018-10-10 16:22:10,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-10-10 16:22:10,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2018-10-10 16:22:10,656 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 217 [2018-10-10 16:22:10,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:10,657 INFO L481 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2018-10-10 16:22:10,657 INFO L482 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-10 16:22:10,657 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2018-10-10 16:22:10,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-10-10 16:22:10,658 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:10,658 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:22:10,658 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:10,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:10,659 INFO L82 PathProgramCache]: Analyzing trace with hash 592964025, now seen corresponding path program 57 times [2018-10-10 16:22:10,659 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:10,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:12,739 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-10 16:22:12,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:12,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-10 16:22:12,740 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-10 16:22:12,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-10 16:22:12,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1773, Invalid=1887, Unknown=0, NotChecked=0, Total=3660 [2018-10-10 16:22:12,741 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 61 states. [2018-10-10 16:22:15,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:15,254 INFO L93 Difference]: Finished difference Result 226 states and 226 transitions. [2018-10-10 16:22:15,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-10 16:22:15,254 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 220 [2018-10-10 16:22:15,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:15,255 INFO L225 Difference]: With dead ends: 226 [2018-10-10 16:22:15,255 INFO L226 Difference]: Without dead ends: 226 [2018-10-10 16:22:15,257 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-10 16:22:15,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-10-10 16:22:15,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 224. [2018-10-10 16:22:15,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-10-10 16:22:15,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 224 transitions. [2018-10-10 16:22:15,259 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 224 transitions. Word has length 220 [2018-10-10 16:22:15,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:15,260 INFO L481 AbstractCegarLoop]: Abstraction has 224 states and 224 transitions. [2018-10-10 16:22:15,260 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-10 16:22:15,260 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 224 transitions. [2018-10-10 16:22:15,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-10-10 16:22:15,261 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:15,261 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:22:15,261 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:15,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:15,262 INFO L82 PathProgramCache]: Analyzing trace with hash -594045567, now seen corresponding path program 58 times [2018-10-10 16:22:15,262 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:15,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:16,934 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-10 16:22:16,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:16,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-10-10 16:22:16,934 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-10 16:22:16,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-10 16:22:16,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1833, Invalid=1949, Unknown=0, NotChecked=0, Total=3782 [2018-10-10 16:22:16,935 INFO L87 Difference]: Start difference. First operand 224 states and 224 transitions. Second operand 62 states. [2018-10-10 16:22:19,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:19,695 INFO L93 Difference]: Finished difference Result 229 states and 229 transitions. [2018-10-10 16:22:19,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-10 16:22:19,695 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 223 [2018-10-10 16:22:19,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:19,696 INFO L225 Difference]: With dead ends: 229 [2018-10-10 16:22:19,696 INFO L226 Difference]: Without dead ends: 229 [2018-10-10 16:22:19,696 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-10 16:22:19,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-10-10 16:22:19,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 227. [2018-10-10 16:22:19,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-10-10 16:22:19,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2018-10-10 16:22:19,699 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 223 [2018-10-10 16:22:19,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:19,699 INFO L481 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2018-10-10 16:22:19,699 INFO L482 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-10 16:22:19,699 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2018-10-10 16:22:19,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-10-10 16:22:19,700 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:19,700 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:22:19,700 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:19,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:19,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1963914425, now seen corresponding path program 59 times [2018-10-10 16:22:19,701 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:19,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:21,326 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-10 16:22:21,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:21,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-10 16:22:21,326 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-10 16:22:21,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-10 16:22:21,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1894, Invalid=2012, Unknown=0, NotChecked=0, Total=3906 [2018-10-10 16:22:21,328 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 63 states. [2018-10-10 16:22:23,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:23,917 INFO L93 Difference]: Finished difference Result 232 states and 232 transitions. [2018-10-10 16:22:23,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-10 16:22:23,918 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 226 [2018-10-10 16:22:23,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:23,919 INFO L225 Difference]: With dead ends: 232 [2018-10-10 16:22:23,919 INFO L226 Difference]: Without dead ends: 232 [2018-10-10 16:22:23,920 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1770 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5611, Invalid=9151, Unknown=0, NotChecked=0, Total=14762 [2018-10-10 16:22:23,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-10-10 16:22:23,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 230. [2018-10-10 16:22:23,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-10-10 16:22:23,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 230 transitions. [2018-10-10 16:22:23,923 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 230 transitions. Word has length 226 [2018-10-10 16:22:23,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:23,923 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 230 transitions. [2018-10-10 16:22:23,923 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-10 16:22:23,924 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 230 transitions. [2018-10-10 16:22:23,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-10-10 16:22:23,925 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:23,925 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:22:23,925 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:23,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:23,925 INFO L82 PathProgramCache]: Analyzing trace with hash 545303169, now seen corresponding path program 60 times [2018-10-10 16:22:23,926 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:23,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:25,889 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-10 16:22:25,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:25,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-10-10 16:22:25,890 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-10 16:22:25,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-10 16:22:25,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1956, Invalid=2076, Unknown=0, NotChecked=0, Total=4032 [2018-10-10 16:22:25,891 INFO L87 Difference]: Start difference. First operand 230 states and 230 transitions. Second operand 64 states. [2018-10-10 16:22:28,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:28,621 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2018-10-10 16:22:28,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-10 16:22:28,621 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 229 [2018-10-10 16:22:28,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:28,622 INFO L225 Difference]: With dead ends: 235 [2018-10-10 16:22:28,622 INFO L226 Difference]: Without dead ends: 235 [2018-10-10 16:22:28,623 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1830 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5796, Invalid=9456, Unknown=0, NotChecked=0, Total=15252 [2018-10-10 16:22:28,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-10-10 16:22:28,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 233. [2018-10-10 16:22:28,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-10-10 16:22:28,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2018-10-10 16:22:28,625 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 229 [2018-10-10 16:22:28,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:28,626 INFO L481 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2018-10-10 16:22:28,626 INFO L482 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-10 16:22:28,626 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2018-10-10 16:22:28,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-10-10 16:22:28,627 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:28,627 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:22:28,628 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:28,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:28,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1175568313, now seen corresponding path program 61 times [2018-10-10 16:22:28,629 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:28,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:30,787 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-10 16:22:30,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:30,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-10 16:22:30,788 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-10 16:22:30,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-10 16:22:30,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2019, Invalid=2141, Unknown=0, NotChecked=0, Total=4160 [2018-10-10 16:22:30,789 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 65 states. [2018-10-10 16:22:33,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:33,406 INFO L93 Difference]: Finished difference Result 238 states and 238 transitions. [2018-10-10 16:22:33,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-10 16:22:33,407 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 232 [2018-10-10 16:22:33,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:33,407 INFO L225 Difference]: With dead ends: 238 [2018-10-10 16:22:33,408 INFO L226 Difference]: Without dead ends: 238 [2018-10-10 16:22:33,408 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-10 16:22:33,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-10-10 16:22:33,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 236. [2018-10-10 16:22:33,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-10-10 16:22:33,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 236 transitions. [2018-10-10 16:22:33,411 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 236 transitions. Word has length 232 [2018-10-10 16:22:33,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:33,412 INFO L481 AbstractCegarLoop]: Abstraction has 236 states and 236 transitions. [2018-10-10 16:22:33,412 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-10 16:22:33,412 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 236 transitions. [2018-10-10 16:22:33,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-10-10 16:22:33,413 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:33,413 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:22:33,414 INFO L424 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:33,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:33,414 INFO L82 PathProgramCache]: Analyzing trace with hash -192544895, now seen corresponding path program 62 times [2018-10-10 16:22:33,414 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:33,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:35,591 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-10 16:22:35,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:35,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-10-10 16:22:35,592 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-10 16:22:35,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-10 16:22:35,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2083, Invalid=2207, Unknown=0, NotChecked=0, Total=4290 [2018-10-10 16:22:35,593 INFO L87 Difference]: Start difference. First operand 236 states and 236 transitions. Second operand 66 states. [2018-10-10 16:22:38,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:38,176 INFO L93 Difference]: Finished difference Result 241 states and 241 transitions. [2018-10-10 16:22:38,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-10 16:22:38,176 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 235 [2018-10-10 16:22:38,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:38,177 INFO L225 Difference]: With dead ends: 241 [2018-10-10 16:22:38,177 INFO L226 Difference]: Without dead ends: 241 [2018-10-10 16:22:38,178 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1953 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6175, Invalid=10081, Unknown=0, NotChecked=0, Total=16256 [2018-10-10 16:22:38,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-10-10 16:22:38,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 239. [2018-10-10 16:22:38,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-10-10 16:22:38,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 239 transitions. [2018-10-10 16:22:38,181 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 239 transitions. Word has length 235 [2018-10-10 16:22:38,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:38,181 INFO L481 AbstractCegarLoop]: Abstraction has 239 states and 239 transitions. [2018-10-10 16:22:38,181 INFO L482 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-10 16:22:38,181 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 239 transitions. [2018-10-10 16:22:38,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-10-10 16:22:38,182 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:38,182 INFO L375 BasicCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:22:38,182 INFO L424 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:38,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:38,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1586514617, now seen corresponding path program 63 times [2018-10-10 16:22:38,183 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:38,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:40,291 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-10 16:22:40,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:40,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-10 16:22:40,292 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-10 16:22:40,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-10 16:22:40,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2148, Invalid=2274, Unknown=0, NotChecked=0, Total=4422 [2018-10-10 16:22:40,293 INFO L87 Difference]: Start difference. First operand 239 states and 239 transitions. Second operand 67 states. [2018-10-10 16:22:43,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:43,088 INFO L93 Difference]: Finished difference Result 244 states and 244 transitions. [2018-10-10 16:22:43,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-10 16:22:43,088 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 238 [2018-10-10 16:22:43,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:43,089 INFO L225 Difference]: With dead ends: 244 [2018-10-10 16:22:43,089 INFO L226 Difference]: Without dead ends: 244 [2018-10-10 16:22:43,090 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6369, Invalid=10401, Unknown=0, NotChecked=0, Total=16770 [2018-10-10 16:22:43,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-10-10 16:22:43,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 242. [2018-10-10 16:22:43,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-10-10 16:22:43,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 242 transitions. [2018-10-10 16:22:43,093 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 242 transitions. Word has length 238 [2018-10-10 16:22:43,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:43,093 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 242 transitions. [2018-10-10 16:22:43,093 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-10 16:22:43,093 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 242 transitions. [2018-10-10 16:22:43,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-10-10 16:22:43,094 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:43,095 INFO L375 BasicCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:22:43,095 INFO L424 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:43,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:43,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1652003969, now seen corresponding path program 64 times [2018-10-10 16:22:43,096 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:43,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:45,300 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-10 16:22:45,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:45,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-10-10 16:22:45,301 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-10 16:22:45,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-10 16:22:45,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2214, Invalid=2342, Unknown=0, NotChecked=0, Total=4556 [2018-10-10 16:22:45,302 INFO L87 Difference]: Start difference. First operand 242 states and 242 transitions. Second operand 68 states. [2018-10-10 16:22:48,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:48,196 INFO L93 Difference]: Finished difference Result 247 states and 247 transitions. [2018-10-10 16:22:48,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-10 16:22:48,197 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 241 [2018-10-10 16:22:48,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:48,198 INFO L225 Difference]: With dead ends: 247 [2018-10-10 16:22:48,198 INFO L226 Difference]: Without dead ends: 247 [2018-10-10 16:22:48,199 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2080 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6566, Invalid=10726, Unknown=0, NotChecked=0, Total=17292 [2018-10-10 16:22:48,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-10-10 16:22:48,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 245. [2018-10-10 16:22:48,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-10-10 16:22:48,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2018-10-10 16:22:48,201 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 241 [2018-10-10 16:22:48,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:48,201 INFO L481 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2018-10-10 16:22:48,202 INFO L482 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-10 16:22:48,202 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2018-10-10 16:22:48,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-10-10 16:22:48,203 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:48,203 INFO L375 BasicCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:22:48,203 INFO L424 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:48,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:48,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1564830279, now seen corresponding path program 65 times [2018-10-10 16:22:48,204 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:48,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:50,600 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-10 16:22:50,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:50,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-10 16:22:50,600 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-10 16:22:50,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-10 16:22:50,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2281, Invalid=2411, Unknown=0, NotChecked=0, Total=4692 [2018-10-10 16:22:50,601 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 69 states. [2018-10-10 16:22:53,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:53,369 INFO L93 Difference]: Finished difference Result 250 states and 250 transitions. [2018-10-10 16:22:53,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-10 16:22:53,370 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 244 [2018-10-10 16:22:53,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:53,371 INFO L225 Difference]: With dead ends: 250 [2018-10-10 16:22:53,371 INFO L226 Difference]: Without dead ends: 250 [2018-10-10 16:22:53,372 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2145 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6766, Invalid=11056, Unknown=0, NotChecked=0, Total=17822 [2018-10-10 16:22:53,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-10-10 16:22:53,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2018-10-10 16:22:53,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-10-10 16:22:53,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 248 transitions. [2018-10-10 16:22:53,375 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 248 transitions. Word has length 244 [2018-10-10 16:22:53,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:53,375 INFO L481 AbstractCegarLoop]: Abstraction has 248 states and 248 transitions. [2018-10-10 16:22:53,375 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-10 16:22:53,376 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 248 transitions. [2018-10-10 16:22:53,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-10-10 16:22:53,377 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:53,377 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:22:53,377 INFO L424 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:53,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:53,377 INFO L82 PathProgramCache]: Analyzing trace with hash -668636799, now seen corresponding path program 66 times [2018-10-10 16:22:53,378 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:53,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:55,692 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-10 16:22:55,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:55,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-10-10 16:22:55,693 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-10-10 16:22:55,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-10-10 16:22:55,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2349, Invalid=2481, Unknown=0, NotChecked=0, Total=4830 [2018-10-10 16:22:55,693 INFO L87 Difference]: Start difference. First operand 248 states and 248 transitions. Second operand 70 states. [2018-10-10 16:22:58,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:58,692 INFO L93 Difference]: Finished difference Result 253 states and 253 transitions. [2018-10-10 16:22:58,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-10 16:22:58,692 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 247 [2018-10-10 16:22:58,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:58,693 INFO L225 Difference]: With dead ends: 253 [2018-10-10 16:22:58,693 INFO L226 Difference]: Without dead ends: 253 [2018-10-10 16:22:58,694 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2211 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6969, Invalid=11391, Unknown=0, NotChecked=0, Total=18360 [2018-10-10 16:22:58,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-10-10 16:22:58,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 251. [2018-10-10 16:22:58,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-10-10 16:22:58,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 251 transitions. [2018-10-10 16:22:58,697 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 251 transitions. Word has length 247 [2018-10-10 16:22:58,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:58,697 INFO L481 AbstractCegarLoop]: Abstraction has 251 states and 251 transitions. [2018-10-10 16:22:58,697 INFO L482 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-10-10 16:22:58,697 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 251 transitions. [2018-10-10 16:22:58,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-10-10 16:22:58,698 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:58,698 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:22:58,698 INFO L424 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:58,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:58,698 INFO L82 PathProgramCache]: Analyzing trace with hash 314613945, now seen corresponding path program 67 times [2018-10-10 16:22:58,699 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:58,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:01,048 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-10 16:23:01,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:01,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-10 16:23:01,049 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-10 16:23:01,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-10 16:23:01,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2418, Invalid=2552, Unknown=0, NotChecked=0, Total=4970 [2018-10-10 16:23:01,050 INFO L87 Difference]: Start difference. First operand 251 states and 251 transitions. Second operand 71 states. [2018-10-10 16:23:04,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:04,025 INFO L93 Difference]: Finished difference Result 256 states and 256 transitions. [2018-10-10 16:23:04,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-10 16:23:04,025 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 250 [2018-10-10 16:23:04,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:04,026 INFO L225 Difference]: With dead ends: 256 [2018-10-10 16:23:04,026 INFO L226 Difference]: Without dead ends: 256 [2018-10-10 16:23:04,028 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2278 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=7175, Invalid=11731, Unknown=0, NotChecked=0, Total=18906 [2018-10-10 16:23:04,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-10-10 16:23:04,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 254. [2018-10-10 16:23:04,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-10-10 16:23:04,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 254 transitions. [2018-10-10 16:23:04,030 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 254 transitions. Word has length 250 [2018-10-10 16:23:04,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:04,030 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 254 transitions. [2018-10-10 16:23:04,030 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-10 16:23:04,030 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 254 transitions. [2018-10-10 16:23:04,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-10-10 16:23:04,031 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:04,032 INFO L375 BasicCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:23:04,032 INFO L424 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:04,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:04,032 INFO L82 PathProgramCache]: Analyzing trace with hash 660569729, now seen corresponding path program 68 times [2018-10-10 16:23:04,032 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:04,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:06,546 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-10 16:23:06,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:06,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-10-10 16:23:06,546 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-10 16:23:06,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-10 16:23:06,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2488, Invalid=2624, Unknown=0, NotChecked=0, Total=5112 [2018-10-10 16:23:06,547 INFO L87 Difference]: Start difference. First operand 254 states and 254 transitions. Second operand 72 states. [2018-10-10 16:23:09,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:09,782 INFO L93 Difference]: Finished difference Result 259 states and 259 transitions. [2018-10-10 16:23:09,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-10 16:23:09,782 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 253 [2018-10-10 16:23:09,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:09,783 INFO L225 Difference]: With dead ends: 259 [2018-10-10 16:23:09,783 INFO L226 Difference]: Without dead ends: 259 [2018-10-10 16:23:09,784 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2346 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=7384, Invalid=12076, Unknown=0, NotChecked=0, Total=19460 [2018-10-10 16:23:09,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-10-10 16:23:09,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 257. [2018-10-10 16:23:09,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-10-10 16:23:09,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2018-10-10 16:23:09,786 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 253 [2018-10-10 16:23:09,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:09,787 INFO L481 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2018-10-10 16:23:09,787 INFO L482 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-10 16:23:09,787 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2018-10-10 16:23:09,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-10-10 16:23:09,788 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:09,788 INFO L375 BasicCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:23:09,788 INFO L424 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:09,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:09,788 INFO L82 PathProgramCache]: Analyzing trace with hash -892179527, now seen corresponding path program 69 times [2018-10-10 16:23:09,789 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:09,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:12,344 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-10 16:23:12,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:12,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-10 16:23:12,345 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-10 16:23:12,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-10 16:23:12,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2559, Invalid=2697, Unknown=0, NotChecked=0, Total=5256 [2018-10-10 16:23:12,346 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 73 states. [2018-10-10 16:23:15,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:15,814 INFO L93 Difference]: Finished difference Result 262 states and 262 transitions. [2018-10-10 16:23:15,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-10 16:23:15,814 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 256 [2018-10-10 16:23:15,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:15,815 INFO L225 Difference]: With dead ends: 262 [2018-10-10 16:23:15,815 INFO L226 Difference]: Without dead ends: 262 [2018-10-10 16:23:15,816 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2415 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=7596, Invalid=12426, Unknown=0, NotChecked=0, Total=20022 [2018-10-10 16:23:15,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-10-10 16:23:15,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2018-10-10 16:23:15,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-10-10 16:23:15,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 260 transitions. [2018-10-10 16:23:15,819 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 260 transitions. Word has length 256 [2018-10-10 16:23:15,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:15,819 INFO L481 AbstractCegarLoop]: Abstraction has 260 states and 260 transitions. [2018-10-10 16:23:15,819 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-10 16:23:15,819 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 260 transitions. [2018-10-10 16:23:15,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-10-10 16:23:15,820 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:15,820 INFO L375 BasicCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:23:15,820 INFO L424 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:15,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:15,821 INFO L82 PathProgramCache]: Analyzing trace with hash -2047487103, now seen corresponding path program 70 times [2018-10-10 16:23:15,821 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:15,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:18,134 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-10 16:23:18,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:18,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-10-10 16:23:18,135 INFO L460 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-10-10 16:23:18,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-10-10 16:23:18,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2631, Invalid=2771, Unknown=0, NotChecked=0, Total=5402 [2018-10-10 16:23:18,136 INFO L87 Difference]: Start difference. First operand 260 states and 260 transitions. Second operand 74 states. [2018-10-10 16:23:21,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:21,618 INFO L93 Difference]: Finished difference Result 265 states and 265 transitions. [2018-10-10 16:23:21,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-10 16:23:21,618 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 259 [2018-10-10 16:23:21,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:21,619 INFO L225 Difference]: With dead ends: 265 [2018-10-10 16:23:21,619 INFO L226 Difference]: Without dead ends: 265 [2018-10-10 16:23:21,620 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2485 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7811, Invalid=12781, Unknown=0, NotChecked=0, Total=20592 [2018-10-10 16:23:21,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-10-10 16:23:21,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 263. [2018-10-10 16:23:21,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-10-10 16:23:21,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 263 transitions. [2018-10-10 16:23:21,622 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 263 transitions. Word has length 259 [2018-10-10 16:23:21,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:21,622 INFO L481 AbstractCegarLoop]: Abstraction has 263 states and 263 transitions. [2018-10-10 16:23:21,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-10-10 16:23:21,622 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 263 transitions. [2018-10-10 16:23:21,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-10-10 16:23:21,623 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:21,623 INFO L375 BasicCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:23:21,623 INFO L424 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:21,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:21,624 INFO L82 PathProgramCache]: Analyzing trace with hash 52426425, now seen corresponding path program 71 times [2018-10-10 16:23:21,624 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:21,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:23,890 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-10 16:23:23,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:23,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-10 16:23:23,890 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-10 16:23:23,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-10 16:23:23,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2704, Invalid=2846, Unknown=0, NotChecked=0, Total=5550 [2018-10-10 16:23:23,891 INFO L87 Difference]: Start difference. First operand 263 states and 263 transitions. Second operand 75 states. [2018-10-10 16:23:27,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:27,671 INFO L93 Difference]: Finished difference Result 268 states and 268 transitions. [2018-10-10 16:23:27,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-10 16:23:27,671 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 262 [2018-10-10 16:23:27,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:27,672 INFO L225 Difference]: With dead ends: 268 [2018-10-10 16:23:27,672 INFO L226 Difference]: Without dead ends: 268 [2018-10-10 16:23:27,674 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2556 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=8029, Invalid=13141, Unknown=0, NotChecked=0, Total=21170 [2018-10-10 16:23:27,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-10-10 16:23:27,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 266. [2018-10-10 16:23:27,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-10-10 16:23:27,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 266 transitions. [2018-10-10 16:23:27,676 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 266 transitions. Word has length 262 [2018-10-10 16:23:27,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:27,676 INFO L481 AbstractCegarLoop]: Abstraction has 266 states and 266 transitions. [2018-10-10 16:23:27,677 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-10 16:23:27,677 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 266 transitions. [2018-10-10 16:23:27,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-10-10 16:23:27,677 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:27,678 INFO L375 BasicCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:23:27,678 INFO L424 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:27,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:27,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1917294463, now seen corresponding path program 72 times [2018-10-10 16:23:27,678 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:27,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:30,057 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-10 16:23:30,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:30,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-10-10 16:23:30,058 INFO L460 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-10-10 16:23:30,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-10-10 16:23:30,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2778, Invalid=2922, Unknown=0, NotChecked=0, Total=5700 [2018-10-10 16:23:30,059 INFO L87 Difference]: Start difference. First operand 266 states and 266 transitions. Second operand 76 states. [2018-10-10 16:23:33,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:33,995 INFO L93 Difference]: Finished difference Result 271 states and 271 transitions. [2018-10-10 16:23:33,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-10 16:23:33,995 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 265 [2018-10-10 16:23:33,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:33,996 INFO L225 Difference]: With dead ends: 271 [2018-10-10 16:23:33,996 INFO L226 Difference]: Without dead ends: 271 [2018-10-10 16:23:33,997 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2628 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=8250, Invalid=13506, Unknown=0, NotChecked=0, Total=21756 [2018-10-10 16:23:33,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-10-10 16:23:33,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 269. [2018-10-10 16:23:33,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-10-10 16:23:33,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 269 transitions. [2018-10-10 16:23:33,999 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 269 transitions. Word has length 265 [2018-10-10 16:23:33,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:33,999 INFO L481 AbstractCegarLoop]: Abstraction has 269 states and 269 transitions. [2018-10-10 16:23:33,999 INFO L482 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-10-10 16:23:33,999 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 269 transitions. [2018-10-10 16:23:34,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-10-10 16:23:34,000 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:34,000 INFO L375 BasicCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:23:34,000 INFO L424 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:34,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:34,001 INFO L82 PathProgramCache]: Analyzing trace with hash 265896377, now seen corresponding path program 73 times [2018-10-10 16:23:34,001 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:34,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:36,871 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-10 16:23:36,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:36,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-10-10 16:23:36,872 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-10 16:23:36,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-10 16:23:36,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2853, Invalid=2999, Unknown=0, NotChecked=0, Total=5852 [2018-10-10 16:23:36,873 INFO L87 Difference]: Start difference. First operand 269 states and 269 transitions. Second operand 77 states. [2018-10-10 16:23:40,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:40,474 INFO L93 Difference]: Finished difference Result 274 states and 274 transitions. [2018-10-10 16:23:40,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-10 16:23:40,475 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 268 [2018-10-10 16:23:40,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:40,476 INFO L225 Difference]: With dead ends: 274 [2018-10-10 16:23:40,476 INFO L226 Difference]: Without dead ends: 274 [2018-10-10 16:23:40,477 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2701 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=8474, Invalid=13876, Unknown=0, NotChecked=0, Total=22350 [2018-10-10 16:23:40,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-10-10 16:23:40,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 272. [2018-10-10 16:23:40,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-10-10 16:23:40,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 272 transitions. [2018-10-10 16:23:40,479 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 272 transitions. Word has length 268 [2018-10-10 16:23:40,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:40,480 INFO L481 AbstractCegarLoop]: Abstraction has 272 states and 272 transitions. [2018-10-10 16:23:40,480 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-10 16:23:40,480 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 272 transitions. [2018-10-10 16:23:40,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-10-10 16:23:40,481 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:40,481 INFO L375 BasicCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:23:40,481 INFO L424 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:40,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:40,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1014447489, now seen corresponding path program 74 times [2018-10-10 16:23:40,482 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:40,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:43,321 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-10 16:23:43,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:43,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-10-10 16:23:43,322 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-10 16:23:43,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-10 16:23:43,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2929, Invalid=3077, Unknown=0, NotChecked=0, Total=6006 [2018-10-10 16:23:43,323 INFO L87 Difference]: Start difference. First operand 272 states and 272 transitions. Second operand 78 states. [2018-10-10 16:23:47,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:47,210 INFO L93 Difference]: Finished difference Result 277 states and 277 transitions. [2018-10-10 16:23:47,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-10 16:23:47,210 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 271 [2018-10-10 16:23:47,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:47,211 INFO L225 Difference]: With dead ends: 277 [2018-10-10 16:23:47,211 INFO L226 Difference]: Without dead ends: 277 [2018-10-10 16:23:47,212 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2775 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=8701, Invalid=14251, Unknown=0, NotChecked=0, Total=22952 [2018-10-10 16:23:47,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-10-10 16:23:47,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 275. [2018-10-10 16:23:47,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-10-10 16:23:47,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 275 transitions. [2018-10-10 16:23:47,215 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 275 transitions. Word has length 271 [2018-10-10 16:23:47,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:47,215 INFO L481 AbstractCegarLoop]: Abstraction has 275 states and 275 transitions. [2018-10-10 16:23:47,215 INFO L482 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-10 16:23:47,216 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 275 transitions. [2018-10-10 16:23:47,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-10-10 16:23:47,216 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:47,217 INFO L375 BasicCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:23:47,217 INFO L424 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:47,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:47,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1630424249, now seen corresponding path program 75 times [2018-10-10 16:23:47,218 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:47,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:49,801 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-10 16:23:49,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:49,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-10-10 16:23:49,801 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-10 16:23:49,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-10 16:23:49,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3006, Invalid=3156, Unknown=0, NotChecked=0, Total=6162 [2018-10-10 16:23:49,802 INFO L87 Difference]: Start difference. First operand 275 states and 275 transitions. Second operand 79 states. [2018-10-10 16:23:53,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:53,849 INFO L93 Difference]: Finished difference Result 280 states and 280 transitions. [2018-10-10 16:23:53,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-10 16:23:53,850 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 274 [2018-10-10 16:23:53,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:53,851 INFO L225 Difference]: With dead ends: 280 [2018-10-10 16:23:53,851 INFO L226 Difference]: Without dead ends: 280 [2018-10-10 16:23:53,852 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2850 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=8931, Invalid=14631, Unknown=0, NotChecked=0, Total=23562 [2018-10-10 16:23:53,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-10-10 16:23:53,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 278. [2018-10-10 16:23:53,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-10-10 16:23:53,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 278 transitions. [2018-10-10 16:23:53,855 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 278 transitions. Word has length 274 [2018-10-10 16:23:53,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:53,855 INFO L481 AbstractCegarLoop]: Abstraction has 278 states and 278 transitions. [2018-10-10 16:23:53,855 INFO L482 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-10 16:23:53,855 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 278 transitions. [2018-10-10 16:23:53,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-10-10 16:23:53,856 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:53,856 INFO L375 BasicCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:23:53,856 INFO L424 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:53,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:53,856 INFO L82 PathProgramCache]: Analyzing trace with hash -201174399, now seen corresponding path program 76 times [2018-10-10 16:23:53,857 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:53,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:56,777 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-10 16:23:56,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:56,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-10-10 16:23:56,778 INFO L460 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-10-10 16:23:56,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-10-10 16:23:56,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3084, Invalid=3236, Unknown=0, NotChecked=0, Total=6320 [2018-10-10 16:23:56,779 INFO L87 Difference]: Start difference. First operand 278 states and 278 transitions. Second operand 80 states. [2018-10-10 16:24:00,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:24:00,674 INFO L93 Difference]: Finished difference Result 283 states and 283 transitions. [2018-10-10 16:24:00,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-10 16:24:00,675 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 277 [2018-10-10 16:24:00,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:24:00,676 INFO L225 Difference]: With dead ends: 283 [2018-10-10 16:24:00,676 INFO L226 Difference]: Without dead ends: 283 [2018-10-10 16:24:00,677 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2926 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=9164, Invalid=15016, Unknown=0, NotChecked=0, Total=24180 [2018-10-10 16:24:00,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-10-10 16:24:00,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 281. [2018-10-10 16:24:00,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-10-10 16:24:00,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2018-10-10 16:24:00,679 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 277 [2018-10-10 16:24:00,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:24:00,680 INFO L481 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2018-10-10 16:24:00,680 INFO L482 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-10-10 16:24:00,680 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2018-10-10 16:24:00,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-10-10 16:24:00,681 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:24:00,681 INFO L375 BasicCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:24:00,681 INFO L424 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:24:00,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:24:00,682 INFO L82 PathProgramCache]: Analyzing trace with hash -2091968583, now seen corresponding path program 77 times [2018-10-10 16:24:00,682 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:24:00,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:24:03,660 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-10 16:24:03,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:24:03,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-10 16:24:03,661 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-10 16:24:03,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-10 16:24:03,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3163, Invalid=3317, Unknown=0, NotChecked=0, Total=6480 [2018-10-10 16:24:03,663 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 81 states. [2018-10-10 16:24:07,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:24:07,711 INFO L93 Difference]: Finished difference Result 286 states and 286 transitions. [2018-10-10 16:24:07,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-10 16:24:07,712 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 280 [2018-10-10 16:24:07,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:24:07,713 INFO L225 Difference]: With dead ends: 286 [2018-10-10 16:24:07,713 INFO L226 Difference]: Without dead ends: 286 [2018-10-10 16:24:07,715 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-10 16:24:07,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-10-10 16:24:07,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 284. [2018-10-10 16:24:07,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-10-10 16:24:07,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 284 transitions. [2018-10-10 16:24:07,718 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 284 transitions. Word has length 280 [2018-10-10 16:24:07,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:24:07,718 INFO L481 AbstractCegarLoop]: Abstraction has 284 states and 284 transitions. [2018-10-10 16:24:07,718 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-10 16:24:07,718 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 284 transitions. [2018-10-10 16:24:07,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2018-10-10 16:24:07,719 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:24:07,719 INFO L375 BasicCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:24:07,719 INFO L424 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:24:07,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:24:07,720 INFO L82 PathProgramCache]: Analyzing trace with hash 2049550209, now seen corresponding path program 78 times [2018-10-10 16:24:07,720 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:24:07,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:24:10,492 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-10 16:24:10,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:24:10,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-10-10 16:24:10,493 INFO L460 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-10-10 16:24:10,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-10-10 16:24:10,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3243, Invalid=3399, Unknown=0, NotChecked=0, Total=6642 [2018-10-10 16:24:10,494 INFO L87 Difference]: Start difference. First operand 284 states and 284 transitions. Second operand 82 states. [2018-10-10 16:24:14,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:24:14,757 INFO L93 Difference]: Finished difference Result 289 states and 289 transitions. [2018-10-10 16:24:14,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-10 16:24:14,758 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 283 [2018-10-10 16:24:14,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:24:14,759 INFO L225 Difference]: With dead ends: 289 [2018-10-10 16:24:14,759 INFO L226 Difference]: Without dead ends: 289 [2018-10-10 16:24:14,760 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3081 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=9639, Invalid=15801, Unknown=0, NotChecked=0, Total=25440 [2018-10-10 16:24:14,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-10-10 16:24:14,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 287. [2018-10-10 16:24:14,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-10-10 16:24:14,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 287 transitions. [2018-10-10 16:24:14,763 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 287 transitions. Word has length 283 [2018-10-10 16:24:14,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:24:14,763 INFO L481 AbstractCegarLoop]: Abstraction has 287 states and 287 transitions. [2018-10-10 16:24:14,763 INFO L482 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-10-10 16:24:14,763 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 287 transitions. [2018-10-10 16:24:14,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-10-10 16:24:14,764 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:24:14,764 INFO L375 BasicCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:24:14,764 INFO L424 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:24:14,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:24:14,765 INFO L82 PathProgramCache]: Analyzing trace with hash 510370489, now seen corresponding path program 79 times [2018-10-10 16:24:14,765 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:24:14,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:24:17,950 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-10 16:24:17,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:24:17,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-10 16:24:17,951 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-10 16:24:17,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-10 16:24:17,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3324, Invalid=3482, Unknown=0, NotChecked=0, Total=6806 [2018-10-10 16:24:17,952 INFO L87 Difference]: Start difference. First operand 287 states and 287 transitions. Second operand 83 states. [2018-10-10 16:24:22,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:24:22,427 INFO L93 Difference]: Finished difference Result 292 states and 292 transitions. [2018-10-10 16:24:22,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-10-10 16:24:22,427 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 286 [2018-10-10 16:24:22,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:24:22,428 INFO L225 Difference]: With dead ends: 292 [2018-10-10 16:24:22,428 INFO L226 Difference]: Without dead ends: 292 [2018-10-10 16:24:22,430 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3160 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=9881, Invalid=16201, Unknown=0, NotChecked=0, Total=26082 [2018-10-10 16:24:22,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-10-10 16:24:22,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 290. [2018-10-10 16:24:22,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-10-10 16:24:22,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 290 transitions. [2018-10-10 16:24:22,432 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 290 transitions. Word has length 286 [2018-10-10 16:24:22,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:24:22,432 INFO L481 AbstractCegarLoop]: Abstraction has 290 states and 290 transitions. [2018-10-10 16:24:22,432 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-10 16:24:22,433 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 290 transitions. [2018-10-10 16:24:22,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-10-10 16:24:22,433 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:24:22,434 INFO L375 BasicCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:24:22,434 INFO L424 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:24:22,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:24:22,434 INFO L82 PathProgramCache]: Analyzing trace with hash -121815935, now seen corresponding path program 80 times [2018-10-10 16:24:22,435 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:24:22,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:24:25,314 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-10 16:24:25,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:24:25,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-10-10 16:24:25,315 INFO L460 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-10-10 16:24:25,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-10-10 16:24:25,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3406, Invalid=3566, Unknown=0, NotChecked=0, Total=6972 [2018-10-10 16:24:25,316 INFO L87 Difference]: Start difference. First operand 290 states and 290 transitions. Second operand 84 states. [2018-10-10 16:24:29,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:24:29,611 INFO L93 Difference]: Finished difference Result 295 states and 295 transitions. [2018-10-10 16:24:29,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-10 16:24:29,611 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 289 [2018-10-10 16:24:29,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:24:29,612 INFO L225 Difference]: With dead ends: 295 [2018-10-10 16:24:29,612 INFO L226 Difference]: Without dead ends: 295 [2018-10-10 16:24:29,614 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3240 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=10126, Invalid=16606, Unknown=0, NotChecked=0, Total=26732 [2018-10-10 16:24:29,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-10-10 16:24:29,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 293. [2018-10-10 16:24:29,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-10-10 16:24:29,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions. [2018-10-10 16:24:29,616 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 289 [2018-10-10 16:24:29,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:24:29,616 INFO L481 AbstractCegarLoop]: Abstraction has 293 states and 293 transitions. [2018-10-10 16:24:29,616 INFO L482 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-10-10 16:24:29,617 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 293 transitions. [2018-10-10 16:24:29,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-10-10 16:24:29,617 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:24:29,618 INFO L375 BasicCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:24:29,618 INFO L424 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:24:29,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:24:29,618 INFO L82 PathProgramCache]: Analyzing trace with hash -155980359, now seen corresponding path program 81 times [2018-10-10 16:24:29,618 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:24:29,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:24:33,006 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-10 16:24:33,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:24:33,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-10-10 16:24:33,007 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-10 16:24:33,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-10 16:24:33,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3489, Invalid=3651, Unknown=0, NotChecked=0, Total=7140 [2018-10-10 16:24:33,008 INFO L87 Difference]: Start difference. First operand 293 states and 293 transitions. Second operand 85 states. [2018-10-10 16:24:37,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:24:37,638 INFO L93 Difference]: Finished difference Result 298 states and 298 transitions. [2018-10-10 16:24:37,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-10 16:24:37,638 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 292 [2018-10-10 16:24:37,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:24:37,639 INFO L225 Difference]: With dead ends: 298 [2018-10-10 16:24:37,640 INFO L226 Difference]: Without dead ends: 298 [2018-10-10 16:24:37,640 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3321 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=10374, Invalid=17016, Unknown=0, NotChecked=0, Total=27390 [2018-10-10 16:24:37,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-10-10 16:24:37,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 296. [2018-10-10 16:24:37,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-10-10 16:24:37,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 296 transitions. [2018-10-10 16:24:37,643 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 296 transitions. Word has length 292 [2018-10-10 16:24:37,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:24:37,643 INFO L481 AbstractCegarLoop]: Abstraction has 296 states and 296 transitions. [2018-10-10 16:24:37,643 INFO L482 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-10 16:24:37,643 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 296 transitions. [2018-10-10 16:24:37,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2018-10-10 16:24:37,644 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:24:37,644 INFO L375 BasicCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:24:37,644 INFO L424 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:24:37,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:24:37,645 INFO L82 PathProgramCache]: Analyzing trace with hash -41086591, now seen corresponding path program 82 times [2018-10-10 16:24:37,645 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:24:37,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:24:40,732 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-10 16:24:40,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:24:40,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-10-10 16:24:40,733 INFO L460 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-10-10 16:24:40,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-10-10 16:24:40,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3573, Invalid=3737, Unknown=0, NotChecked=0, Total=7310 [2018-10-10 16:24:40,734 INFO L87 Difference]: Start difference. First operand 296 states and 296 transitions. Second operand 86 states. [2018-10-10 16:24:45,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:24:45,335 INFO L93 Difference]: Finished difference Result 301 states and 301 transitions. [2018-10-10 16:24:45,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-10-10 16:24:45,335 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 295 [2018-10-10 16:24:45,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:24:45,337 INFO L225 Difference]: With dead ends: 301 [2018-10-10 16:24:45,337 INFO L226 Difference]: Without dead ends: 301 [2018-10-10 16:24:45,338 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3403 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=10625, Invalid=17431, Unknown=0, NotChecked=0, Total=28056 [2018-10-10 16:24:45,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-10-10 16:24:45,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 299. [2018-10-10 16:24:45,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-10-10 16:24:45,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 299 transitions. [2018-10-10 16:24:45,341 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 299 transitions. Word has length 295 [2018-10-10 16:24:45,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:24:45,341 INFO L481 AbstractCegarLoop]: Abstraction has 299 states and 299 transitions. [2018-10-10 16:24:45,342 INFO L482 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-10-10 16:24:45,342 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 299 transitions. [2018-10-10 16:24:45,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-10-10 16:24:45,343 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:24:45,343 INFO L375 BasicCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:24:45,343 INFO L424 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:24:45,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:24:45,343 INFO L82 PathProgramCache]: Analyzing trace with hash -329779015, now seen corresponding path program 83 times [2018-10-10 16:24:45,344 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:24:45,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:24:48,678 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-10 16:24:48,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:24:48,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-10 16:24:48,678 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-10 16:24:48,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-10 16:24:48,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3658, Invalid=3824, Unknown=0, NotChecked=0, Total=7482 [2018-10-10 16:24:48,679 INFO L87 Difference]: Start difference. First operand 299 states and 299 transitions. Second operand 87 states. [2018-10-10 16:24:53,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:24:53,166 INFO L93 Difference]: Finished difference Result 304 states and 304 transitions. [2018-10-10 16:24:53,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-10 16:24:53,167 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 298 [2018-10-10 16:24:53,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:24:53,168 INFO L225 Difference]: With dead ends: 304 [2018-10-10 16:24:53,168 INFO L226 Difference]: Without dead ends: 304 [2018-10-10 16:24:53,169 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-10 16:24:53,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-10-10 16:24:53,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 302. [2018-10-10 16:24:53,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-10-10 16:24:53,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 302 transitions. [2018-10-10 16:24:53,172 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 302 transitions. Word has length 298 [2018-10-10 16:24:53,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:24:53,172 INFO L481 AbstractCegarLoop]: Abstraction has 302 states and 302 transitions. [2018-10-10 16:24:53,172 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-10 16:24:53,172 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 302 transitions. [2018-10-10 16:24:53,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-10-10 16:24:53,173 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:24:53,173 INFO L375 BasicCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:24:53,174 INFO L424 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:24:53,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:24:53,174 INFO L82 PathProgramCache]: Analyzing trace with hash 2053711489, now seen corresponding path program 84 times [2018-10-10 16:24:53,174 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:24:53,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:24:56,352 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-10 16:24:56,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:24:56,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-10-10 16:24:56,352 INFO L460 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-10-10 16:24:56,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-10-10 16:24:56,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3744, Invalid=3912, Unknown=0, NotChecked=0, Total=7656 [2018-10-10 16:24:56,354 INFO L87 Difference]: Start difference. First operand 302 states and 302 transitions. Second operand 88 states. [2018-10-10 16:25:01,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:25:01,190 INFO L93 Difference]: Finished difference Result 307 states and 307 transitions. [2018-10-10 16:25:01,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-10-10 16:25:01,190 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 301 [2018-10-10 16:25:01,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:25:01,192 INFO L225 Difference]: With dead ends: 307 [2018-10-10 16:25:01,192 INFO L226 Difference]: Without dead ends: 307 [2018-10-10 16:25:01,193 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3570 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=11136, Invalid=18276, Unknown=0, NotChecked=0, Total=29412 [2018-10-10 16:25:01,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-10-10 16:25:01,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 305. [2018-10-10 16:25:01,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-10-10 16:25:01,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 305 transitions. [2018-10-10 16:25:01,196 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 305 transitions. Word has length 301 [2018-10-10 16:25:01,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:25:01,196 INFO L481 AbstractCegarLoop]: Abstraction has 305 states and 305 transitions. [2018-10-10 16:25:01,196 INFO L482 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-10-10 16:25:01,196 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 305 transitions. [2018-10-10 16:25:01,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-10-10 16:25:01,198 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:25:01,198 INFO L375 BasicCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:25:01,198 INFO L424 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:25:01,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:25:01,198 INFO L82 PathProgramCache]: Analyzing trace with hash -74988615, now seen corresponding path program 85 times [2018-10-10 16:25:01,199 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:25:01,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:25:04,721 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-10 16:25:04,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:25:04,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-10-10 16:25:04,722 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-10 16:25:04,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-10 16:25:04,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3831, Invalid=4001, Unknown=0, NotChecked=0, Total=7832 [2018-10-10 16:25:04,724 INFO L87 Difference]: Start difference. First operand 305 states and 305 transitions. Second operand 89 states. [2018-10-10 16:25:09,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:25:09,648 INFO L93 Difference]: Finished difference Result 310 states and 310 transitions. [2018-10-10 16:25:09,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-10-10 16:25:09,648 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 304 [2018-10-10 16:25:09,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:25:09,649 INFO L225 Difference]: With dead ends: 310 [2018-10-10 16:25:09,649 INFO L226 Difference]: Without dead ends: 310 [2018-10-10 16:25:09,651 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3655 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=11396, Invalid=18706, Unknown=0, NotChecked=0, Total=30102 [2018-10-10 16:25:09,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-10-10 16:25:09,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 308. [2018-10-10 16:25:09,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-10-10 16:25:09,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 308 transitions. [2018-10-10 16:25:09,654 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 308 transitions. Word has length 304 [2018-10-10 16:25:09,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:25:09,654 INFO L481 AbstractCegarLoop]: Abstraction has 308 states and 308 transitions. [2018-10-10 16:25:09,654 INFO L482 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-10 16:25:09,655 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 308 transitions. [2018-10-10 16:25:09,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-10-10 16:25:09,656 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:25:09,656 INFO L375 BasicCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:25:09,656 INFO L424 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:25:09,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:25:09,656 INFO L82 PathProgramCache]: Analyzing trace with hash -987661439, now seen corresponding path program 86 times [2018-10-10 16:25:09,657 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:25:09,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:25:13,053 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-10 16:25:13,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:25:13,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-10-10 16:25:13,054 INFO L460 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-10-10 16:25:13,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-10-10 16:25:13,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3919, Invalid=4091, Unknown=0, NotChecked=0, Total=8010 [2018-10-10 16:25:13,055 INFO L87 Difference]: Start difference. First operand 308 states and 308 transitions. Second operand 90 states. [2018-10-10 16:25:17,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:25:17,986 INFO L93 Difference]: Finished difference Result 313 states and 313 transitions. [2018-10-10 16:25:17,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-10 16:25:17,986 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 307 [2018-10-10 16:25:17,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:25:17,987 INFO L225 Difference]: With dead ends: 313 [2018-10-10 16:25:17,987 INFO L226 Difference]: Without dead ends: 313 [2018-10-10 16:25:17,989 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3741 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=11659, Invalid=19141, Unknown=0, NotChecked=0, Total=30800 [2018-10-10 16:25:17,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-10-10 16:25:17,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 311. [2018-10-10 16:25:17,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-10-10 16:25:17,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 311 transitions. [2018-10-10 16:25:17,992 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 311 transitions. Word has length 307 [2018-10-10 16:25:17,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:25:17,992 INFO L481 AbstractCegarLoop]: Abstraction has 311 states and 311 transitions. [2018-10-10 16:25:17,992 INFO L482 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-10-10 16:25:17,992 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 311 transitions. [2018-10-10 16:25:17,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-10-10 16:25:17,993 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:25:17,993 INFO L375 BasicCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:25:17,993 INFO L424 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:25:17,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:25:17,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1014189753, now seen corresponding path program 87 times [2018-10-10 16:25:17,994 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:25:18,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:25:21,691 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-10 16:25:21,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:25:21,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-10-10 16:25:21,692 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-10 16:25:21,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-10 16:25:21,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4008, Invalid=4182, Unknown=0, NotChecked=0, Total=8190 [2018-10-10 16:25:21,693 INFO L87 Difference]: Start difference. First operand 311 states and 311 transitions. Second operand 91 states. [2018-10-10 16:25:26,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:25:26,710 INFO L93 Difference]: Finished difference Result 316 states and 316 transitions. [2018-10-10 16:25:26,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-10-10 16:25:26,710 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 310 [2018-10-10 16:25:26,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:25:26,711 INFO L225 Difference]: With dead ends: 316 [2018-10-10 16:25:26,711 INFO L226 Difference]: Without dead ends: 316 [2018-10-10 16:25:26,713 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3828 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=11925, Invalid=19581, Unknown=0, NotChecked=0, Total=31506 [2018-10-10 16:25:26,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-10-10 16:25:26,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 314. [2018-10-10 16:25:26,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2018-10-10 16:25:26,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 314 transitions. [2018-10-10 16:25:26,715 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 314 transitions. Word has length 310 [2018-10-10 16:25:26,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:25:26,716 INFO L481 AbstractCegarLoop]: Abstraction has 314 states and 314 transitions. [2018-10-10 16:25:26,716 INFO L482 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-10 16:25:26,716 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 314 transitions. [2018-10-10 16:25:26,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-10-10 16:25:26,717 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:25:26,717 INFO L375 BasicCegarLoop]: trace histogram [88, 88, 88, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:25:26,717 INFO L424 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:25:26,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:25:26,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1752821631, now seen corresponding path program 88 times [2018-10-10 16:25:26,718 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:25:26,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:25:30,450 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-10 16:25:30,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:25:30,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-10-10 16:25:30,451 INFO L460 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-10-10 16:25:30,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-10-10 16:25:30,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4098, Invalid=4274, Unknown=0, NotChecked=0, Total=8372 [2018-10-10 16:25:30,452 INFO L87 Difference]: Start difference. First operand 314 states and 314 transitions. Second operand 92 states. [2018-10-10 16:25:35,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:25:35,642 INFO L93 Difference]: Finished difference Result 319 states and 319 transitions. [2018-10-10 16:25:35,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-10-10 16:25:35,642 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 313 [2018-10-10 16:25:35,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:25:35,643 INFO L225 Difference]: With dead ends: 319 [2018-10-10 16:25:35,643 INFO L226 Difference]: Without dead ends: 319 [2018-10-10 16:25:35,645 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3916 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=12194, Invalid=20026, Unknown=0, NotChecked=0, Total=32220 [2018-10-10 16:25:35,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-10-10 16:25:35,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 317. [2018-10-10 16:25:35,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-10-10 16:25:35,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 317 transitions. [2018-10-10 16:25:35,647 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 317 transitions. Word has length 313 [2018-10-10 16:25:35,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:25:35,648 INFO L481 AbstractCegarLoop]: Abstraction has 317 states and 317 transitions. [2018-10-10 16:25:35,648 INFO L482 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-10-10 16:25:35,648 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 317 transitions. [2018-10-10 16:25:35,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2018-10-10 16:25:35,649 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:25:35,649 INFO L375 BasicCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:25:35,649 INFO L424 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:25:35,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:25:35,649 INFO L82 PathProgramCache]: Analyzing trace with hash -481650247, now seen corresponding path program 89 times [2018-10-10 16:25:35,650 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:25:35,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:25:39,536 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-10 16:25:39,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:25:39,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-10 16:25:39,536 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-10 16:25:39,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-10 16:25:39,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4189, Invalid=4367, Unknown=0, NotChecked=0, Total=8556 [2018-10-10 16:25:39,537 INFO L87 Difference]: Start difference. First operand 317 states and 317 transitions. Second operand 93 states. [2018-10-10 16:25:44,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:25:44,895 INFO L93 Difference]: Finished difference Result 322 states and 322 transitions. [2018-10-10 16:25:44,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-10 16:25:44,900 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 316 [2018-10-10 16:25:44,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:25:44,901 INFO L225 Difference]: With dead ends: 322 [2018-10-10 16:25:44,901 INFO L226 Difference]: Without dead ends: 322 [2018-10-10 16:25:44,903 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4005 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=12466, Invalid=20476, Unknown=0, NotChecked=0, Total=32942 [2018-10-10 16:25:44,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-10-10 16:25:44,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 320. [2018-10-10 16:25:44,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-10-10 16:25:44,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 320 transitions. [2018-10-10 16:25:44,906 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 320 transitions. Word has length 316 [2018-10-10 16:25:44,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:25:44,906 INFO L481 AbstractCegarLoop]: Abstraction has 320 states and 320 transitions. [2018-10-10 16:25:44,906 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-10 16:25:44,906 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 320 transitions. [2018-10-10 16:25:44,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2018-10-10 16:25:44,907 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:25:44,907 INFO L375 BasicCegarLoop]: trace histogram [90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:25:44,907 INFO L424 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:25:44,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:25:44,908 INFO L82 PathProgramCache]: Analyzing trace with hash 258401665, now seen corresponding path program 90 times [2018-10-10 16:25:44,908 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:25:44,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:25:48,639 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-10 16:25:48,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:25:48,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-10-10 16:25:48,640 INFO L460 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-10-10 16:25:48,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-10-10 16:25:48,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4281, Invalid=4461, Unknown=0, NotChecked=0, Total=8742 [2018-10-10 16:25:48,641 INFO L87 Difference]: Start difference. First operand 320 states and 320 transitions. Second operand 94 states. [2018-10-10 16:25:54,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:25:54,072 INFO L93 Difference]: Finished difference Result 325 states and 325 transitions. [2018-10-10 16:25:54,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-10-10 16:25:54,073 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 319 [2018-10-10 16:25:54,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:25:54,074 INFO L225 Difference]: With dead ends: 325 [2018-10-10 16:25:54,074 INFO L226 Difference]: Without dead ends: 325 [2018-10-10 16:25:54,076 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4095 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=12741, Invalid=20931, Unknown=0, NotChecked=0, Total=33672 [2018-10-10 16:25:54,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-10-10 16:25:54,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 323. [2018-10-10 16:25:54,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-10-10 16:25:54,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 323 transitions. [2018-10-10 16:25:54,078 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 323 transitions. Word has length 319 [2018-10-10 16:25:54,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:25:54,078 INFO L481 AbstractCegarLoop]: Abstraction has 323 states and 323 transitions. [2018-10-10 16:25:54,078 INFO L482 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-10-10 16:25:54,078 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 323 transitions. [2018-10-10 16:25:54,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-10-10 16:25:54,079 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:25:54,080 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:25:54,080 INFO L424 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:25:54,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:25:54,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1077781689, now seen corresponding path program 91 times [2018-10-10 16:25:54,081 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:25:54,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:25:57,884 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-10 16:25:57,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:25:57,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-10-10 16:25:57,885 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-10 16:25:57,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-10 16:25:57,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4374, Invalid=4556, Unknown=0, NotChecked=0, Total=8930 [2018-10-10 16:25:57,886 INFO L87 Difference]: Start difference. First operand 323 states and 323 transitions. Second operand 95 states. [2018-10-10 16:26:03,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:26:03,462 INFO L93 Difference]: Finished difference Result 328 states and 328 transitions. [2018-10-10 16:26:03,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-10-10 16:26:03,462 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 322 [2018-10-10 16:26:03,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:26:03,463 INFO L225 Difference]: With dead ends: 328 [2018-10-10 16:26:03,464 INFO L226 Difference]: Without dead ends: 328 [2018-10-10 16:26:03,465 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4186 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=13019, Invalid=21391, Unknown=0, NotChecked=0, Total=34410 [2018-10-10 16:26:03,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-10-10 16:26:03,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 326. [2018-10-10 16:26:03,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-10-10 16:26:03,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 326 transitions. [2018-10-10 16:26:03,468 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 326 transitions. Word has length 322 [2018-10-10 16:26:03,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:26:03,468 INFO L481 AbstractCegarLoop]: Abstraction has 326 states and 326 transitions. [2018-10-10 16:26:03,468 INFO L482 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-10 16:26:03,468 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 326 transitions. [2018-10-10 16:26:03,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2018-10-10 16:26:03,469 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:26:03,469 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:26:03,470 INFO L424 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:26:03,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:26:03,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1366033791, now seen corresponding path program 92 times [2018-10-10 16:26:03,470 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:26:03,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:26:07,528 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-10 16:26:07,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:26:07,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-10-10 16:26:07,528 INFO L460 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-10-10 16:26:07,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-10-10 16:26:07,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4468, Invalid=4652, Unknown=0, NotChecked=0, Total=9120 [2018-10-10 16:26:07,529 INFO L87 Difference]: Start difference. First operand 326 states and 326 transitions. Second operand 96 states. [2018-10-10 16:26:12,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:26:12,856 INFO L93 Difference]: Finished difference Result 331 states and 331 transitions. [2018-10-10 16:26:12,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-10 16:26:12,856 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 325 [2018-10-10 16:26:12,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:26:12,857 INFO L225 Difference]: With dead ends: 331 [2018-10-10 16:26:12,857 INFO L226 Difference]: Without dead ends: 331 [2018-10-10 16:26:12,859 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-10 16:26:12,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-10-10 16:26:12,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 329. [2018-10-10 16:26:12,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-10-10 16:26:12,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 329 transitions. [2018-10-10 16:26:12,862 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 329 transitions. Word has length 325 [2018-10-10 16:26:12,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:26:12,863 INFO L481 AbstractCegarLoop]: Abstraction has 329 states and 329 transitions. [2018-10-10 16:26:12,863 INFO L482 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-10-10 16:26:12,863 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 329 transitions. [2018-10-10 16:26:12,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-10-10 16:26:12,864 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:26:12,864 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:26:12,864 INFO L424 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:26:12,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:26:12,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1082363975, now seen corresponding path program 93 times [2018-10-10 16:26:12,865 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:26:12,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:26:17,132 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-10 16:26:17,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:26:17,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-10-10 16:26:17,133 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-10-10 16:26:17,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-10-10 16:26:17,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4563, Invalid=4749, Unknown=0, NotChecked=0, Total=9312 [2018-10-10 16:26:17,134 INFO L87 Difference]: Start difference. First operand 329 states and 329 transitions. Second operand 97 states. [2018-10-10 16:26:22,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:26:22,823 INFO L93 Difference]: Finished difference Result 332 states and 332 transitions. [2018-10-10 16:26:22,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-10-10 16:26:22,823 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 328 [2018-10-10 16:26:22,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:26:22,825 INFO L225 Difference]: With dead ends: 332 [2018-10-10 16:26:22,825 INFO L226 Difference]: Without dead ends: 332 [2018-10-10 16:26:22,826 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-10 16:26:22,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-10-10 16:26:22,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2018-10-10 16:26:22,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-10-10 16:26:22,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 332 transitions. [2018-10-10 16:26:22,829 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 332 transitions. Word has length 328 [2018-10-10 16:26:22,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:26:22,829 INFO L481 AbstractCegarLoop]: Abstraction has 332 states and 332 transitions. [2018-10-10 16:26:22,829 INFO L482 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-10-10 16:26:22,829 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 332 transitions. [2018-10-10 16:26:22,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2018-10-10 16:26:22,831 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:26:22,831 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:26:22,831 INFO L424 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:26:22,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:26:22,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1524453249, now seen corresponding path program 94 times [2018-10-10 16:26:22,832 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:26:22,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:26:23,405 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-10 16:26:23,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 16:26:23,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 16:26:23,406 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 16:26:23,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 16:26:23,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-10 16:26:23,407 INFO L87 Difference]: Start difference. First operand 332 states and 332 transitions. Second operand 8 states. [2018-10-10 16:26:23,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:26:23,847 INFO L93 Difference]: Finished difference Result 330 states and 330 transitions. [2018-10-10 16:26:23,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 16:26:23,848 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 331 [2018-10-10 16:26:23,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:26:23,849 INFO L225 Difference]: With dead ends: 330 [2018-10-10 16:26:23,849 INFO L226 Difference]: Without dead ends: 0 [2018-10-10 16:26:23,849 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-10 16:26:23,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-10 16:26:23,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-10 16:26:23,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-10 16:26:23,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-10 16:26:23,850 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 331 [2018-10-10 16:26:23,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:26:23,850 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-10 16:26:23,850 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 16:26:23,850 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-10 16:26:23,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-10 16:26:23,855 INFO L202 PluginConnector]: Adding new model 20051113-1.c_false-valid-memtrack.i_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 04:26:23 BasicIcfg [2018-10-10 16:26:23,855 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-10 16:26:23,856 INFO L168 Benchmark]: Toolchain (without parser) took 381491.36 ms. Allocated memory was 1.5 GB in the beginning and 3.4 GB in the end (delta: 1.8 GB). Free memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: -295.4 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-10-10 16:26:23,857 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 16:26:23,857 INFO L168 Benchmark]: Boogie Preprocessor took 48.46 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 16:26:23,857 INFO L168 Benchmark]: RCFGBuilder took 567.43 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-10 16:26:23,858 INFO L168 Benchmark]: IcfgTransformer took 19591.49 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 936.4 MB). Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 15.6 MB). Peak memory consumption was 952.0 MB. Max. memory is 7.1 GB. [2018-10-10 16:26:23,858 INFO L168 Benchmark]: TraceAbstraction took 361279.64 ms. Allocated memory was 2.5 GB in the beginning and 3.4 GB in the end (delta: 884.5 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -332.1 MB). Peak memory consumption was 552.4 MB. Max. memory is 7.1 GB. [2018-10-10 16:26:23,861 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.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 48.46 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 567.43 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * IcfgTransformer took 19591.49 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 936.4 MB). Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 15.6 MB). Peak memory consumption was 952.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 361279.64 ms. Allocated memory was 2.5 GB in the beginning and 3.4 GB in the end (delta: 884.5 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -332.1 MB). Peak memory consumption was 552.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 52 LocStat_MAX_WEQGRAPH_SIZE : 3 LocStat_MAX_SIZEOF_WEQEDGELABEL : 3 LocStat_NO_SUPPORTING_EQUALITIES : 1249 LocStat_NO_SUPPORTING_DISEQUALITIES : 233 LocStat_NO_DISJUNCTIONS : -104 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 54 TransStat_MAX_WEQGRAPH_SIZE : 3 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 67 TransStat_NO_SUPPORTING_DISEQUALITIES : 1 TransStat_NO_DISJUNCTIONS : 54 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqPostOperator statistics APPLY_NORMAL(MILLISECONDS) : 13652.62 APPLY_RETURN(MILLISECONDS) : 0.00 #APPLY_NORMAL : 115 #APPLY_RETURN : 0 * Results from de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: - StatisticsResult: Abstract Interpretation statistics Visited 54 different actions 113 times. Merged at 28 different actions 56 times. Widened at 1 different actions 1 times. Found 3 fixpoints after 3 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 : 3 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: 102]: 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, 54 locations, 1 error locations. SAFE Result, 361.2s OverallTime, 95 OverallIterations, 94 TraceHistogramMax, 207.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4454 SDtfs, 20733 SDslu, 138360 SDs, 0 SdLazy, 24914 SolverSat, 4608 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 24.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9130 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 8940 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138419 ImplicationChecksByTransitivity, 318.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=332occurred 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.1s SatisfiabilityAnalysisTime, 146.8s InterpolantComputationTime, 18050 NumberOfCodeBlocks, 18050 NumberOfCodeBlocksAsserted, 95 NumberOfCheckSat, 17955 ConstructedInterpolants, 0 QuantifiedInterpolants, 17628963 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_9.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-Benchmark-0-2018-10-10_16-26-23-878.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_9.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-VPDomainBenchmark-0-2018-10-10_16-26-23-878.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_9.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-BenchmarkWithCounters-0-2018-10-10_16-26-23-878.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...