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/20181015-LoopsPathprograms/array_true-unreach-call3_true-termination.i_5.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2d08e6e [2018-10-15 12:55:21,128 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 12:55:21,130 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 12:55:21,142 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 12:55:21,142 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 12:55:21,143 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 12:55:21,145 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 12:55:21,146 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 12:55:21,148 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 12:55:21,149 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 12:55:21,150 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 12:55:21,150 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 12:55:21,151 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 12:55:21,152 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 12:55:21,153 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 12:55:21,154 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 12:55:21,155 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 12:55:21,157 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 12:55:21,159 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 12:55:21,161 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 12:55:21,162 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 12:55:21,163 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 12:55:21,171 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 12:55:21,171 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 12:55:21,171 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 12:55:21,172 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 12:55:21,173 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 12:55:21,174 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 12:55:21,177 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 12:55:21,178 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 12:55:21,179 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 12:55:21,179 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 12:55:21,181 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 12:55:21,182 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 12:55:21,185 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 12:55:21,187 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 12:55:21,187 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-15 12:55:21,211 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 12:55:21,211 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 12:55:21,212 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 12:55:21,212 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 12:55:21,212 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 12:55:21,213 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 12:55:21,213 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 12:55:21,213 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 12:55:21,214 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 12:55:21,214 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 12:55:21,214 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 12:55:21,214 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 12:55:21,214 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 12:55:21,215 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 12:55:21,215 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 12:55:21,282 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 12:55:21,294 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 12:55:21,298 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 12:55:21,300 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 12:55:21,300 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 12:55:21,301 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/array_true-unreach-call3_true-termination.i_5.bpl [2018-10-15 12:55:21,302 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/array_true-unreach-call3_true-termination.i_5.bpl' [2018-10-15 12:55:21,359 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 12:55:21,361 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-15 12:55:21,362 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 12:55:21,362 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 12:55:21,362 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 12:55:21,394 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array_true-unreach-call3_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:21" (1/1) ... [2018-10-15 12:55:21,396 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array_true-unreach-call3_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:21" (1/1) ... [2018-10-15 12:55:21,408 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array_true-unreach-call3_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:21" (1/1) ... [2018-10-15 12:55:21,408 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array_true-unreach-call3_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:21" (1/1) ... [2018-10-15 12:55:21,412 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array_true-unreach-call3_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:21" (1/1) ... [2018-10-15 12:55:21,413 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array_true-unreach-call3_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:21" (1/1) ... [2018-10-15 12:55:21,414 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array_true-unreach-call3_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:21" (1/1) ... [2018-10-15 12:55:21,416 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 12:55:21,417 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 12:55:21,418 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 12:55:21,418 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 12:55:21,419 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array_true-unreach-call3_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:21" (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-15 12:55:21,486 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-15 12:55:21,486 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 12:55:21,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 12:55:22,079 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 12:55:22,080 INFO L202 PluginConnector]: Adding new model array_true-unreach-call3_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:55:22 BoogieIcfgContainer [2018-10-15 12:55:22,080 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 12:55:22,081 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-15 12:55:22,081 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-15 12:55:22,082 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-15 12:55:22,085 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "array_true-unreach-call3_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:55:22" (1/1) ... [2018-10-15 12:55:22,092 INFO L137 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-10-15 12:55:22,092 INFO L138 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-10-15 12:55:22,124 INFO L191 apSepIcfgTransformer]: Heap separator: starting loc-array-style preprocessing [2018-10-15 12:55:22,167 INFO L219 apSepIcfgTransformer]: finished MemlocArrayUpdater [2018-10-15 12:55:22,181 INFO L282 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-10-15 12:55:22,255 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=1) [2018-10-15 12:55:26,474 INFO L315 AbstractInterpreter]: Visited 47 different actions 144 times. Merged at 29 different actions 91 times. Widened at 1 different actions 2 times. Found 4 fixpoints after 3 different actions. Largest state had 0 variables. [2018-10-15 12:55:26,476 INFO L306 apSepIcfgTransformer]: finished equality analysis [2018-10-15 12:55:26,480 INFO L318 apSepIcfgTransformer]: Finished detection of select terms ("array reads") [2018-10-15 12:55:26,490 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select |#loc_#memory_int_(Array-Int-#locsort1)| |v_ULTIMATE.start_read~int_#ptr.base_2|) at (assume read~int_#value == #memory_int[read~int_#ptr.base][read~int_#ptr.offset];) [2018-10-15 12:55:26,492 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select (select |#loc_#memory_int_(Array-Int-(Array-Int-#locsort2))| |v_ULTIMATE.start_read~int_#ptr.base_2|) |v_ULTIMATE.start_read~int_#ptr.offset_2|) at (assume read~int_#value == #memory_int[read~int_#ptr.base][read~int_#ptr.offset];) [2018-10-15 12:55:26,528 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_2|) at (assume write~int_old_#memory_int[write~int_#ptr.base := write~int_old_#memory_int[write~int_#ptr.base][write~int_#ptr.offset := write~int_#value]] == #memory_int;) [2018-10-15 12:55:26,529 INFO L232 HeapPartitionManager]: partitioning result: [2018-10-15 12:55:26,530 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-15 12:55:26,530 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-15 12:55:26,530 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-15 12:55:26,531 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-15 12:55:26,531 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-15 12:55:26,531 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-15 12:55:26,531 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-15 12:55:26,532 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-15 12:55:26,532 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-15 12:55:26,532 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-15 12:55:26,532 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-15 12:55:26,532 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-15 12:55:26,533 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-15 12:55:26,533 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-15 12:55:26,535 INFO L145 ransitionTransformer]: executing heap partitioning transformation [2018-10-15 12:55:26,551 INFO L202 PluginConnector]: Adding new model array_true-unreach-call3_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 12:55:26 BasicIcfg [2018-10-15 12:55:26,552 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-15 12:55:26,553 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 12:55:26,553 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 12:55:26,556 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 12:55:26,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array_true-unreach-call3_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:21" (1/3) ... [2018-10-15 12:55:26,558 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22047998 and model type array_true-unreach-call3_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 12:55:26, skipping insertion in model container [2018-10-15 12:55:26,558 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array_true-unreach-call3_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:55:22" (2/3) ... [2018-10-15 12:55:26,559 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22047998 and model type array_true-unreach-call3_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 12:55:26, skipping insertion in model container [2018-10-15 12:55:26,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array_true-unreach-call3_true-termination.i_5.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 12:55:26" (3/3) ... [2018-10-15 12:55:26,560 INFO L112 eAbstractionObserver]: Analyzing ICFG memPartitionedIcfg [2018-10-15 12:55:26,570 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 12:55:26,579 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 12:55:26,597 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 12:55:26,622 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 12:55:26,623 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 12:55:26,624 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 12:55:26,624 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 12:55:26,625 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 12:55:26,625 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 12:55:26,626 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 12:55:26,626 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 12:55:26,626 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 12:55:26,644 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-10-15 12:55:26,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-15 12:55:26,651 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:26,652 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] [2018-10-15 12:55:26,654 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:26,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:26,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1475772594, now seen corresponding path program 1 times [2018-10-15 12:55:26,722 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:26,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:26,891 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-15 12:55:26,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 12:55:26,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 12:55:26,899 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 12:55:26,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 12:55:26,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 12:55:26,916 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2018-10-15 12:55:27,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:27,083 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2018-10-15 12:55:27,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 12:55:27,085 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-10-15 12:55:27,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:27,096 INFO L225 Difference]: With dead ends: 69 [2018-10-15 12:55:27,097 INFO L226 Difference]: Without dead ends: 69 [2018-10-15 12:55:27,099 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 12:55:27,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-15 12:55:27,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 45. [2018-10-15 12:55:27,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-15 12:55:27,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-10-15 12:55:27,209 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 29 [2018-10-15 12:55:27,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:27,210 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-10-15 12:55:27,210 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 12:55:27,210 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-10-15 12:55:27,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-15 12:55:27,212 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:27,212 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] [2018-10-15 12:55:27,213 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:27,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:27,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1153688702, now seen corresponding path program 1 times [2018-10-15 12:55:27,214 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:27,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:27,396 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-15 12:55:27,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:27,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-15 12:55:27,398 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 12:55:27,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 12:55:27,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-15 12:55:27,399 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 5 states. [2018-10-15 12:55:27,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:27,837 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2018-10-15 12:55:27,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-15 12:55:27,841 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-10-15 12:55:27,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:27,843 INFO L225 Difference]: With dead ends: 79 [2018-10-15 12:55:27,843 INFO L226 Difference]: Without dead ends: 79 [2018-10-15 12:55:27,844 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-15 12:55:27,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-10-15 12:55:27,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 55. [2018-10-15 12:55:27,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-15 12:55:27,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-10-15 12:55:27,856 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 39 [2018-10-15 12:55:27,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:27,856 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-10-15 12:55:27,856 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 12:55:27,857 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-10-15 12:55:27,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-15 12:55:27,858 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:27,858 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:27,859 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:27,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:27,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1823471946, now seen corresponding path program 2 times [2018-10-15 12:55:27,862 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:27,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:28,089 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-15 12:55:28,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:28,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-15 12:55:28,090 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-15 12:55:28,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-15 12:55:28,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-15 12:55:28,091 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 7 states. [2018-10-15 12:55:28,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:28,380 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2018-10-15 12:55:28,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-15 12:55:28,381 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2018-10-15 12:55:28,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:28,382 INFO L225 Difference]: With dead ends: 89 [2018-10-15 12:55:28,382 INFO L226 Difference]: Without dead ends: 89 [2018-10-15 12:55:28,382 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-10-15 12:55:28,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-10-15 12:55:28,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 65. [2018-10-15 12:55:28,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-10-15 12:55:28,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2018-10-15 12:55:28,392 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 49 [2018-10-15 12:55:28,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:28,393 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2018-10-15 12:55:28,393 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-15 12:55:28,393 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2018-10-15 12:55:28,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-10-15 12:55:28,395 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:28,395 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:28,395 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:28,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:28,396 INFO L82 PathProgramCache]: Analyzing trace with hash -567377686, now seen corresponding path program 3 times [2018-10-15 12:55:28,396 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:28,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:28,612 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:28,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:28,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-15 12:55:28,613 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 12:55:28,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 12:55:28,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-10-15 12:55:28,614 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 9 states. [2018-10-15 12:55:29,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:29,244 INFO L93 Difference]: Finished difference Result 99 states and 100 transitions. [2018-10-15 12:55:29,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-15 12:55:29,245 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2018-10-15 12:55:29,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:29,247 INFO L225 Difference]: With dead ends: 99 [2018-10-15 12:55:29,247 INFO L226 Difference]: Without dead ends: 99 [2018-10-15 12:55:29,248 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2018-10-15 12:55:29,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-10-15 12:55:29,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 75. [2018-10-15 12:55:29,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-15 12:55:29,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2018-10-15 12:55:29,256 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 59 [2018-10-15 12:55:29,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:29,256 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2018-10-15 12:55:29,257 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 12:55:29,257 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2018-10-15 12:55:29,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-10-15 12:55:29,259 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:29,259 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:29,259 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:29,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:29,260 INFO L82 PathProgramCache]: Analyzing trace with hash -416232930, now seen corresponding path program 4 times [2018-10-15 12:55:29,261 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:29,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:29,445 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:29,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:29,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 12:55:29,446 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 12:55:29,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 12:55:29,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-10-15 12:55:29,446 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 11 states. [2018-10-15 12:55:29,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:29,782 INFO L93 Difference]: Finished difference Result 109 states and 110 transitions. [2018-10-15 12:55:29,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-15 12:55:29,783 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2018-10-15 12:55:29,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:29,786 INFO L225 Difference]: With dead ends: 109 [2018-10-15 12:55:29,786 INFO L226 Difference]: Without dead ends: 109 [2018-10-15 12:55:29,787 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=219, Unknown=0, NotChecked=0, Total=342 [2018-10-15 12:55:29,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-10-15 12:55:29,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 85. [2018-10-15 12:55:29,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-15 12:55:29,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2018-10-15 12:55:29,793 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 69 [2018-10-15 12:55:29,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:29,794 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2018-10-15 12:55:29,794 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 12:55:29,794 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2018-10-15 12:55:29,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-15 12:55:29,795 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:29,795 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:29,796 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:29,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:29,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1960828334, now seen corresponding path program 5 times [2018-10-15 12:55:29,797 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:29,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:30,106 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:30,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:30,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-15 12:55:30,107 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-15 12:55:30,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-15 12:55:30,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-10-15 12:55:30,108 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 13 states. [2018-10-15 12:55:30,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:30,405 INFO L93 Difference]: Finished difference Result 119 states and 120 transitions. [2018-10-15 12:55:30,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-15 12:55:30,406 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 79 [2018-10-15 12:55:30,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:30,408 INFO L225 Difference]: With dead ends: 119 [2018-10-15 12:55:30,408 INFO L226 Difference]: Without dead ends: 119 [2018-10-15 12:55:30,409 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=178, Invalid=328, Unknown=0, NotChecked=0, Total=506 [2018-10-15 12:55:30,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-10-15 12:55:30,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 95. [2018-10-15 12:55:30,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-10-15 12:55:30,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2018-10-15 12:55:30,417 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 79 [2018-10-15 12:55:30,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:30,418 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2018-10-15 12:55:30,418 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-15 12:55:30,418 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2018-10-15 12:55:30,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-10-15 12:55:30,419 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:30,420 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:30,420 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:30,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:30,420 INFO L82 PathProgramCache]: Analyzing trace with hash 741722502, now seen corresponding path program 6 times [2018-10-15 12:55:30,421 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:30,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:30,613 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:30,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:30,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 12:55:30,614 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 12:55:30,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 12:55:30,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-10-15 12:55:30,615 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 15 states. [2018-10-15 12:55:31,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:31,499 INFO L93 Difference]: Finished difference Result 129 states and 130 transitions. [2018-10-15 12:55:31,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-15 12:55:31,500 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 89 [2018-10-15 12:55:31,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:31,501 INFO L225 Difference]: With dead ends: 129 [2018-10-15 12:55:31,501 INFO L226 Difference]: Without dead ends: 129 [2018-10-15 12:55:31,502 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=243, Invalid=459, Unknown=0, NotChecked=0, Total=702 [2018-10-15 12:55:31,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-10-15 12:55:31,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 105. [2018-10-15 12:55:31,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-10-15 12:55:31,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2018-10-15 12:55:31,509 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 89 [2018-10-15 12:55:31,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:31,509 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2018-10-15 12:55:31,509 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 12:55:31,509 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2018-10-15 12:55:31,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-15 12:55:31,511 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:31,511 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:31,512 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:31,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:31,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1508180038, now seen corresponding path program 7 times [2018-10-15 12:55:31,513 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:31,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:32,028 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 217 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:32,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:32,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-15 12:55:32,029 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-15 12:55:32,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-15 12:55:32,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2018-10-15 12:55:32,029 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 17 states. [2018-10-15 12:55:32,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:32,393 INFO L93 Difference]: Finished difference Result 139 states and 140 transitions. [2018-10-15 12:55:32,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-15 12:55:32,394 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 99 [2018-10-15 12:55:32,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:32,396 INFO L225 Difference]: With dead ends: 139 [2018-10-15 12:55:32,397 INFO L226 Difference]: Without dead ends: 139 [2018-10-15 12:55:32,399 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=318, Invalid=612, Unknown=0, NotChecked=0, Total=930 [2018-10-15 12:55:32,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-10-15 12:55:32,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 115. [2018-10-15 12:55:32,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-10-15 12:55:32,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2018-10-15 12:55:32,405 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 99 [2018-10-15 12:55:32,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:32,406 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2018-10-15 12:55:32,406 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-15 12:55:32,406 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2018-10-15 12:55:32,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-15 12:55:32,408 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:32,408 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:32,408 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:32,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:32,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1105790190, now seen corresponding path program 8 times [2018-10-15 12:55:32,409 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:32,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:32,856 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:32,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:32,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-15 12:55:32,857 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-15 12:55:32,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-15 12:55:32,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2018-10-15 12:55:32,858 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 19 states. [2018-10-15 12:55:33,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:33,292 INFO L93 Difference]: Finished difference Result 149 states and 150 transitions. [2018-10-15 12:55:33,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-15 12:55:33,293 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 109 [2018-10-15 12:55:33,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:33,295 INFO L225 Difference]: With dead ends: 149 [2018-10-15 12:55:33,295 INFO L226 Difference]: Without dead ends: 149 [2018-10-15 12:55:33,296 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=403, Invalid=787, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 12:55:33,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-10-15 12:55:33,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 125. [2018-10-15 12:55:33,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-10-15 12:55:33,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 126 transitions. [2018-10-15 12:55:33,302 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 126 transitions. Word has length 109 [2018-10-15 12:55:33,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:33,303 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 126 transitions. [2018-10-15 12:55:33,303 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-15 12:55:33,303 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2018-10-15 12:55:33,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-10-15 12:55:33,305 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:33,305 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:33,305 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:33,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:33,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1440147166, now seen corresponding path program 9 times [2018-10-15 12:55:33,306 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:33,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:33,591 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 0 proven. 369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:33,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:33,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 12:55:33,592 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 12:55:33,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 12:55:33,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2018-10-15 12:55:33,593 INFO L87 Difference]: Start difference. First operand 125 states and 126 transitions. Second operand 21 states. [2018-10-15 12:55:34,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:34,014 INFO L93 Difference]: Finished difference Result 159 states and 160 transitions. [2018-10-15 12:55:34,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-15 12:55:34,015 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 119 [2018-10-15 12:55:34,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:34,016 INFO L225 Difference]: With dead ends: 159 [2018-10-15 12:55:34,016 INFO L226 Difference]: Without dead ends: 159 [2018-10-15 12:55:34,017 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=498, Invalid=984, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 12:55:34,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-10-15 12:55:34,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 135. [2018-10-15 12:55:34,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-10-15 12:55:34,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2018-10-15 12:55:34,022 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 119 [2018-10-15 12:55:34,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:34,023 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2018-10-15 12:55:34,023 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 12:55:34,023 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2018-10-15 12:55:34,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-10-15 12:55:34,025 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:34,025 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:34,025 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:34,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:34,026 INFO L82 PathProgramCache]: Analyzing trace with hash -556499882, now seen corresponding path program 10 times [2018-10-15 12:55:34,027 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:34,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:34,425 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 0 proven. 460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:34,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:34,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-15 12:55:34,426 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-15 12:55:34,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-15 12:55:34,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2018-10-15 12:55:34,427 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 23 states. [2018-10-15 12:55:35,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:35,024 INFO L93 Difference]: Finished difference Result 169 states and 170 transitions. [2018-10-15 12:55:35,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-15 12:55:35,025 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 129 [2018-10-15 12:55:35,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:35,027 INFO L225 Difference]: With dead ends: 169 [2018-10-15 12:55:35,027 INFO L226 Difference]: Without dead ends: 169 [2018-10-15 12:55:35,028 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=603, Invalid=1203, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 12:55:35,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-10-15 12:55:35,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 145. [2018-10-15 12:55:35,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-10-15 12:55:35,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 146 transitions. [2018-10-15 12:55:35,032 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 146 transitions. Word has length 129 [2018-10-15 12:55:35,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:35,033 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 146 transitions. [2018-10-15 12:55:35,033 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-15 12:55:35,033 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 146 transitions. [2018-10-15 12:55:35,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-15 12:55:35,035 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:35,036 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:35,036 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:35,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:35,036 INFO L82 PathProgramCache]: Analyzing trace with hash 693399178, now seen corresponding path program 11 times [2018-10-15 12:55:35,037 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:35,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:35,400 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:35,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:35,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-15 12:55:35,401 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-15 12:55:35,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-15 12:55:35,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2018-10-15 12:55:35,402 INFO L87 Difference]: Start difference. First operand 145 states and 146 transitions. Second operand 25 states. [2018-10-15 12:55:36,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:36,031 INFO L93 Difference]: Finished difference Result 179 states and 180 transitions. [2018-10-15 12:55:36,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-15 12:55:36,035 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 139 [2018-10-15 12:55:36,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:36,036 INFO L225 Difference]: With dead ends: 179 [2018-10-15 12:55:36,036 INFO L226 Difference]: Without dead ends: 179 [2018-10-15 12:55:36,037 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=718, Invalid=1444, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 12:55:36,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-10-15 12:55:36,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 155. [2018-10-15 12:55:36,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-10-15 12:55:36,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 156 transitions. [2018-10-15 12:55:36,042 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 156 transitions. Word has length 139 [2018-10-15 12:55:36,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:36,042 INFO L481 AbstractCegarLoop]: Abstraction has 155 states and 156 transitions. [2018-10-15 12:55:36,042 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-15 12:55:36,043 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 156 transitions. [2018-10-15 12:55:36,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-10-15 12:55:36,044 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:36,045 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:36,045 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:36,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:36,045 INFO L82 PathProgramCache]: Analyzing trace with hash 276967358, now seen corresponding path program 12 times [2018-10-15 12:55:36,046 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:36,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:37,275 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:37,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:37,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 12:55:37,276 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 12:55:37,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 12:55:37,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2018-10-15 12:55:37,277 INFO L87 Difference]: Start difference. First operand 155 states and 156 transitions. Second operand 27 states. [2018-10-15 12:55:38,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:38,141 INFO L93 Difference]: Finished difference Result 189 states and 190 transitions. [2018-10-15 12:55:38,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-15 12:55:38,141 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 149 [2018-10-15 12:55:38,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:38,143 INFO L225 Difference]: With dead ends: 189 [2018-10-15 12:55:38,144 INFO L226 Difference]: Without dead ends: 189 [2018-10-15 12:55:38,145 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=843, Invalid=1707, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 12:55:38,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-10-15 12:55:38,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 165. [2018-10-15 12:55:38,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-10-15 12:55:38,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 166 transitions. [2018-10-15 12:55:38,149 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 166 transitions. Word has length 149 [2018-10-15 12:55:38,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:38,150 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 166 transitions. [2018-10-15 12:55:38,150 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 12:55:38,150 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 166 transitions. [2018-10-15 12:55:38,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-10-15 12:55:38,151 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:38,152 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:38,152 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:38,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:38,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1286012914, now seen corresponding path program 13 times [2018-10-15 12:55:38,153 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:38,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:38,805 INFO L134 CoverageAnalysis]: Checked inductivity of 793 backedges. 0 proven. 793 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:38,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:38,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 12:55:38,806 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 12:55:38,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 12:55:38,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=588, Unknown=0, NotChecked=0, Total=812 [2018-10-15 12:55:38,806 INFO L87 Difference]: Start difference. First operand 165 states and 166 transitions. Second operand 29 states. [2018-10-15 12:55:39,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:39,834 INFO L93 Difference]: Finished difference Result 199 states and 200 transitions. [2018-10-15 12:55:39,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-15 12:55:39,835 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 159 [2018-10-15 12:55:39,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:39,836 INFO L225 Difference]: With dead ends: 199 [2018-10-15 12:55:39,836 INFO L226 Difference]: Without dead ends: 199 [2018-10-15 12:55:39,840 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=978, Invalid=1992, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 12:55:39,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-10-15 12:55:39,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 175. [2018-10-15 12:55:39,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-10-15 12:55:39,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2018-10-15 12:55:39,846 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 159 [2018-10-15 12:55:39,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:39,846 INFO L481 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2018-10-15 12:55:39,847 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 12:55:39,847 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2018-10-15 12:55:39,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-10-15 12:55:39,848 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:39,848 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:39,849 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:39,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:39,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1149493466, now seen corresponding path program 14 times [2018-10-15 12:55:39,850 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:39,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:40,333 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:40,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:40,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 12:55:40,334 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 12:55:40,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 12:55:40,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2018-10-15 12:55:40,335 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 31 states. [2018-10-15 12:55:41,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:41,086 INFO L93 Difference]: Finished difference Result 209 states and 210 transitions. [2018-10-15 12:55:41,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-15 12:55:41,087 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 169 [2018-10-15 12:55:41,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:41,089 INFO L225 Difference]: With dead ends: 209 [2018-10-15 12:55:41,089 INFO L226 Difference]: Without dead ends: 209 [2018-10-15 12:55:41,092 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1123, Invalid=2299, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 12:55:41,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-10-15 12:55:41,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 185. [2018-10-15 12:55:41,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-10-15 12:55:41,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 186 transitions. [2018-10-15 12:55:41,096 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 186 transitions. Word has length 169 [2018-10-15 12:55:41,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:41,096 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 186 transitions. [2018-10-15 12:55:41,097 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 12:55:41,097 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 186 transitions. [2018-10-15 12:55:41,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-15 12:55:41,098 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:41,098 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:41,098 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:41,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:41,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1412091226, now seen corresponding path program 15 times [2018-10-15 12:55:41,099 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:41,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:41,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1065 backedges. 0 proven. 1065 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:41,568 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:41,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 12:55:41,569 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 12:55:41,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 12:55:41,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 12:55:41,570 INFO L87 Difference]: Start difference. First operand 185 states and 186 transitions. Second operand 33 states. [2018-10-15 12:55:42,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:42,556 INFO L93 Difference]: Finished difference Result 219 states and 220 transitions. [2018-10-15 12:55:42,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-15 12:55:42,560 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 179 [2018-10-15 12:55:42,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:42,562 INFO L225 Difference]: With dead ends: 219 [2018-10-15 12:55:42,562 INFO L226 Difference]: Without dead ends: 219 [2018-10-15 12:55:42,564 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1278, Invalid=2628, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 12:55:42,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-10-15 12:55:42,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 195. [2018-10-15 12:55:42,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-10-15 12:55:42,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 196 transitions. [2018-10-15 12:55:42,568 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 196 transitions. Word has length 179 [2018-10-15 12:55:42,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:42,568 INFO L481 AbstractCegarLoop]: Abstraction has 195 states and 196 transitions. [2018-10-15 12:55:42,569 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 12:55:42,569 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 196 transitions. [2018-10-15 12:55:42,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-10-15 12:55:42,570 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:42,570 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:42,570 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:42,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:42,571 INFO L82 PathProgramCache]: Analyzing trace with hash 457984654, now seen corresponding path program 16 times [2018-10-15 12:55:42,571 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:42,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:43,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 0 proven. 1216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:43,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:43,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 12:55:43,535 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 12:55:43,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 12:55:43,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 12:55:43,536 INFO L87 Difference]: Start difference. First operand 195 states and 196 transitions. Second operand 35 states. [2018-10-15 12:55:44,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:44,437 INFO L93 Difference]: Finished difference Result 229 states and 230 transitions. [2018-10-15 12:55:44,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-15 12:55:44,438 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 189 [2018-10-15 12:55:44,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:44,440 INFO L225 Difference]: With dead ends: 229 [2018-10-15 12:55:44,440 INFO L226 Difference]: Without dead ends: 229 [2018-10-15 12:55:44,442 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1443, Invalid=2979, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 12:55:44,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-10-15 12:55:44,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 205. [2018-10-15 12:55:44,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-10-15 12:55:44,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 206 transitions. [2018-10-15 12:55:44,446 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 206 transitions. Word has length 189 [2018-10-15 12:55:44,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:44,446 INFO L481 AbstractCegarLoop]: Abstraction has 205 states and 206 transitions. [2018-10-15 12:55:44,446 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 12:55:44,447 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 206 transitions. [2018-10-15 12:55:44,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-15 12:55:44,447 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:44,447 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:44,448 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:44,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:44,448 INFO L82 PathProgramCache]: Analyzing trace with hash 384423618, now seen corresponding path program 17 times [2018-10-15 12:55:44,449 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:44,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:45,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1377 backedges. 0 proven. 1377 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:45,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:45,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 12:55:45,401 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 12:55:45,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 12:55:45,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 12:55:45,402 INFO L87 Difference]: Start difference. First operand 205 states and 206 transitions. Second operand 37 states. [2018-10-15 12:55:46,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:46,347 INFO L93 Difference]: Finished difference Result 239 states and 240 transitions. [2018-10-15 12:55:46,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-15 12:55:46,348 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 199 [2018-10-15 12:55:46,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:46,350 INFO L225 Difference]: With dead ends: 239 [2018-10-15 12:55:46,350 INFO L226 Difference]: Without dead ends: 239 [2018-10-15 12:55:46,351 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 833 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1618, Invalid=3352, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 12:55:46,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-10-15 12:55:46,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 215. [2018-10-15 12:55:46,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-10-15 12:55:46,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 216 transitions. [2018-10-15 12:55:46,355 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 216 transitions. Word has length 199 [2018-10-15 12:55:46,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:46,355 INFO L481 AbstractCegarLoop]: Abstraction has 215 states and 216 transitions. [2018-10-15 12:55:46,356 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 12:55:46,356 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 216 transitions. [2018-10-15 12:55:46,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-10-15 12:55:46,356 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:46,357 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:46,357 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:46,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:46,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1115468278, now seen corresponding path program 18 times [2018-10-15 12:55:46,358 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:46,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:46,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1548 backedges. 0 proven. 1548 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:46,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:46,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 12:55:46,952 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 12:55:46,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 12:55:46,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 12:55:46,953 INFO L87 Difference]: Start difference. First operand 215 states and 216 transitions. Second operand 39 states. [2018-10-15 12:55:48,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:48,187 INFO L93 Difference]: Finished difference Result 249 states and 250 transitions. [2018-10-15 12:55:48,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-15 12:55:48,188 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 209 [2018-10-15 12:55:48,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:48,190 INFO L225 Difference]: With dead ends: 249 [2018-10-15 12:55:48,190 INFO L226 Difference]: Without dead ends: 249 [2018-10-15 12:55:48,193 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1803, Invalid=3747, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 12:55:48,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-10-15 12:55:48,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 225. [2018-10-15 12:55:48,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-10-15 12:55:48,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 226 transitions. [2018-10-15 12:55:48,197 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 226 transitions. Word has length 209 [2018-10-15 12:55:48,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:48,198 INFO L481 AbstractCegarLoop]: Abstraction has 225 states and 226 transitions. [2018-10-15 12:55:48,198 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 12:55:48,198 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 226 transitions. [2018-10-15 12:55:48,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-10-15 12:55:48,199 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:48,199 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:48,199 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:48,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:48,200 INFO L82 PathProgramCache]: Analyzing trace with hash -2098324438, now seen corresponding path program 19 times [2018-10-15 12:55:48,200 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:48,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:49,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:49,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:49,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 12:55:49,159 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 12:55:49,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 12:55:49,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=1200, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 12:55:49,160 INFO L87 Difference]: Start difference. First operand 225 states and 226 transitions. Second operand 41 states. [2018-10-15 12:55:50,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:50,444 INFO L93 Difference]: Finished difference Result 259 states and 260 transitions. [2018-10-15 12:55:50,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-15 12:55:50,445 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 219 [2018-10-15 12:55:50,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:50,446 INFO L225 Difference]: With dead ends: 259 [2018-10-15 12:55:50,446 INFO L226 Difference]: Without dead ends: 259 [2018-10-15 12:55:50,448 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1045 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1998, Invalid=4164, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 12:55:50,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-10-15 12:55:50,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 235. [2018-10-15 12:55:50,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-10-15 12:55:50,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 236 transitions. [2018-10-15 12:55:50,453 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 236 transitions. Word has length 219 [2018-10-15 12:55:50,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:50,453 INFO L481 AbstractCegarLoop]: Abstraction has 235 states and 236 transitions. [2018-10-15 12:55:50,454 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 12:55:50,454 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 236 transitions. [2018-10-15 12:55:50,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-10-15 12:55:50,455 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:50,455 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:50,455 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:50,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:50,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1701358242, now seen corresponding path program 20 times [2018-10-15 12:55:50,456 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:50,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:51,831 INFO L134 CoverageAnalysis]: Checked inductivity of 1920 backedges. 0 proven. 1920 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:51,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:51,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 12:55:51,832 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 12:55:51,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 12:55:51,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 12:55:51,833 INFO L87 Difference]: Start difference. First operand 235 states and 236 transitions. Second operand 43 states. [2018-10-15 12:55:53,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:53,383 INFO L93 Difference]: Finished difference Result 269 states and 270 transitions. [2018-10-15 12:55:53,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-15 12:55:53,384 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 229 [2018-10-15 12:55:53,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:53,386 INFO L225 Difference]: With dead ends: 269 [2018-10-15 12:55:53,386 INFO L226 Difference]: Without dead ends: 269 [2018-10-15 12:55:53,388 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1160 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2203, Invalid=4603, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 12:55:53,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-10-15 12:55:53,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 245. [2018-10-15 12:55:53,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-10-15 12:55:53,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 246 transitions. [2018-10-15 12:55:53,393 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 246 transitions. Word has length 229 [2018-10-15 12:55:53,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:53,393 INFO L481 AbstractCegarLoop]: Abstraction has 245 states and 246 transitions. [2018-10-15 12:55:53,393 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 12:55:53,393 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 246 transitions. [2018-10-15 12:55:53,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-10-15 12:55:53,395 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:53,395 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:53,395 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:53,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:53,395 INFO L82 PathProgramCache]: Analyzing trace with hash 490839442, now seen corresponding path program 21 times [2018-10-15 12:55:53,396 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:53,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:54,556 INFO L134 CoverageAnalysis]: Checked inductivity of 2121 backedges. 0 proven. 2121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:54,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:54,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 12:55:54,557 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 12:55:54,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 12:55:54,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=1452, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 12:55:54,558 INFO L87 Difference]: Start difference. First operand 245 states and 246 transitions. Second operand 45 states. [2018-10-15 12:55:55,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:55,877 INFO L93 Difference]: Finished difference Result 279 states and 280 transitions. [2018-10-15 12:55:55,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-15 12:55:55,880 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 239 [2018-10-15 12:55:55,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:55,882 INFO L225 Difference]: With dead ends: 279 [2018-10-15 12:55:55,882 INFO L226 Difference]: Without dead ends: 279 [2018-10-15 12:55:55,884 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1281 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2418, Invalid=5064, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 12:55:55,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-10-15 12:55:55,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 255. [2018-10-15 12:55:55,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-10-15 12:55:55,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 256 transitions. [2018-10-15 12:55:55,888 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 256 transitions. Word has length 239 [2018-10-15 12:55:55,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:55,888 INFO L481 AbstractCegarLoop]: Abstraction has 255 states and 256 transitions. [2018-10-15 12:55:55,888 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 12:55:55,889 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 256 transitions. [2018-10-15 12:55:55,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-10-15 12:55:55,890 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:55,890 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:55,890 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:55,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:55,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1680225478, now seen corresponding path program 22 times [2018-10-15 12:55:55,891 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:55,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:56,863 INFO L134 CoverageAnalysis]: Checked inductivity of 2332 backedges. 0 proven. 2332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:56,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:56,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 12:55:56,864 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 12:55:56,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 12:55:56,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=1587, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 12:55:56,864 INFO L87 Difference]: Start difference. First operand 255 states and 256 transitions. Second operand 47 states. [2018-10-15 12:55:58,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:58,585 INFO L93 Difference]: Finished difference Result 289 states and 290 transitions. [2018-10-15 12:55:58,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-15 12:55:58,586 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 249 [2018-10-15 12:55:58,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:58,587 INFO L225 Difference]: With dead ends: 289 [2018-10-15 12:55:58,587 INFO L226 Difference]: Without dead ends: 289 [2018-10-15 12:55:58,589 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1408 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2643, Invalid=5547, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 12:55:58,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-10-15 12:55:58,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 265. [2018-10-15 12:55:58,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-10-15 12:55:58,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 266 transitions. [2018-10-15 12:55:58,593 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 266 transitions. Word has length 249 [2018-10-15 12:55:58,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:58,593 INFO L481 AbstractCegarLoop]: Abstraction has 265 states and 266 transitions. [2018-10-15 12:55:58,593 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 12:55:58,594 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 266 transitions. [2018-10-15 12:55:58,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-10-15 12:55:58,595 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:58,595 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:58,595 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:58,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:58,596 INFO L82 PathProgramCache]: Analyzing trace with hash -2115085574, now seen corresponding path program 23 times [2018-10-15 12:55:58,596 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:58,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:00,115 INFO L134 CoverageAnalysis]: Checked inductivity of 2553 backedges. 0 proven. 2553 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:00,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:00,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 12:56:00,115 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 12:56:00,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 12:56:00,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=624, Invalid=1728, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 12:56:00,116 INFO L87 Difference]: Start difference. First operand 265 states and 266 transitions. Second operand 49 states. [2018-10-15 12:56:02,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:02,298 INFO L93 Difference]: Finished difference Result 299 states and 300 transitions. [2018-10-15 12:56:02,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-15 12:56:02,299 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 259 [2018-10-15 12:56:02,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:02,301 INFO L225 Difference]: With dead ends: 299 [2018-10-15 12:56:02,301 INFO L226 Difference]: Without dead ends: 299 [2018-10-15 12:56:02,303 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1541 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=2878, Invalid=6052, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 12:56:02,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-10-15 12:56:02,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 275. [2018-10-15 12:56:02,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-10-15 12:56:02,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 276 transitions. [2018-10-15 12:56:02,307 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 276 transitions. Word has length 259 [2018-10-15 12:56:02,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:02,308 INFO L481 AbstractCegarLoop]: Abstraction has 275 states and 276 transitions. [2018-10-15 12:56:02,308 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 12:56:02,308 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 276 transitions. [2018-10-15 12:56:02,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-10-15 12:56:02,309 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:02,309 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:02,310 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:02,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:02,310 INFO L82 PathProgramCache]: Analyzing trace with hash 917721134, now seen corresponding path program 24 times [2018-10-15 12:56:02,311 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:02,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:03,439 INFO L134 CoverageAnalysis]: Checked inductivity of 2784 backedges. 0 proven. 2784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:03,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:03,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 12:56:03,440 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 12:56:03,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 12:56:03,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 12:56:03,441 INFO L87 Difference]: Start difference. First operand 275 states and 276 transitions. Second operand 51 states. [2018-10-15 12:56:05,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:05,221 INFO L93 Difference]: Finished difference Result 309 states and 310 transitions. [2018-10-15 12:56:05,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-15 12:56:05,222 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 269 [2018-10-15 12:56:05,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:05,224 INFO L225 Difference]: With dead ends: 309 [2018-10-15 12:56:05,224 INFO L226 Difference]: Without dead ends: 309 [2018-10-15 12:56:05,226 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1680 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3123, Invalid=6579, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 12:56:05,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-10-15 12:56:05,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 285. [2018-10-15 12:56:05,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-10-15 12:56:05,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 286 transitions. [2018-10-15 12:56:05,232 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 286 transitions. Word has length 269 [2018-10-15 12:56:05,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:05,232 INFO L481 AbstractCegarLoop]: Abstraction has 285 states and 286 transitions. [2018-10-15 12:56:05,232 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 12:56:05,232 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 286 transitions. [2018-10-15 12:56:05,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-10-15 12:56:05,234 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:05,234 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:05,235 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:05,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:05,235 INFO L82 PathProgramCache]: Analyzing trace with hash -469871518, now seen corresponding path program 25 times [2018-10-15 12:56:05,236 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:05,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:07,039 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:07,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:07,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 12:56:07,040 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 12:56:07,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 12:56:07,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=728, Invalid=2028, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 12:56:07,040 INFO L87 Difference]: Start difference. First operand 285 states and 286 transitions. Second operand 53 states. [2018-10-15 12:56:09,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:09,285 INFO L93 Difference]: Finished difference Result 319 states and 320 transitions. [2018-10-15 12:56:09,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-15 12:56:09,287 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 279 [2018-10-15 12:56:09,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:09,289 INFO L225 Difference]: With dead ends: 319 [2018-10-15 12:56:09,289 INFO L226 Difference]: Without dead ends: 319 [2018-10-15 12:56:09,291 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1825 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3378, Invalid=7128, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 12:56:09,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-10-15 12:56:09,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 295. [2018-10-15 12:56:09,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-10-15 12:56:09,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 296 transitions. [2018-10-15 12:56:09,295 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 296 transitions. Word has length 279 [2018-10-15 12:56:09,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:09,296 INFO L481 AbstractCegarLoop]: Abstraction has 295 states and 296 transitions. [2018-10-15 12:56:09,296 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 12:56:09,296 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 296 transitions. [2018-10-15 12:56:09,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-10-15 12:56:09,298 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:09,298 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:09,298 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:09,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:09,298 INFO L82 PathProgramCache]: Analyzing trace with hash -2134333546, now seen corresponding path program 26 times [2018-10-15 12:56:09,299 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:09,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:10,595 INFO L134 CoverageAnalysis]: Checked inductivity of 3276 backedges. 0 proven. 3276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:10,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:10,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-15 12:56:10,596 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-15 12:56:10,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-15 12:56:10,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=783, Invalid=2187, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 12:56:10,597 INFO L87 Difference]: Start difference. First operand 295 states and 296 transitions. Second operand 55 states. [2018-10-15 12:56:12,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:12,532 INFO L93 Difference]: Finished difference Result 329 states and 330 transitions. [2018-10-15 12:56:12,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-15 12:56:12,533 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 289 [2018-10-15 12:56:12,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:12,535 INFO L225 Difference]: With dead ends: 329 [2018-10-15 12:56:12,535 INFO L226 Difference]: Without dead ends: 329 [2018-10-15 12:56:12,536 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1976 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3643, Invalid=7699, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 12:56:12,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-10-15 12:56:12,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 305. [2018-10-15 12:56:12,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-10-15 12:56:12,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 306 transitions. [2018-10-15 12:56:12,541 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 306 transitions. Word has length 289 [2018-10-15 12:56:12,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:12,542 INFO L481 AbstractCegarLoop]: Abstraction has 305 states and 306 transitions. [2018-10-15 12:56:12,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-15 12:56:12,542 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 306 transitions. [2018-10-15 12:56:12,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2018-10-15 12:56:12,544 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:12,544 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:12,544 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:12,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:12,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1921283638, now seen corresponding path program 27 times [2018-10-15 12:56:12,545 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:12,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:13,840 INFO L134 CoverageAnalysis]: Checked inductivity of 3537 backedges. 0 proven. 3537 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:13,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:13,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-15 12:56:13,841 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-15 12:56:13,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-15 12:56:13,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=840, Invalid=2352, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 12:56:13,842 INFO L87 Difference]: Start difference. First operand 305 states and 306 transitions. Second operand 57 states. [2018-10-15 12:56:15,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:15,794 INFO L93 Difference]: Finished difference Result 339 states and 340 transitions. [2018-10-15 12:56:15,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-15 12:56:15,794 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 299 [2018-10-15 12:56:15,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:15,797 INFO L225 Difference]: With dead ends: 339 [2018-10-15 12:56:15,797 INFO L226 Difference]: Without dead ends: 339 [2018-10-15 12:56:15,798 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2133 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3918, Invalid=8292, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 12:56:15,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-10-15 12:56:15,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 315. [2018-10-15 12:56:15,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-10-15 12:56:15,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 316 transitions. [2018-10-15 12:56:15,803 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 316 transitions. Word has length 299 [2018-10-15 12:56:15,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:15,803 INFO L481 AbstractCegarLoop]: Abstraction has 315 states and 316 transitions. [2018-10-15 12:56:15,803 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-15 12:56:15,804 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 316 transitions. [2018-10-15 12:56:15,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2018-10-15 12:56:15,805 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:15,805 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:15,806 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:15,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:15,806 INFO L82 PathProgramCache]: Analyzing trace with hash 133184254, now seen corresponding path program 28 times [2018-10-15 12:56:15,807 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:15,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:17,130 INFO L134 CoverageAnalysis]: Checked inductivity of 3808 backedges. 0 proven. 3808 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:17,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:17,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-15 12:56:17,131 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-15 12:56:17,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-15 12:56:17,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=899, Invalid=2523, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 12:56:17,132 INFO L87 Difference]: Start difference. First operand 315 states and 316 transitions. Second operand 59 states. [2018-10-15 12:56:19,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:19,393 INFO L93 Difference]: Finished difference Result 349 states and 350 transitions. [2018-10-15 12:56:19,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-15 12:56:19,394 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 309 [2018-10-15 12:56:19,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:19,395 INFO L225 Difference]: With dead ends: 349 [2018-10-15 12:56:19,395 INFO L226 Difference]: Without dead ends: 349 [2018-10-15 12:56:19,396 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2296 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4203, Invalid=8907, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 12:56:19,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-10-15 12:56:19,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 325. [2018-10-15 12:56:19,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-10-15 12:56:19,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 326 transitions. [2018-10-15 12:56:19,401 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 326 transitions. Word has length 309 [2018-10-15 12:56:19,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:19,401 INFO L481 AbstractCegarLoop]: Abstraction has 325 states and 326 transitions. [2018-10-15 12:56:19,401 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-15 12:56:19,402 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 326 transitions. [2018-10-15 12:56:19,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2018-10-15 12:56:19,403 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:19,403 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:19,404 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:19,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:19,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1601174322, now seen corresponding path program 29 times [2018-10-15 12:56:19,405 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:19,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:20,733 INFO L134 CoverageAnalysis]: Checked inductivity of 4089 backedges. 0 proven. 4089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:20,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:20,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-15 12:56:20,733 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-15 12:56:20,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-15 12:56:20,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=960, Invalid=2700, Unknown=0, NotChecked=0, Total=3660 [2018-10-15 12:56:20,734 INFO L87 Difference]: Start difference. First operand 325 states and 326 transitions. Second operand 61 states. [2018-10-15 12:56:23,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:23,161 INFO L93 Difference]: Finished difference Result 359 states and 360 transitions. [2018-10-15 12:56:23,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-15 12:56:23,162 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 319 [2018-10-15 12:56:23,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:23,163 INFO L225 Difference]: With dead ends: 359 [2018-10-15 12:56:23,164 INFO L226 Difference]: Without dead ends: 359 [2018-10-15 12:56:23,165 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2465 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4498, Invalid=9544, Unknown=0, NotChecked=0, Total=14042 [2018-10-15 12:56:23,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2018-10-15 12:56:23,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 335. [2018-10-15 12:56:23,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-10-15 12:56:23,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 336 transitions. [2018-10-15 12:56:23,169 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 336 transitions. Word has length 319 [2018-10-15 12:56:23,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:23,169 INFO L481 AbstractCegarLoop]: Abstraction has 335 states and 336 transitions. [2018-10-15 12:56:23,170 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-15 12:56:23,170 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 336 transitions. [2018-10-15 12:56:23,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2018-10-15 12:56:23,171 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:23,171 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:23,172 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:23,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:23,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1756629606, now seen corresponding path program 30 times [2018-10-15 12:56:23,173 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:23,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:24,689 INFO L134 CoverageAnalysis]: Checked inductivity of 4380 backedges. 0 proven. 4380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:24,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:24,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-15 12:56:24,690 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-15 12:56:24,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-15 12:56:24,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 12:56:24,691 INFO L87 Difference]: Start difference. First operand 335 states and 336 transitions. Second operand 63 states. [2018-10-15 12:56:27,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:27,082 INFO L93 Difference]: Finished difference Result 369 states and 370 transitions. [2018-10-15 12:56:27,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-15 12:56:27,083 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 329 [2018-10-15 12:56:27,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:27,085 INFO L225 Difference]: With dead ends: 369 [2018-10-15 12:56:27,085 INFO L226 Difference]: Without dead ends: 369 [2018-10-15 12:56:27,087 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2640 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4803, Invalid=10203, Unknown=0, NotChecked=0, Total=15006 [2018-10-15 12:56:27,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-10-15 12:56:27,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 345. [2018-10-15 12:56:27,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-10-15 12:56:27,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 346 transitions. [2018-10-15 12:56:27,092 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 346 transitions. Word has length 329 [2018-10-15 12:56:27,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:27,092 INFO L481 AbstractCegarLoop]: Abstraction has 345 states and 346 transitions. [2018-10-15 12:56:27,092 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-15 12:56:27,092 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 346 transitions. [2018-10-15 12:56:27,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2018-10-15 12:56:27,094 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:27,094 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:27,094 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:27,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:27,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1374005402, now seen corresponding path program 31 times [2018-10-15 12:56:27,096 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:27,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:28,742 INFO L134 CoverageAnalysis]: Checked inductivity of 4681 backedges. 0 proven. 4681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:28,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:28,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-15 12:56:28,743 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-15 12:56:28,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-15 12:56:28,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1088, Invalid=3072, Unknown=0, NotChecked=0, Total=4160 [2018-10-15 12:56:28,744 INFO L87 Difference]: Start difference. First operand 345 states and 346 transitions. Second operand 65 states. [2018-10-15 12:56:31,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:31,287 INFO L93 Difference]: Finished difference Result 379 states and 380 transitions. [2018-10-15 12:56:31,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-15 12:56:31,288 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 339 [2018-10-15 12:56:31,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:31,293 INFO L225 Difference]: With dead ends: 379 [2018-10-15 12:56:31,293 INFO L226 Difference]: Without dead ends: 379 [2018-10-15 12:56:31,294 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2821 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5118, Invalid=10884, Unknown=0, NotChecked=0, Total=16002 [2018-10-15 12:56:31,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-10-15 12:56:31,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 355. [2018-10-15 12:56:31,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2018-10-15 12:56:31,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 356 transitions. [2018-10-15 12:56:31,302 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 356 transitions. Word has length 339 [2018-10-15 12:56:31,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:31,302 INFO L481 AbstractCegarLoop]: Abstraction has 355 states and 356 transitions. [2018-10-15 12:56:31,302 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-15 12:56:31,302 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 356 transitions. [2018-10-15 12:56:31,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2018-10-15 12:56:31,304 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:31,304 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:31,304 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:31,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:31,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1768024626, now seen corresponding path program 32 times [2018-10-15 12:56:31,305 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:31,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:32,786 INFO L134 CoverageAnalysis]: Checked inductivity of 4992 backedges. 0 proven. 4992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:32,786 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:32,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-15 12:56:32,787 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-15 12:56:32,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-15 12:56:32,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1155, Invalid=3267, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 12:56:32,788 INFO L87 Difference]: Start difference. First operand 355 states and 356 transitions. Second operand 67 states. [2018-10-15 12:56:35,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:35,773 INFO L93 Difference]: Finished difference Result 389 states and 390 transitions. [2018-10-15 12:56:35,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-10-15 12:56:35,774 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 349 [2018-10-15 12:56:35,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:35,776 INFO L225 Difference]: With dead ends: 389 [2018-10-15 12:56:35,776 INFO L226 Difference]: Without dead ends: 389 [2018-10-15 12:56:35,778 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3008 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5443, Invalid=11587, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 12:56:35,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-10-15 12:56:35,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 365. [2018-10-15 12:56:35,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-10-15 12:56:35,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 366 transitions. [2018-10-15 12:56:35,783 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 366 transitions. Word has length 349 [2018-10-15 12:56:35,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:35,784 INFO L481 AbstractCegarLoop]: Abstraction has 365 states and 366 transitions. [2018-10-15 12:56:35,784 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-15 12:56:35,784 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 366 transitions. [2018-10-15 12:56:35,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2018-10-15 12:56:35,786 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:35,787 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:35,787 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:35,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:35,787 INFO L82 PathProgramCache]: Analyzing trace with hash -202993150, now seen corresponding path program 33 times [2018-10-15 12:56:35,788 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:35,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:37,623 INFO L134 CoverageAnalysis]: Checked inductivity of 5313 backedges. 0 proven. 5313 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:37,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:37,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-15 12:56:37,624 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-15 12:56:37,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-15 12:56:37,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1224, Invalid=3468, Unknown=0, NotChecked=0, Total=4692 [2018-10-15 12:56:37,625 INFO L87 Difference]: Start difference. First operand 365 states and 366 transitions. Second operand 69 states. [2018-10-15 12:56:40,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:40,529 INFO L93 Difference]: Finished difference Result 399 states and 400 transitions. [2018-10-15 12:56:40,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-10-15 12:56:40,529 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 359 [2018-10-15 12:56:40,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:40,532 INFO L225 Difference]: With dead ends: 399 [2018-10-15 12:56:40,532 INFO L226 Difference]: Without dead ends: 399 [2018-10-15 12:56:40,533 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3201 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5778, Invalid=12312, Unknown=0, NotChecked=0, Total=18090 [2018-10-15 12:56:40,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-10-15 12:56:40,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 375. [2018-10-15 12:56:40,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2018-10-15 12:56:40,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 376 transitions. [2018-10-15 12:56:40,537 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 376 transitions. Word has length 359 [2018-10-15 12:56:40,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:40,537 INFO L481 AbstractCegarLoop]: Abstraction has 375 states and 376 transitions. [2018-10-15 12:56:40,537 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-15 12:56:40,537 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 376 transitions. [2018-10-15 12:56:40,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2018-10-15 12:56:40,539 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:40,539 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:40,539 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:40,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:40,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1547197750, now seen corresponding path program 34 times [2018-10-15 12:56:40,540 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:40,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:42,174 INFO L134 CoverageAnalysis]: Checked inductivity of 5644 backedges. 0 proven. 5644 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:42,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:42,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-15 12:56:42,175 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-15 12:56:42,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-15 12:56:42,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1295, Invalid=3675, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 12:56:42,175 INFO L87 Difference]: Start difference. First operand 375 states and 376 transitions. Second operand 71 states. [2018-10-15 12:56:45,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:45,311 INFO L93 Difference]: Finished difference Result 409 states and 410 transitions. [2018-10-15 12:56:45,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-10-15 12:56:45,315 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 369 [2018-10-15 12:56:45,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:45,317 INFO L225 Difference]: With dead ends: 409 [2018-10-15 12:56:45,317 INFO L226 Difference]: Without dead ends: 409 [2018-10-15 12:56:45,318 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3400 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=6123, Invalid=13059, Unknown=0, NotChecked=0, Total=19182 [2018-10-15 12:56:45,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2018-10-15 12:56:45,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 385. [2018-10-15 12:56:45,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-10-15 12:56:45,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 386 transitions. [2018-10-15 12:56:45,322 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 386 transitions. Word has length 369 [2018-10-15 12:56:45,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:45,323 INFO L481 AbstractCegarLoop]: Abstraction has 385 states and 386 transitions. [2018-10-15 12:56:45,323 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-15 12:56:45,323 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 386 transitions. [2018-10-15 12:56:45,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2018-10-15 12:56:45,325 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:45,325 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:45,325 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:45,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:45,326 INFO L82 PathProgramCache]: Analyzing trace with hash -344148118, now seen corresponding path program 35 times [2018-10-15 12:56:45,326 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:45,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:47,215 INFO L134 CoverageAnalysis]: Checked inductivity of 5985 backedges. 0 proven. 5985 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:47,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:47,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-15 12:56:47,216 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-15 12:56:47,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-15 12:56:47,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1368, Invalid=3888, Unknown=0, NotChecked=0, Total=5256 [2018-10-15 12:56:47,217 INFO L87 Difference]: Start difference. First operand 385 states and 386 transitions. Second operand 73 states. [2018-10-15 12:56:50,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:50,534 INFO L93 Difference]: Finished difference Result 419 states and 420 transitions. [2018-10-15 12:56:50,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-10-15 12:56:50,534 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 379 [2018-10-15 12:56:50,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:50,536 INFO L225 Difference]: With dead ends: 419 [2018-10-15 12:56:50,536 INFO L226 Difference]: Without dead ends: 419 [2018-10-15 12:56:50,537 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3605 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6478, Invalid=13828, Unknown=0, NotChecked=0, Total=20306 [2018-10-15 12:56:50,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-10-15 12:56:50,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 395. [2018-10-15 12:56:50,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-10-15 12:56:50,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 396 transitions. [2018-10-15 12:56:50,542 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 396 transitions. Word has length 379 [2018-10-15 12:56:50,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:50,542 INFO L481 AbstractCegarLoop]: Abstraction has 395 states and 396 transitions. [2018-10-15 12:56:50,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-15 12:56:50,543 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 396 transitions. [2018-10-15 12:56:50,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2018-10-15 12:56:50,544 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:50,545 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:50,545 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:50,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:50,545 INFO L82 PathProgramCache]: Analyzing trace with hash -619913058, now seen corresponding path program 36 times [2018-10-15 12:56:50,546 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:50,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:52,752 INFO L134 CoverageAnalysis]: Checked inductivity of 6336 backedges. 0 proven. 6336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:52,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:52,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-15 12:56:52,753 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-15 12:56:52,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-15 12:56:52,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1443, Invalid=4107, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 12:56:52,753 INFO L87 Difference]: Start difference. First operand 395 states and 396 transitions. Second operand 75 states. [2018-10-15 12:56:56,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:56,245 INFO L93 Difference]: Finished difference Result 429 states and 430 transitions. [2018-10-15 12:56:56,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-10-15 12:56:56,245 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 389 [2018-10-15 12:56:56,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:56,247 INFO L225 Difference]: With dead ends: 429 [2018-10-15 12:56:56,248 INFO L226 Difference]: Without dead ends: 429 [2018-10-15 12:56:56,249 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3816 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6843, Invalid=14619, Unknown=0, NotChecked=0, Total=21462 [2018-10-15 12:56:56,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2018-10-15 12:56:56,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 405. [2018-10-15 12:56:56,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-10-15 12:56:56,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 406 transitions. [2018-10-15 12:56:56,253 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 406 transitions. Word has length 389 [2018-10-15 12:56:56,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:56,254 INFO L481 AbstractCegarLoop]: Abstraction has 405 states and 406 transitions. [2018-10-15 12:56:56,254 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-15 12:56:56,254 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 406 transitions. [2018-10-15 12:56:56,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2018-10-15 12:56:56,256 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:56,256 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:56,257 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:56,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:56,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1974606034, now seen corresponding path program 37 times [2018-10-15 12:56:56,258 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:56,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:58,352 INFO L134 CoverageAnalysis]: Checked inductivity of 6697 backedges. 0 proven. 6697 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:58,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:58,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-10-15 12:56:58,353 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-15 12:56:58,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-15 12:56:58,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1520, Invalid=4332, Unknown=0, NotChecked=0, Total=5852 [2018-10-15 12:56:58,354 INFO L87 Difference]: Start difference. First operand 405 states and 406 transitions. Second operand 77 states. [2018-10-15 12:57:01,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:01,737 INFO L93 Difference]: Finished difference Result 439 states and 440 transitions. [2018-10-15 12:57:01,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-10-15 12:57:01,737 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 399 [2018-10-15 12:57:01,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:01,740 INFO L225 Difference]: With dead ends: 439 [2018-10-15 12:57:01,740 INFO L226 Difference]: Without dead ends: 439 [2018-10-15 12:57:01,741 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4033 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=7218, Invalid=15432, Unknown=0, NotChecked=0, Total=22650 [2018-10-15 12:57:01,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2018-10-15 12:57:01,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 415. [2018-10-15 12:57:01,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 415 states. [2018-10-15 12:57:01,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 416 transitions. [2018-10-15 12:57:01,746 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 416 transitions. Word has length 399 [2018-10-15 12:57:01,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:01,746 INFO L481 AbstractCegarLoop]: Abstraction has 415 states and 416 transitions. [2018-10-15 12:57:01,746 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-15 12:57:01,746 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 416 transitions. [2018-10-15 12:57:01,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2018-10-15 12:57:01,748 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:01,749 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:01,749 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:01,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:01,749 INFO L82 PathProgramCache]: Analyzing trace with hash 195403782, now seen corresponding path program 38 times [2018-10-15 12:57:01,750 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:01,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:03,835 INFO L134 CoverageAnalysis]: Checked inductivity of 7068 backedges. 0 proven. 7068 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:03,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:03,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-10-15 12:57:03,836 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-15 12:57:03,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-15 12:57:03,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1599, Invalid=4563, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 12:57:03,837 INFO L87 Difference]: Start difference. First operand 415 states and 416 transitions. Second operand 79 states. [2018-10-15 12:57:07,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:07,625 INFO L93 Difference]: Finished difference Result 449 states and 450 transitions. [2018-10-15 12:57:07,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-10-15 12:57:07,625 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 409 [2018-10-15 12:57:07,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:07,628 INFO L225 Difference]: With dead ends: 449 [2018-10-15 12:57:07,628 INFO L226 Difference]: Without dead ends: 449 [2018-10-15 12:57:07,630 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4256 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=7603, Invalid=16267, Unknown=0, NotChecked=0, Total=23870 [2018-10-15 12:57:07,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2018-10-15 12:57:07,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 425. [2018-10-15 12:57:07,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-10-15 12:57:07,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 426 transitions. [2018-10-15 12:57:07,636 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 426 transitions. Word has length 409 [2018-10-15 12:57:07,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:07,636 INFO L481 AbstractCegarLoop]: Abstraction has 425 states and 426 transitions. [2018-10-15 12:57:07,636 INFO L482 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-15 12:57:07,636 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 426 transitions. [2018-10-15 12:57:07,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2018-10-15 12:57:07,639 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:07,639 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:07,639 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:07,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:07,639 INFO L82 PathProgramCache]: Analyzing trace with hash -426723782, now seen corresponding path program 39 times [2018-10-15 12:57:07,640 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:07,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:10,129 INFO L134 CoverageAnalysis]: Checked inductivity of 7449 backedges. 0 proven. 7449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:10,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:10,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-15 12:57:10,130 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-15 12:57:10,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-15 12:57:10,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1680, Invalid=4800, Unknown=0, NotChecked=0, Total=6480 [2018-10-15 12:57:10,131 INFO L87 Difference]: Start difference. First operand 425 states and 426 transitions. Second operand 81 states. [2018-10-15 12:57:13,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:13,659 INFO L93 Difference]: Finished difference Result 459 states and 460 transitions. [2018-10-15 12:57:13,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-10-15 12:57:13,660 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 419 [2018-10-15 12:57:13,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:13,663 INFO L225 Difference]: With dead ends: 459 [2018-10-15 12:57:13,663 INFO L226 Difference]: Without dead ends: 459 [2018-10-15 12:57:13,664 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4485 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=7998, Invalid=17124, Unknown=0, NotChecked=0, Total=25122 [2018-10-15 12:57:13,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-10-15 12:57:13,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 435. [2018-10-15 12:57:13,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-10-15 12:57:13,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 436 transitions. [2018-10-15 12:57:13,668 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 436 transitions. Word has length 419 [2018-10-15 12:57:13,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:13,668 INFO L481 AbstractCegarLoop]: Abstraction has 435 states and 436 transitions. [2018-10-15 12:57:13,668 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-15 12:57:13,668 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 436 transitions. [2018-10-15 12:57:13,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2018-10-15 12:57:13,670 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:13,671 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:13,671 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:13,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:13,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1032625006, now seen corresponding path program 40 times [2018-10-15 12:57:13,672 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:13,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:16,066 INFO L134 CoverageAnalysis]: Checked inductivity of 7840 backedges. 0 proven. 7840 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:16,066 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:16,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-15 12:57:16,067 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-15 12:57:16,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-15 12:57:16,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1763, Invalid=5043, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 12:57:16,068 INFO L87 Difference]: Start difference. First operand 435 states and 436 transitions. Second operand 83 states. [2018-10-15 12:57:19,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:19,813 INFO L93 Difference]: Finished difference Result 469 states and 470 transitions. [2018-10-15 12:57:19,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-10-15 12:57:19,814 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 429 [2018-10-15 12:57:19,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:19,817 INFO L225 Difference]: With dead ends: 469 [2018-10-15 12:57:19,817 INFO L226 Difference]: Without dead ends: 469 [2018-10-15 12:57:19,818 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4720 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=8403, Invalid=18003, Unknown=0, NotChecked=0, Total=26406 [2018-10-15 12:57:19,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2018-10-15 12:57:19,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 445. [2018-10-15 12:57:19,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-10-15 12:57:19,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 446 transitions. [2018-10-15 12:57:19,823 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 446 transitions. Word has length 429 [2018-10-15 12:57:19,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:19,823 INFO L481 AbstractCegarLoop]: Abstraction has 445 states and 446 transitions. [2018-10-15 12:57:19,824 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-15 12:57:19,824 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 446 transitions. [2018-10-15 12:57:19,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2018-10-15 12:57:19,826 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:19,826 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:19,826 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:19,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:19,827 INFO L82 PathProgramCache]: Analyzing trace with hash 690130850, now seen corresponding path program 41 times [2018-10-15 12:57:19,827 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:19,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:22,049 INFO L134 CoverageAnalysis]: Checked inductivity of 8241 backedges. 0 proven. 8241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:22,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:22,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-10-15 12:57:22,050 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-15 12:57:22,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-15 12:57:22,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1848, Invalid=5292, Unknown=0, NotChecked=0, Total=7140 [2018-10-15 12:57:22,051 INFO L87 Difference]: Start difference. First operand 445 states and 446 transitions. Second operand 85 states. [2018-10-15 12:57:25,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:25,956 INFO L93 Difference]: Finished difference Result 479 states and 480 transitions. [2018-10-15 12:57:25,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-10-15 12:57:25,957 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 439 [2018-10-15 12:57:25,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:25,959 INFO L225 Difference]: With dead ends: 479 [2018-10-15 12:57:25,960 INFO L226 Difference]: Without dead ends: 479 [2018-10-15 12:57:25,961 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4961 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=8818, Invalid=18904, Unknown=0, NotChecked=0, Total=27722 [2018-10-15 12:57:25,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2018-10-15 12:57:25,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 455. [2018-10-15 12:57:25,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2018-10-15 12:57:25,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 456 transitions. [2018-10-15 12:57:25,964 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 456 transitions. Word has length 439 [2018-10-15 12:57:25,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:25,964 INFO L481 AbstractCegarLoop]: Abstraction has 455 states and 456 transitions. [2018-10-15 12:57:25,965 INFO L482 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-15 12:57:25,965 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 456 transitions. [2018-10-15 12:57:25,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2018-10-15 12:57:25,966 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:25,966 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:25,967 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:25,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:25,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1756638506, now seen corresponding path program 42 times [2018-10-15 12:57:25,967 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:26,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:28,506 INFO L134 CoverageAnalysis]: Checked inductivity of 8652 backedges. 0 proven. 8652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:28,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:28,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-15 12:57:28,507 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-15 12:57:28,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-15 12:57:28,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1935, Invalid=5547, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 12:57:28,509 INFO L87 Difference]: Start difference. First operand 455 states and 456 transitions. Second operand 87 states. [2018-10-15 12:57:32,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:32,989 INFO L93 Difference]: Finished difference Result 489 states and 490 transitions. [2018-10-15 12:57:32,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-10-15 12:57:32,990 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 449 [2018-10-15 12:57:32,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:32,991 INFO L225 Difference]: With dead ends: 489 [2018-10-15 12:57:32,991 INFO L226 Difference]: Without dead ends: 489 [2018-10-15 12:57:32,992 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5208 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=9243, Invalid=19827, Unknown=0, NotChecked=0, Total=29070 [2018-10-15 12:57:32,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2018-10-15 12:57:32,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 465. [2018-10-15 12:57:32,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 465 states. [2018-10-15 12:57:32,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 466 transitions. [2018-10-15 12:57:32,996 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 466 transitions. Word has length 449 [2018-10-15 12:57:32,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:32,997 INFO L481 AbstractCegarLoop]: Abstraction has 465 states and 466 transitions. [2018-10-15 12:57:32,997 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-15 12:57:32,997 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 466 transitions. [2018-10-15 12:57:32,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2018-10-15 12:57:32,999 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:33,000 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:33,000 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:33,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:33,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1064412426, now seen corresponding path program 43 times [2018-10-15 12:57:33,001 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:33,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:35,708 INFO L134 CoverageAnalysis]: Checked inductivity of 9073 backedges. 0 proven. 9073 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:35,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:35,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-10-15 12:57:35,709 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-15 12:57:35,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-15 12:57:35,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2024, Invalid=5808, Unknown=0, NotChecked=0, Total=7832 [2018-10-15 12:57:35,710 INFO L87 Difference]: Start difference. First operand 465 states and 466 transitions. Second operand 89 states. [2018-10-15 12:57:40,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:40,369 INFO L93 Difference]: Finished difference Result 499 states and 500 transitions. [2018-10-15 12:57:40,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-10-15 12:57:40,369 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 459 [2018-10-15 12:57:40,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:40,371 INFO L225 Difference]: With dead ends: 499 [2018-10-15 12:57:40,371 INFO L226 Difference]: Without dead ends: 499 [2018-10-15 12:57:40,372 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5461 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=9678, Invalid=20772, Unknown=0, NotChecked=0, Total=30450 [2018-10-15 12:57:40,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2018-10-15 12:57:40,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 475. [2018-10-15 12:57:40,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 475 states. [2018-10-15 12:57:40,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 476 transitions. [2018-10-15 12:57:40,376 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 476 transitions. Word has length 459 [2018-10-15 12:57:40,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:40,377 INFO L481 AbstractCegarLoop]: Abstraction has 475 states and 476 transitions. [2018-10-15 12:57:40,377 INFO L482 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-15 12:57:40,377 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 476 transitions. [2018-10-15 12:57:40,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2018-10-15 12:57:40,378 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:40,379 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:40,379 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:40,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:40,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1771223490, now seen corresponding path program 44 times [2018-10-15 12:57:40,380 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:40,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:42,970 INFO L134 CoverageAnalysis]: Checked inductivity of 9504 backedges. 0 proven. 9504 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:42,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:42,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-10-15 12:57:42,971 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-15 12:57:42,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-15 12:57:42,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2115, Invalid=6075, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 12:57:42,972 INFO L87 Difference]: Start difference. First operand 475 states and 476 transitions. Second operand 91 states. [2018-10-15 12:57:47,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:47,642 INFO L93 Difference]: Finished difference Result 509 states and 510 transitions. [2018-10-15 12:57:47,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-10-15 12:57:47,643 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 469 [2018-10-15 12:57:47,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:47,645 INFO L225 Difference]: With dead ends: 509 [2018-10-15 12:57:47,645 INFO L226 Difference]: Without dead ends: 509 [2018-10-15 12:57:47,645 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5720 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=10123, Invalid=21739, Unknown=0, NotChecked=0, Total=31862 [2018-10-15 12:57:47,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2018-10-15 12:57:47,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 485. [2018-10-15 12:57:47,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2018-10-15 12:57:47,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 486 transitions. [2018-10-15 12:57:47,650 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 486 transitions. Word has length 469 [2018-10-15 12:57:47,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:47,650 INFO L481 AbstractCegarLoop]: Abstraction has 485 states and 486 transitions. [2018-10-15 12:57:47,650 INFO L482 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-15 12:57:47,650 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 486 transitions. [2018-10-15 12:57:47,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2018-10-15 12:57:47,653 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:47,653 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:47,653 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:47,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:47,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1031276942, now seen corresponding path program 45 times [2018-10-15 12:57:47,654 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:47,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:50,618 INFO L134 CoverageAnalysis]: Checked inductivity of 9945 backedges. 0 proven. 9945 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:50,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:50,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-15 12:57:50,619 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-15 12:57:50,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-15 12:57:50,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2208, Invalid=6348, Unknown=0, NotChecked=0, Total=8556 [2018-10-15 12:57:50,620 INFO L87 Difference]: Start difference. First operand 485 states and 486 transitions. Second operand 93 states. [2018-10-15 12:57:55,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:55,444 INFO L93 Difference]: Finished difference Result 519 states and 520 transitions. [2018-10-15 12:57:55,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-10-15 12:57:55,444 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 479 [2018-10-15 12:57:55,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:55,446 INFO L225 Difference]: With dead ends: 519 [2018-10-15 12:57:55,446 INFO L226 Difference]: Without dead ends: 519 [2018-10-15 12:57:55,447 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5985 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=10578, Invalid=22728, Unknown=0, NotChecked=0, Total=33306 [2018-10-15 12:57:55,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2018-10-15 12:57:55,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 495. [2018-10-15 12:57:55,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2018-10-15 12:57:55,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 496 transitions. [2018-10-15 12:57:55,451 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 496 transitions. Word has length 479 [2018-10-15 12:57:55,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:55,451 INFO L481 AbstractCegarLoop]: Abstraction has 495 states and 496 transitions. [2018-10-15 12:57:55,451 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-15 12:57:55,451 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 496 transitions. [2018-10-15 12:57:55,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 490 [2018-10-15 12:57:55,453 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:55,454 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:55,454 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:55,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:55,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1887767130, now seen corresponding path program 46 times [2018-10-15 12:57:55,454 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:55,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:58,470 INFO L134 CoverageAnalysis]: Checked inductivity of 10396 backedges. 0 proven. 10396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:58,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:58,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-10-15 12:57:58,471 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-15 12:57:58,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-15 12:57:58,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2303, Invalid=6627, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 12:57:58,472 INFO L87 Difference]: Start difference. First operand 495 states and 496 transitions. Second operand 95 states. [2018-10-15 12:58:04,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:04,000 INFO L93 Difference]: Finished difference Result 529 states and 530 transitions. [2018-10-15 12:58:04,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-10-15 12:58:04,000 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 489 [2018-10-15 12:58:04,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:04,004 INFO L225 Difference]: With dead ends: 529 [2018-10-15 12:58:04,004 INFO L226 Difference]: Without dead ends: 529 [2018-10-15 12:58:04,005 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6256 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=11043, Invalid=23739, Unknown=0, NotChecked=0, Total=34782 [2018-10-15 12:58:04,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 529 states. [2018-10-15 12:58:04,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 529 to 505. [2018-10-15 12:58:04,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2018-10-15 12:58:04,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 506 transitions. [2018-10-15 12:58:04,009 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 506 transitions. Word has length 489 [2018-10-15 12:58:04,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:04,009 INFO L481 AbstractCegarLoop]: Abstraction has 505 states and 506 transitions. [2018-10-15 12:58:04,009 INFO L482 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-15 12:58:04,009 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 506 transitions. [2018-10-15 12:58:04,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2018-10-15 12:58:04,011 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:04,011 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:58:04,012 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:04,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:04,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1651475418, now seen corresponding path program 47 times [2018-10-15 12:58:04,012 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:04,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:07,215 INFO L134 CoverageAnalysis]: Checked inductivity of 10857 backedges. 0 proven. 10857 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:58:07,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:07,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-10-15 12:58:07,216 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-10-15 12:58:07,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-10-15 12:58:07,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2400, Invalid=6912, Unknown=0, NotChecked=0, Total=9312 [2018-10-15 12:58:07,217 INFO L87 Difference]: Start difference. First operand 505 states and 506 transitions. Second operand 97 states. [2018-10-15 12:58:12,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:12,510 INFO L93 Difference]: Finished difference Result 539 states and 540 transitions. [2018-10-15 12:58:12,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-10-15 12:58:12,510 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 499 [2018-10-15 12:58:12,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:12,512 INFO L225 Difference]: With dead ends: 539 [2018-10-15 12:58:12,512 INFO L226 Difference]: Without dead ends: 539 [2018-10-15 12:58:12,514 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6533 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=11518, Invalid=24772, Unknown=0, NotChecked=0, Total=36290 [2018-10-15 12:58:12,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2018-10-15 12:58:12,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 515. [2018-10-15 12:58:12,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2018-10-15 12:58:12,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 516 transitions. [2018-10-15 12:58:12,519 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 516 transitions. Word has length 499 [2018-10-15 12:58:12,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:12,519 INFO L481 AbstractCegarLoop]: Abstraction has 515 states and 516 transitions. [2018-10-15 12:58:12,519 INFO L482 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-10-15 12:58:12,519 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 516 transitions. [2018-10-15 12:58:12,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2018-10-15 12:58:12,521 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:12,521 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:58:12,521 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:12,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:12,522 INFO L82 PathProgramCache]: Analyzing trace with hash 771678478, now seen corresponding path program 48 times [2018-10-15 12:58:12,522 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:12,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:15,575 INFO L134 CoverageAnalysis]: Checked inductivity of 11328 backedges. 0 proven. 11328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:58:15,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:15,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-10-15 12:58:15,575 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-10-15 12:58:15,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-10-15 12:58:15,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2499, Invalid=7203, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 12:58:15,576 INFO L87 Difference]: Start difference. First operand 515 states and 516 transitions. Second operand 99 states. [2018-10-15 12:58:20,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:20,912 INFO L93 Difference]: Finished difference Result 549 states and 550 transitions. [2018-10-15 12:58:20,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-10-15 12:58:20,912 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 509 [2018-10-15 12:58:20,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:20,914 INFO L225 Difference]: With dead ends: 549 [2018-10-15 12:58:20,914 INFO L226 Difference]: Without dead ends: 549 [2018-10-15 12:58:20,916 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6816 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=12003, Invalid=25827, Unknown=0, NotChecked=0, Total=37830 [2018-10-15 12:58:20,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2018-10-15 12:58:20,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 525. [2018-10-15 12:58:20,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 525 states. [2018-10-15 12:58:20,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 526 transitions. [2018-10-15 12:58:20,920 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 526 transitions. Word has length 509 [2018-10-15 12:58:20,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:20,921 INFO L481 AbstractCegarLoop]: Abstraction has 525 states and 526 transitions. [2018-10-15 12:58:20,921 INFO L482 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-10-15 12:58:20,921 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 526 transitions. [2018-10-15 12:58:20,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2018-10-15 12:58:20,923 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:20,924 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:58:20,924 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:20,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:20,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1714572610, now seen corresponding path program 49 times [2018-10-15 12:58:20,925 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:20,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:23,976 INFO L134 CoverageAnalysis]: Checked inductivity of 11809 backedges. 0 proven. 11809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:58:23,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:23,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-10-15 12:58:23,977 INFO L460 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-10-15 12:58:23,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-10-15 12:58:23,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2600, Invalid=7500, Unknown=0, NotChecked=0, Total=10100 [2018-10-15 12:58:23,978 INFO L87 Difference]: Start difference. First operand 525 states and 526 transitions. Second operand 101 states. [2018-10-15 12:58:29,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:29,856 INFO L93 Difference]: Finished difference Result 559 states and 560 transitions. [2018-10-15 12:58:29,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-10-15 12:58:29,857 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 519 [2018-10-15 12:58:29,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:29,859 INFO L225 Difference]: With dead ends: 559 [2018-10-15 12:58:29,859 INFO L226 Difference]: Without dead ends: 559 [2018-10-15 12:58:29,860 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7105 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=12498, Invalid=26904, Unknown=0, NotChecked=0, Total=39402 [2018-10-15 12:58:29,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2018-10-15 12:58:29,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 535. [2018-10-15 12:58:29,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2018-10-15 12:58:29,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 536 transitions. [2018-10-15 12:58:29,865 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 536 transitions. Word has length 519 [2018-10-15 12:58:29,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:29,866 INFO L481 AbstractCegarLoop]: Abstraction has 535 states and 536 transitions. [2018-10-15 12:58:29,866 INFO L482 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-10-15 12:58:29,866 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 536 transitions. [2018-10-15 12:58:29,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2018-10-15 12:58:29,869 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:29,869 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:58:29,869 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:29,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:29,870 INFO L82 PathProgramCache]: Analyzing trace with hash -192739210, now seen corresponding path program 50 times [2018-10-15 12:58:29,870 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:29,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:33,539 INFO L134 CoverageAnalysis]: Checked inductivity of 12300 backedges. 0 proven. 12300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:58:33,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:33,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-10-15 12:58:33,540 INFO L460 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-10-15 12:58:33,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-10-15 12:58:33,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2703, Invalid=7803, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 12:58:33,541 INFO L87 Difference]: Start difference. First operand 535 states and 536 transitions. Second operand 103 states. [2018-10-15 12:58:39,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:39,478 INFO L93 Difference]: Finished difference Result 569 states and 570 transitions. [2018-10-15 12:58:39,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2018-10-15 12:58:39,478 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 529 [2018-10-15 12:58:39,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:39,481 INFO L225 Difference]: With dead ends: 569 [2018-10-15 12:58:39,481 INFO L226 Difference]: Without dead ends: 569 [2018-10-15 12:58:39,482 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7400 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=13003, Invalid=28003, Unknown=0, NotChecked=0, Total=41006 [2018-10-15 12:58:39,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2018-10-15 12:58:39,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 545. [2018-10-15 12:58:39,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2018-10-15 12:58:39,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 546 transitions. [2018-10-15 12:58:39,485 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 546 transitions. Word has length 529 [2018-10-15 12:58:39,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:39,486 INFO L481 AbstractCegarLoop]: Abstraction has 545 states and 546 transitions. [2018-10-15 12:58:39,486 INFO L482 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-10-15 12:58:39,486 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 546 transitions. [2018-10-15 12:58:39,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 540 [2018-10-15 12:58:39,489 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:39,489 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:58:39,489 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:39,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:39,489 INFO L82 PathProgramCache]: Analyzing trace with hash 735728298, now seen corresponding path program 51 times [2018-10-15 12:58:39,490 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:39,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:43,101 INFO L134 CoverageAnalysis]: Checked inductivity of 12801 backedges. 0 proven. 12801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:58:43,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:43,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-10-15 12:58:43,102 INFO L460 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-10-15 12:58:43,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-10-15 12:58:43,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2808, Invalid=8112, Unknown=0, NotChecked=0, Total=10920 [2018-10-15 12:58:43,103 INFO L87 Difference]: Start difference. First operand 545 states and 546 transitions. Second operand 105 states. [2018-10-15 12:58:49,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:49,493 INFO L93 Difference]: Finished difference Result 579 states and 580 transitions. [2018-10-15 12:58:49,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2018-10-15 12:58:49,493 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 539 [2018-10-15 12:58:49,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:49,496 INFO L225 Difference]: With dead ends: 579 [2018-10-15 12:58:49,497 INFO L226 Difference]: Without dead ends: 579 [2018-10-15 12:58:49,498 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7701 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=13518, Invalid=29124, Unknown=0, NotChecked=0, Total=42642 [2018-10-15 12:58:49,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2018-10-15 12:58:49,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 555. [2018-10-15 12:58:49,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2018-10-15 12:58:49,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 556 transitions. [2018-10-15 12:58:49,503 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 556 transitions. Word has length 539 [2018-10-15 12:58:49,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:49,503 INFO L481 AbstractCegarLoop]: Abstraction has 555 states and 556 transitions. [2018-10-15 12:58:49,503 INFO L482 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-10-15 12:58:49,503 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 556 transitions. [2018-10-15 12:58:49,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 550 [2018-10-15 12:58:49,505 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:49,505 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:58:49,506 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:49,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:49,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1131320354, now seen corresponding path program 52 times [2018-10-15 12:58:49,506 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:49,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:53,258 INFO L134 CoverageAnalysis]: Checked inductivity of 13312 backedges. 0 proven. 13312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:58:53,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:53,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-10-15 12:58:53,259 INFO L460 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-10-15 12:58:53,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-10-15 12:58:53,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2915, Invalid=8427, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 12:58:53,260 INFO L87 Difference]: Start difference. First operand 555 states and 556 transitions. Second operand 107 states. [2018-10-15 12:58:59,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:59,354 INFO L93 Difference]: Finished difference Result 589 states and 590 transitions. [2018-10-15 12:58:59,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2018-10-15 12:58:59,355 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 549 [2018-10-15 12:58:59,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:59,358 INFO L225 Difference]: With dead ends: 589 [2018-10-15 12:58:59,358 INFO L226 Difference]: Without dead ends: 589 [2018-10-15 12:58:59,360 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8008 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=14043, Invalid=30267, Unknown=0, NotChecked=0, Total=44310 [2018-10-15 12:58:59,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2018-10-15 12:58:59,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 565. [2018-10-15 12:58:59,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 565 states. [2018-10-15 12:58:59,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 566 transitions. [2018-10-15 12:58:59,364 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 566 transitions. Word has length 549 [2018-10-15 12:58:59,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:59,365 INFO L481 AbstractCegarLoop]: Abstraction has 565 states and 566 transitions. [2018-10-15 12:58:59,365 INFO L482 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-10-15 12:58:59,365 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 566 transitions. [2018-10-15 12:58:59,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 560 [2018-10-15 12:58:59,368 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:59,368 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:58:59,368 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:59,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:59,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1468951534, now seen corresponding path program 53 times [2018-10-15 12:58:59,369 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:59,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:59:03,151 INFO L134 CoverageAnalysis]: Checked inductivity of 13833 backedges. 0 proven. 13833 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:59:03,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:59:03,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-10-15 12:59:03,152 INFO L460 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-10-15 12:59:03,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-10-15 12:59:03,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3024, Invalid=8748, Unknown=0, NotChecked=0, Total=11772 [2018-10-15 12:59:03,153 INFO L87 Difference]: Start difference. First operand 565 states and 566 transitions. Second operand 109 states. [2018-10-15 12:59:09,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:59:09,789 INFO L93 Difference]: Finished difference Result 599 states and 600 transitions. [2018-10-15 12:59:09,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2018-10-15 12:59:09,789 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 559 [2018-10-15 12:59:09,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:59:09,791 INFO L225 Difference]: With dead ends: 599 [2018-10-15 12:59:09,792 INFO L226 Difference]: Without dead ends: 599 [2018-10-15 12:59:09,793 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8321 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=14578, Invalid=31432, Unknown=0, NotChecked=0, Total=46010 [2018-10-15 12:59:09,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2018-10-15 12:59:09,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 575. [2018-10-15 12:59:09,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2018-10-15 12:59:09,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 576 transitions. [2018-10-15 12:59:09,797 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 576 transitions. Word has length 559 [2018-10-15 12:59:09,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:59:09,798 INFO L481 AbstractCegarLoop]: Abstraction has 575 states and 576 transitions. [2018-10-15 12:59:09,798 INFO L482 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-10-15 12:59:09,798 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 576 transitions. [2018-10-15 12:59:09,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2018-10-15 12:59:09,800 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:59:09,800 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:59:09,800 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:59:09,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:59:09,801 INFO L82 PathProgramCache]: Analyzing trace with hash 917769030, now seen corresponding path program 54 times [2018-10-15 12:59:09,801 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:59:09,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:59:13,648 INFO L134 CoverageAnalysis]: Checked inductivity of 14364 backedges. 0 proven. 14364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:59:13,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:59:13,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-10-15 12:59:13,649 INFO L460 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-10-15 12:59:13,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-10-15 12:59:13,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3135, Invalid=9075, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 12:59:13,650 INFO L87 Difference]: Start difference. First operand 575 states and 576 transitions. Second operand 111 states. [2018-10-15 12:59:20,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:59:20,338 INFO L93 Difference]: Finished difference Result 609 states and 610 transitions. [2018-10-15 12:59:20,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2018-10-15 12:59:20,338 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 569 [2018-10-15 12:59:20,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:59:20,340 INFO L225 Difference]: With dead ends: 609 [2018-10-15 12:59:20,340 INFO L226 Difference]: Without dead ends: 609 [2018-10-15 12:59:20,342 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8640 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=15123, Invalid=32619, Unknown=0, NotChecked=0, Total=47742 [2018-10-15 12:59:20,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2018-10-15 12:59:20,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 585. [2018-10-15 12:59:20,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2018-10-15 12:59:20,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 586 transitions. [2018-10-15 12:59:20,346 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 586 transitions. Word has length 569 [2018-10-15 12:59:20,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:59:20,347 INFO L481 AbstractCegarLoop]: Abstraction has 585 states and 586 transitions. [2018-10-15 12:59:20,347 INFO L482 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-10-15 12:59:20,347 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 586 transitions. [2018-10-15 12:59:20,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 580 [2018-10-15 12:59:20,349 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:59:20,349 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:59:20,350 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:59:20,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:59:20,350 INFO L82 PathProgramCache]: Analyzing trace with hash -402517638, now seen corresponding path program 55 times [2018-10-15 12:59:20,350 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:59:20,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:59:24,459 INFO L134 CoverageAnalysis]: Checked inductivity of 14905 backedges. 0 proven. 14905 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:59:24,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:59:24,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-10-15 12:59:24,460 INFO L460 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-10-15 12:59:24,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-10-15 12:59:24,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3248, Invalid=9408, Unknown=0, NotChecked=0, Total=12656 [2018-10-15 12:59:24,460 INFO L87 Difference]: Start difference. First operand 585 states and 586 transitions. Second operand 113 states. [2018-10-15 12:59:31,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:59:31,536 INFO L93 Difference]: Finished difference Result 619 states and 620 transitions. [2018-10-15 12:59:31,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2018-10-15 12:59:31,536 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 579 [2018-10-15 12:59:31,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:59:31,538 INFO L225 Difference]: With dead ends: 619 [2018-10-15 12:59:31,538 INFO L226 Difference]: Without dead ends: 619 [2018-10-15 12:59:31,540 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8965 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=15678, Invalid=33828, Unknown=0, NotChecked=0, Total=49506 [2018-10-15 12:59:31,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2018-10-15 12:59:31,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 595. [2018-10-15 12:59:31,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2018-10-15 12:59:31,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 596 transitions. [2018-10-15 12:59:31,544 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 596 transitions. Word has length 579 [2018-10-15 12:59:31,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:59:31,544 INFO L481 AbstractCegarLoop]: Abstraction has 595 states and 596 transitions. [2018-10-15 12:59:31,544 INFO L482 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-10-15 12:59:31,544 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 596 transitions. [2018-10-15 12:59:31,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 590 [2018-10-15 12:59:31,547 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:59:31,547 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:59:31,547 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:59:31,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:59:31,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1786046126, now seen corresponding path program 56 times [2018-10-15 12:59:31,548 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:59:31,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:59:35,794 INFO L134 CoverageAnalysis]: Checked inductivity of 15456 backedges. 0 proven. 15456 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:59:35,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:59:35,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-10-15 12:59:35,795 INFO L460 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-10-15 12:59:35,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-10-15 12:59:35,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3363, Invalid=9747, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 12:59:35,796 INFO L87 Difference]: Start difference. First operand 595 states and 596 transitions. Second operand 115 states. [2018-10-15 12:59:42,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:59:42,989 INFO L93 Difference]: Finished difference Result 629 states and 630 transitions. [2018-10-15 12:59:42,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2018-10-15 12:59:42,989 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 589 [2018-10-15 12:59:42,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:59:42,992 INFO L225 Difference]: With dead ends: 629 [2018-10-15 12:59:42,992 INFO L226 Difference]: Without dead ends: 629 [2018-10-15 12:59:42,994 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9296 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=16243, Invalid=35059, Unknown=0, NotChecked=0, Total=51302 [2018-10-15 12:59:42,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2018-10-15 12:59:42,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 605. [2018-10-15 12:59:42,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2018-10-15 12:59:42,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 606 transitions. [2018-10-15 12:59:42,998 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 606 transitions. Word has length 589 [2018-10-15 12:59:42,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:59:42,999 INFO L481 AbstractCegarLoop]: Abstraction has 605 states and 606 transitions. [2018-10-15 12:59:42,999 INFO L482 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-10-15 12:59:42,999 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 606 transitions. [2018-10-15 12:59:43,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2018-10-15 12:59:43,001 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:59:43,001 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 57, 57, 57, 57, 57, 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] [2018-10-15 12:59:43,001 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:59:43,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:59:43,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1919563038, now seen corresponding path program 57 times [2018-10-15 12:59:43,002 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:59:43,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:59:47,108 INFO L134 CoverageAnalysis]: Checked inductivity of 16017 backedges. 0 proven. 16017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:59:47,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:59:47,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-10-15 12:59:47,109 INFO L460 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-10-15 12:59:47,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-10-15 12:59:47,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3480, Invalid=10092, Unknown=0, NotChecked=0, Total=13572 [2018-10-15 12:59:47,110 INFO L87 Difference]: Start difference. First operand 605 states and 606 transitions. Second operand 117 states. [2018-10-15 12:59:54,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:59:54,912 INFO L93 Difference]: Finished difference Result 639 states and 640 transitions. [2018-10-15 12:59:54,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2018-10-15 12:59:54,912 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 599 [2018-10-15 12:59:54,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:59:54,914 INFO L225 Difference]: With dead ends: 639 [2018-10-15 12:59:54,914 INFO L226 Difference]: Without dead ends: 639 [2018-10-15 12:59:54,916 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9633 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=16818, Invalid=36312, Unknown=0, NotChecked=0, Total=53130 [2018-10-15 12:59:54,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2018-10-15 12:59:54,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 615. [2018-10-15 12:59:54,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 615 states. [2018-10-15 12:59:54,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 616 transitions. [2018-10-15 12:59:54,920 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 616 transitions. Word has length 599 [2018-10-15 12:59:54,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:59:54,920 INFO L481 AbstractCegarLoop]: Abstraction has 615 states and 616 transitions. [2018-10-15 12:59:54,920 INFO L482 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-10-15 12:59:54,921 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 616 transitions. [2018-10-15 12:59:54,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 610 [2018-10-15 12:59:54,923 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:59:54,923 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 58, 58, 58, 58, 58, 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] [2018-10-15 12:59:54,924 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:59:54,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:59:54,924 INFO L82 PathProgramCache]: Analyzing trace with hash 912129558, now seen corresponding path program 58 times [2018-10-15 12:59:54,924 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:59:54,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:59:59,626 INFO L134 CoverageAnalysis]: Checked inductivity of 16588 backedges. 0 proven. 16588 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:59:59,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:59:59,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-10-15 12:59:59,627 INFO L460 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-10-15 12:59:59,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-10-15 12:59:59,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3599, Invalid=10443, Unknown=0, NotChecked=0, Total=14042 [2018-10-15 12:59:59,628 INFO L87 Difference]: Start difference. First operand 615 states and 616 transitions. Second operand 119 states. [2018-10-15 13:00:06,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:00:06,841 INFO L93 Difference]: Finished difference Result 649 states and 650 transitions. [2018-10-15 13:00:06,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2018-10-15 13:00:06,841 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 609 [2018-10-15 13:00:06,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:00:06,845 INFO L225 Difference]: With dead ends: 649 [2018-10-15 13:00:06,845 INFO L226 Difference]: Without dead ends: 649 [2018-10-15 13:00:06,847 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9976 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=17403, Invalid=37587, Unknown=0, NotChecked=0, Total=54990 [2018-10-15 13:00:06,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2018-10-15 13:00:06,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 625. [2018-10-15 13:00:06,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 625 states. [2018-10-15 13:00:06,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 626 transitions. [2018-10-15 13:00:06,852 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 626 transitions. Word has length 609 [2018-10-15 13:00:06,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:00:06,852 INFO L481 AbstractCegarLoop]: Abstraction has 625 states and 626 transitions. [2018-10-15 13:00:06,852 INFO L482 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-10-15 13:00:06,852 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 626 transitions. [2018-10-15 13:00:06,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 620 [2018-10-15 13:00:06,856 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:00:06,856 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 59, 59, 59, 59, 59, 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] [2018-10-15 13:00:06,856 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:00:06,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:00:06,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1396097098, now seen corresponding path program 59 times [2018-10-15 13:00:06,857 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:00:06,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:00:11,480 INFO L134 CoverageAnalysis]: Checked inductivity of 17169 backedges. 0 proven. 17169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:00:11,481 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:00:11,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-10-15 13:00:11,481 INFO L460 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-10-15 13:00:11,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-10-15 13:00:11,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3720, Invalid=10800, Unknown=0, NotChecked=0, Total=14520 [2018-10-15 13:00:11,483 INFO L87 Difference]: Start difference. First operand 625 states and 626 transitions. Second operand 121 states. [2018-10-15 13:00:19,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:00:19,617 INFO L93 Difference]: Finished difference Result 659 states and 660 transitions. [2018-10-15 13:00:19,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2018-10-15 13:00:19,617 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 619 [2018-10-15 13:00:19,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:00:19,620 INFO L225 Difference]: With dead ends: 659 [2018-10-15 13:00:19,620 INFO L226 Difference]: Without dead ends: 659 [2018-10-15 13:00:19,622 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10325 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=17998, Invalid=38884, Unknown=0, NotChecked=0, Total=56882 [2018-10-15 13:00:19,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2018-10-15 13:00:19,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 635. [2018-10-15 13:00:19,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2018-10-15 13:00:19,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 636 transitions. [2018-10-15 13:00:19,627 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 636 transitions. Word has length 619 [2018-10-15 13:00:19,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:00:19,627 INFO L481 AbstractCegarLoop]: Abstraction has 635 states and 636 transitions. [2018-10-15 13:00:19,627 INFO L482 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-10-15 13:00:19,627 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 636 transitions. [2018-10-15 13:00:19,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 630 [2018-10-15 13:00:19,630 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:00:19,630 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 60, 60, 60, 60, 60, 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] [2018-10-15 13:00:19,630 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:00:19,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:00:19,631 INFO L82 PathProgramCache]: Analyzing trace with hash -805744258, now seen corresponding path program 60 times [2018-10-15 13:00:19,631 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:00:19,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:00:24,405 INFO L134 CoverageAnalysis]: Checked inductivity of 17760 backedges. 0 proven. 17760 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:00:24,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:00:24,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-10-15 13:00:24,406 INFO L460 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-10-15 13:00:24,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-10-15 13:00:24,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3843, Invalid=11163, Unknown=0, NotChecked=0, Total=15006 [2018-10-15 13:00:24,407 INFO L87 Difference]: Start difference. First operand 635 states and 636 transitions. Second operand 123 states. [2018-10-15 13:00:32,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:00:32,698 INFO L93 Difference]: Finished difference Result 669 states and 670 transitions. [2018-10-15 13:00:32,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2018-10-15 13:00:32,698 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 629 [2018-10-15 13:00:32,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:00:32,701 INFO L225 Difference]: With dead ends: 669 [2018-10-15 13:00:32,701 INFO L226 Difference]: Without dead ends: 669 [2018-10-15 13:00:32,703 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10680 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=18603, Invalid=40203, Unknown=0, NotChecked=0, Total=58806 [2018-10-15 13:00:32,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2018-10-15 13:00:32,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 645. [2018-10-15 13:00:32,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 645 states. [2018-10-15 13:00:32,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 646 transitions. [2018-10-15 13:00:32,707 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 646 transitions. Word has length 629 [2018-10-15 13:00:32,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:00:32,707 INFO L481 AbstractCegarLoop]: Abstraction has 645 states and 646 transitions. [2018-10-15 13:00:32,708 INFO L482 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-10-15 13:00:32,708 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 646 transitions. [2018-10-15 13:00:32,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 640 [2018-10-15 13:00:32,710 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:00:32,711 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 61, 61, 61, 61, 61, 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] [2018-10-15 13:00:32,711 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:00:32,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:00:32,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1980829262, now seen corresponding path program 61 times [2018-10-15 13:00:32,712 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:00:32,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:00:37,623 INFO L134 CoverageAnalysis]: Checked inductivity of 18361 backedges. 0 proven. 18361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:00:37,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:00:37,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-10-15 13:00:37,624 INFO L460 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-10-15 13:00:37,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-10-15 13:00:37,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3968, Invalid=11532, Unknown=0, NotChecked=0, Total=15500 [2018-10-15 13:00:37,625 INFO L87 Difference]: Start difference. First operand 645 states and 646 transitions. Second operand 125 states. [2018-10-15 13:00:46,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:00:46,305 INFO L93 Difference]: Finished difference Result 679 states and 680 transitions. [2018-10-15 13:00:46,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 186 states. [2018-10-15 13:00:46,305 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 639 [2018-10-15 13:00:46,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:00:46,309 INFO L225 Difference]: With dead ends: 679 [2018-10-15 13:00:46,309 INFO L226 Difference]: Without dead ends: 679 [2018-10-15 13:00:46,310 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11041 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=19218, Invalid=41544, Unknown=0, NotChecked=0, Total=60762 [2018-10-15 13:00:46,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2018-10-15 13:00:46,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 655. [2018-10-15 13:00:46,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2018-10-15 13:00:46,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 656 transitions. [2018-10-15 13:00:46,315 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 656 transitions. Word has length 639 [2018-10-15 13:00:46,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:00:46,315 INFO L481 AbstractCegarLoop]: Abstraction has 655 states and 656 transitions. [2018-10-15 13:00:46,315 INFO L482 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-10-15 13:00:46,315 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 656 transitions. [2018-10-15 13:00:46,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 650 [2018-10-15 13:00:46,318 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:00:46,319 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 62, 62, 62, 62, 62, 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] [2018-10-15 13:00:46,319 INFO L424 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:00:46,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:00:46,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1137762534, now seen corresponding path program 62 times [2018-10-15 13:00:46,320 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:00:46,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:00:51,398 INFO L134 CoverageAnalysis]: Checked inductivity of 18972 backedges. 0 proven. 18972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:00:51,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:00:51,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-10-15 13:00:51,399 INFO L460 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-10-15 13:00:51,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-10-15 13:00:51,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=11907, Unknown=0, NotChecked=0, Total=16002 [2018-10-15 13:00:51,401 INFO L87 Difference]: Start difference. First operand 655 states and 656 transitions. Second operand 127 states. [2018-10-15 13:00:59,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:00:59,741 INFO L93 Difference]: Finished difference Result 689 states and 690 transitions. [2018-10-15 13:00:59,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 189 states. [2018-10-15 13:00:59,741 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 649 [2018-10-15 13:00:59,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:00:59,743 INFO L225 Difference]: With dead ends: 689 [2018-10-15 13:00:59,743 INFO L226 Difference]: Without dead ends: 689 [2018-10-15 13:00:59,745 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11408 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=19843, Invalid=42907, Unknown=0, NotChecked=0, Total=62750 [2018-10-15 13:00:59,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2018-10-15 13:00:59,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 665. [2018-10-15 13:00:59,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 665 states. [2018-10-15 13:00:59,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 666 transitions. [2018-10-15 13:00:59,750 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 666 transitions. Word has length 649 [2018-10-15 13:00:59,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:00:59,750 INFO L481 AbstractCegarLoop]: Abstraction has 665 states and 666 transitions. [2018-10-15 13:00:59,750 INFO L482 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-10-15 13:00:59,750 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 666 transitions. [2018-10-15 13:00:59,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 660 [2018-10-15 13:00:59,753 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:00:59,754 INFO L375 BasicCegarLoop]: trace histogram [63, 63, 63, 63, 63, 63, 63, 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] [2018-10-15 13:00:59,754 INFO L424 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:00:59,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:00:59,754 INFO L82 PathProgramCache]: Analyzing trace with hash -1714921702, now seen corresponding path program 63 times [2018-10-15 13:00:59,755 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:00:59,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:01:04,698 INFO L134 CoverageAnalysis]: Checked inductivity of 19593 backedges. 0 proven. 19593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:01:04,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:01:04,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-10-15 13:01:04,699 INFO L460 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-10-15 13:01:04,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-10-15 13:01:04,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4224, Invalid=12288, Unknown=0, NotChecked=0, Total=16512 [2018-10-15 13:01:04,700 INFO L87 Difference]: Start difference. First operand 665 states and 666 transitions. Second operand 129 states. [2018-10-15 13:01:13,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:01:13,905 INFO L93 Difference]: Finished difference Result 699 states and 700 transitions. [2018-10-15 13:01:13,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2018-10-15 13:01:13,906 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 659 [2018-10-15 13:01:13,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:01:13,908 INFO L225 Difference]: With dead ends: 699 [2018-10-15 13:01:13,908 INFO L226 Difference]: Without dead ends: 699 [2018-10-15 13:01:13,910 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11781 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=20478, Invalid=44292, Unknown=0, NotChecked=0, Total=64770 [2018-10-15 13:01:13,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2018-10-15 13:01:13,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 675. [2018-10-15 13:01:13,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 675 states. [2018-10-15 13:01:13,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 676 transitions. [2018-10-15 13:01:13,915 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 676 transitions. Word has length 659 [2018-10-15 13:01:13,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:01:13,916 INFO L481 AbstractCegarLoop]: Abstraction has 675 states and 676 transitions. [2018-10-15 13:01:13,916 INFO L482 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-10-15 13:01:13,916 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 676 transitions. [2018-10-15 13:01:13,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 670 [2018-10-15 13:01:13,919 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:01:13,919 INFO L375 BasicCegarLoop]: trace histogram [64, 64, 64, 64, 64, 64, 64, 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] [2018-10-15 13:01:13,919 INFO L424 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:01:13,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:01:13,920 INFO L82 PathProgramCache]: Analyzing trace with hash -177296306, now seen corresponding path program 64 times [2018-10-15 13:01:13,920 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:01:13,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:01:19,190 INFO L134 CoverageAnalysis]: Checked inductivity of 20224 backedges. 0 proven. 20224 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:01:19,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:01:19,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-10-15 13:01:19,191 INFO L460 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-10-15 13:01:19,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-10-15 13:01:19,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4355, Invalid=12675, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 13:01:19,192 INFO L87 Difference]: Start difference. First operand 675 states and 676 transitions. Second operand 131 states. [2018-10-15 13:01:28,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:01:28,651 INFO L93 Difference]: Finished difference Result 709 states and 710 transitions. [2018-10-15 13:01:28,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2018-10-15 13:01:28,651 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 669 [2018-10-15 13:01:28,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:01:28,654 INFO L225 Difference]: With dead ends: 709 [2018-10-15 13:01:28,654 INFO L226 Difference]: Without dead ends: 709 [2018-10-15 13:01:28,655 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 257 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12160 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=21123, Invalid=45699, Unknown=0, NotChecked=0, Total=66822 [2018-10-15 13:01:28,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2018-10-15 13:01:28,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 685. [2018-10-15 13:01:28,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 685 states. [2018-10-15 13:01:28,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 686 transitions. [2018-10-15 13:01:28,659 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 686 transitions. Word has length 669 [2018-10-15 13:01:28,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:01:28,660 INFO L481 AbstractCegarLoop]: Abstraction has 685 states and 686 transitions. [2018-10-15 13:01:28,660 INFO L482 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-10-15 13:01:28,660 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 686 transitions. [2018-10-15 13:01:28,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 680 [2018-10-15 13:01:28,663 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:01:28,664 INFO L375 BasicCegarLoop]: trace histogram [65, 65, 65, 65, 65, 65, 65, 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] [2018-10-15 13:01:28,664 INFO L424 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:01:28,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:01:28,664 INFO L82 PathProgramCache]: Analyzing trace with hash -2117269374, now seen corresponding path program 65 times [2018-10-15 13:01:28,665 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:01:28,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:01:34,177 INFO L134 CoverageAnalysis]: Checked inductivity of 20865 backedges. 0 proven. 20865 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:01:34,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:01:34,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-10-15 13:01:34,178 INFO L460 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-10-15 13:01:34,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-10-15 13:01:34,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4488, Invalid=13068, Unknown=0, NotChecked=0, Total=17556 [2018-10-15 13:01:34,179 INFO L87 Difference]: Start difference. First operand 685 states and 686 transitions. Second operand 133 states. [2018-10-15 13:01:43,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:01:43,892 INFO L93 Difference]: Finished difference Result 719 states and 720 transitions. [2018-10-15 13:01:43,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 198 states. [2018-10-15 13:01:43,892 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 679 [2018-10-15 13:01:43,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:01:43,894 INFO L225 Difference]: With dead ends: 719 [2018-10-15 13:01:43,894 INFO L226 Difference]: Without dead ends: 719 [2018-10-15 13:01:43,896 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12545 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=21778, Invalid=47128, Unknown=0, NotChecked=0, Total=68906 [2018-10-15 13:01:43,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2018-10-15 13:01:43,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 695. [2018-10-15 13:01:43,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 695 states. [2018-10-15 13:01:43,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 696 transitions. [2018-10-15 13:01:43,900 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 696 transitions. Word has length 679 [2018-10-15 13:01:43,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:01:43,901 INFO L481 AbstractCegarLoop]: Abstraction has 695 states and 696 transitions. [2018-10-15 13:01:43,901 INFO L482 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-10-15 13:01:43,901 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 696 transitions. [2018-10-15 13:01:43,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 690 [2018-10-15 13:01:43,904 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:01:43,904 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 66, 66, 66, 66, 66, 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] [2018-10-15 13:01:43,904 INFO L424 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:01:43,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:01:43,905 INFO L82 PathProgramCache]: Analyzing trace with hash 526169014, now seen corresponding path program 66 times [2018-10-15 13:01:43,905 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:01:43,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:01:49,746 INFO L134 CoverageAnalysis]: Checked inductivity of 21516 backedges. 0 proven. 21516 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:01:49,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:01:49,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-10-15 13:01:49,747 INFO L460 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-10-15 13:01:49,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-10-15 13:01:49,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4623, Invalid=13467, Unknown=0, NotChecked=0, Total=18090 [2018-10-15 13:01:49,748 INFO L87 Difference]: Start difference. First operand 695 states and 696 transitions. Second operand 135 states. [2018-10-15 13:01:59,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:01:59,625 INFO L93 Difference]: Finished difference Result 729 states and 730 transitions. [2018-10-15 13:01:59,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2018-10-15 13:01:59,625 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 689 [2018-10-15 13:01:59,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:01:59,627 INFO L225 Difference]: With dead ends: 729 [2018-10-15 13:01:59,627 INFO L226 Difference]: Without dead ends: 729 [2018-10-15 13:01:59,629 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12936 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=22443, Invalid=48579, Unknown=0, NotChecked=0, Total=71022 [2018-10-15 13:01:59,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2018-10-15 13:01:59,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 705. [2018-10-15 13:01:59,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 705 states. [2018-10-15 13:01:59,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 705 states to 705 states and 706 transitions. [2018-10-15 13:01:59,633 INFO L78 Accepts]: Start accepts. Automaton has 705 states and 706 transitions. Word has length 689 [2018-10-15 13:01:59,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:01:59,634 INFO L481 AbstractCegarLoop]: Abstraction has 705 states and 706 transitions. [2018-10-15 13:01:59,634 INFO L482 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-10-15 13:01:59,634 INFO L276 IsEmpty]: Start isEmpty. Operand 705 states and 706 transitions. [2018-10-15 13:01:59,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 700 [2018-10-15 13:01:59,637 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:01:59,637 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 67, 67, 67, 67, 67, 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] [2018-10-15 13:01:59,637 INFO L424 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:01:59,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:01:59,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1476849130, now seen corresponding path program 67 times [2018-10-15 13:01:59,638 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:01:59,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:02:05,399 INFO L134 CoverageAnalysis]: Checked inductivity of 22177 backedges. 0 proven. 22177 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:02:05,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:02:05,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2018-10-15 13:02:05,400 INFO L460 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-10-15 13:02:05,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-10-15 13:02:05,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4760, Invalid=13872, Unknown=0, NotChecked=0, Total=18632 [2018-10-15 13:02:05,401 INFO L87 Difference]: Start difference. First operand 705 states and 706 transitions. Second operand 137 states. [2018-10-15 13:02:15,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:02:15,682 INFO L93 Difference]: Finished difference Result 739 states and 740 transitions. [2018-10-15 13:02:15,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 204 states. [2018-10-15 13:02:15,682 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 699 [2018-10-15 13:02:15,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:02:15,685 INFO L225 Difference]: With dead ends: 739 [2018-10-15 13:02:15,685 INFO L226 Difference]: Without dead ends: 739 [2018-10-15 13:02:15,687 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13333 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=23118, Invalid=50052, Unknown=0, NotChecked=0, Total=73170 [2018-10-15 13:02:15,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 739 states. [2018-10-15 13:02:15,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 739 to 715. [2018-10-15 13:02:15,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2018-10-15 13:02:15,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 716 transitions. [2018-10-15 13:02:15,691 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 716 transitions. Word has length 699 [2018-10-15 13:02:15,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:02:15,692 INFO L481 AbstractCegarLoop]: Abstraction has 715 states and 716 transitions. [2018-10-15 13:02:15,692 INFO L482 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-10-15 13:02:15,692 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 716 transitions. [2018-10-15 13:02:15,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 710 [2018-10-15 13:02:15,696 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:02:15,696 INFO L375 BasicCegarLoop]: trace histogram [68, 68, 68, 68, 68, 68, 68, 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] [2018-10-15 13:02:15,696 INFO L424 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:02:15,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:02:15,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1394931486, now seen corresponding path program 68 times [2018-10-15 13:02:15,697 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:02:15,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:02:21,908 INFO L134 CoverageAnalysis]: Checked inductivity of 22848 backedges. 0 proven. 22848 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:02:21,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:02:21,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2018-10-15 13:02:21,909 INFO L460 AbstractCegarLoop]: Interpolant automaton has 139 states [2018-10-15 13:02:21,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2018-10-15 13:02:21,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4899, Invalid=14283, Unknown=0, NotChecked=0, Total=19182 [2018-10-15 13:02:21,911 INFO L87 Difference]: Start difference. First operand 715 states and 716 transitions. Second operand 139 states. [2018-10-15 13:02:31,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:02:31,804 INFO L93 Difference]: Finished difference Result 749 states and 750 transitions. [2018-10-15 13:02:31,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 207 states. [2018-10-15 13:02:31,804 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 709 [2018-10-15 13:02:31,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:02:31,808 INFO L225 Difference]: With dead ends: 749 [2018-10-15 13:02:31,808 INFO L226 Difference]: Without dead ends: 749 [2018-10-15 13:02:31,811 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13736 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=23803, Invalid=51547, Unknown=0, NotChecked=0, Total=75350 [2018-10-15 13:02:31,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2018-10-15 13:02:31,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 725. [2018-10-15 13:02:31,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 725 states. [2018-10-15 13:02:31,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 726 transitions. [2018-10-15 13:02:31,816 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 726 transitions. Word has length 709 [2018-10-15 13:02:31,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:02:31,816 INFO L481 AbstractCegarLoop]: Abstraction has 725 states and 726 transitions. [2018-10-15 13:02:31,817 INFO L482 AbstractCegarLoop]: Interpolant automaton has 139 states. [2018-10-15 13:02:31,817 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 726 transitions. [2018-10-15 13:02:31,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 720 [2018-10-15 13:02:31,820 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:02:31,820 INFO L375 BasicCegarLoop]: trace histogram [69, 69, 69, 69, 69, 69, 69, 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] [2018-10-15 13:02:31,820 INFO L424 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:02:31,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:02:31,821 INFO L82 PathProgramCache]: Analyzing trace with hash -914354350, now seen corresponding path program 69 times [2018-10-15 13:02:31,821 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:02:31,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:02:38,049 INFO L134 CoverageAnalysis]: Checked inductivity of 23529 backedges. 0 proven. 23529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:02:38,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:02:38,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141] total 141 [2018-10-15 13:02:38,050 INFO L460 AbstractCegarLoop]: Interpolant automaton has 141 states [2018-10-15 13:02:38,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2018-10-15 13:02:38,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5040, Invalid=14700, Unknown=0, NotChecked=0, Total=19740 [2018-10-15 13:02:38,051 INFO L87 Difference]: Start difference. First operand 725 states and 726 transitions. Second operand 141 states. [2018-10-15 13:02:48,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:02:48,853 INFO L93 Difference]: Finished difference Result 759 states and 760 transitions. [2018-10-15 13:02:48,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 210 states. [2018-10-15 13:02:48,853 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 719 [2018-10-15 13:02:48,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:02:48,856 INFO L225 Difference]: With dead ends: 759 [2018-10-15 13:02:48,856 INFO L226 Difference]: Without dead ends: 759 [2018-10-15 13:02:48,858 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 277 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14145 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=24498, Invalid=53064, Unknown=0, NotChecked=0, Total=77562 [2018-10-15 13:02:48,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 759 states. [2018-10-15 13:02:48,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 759 to 735. [2018-10-15 13:02:48,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 735 states. [2018-10-15 13:02:48,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 736 transitions. [2018-10-15 13:02:48,863 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 736 transitions. Word has length 719 [2018-10-15 13:02:48,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:02:48,863 INFO L481 AbstractCegarLoop]: Abstraction has 735 states and 736 transitions. [2018-10-15 13:02:48,863 INFO L482 AbstractCegarLoop]: Interpolant automaton has 141 states. [2018-10-15 13:02:48,863 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 736 transitions. [2018-10-15 13:02:48,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 730 [2018-10-15 13:02:48,866 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:02:48,867 INFO L375 BasicCegarLoop]: trace histogram [70, 70, 70, 70, 70, 70, 70, 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] [2018-10-15 13:02:48,867 INFO L424 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:02:48,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:02:48,867 INFO L82 PathProgramCache]: Analyzing trace with hash -112101754, now seen corresponding path program 70 times [2018-10-15 13:02:48,868 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:02:48,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:02:55,126 INFO L134 CoverageAnalysis]: Checked inductivity of 24220 backedges. 0 proven. 24220 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:02:55,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:02:55,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143] total 143 [2018-10-15 13:02:55,127 INFO L460 AbstractCegarLoop]: Interpolant automaton has 143 states [2018-10-15 13:02:55,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2018-10-15 13:02:55,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5183, Invalid=15123, Unknown=0, NotChecked=0, Total=20306 [2018-10-15 13:02:55,129 INFO L87 Difference]: Start difference. First operand 735 states and 736 transitions. Second operand 143 states. [2018-10-15 13:03:05,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:05,784 INFO L93 Difference]: Finished difference Result 769 states and 770 transitions. [2018-10-15 13:03:05,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 213 states. [2018-10-15 13:03:05,785 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 729 [2018-10-15 13:03:05,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:05,789 INFO L225 Difference]: With dead ends: 769 [2018-10-15 13:03:05,789 INFO L226 Difference]: Without dead ends: 769 [2018-10-15 13:03:05,791 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 281 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14560 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=25203, Invalid=54603, Unknown=0, NotChecked=0, Total=79806 [2018-10-15 13:03:05,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2018-10-15 13:03:05,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 745. [2018-10-15 13:03:05,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2018-10-15 13:03:05,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 746 transitions. [2018-10-15 13:03:05,796 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 746 transitions. Word has length 729 [2018-10-15 13:03:05,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:05,797 INFO L481 AbstractCegarLoop]: Abstraction has 745 states and 746 transitions. [2018-10-15 13:03:05,797 INFO L482 AbstractCegarLoop]: Interpolant automaton has 143 states. [2018-10-15 13:03:05,797 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 746 transitions. [2018-10-15 13:03:05,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 740 [2018-10-15 13:03:05,801 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:05,801 INFO L375 BasicCegarLoop]: trace histogram [71, 71, 71, 71, 71, 71, 71, 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] [2018-10-15 13:03:05,801 INFO L424 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:05,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:05,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1706922822, now seen corresponding path program 71 times [2018-10-15 13:03:05,802 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:05,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:12,183 INFO L134 CoverageAnalysis]: Checked inductivity of 24921 backedges. 0 proven. 24921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:12,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:12,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145] total 145 [2018-10-15 13:03:12,184 INFO L460 AbstractCegarLoop]: Interpolant automaton has 145 states [2018-10-15 13:03:12,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2018-10-15 13:03:12,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5328, Invalid=15552, Unknown=0, NotChecked=0, Total=20880 [2018-10-15 13:03:12,185 INFO L87 Difference]: Start difference. First operand 745 states and 746 transitions. Second operand 145 states. [2018-10-15 13:03:24,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:24,046 INFO L93 Difference]: Finished difference Result 779 states and 780 transitions. [2018-10-15 13:03:24,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 216 states. [2018-10-15 13:03:24,047 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 739 [2018-10-15 13:03:24,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:24,051 INFO L225 Difference]: With dead ends: 779 [2018-10-15 13:03:24,051 INFO L226 Difference]: Without dead ends: 779 [2018-10-15 13:03:24,053 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 285 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14981 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=25918, Invalid=56164, Unknown=0, NotChecked=0, Total=82082 [2018-10-15 13:03:24,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2018-10-15 13:03:24,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 755. [2018-10-15 13:03:24,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 755 states. [2018-10-15 13:03:24,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 756 transitions. [2018-10-15 13:03:24,060 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 756 transitions. Word has length 739 [2018-10-15 13:03:24,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:24,060 INFO L481 AbstractCegarLoop]: Abstraction has 755 states and 756 transitions. [2018-10-15 13:03:24,060 INFO L482 AbstractCegarLoop]: Interpolant automaton has 145 states. [2018-10-15 13:03:24,060 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 756 transitions. [2018-10-15 13:03:24,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 750 [2018-10-15 13:03:24,064 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:24,064 INFO L375 BasicCegarLoop]: trace histogram [72, 72, 72, 72, 72, 72, 72, 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] [2018-10-15 13:03:24,064 INFO L424 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:24,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:24,064 INFO L82 PathProgramCache]: Analyzing trace with hash -781438482, now seen corresponding path program 72 times [2018-10-15 13:03:24,065 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:24,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:30,772 INFO L134 CoverageAnalysis]: Checked inductivity of 25632 backedges. 0 proven. 25632 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:30,773 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:30,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147] total 147 [2018-10-15 13:03:30,774 INFO L460 AbstractCegarLoop]: Interpolant automaton has 147 states [2018-10-15 13:03:30,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2018-10-15 13:03:30,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5475, Invalid=15987, Unknown=0, NotChecked=0, Total=21462 [2018-10-15 13:03:30,775 INFO L87 Difference]: Start difference. First operand 755 states and 756 transitions. Second operand 147 states. [2018-10-15 13:03:42,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:42,053 INFO L93 Difference]: Finished difference Result 789 states and 790 transitions. [2018-10-15 13:03:42,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 219 states. [2018-10-15 13:03:42,053 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 749 [2018-10-15 13:03:42,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:42,056 INFO L225 Difference]: With dead ends: 789 [2018-10-15 13:03:42,056 INFO L226 Difference]: Without dead ends: 789 [2018-10-15 13:03:42,059 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 289 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15408 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=26643, Invalid=57747, Unknown=0, NotChecked=0, Total=84390 [2018-10-15 13:03:42,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2018-10-15 13:03:42,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 765. [2018-10-15 13:03:42,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 765 states. [2018-10-15 13:03:42,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 766 transitions. [2018-10-15 13:03:42,066 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 766 transitions. Word has length 749 [2018-10-15 13:03:42,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:42,066 INFO L481 AbstractCegarLoop]: Abstraction has 765 states and 766 transitions. [2018-10-15 13:03:42,067 INFO L482 AbstractCegarLoop]: Interpolant automaton has 147 states. [2018-10-15 13:03:42,067 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 766 transitions. [2018-10-15 13:03:42,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 760 [2018-10-15 13:03:42,071 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:42,072 INFO L375 BasicCegarLoop]: trace histogram [73, 73, 73, 73, 73, 73, 73, 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] [2018-10-15 13:03:42,072 INFO L424 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:42,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:42,072 INFO L82 PathProgramCache]: Analyzing trace with hash 626525730, now seen corresponding path program 73 times [2018-10-15 13:03:42,073 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:42,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat