java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplTransformed.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20181010-MemSafetyPathprograms/20051113-1.c_false-valid-memtrack.i_15.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-093a8c0 [2018-10-14 17:56:24,849 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-14 17:56:24,851 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-14 17:56:24,864 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-14 17:56:24,864 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-14 17:56:24,865 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-14 17:56:24,867 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-14 17:56:24,869 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-14 17:56:24,870 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-14 17:56:24,871 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-14 17:56:24,872 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-14 17:56:24,872 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-14 17:56:24,873 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-14 17:56:24,874 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-14 17:56:24,875 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-14 17:56:24,876 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-14 17:56:24,877 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-14 17:56:24,880 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-14 17:56:24,886 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-14 17:56:24,888 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-14 17:56:24,889 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-14 17:56:24,894 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-14 17:56:24,896 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-14 17:56:24,896 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-14 17:56:24,897 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-14 17:56:24,898 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-14 17:56:24,902 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-14 17:56:24,903 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-14 17:56:24,904 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-14 17:56:24,907 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-14 17:56:24,907 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-14 17:56:24,908 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-14 17:56:24,908 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-14 17:56:24,908 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-14 17:56:24,909 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-14 17:56:24,910 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-14 17:56:24,910 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-14 17:56:24,919 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-14 17:56:24,919 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-14 17:56:24,920 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-14 17:56:24,921 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-14 17:56:24,921 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-14 17:56:24,921 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-14 17:56:24,922 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-14 17:56:24,922 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-14 17:56:24,922 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-14 17:56:24,922 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-14 17:56:24,922 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-14 17:56:24,923 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-14 17:56:24,923 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-14 17:56:24,924 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-14 17:56:24,924 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-14 17:56:24,986 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-14 17:56:25,003 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-14 17:56:25,009 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-14 17:56:25,010 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-14 17:56:25,011 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-14 17:56:25,012 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/20051113-1.c_false-valid-memtrack.i_15.bpl [2018-10-14 17:56:25,012 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/20051113-1.c_false-valid-memtrack.i_15.bpl' [2018-10-14 17:56:25,076 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-14 17:56:25,078 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-14 17:56:25,079 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-14 17:56:25,079 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-14 17:56:25,079 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-14 17:56:25,106 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 05:56:25" (1/1) ... [2018-10-14 17:56:25,108 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 05:56:25" (1/1) ... [2018-10-14 17:56:25,124 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 05:56:25" (1/1) ... [2018-10-14 17:56:25,125 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 05:56:25" (1/1) ... [2018-10-14 17:56:25,131 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 05:56:25" (1/1) ... [2018-10-14 17:56:25,133 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 05:56:25" (1/1) ... [2018-10-14 17:56:25,135 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 05:56:25" (1/1) ... [2018-10-14 17:56:25,137 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-14 17:56:25,138 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-14 17:56:25,139 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-14 17:56:25,139 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-14 17:56:25,140 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "20051113-1.c_false-valid-memtrack.i_15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 05:56:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-14 17:56:25,217 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-14 17:56:25,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-14 17:56:25,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-14 17:56:25,886 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-14 17:56:25,887 INFO L202 PluginConnector]: Adding new model 20051113-1.c_false-valid-memtrack.i_15.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:56:25 BoogieIcfgContainer [2018-10-14 17:56:25,887 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-14 17:56:25,887 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-14 17:56:25,887 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-14 17:56:25,888 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-14 17:56:25,891 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "20051113-1.c_false-valid-memtrack.i_15.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:56:25" (1/1) ... [2018-10-14 17:56:25,899 INFO L137 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-10-14 17:56:25,900 INFO L138 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-10-14 17:56:25,946 INFO L191 apSepIcfgTransformer]: Heap separator: starting loc-array-style preprocessing [2018-10-14 17:56:26,003 INFO L219 apSepIcfgTransformer]: finished MemlocArrayUpdater [2018-10-14 17:56:26,019 INFO L282 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-10-14 17:56:26,089 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=1) [2018-10-14 17:58:01,833 INFO L315 AbstractInterpreter]: Visited 78 different actions 161 times. Merged at 52 different actions 80 times. Widened at 1 different actions 1 times. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. [2018-10-14 17:58:01,836 INFO L306 apSepIcfgTransformer]: finished equality analysis [2018-10-14 17:58:01,840 INFO L318 apSepIcfgTransformer]: Finished detection of select terms ("array reads") [2018-10-14 17:58:02,239 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select |v_#locv_#memory_int_2_1_1| |v_ULTIMATE.start_#Ultimate.C_memset_#ptr.base_6|) at (#memory_int := #memory_int[#Ultimate.C_memset_#ptr.base := #memory_int[#Ultimate.C_memset_#ptr.base][#Ultimate.C_memset_#t~loopctr16 + #Ultimate.C_memset_#ptr.offset := #Ultimate.C_memset_#value]];) [2018-10-14 17:58:02,485 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select |v_#locv_ULTIMATE.start_write~int_old_#memory_int_2_1_1| |v_ULTIMATE.start_write~int_#ptr.base_6|) at (assume #memory_int == write~int_old_#memory_int[write~int_#ptr.base := write~int_old_#memory_int[write~int_#ptr.base][write~int_#ptr.offset := write~int_#value]];) [2018-10-14 17:58:02,487 INFO L232 HeapPartitionManager]: partitioning result: [2018-10-14 17:58:02,488 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-14 17:58:02,488 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-14 17:58:02,488 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 6 [2018-10-14 17:58:02,488 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-14 17:58:02,489 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-14 17:58:02,489 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 0 [2018-10-14 17:58:02,489 INFO L248 HeapPartitionManager]: # location blocks :0 [2018-10-14 17:58:02,489 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-14 17:58:02,489 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-14 17:58:02,489 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 6 [2018-10-14 17:58:02,490 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-14 17:58:02,490 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-14 17:58:02,490 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 0 [2018-10-14 17:58:02,490 INFO L248 HeapPartitionManager]: # location blocks :0 [2018-10-14 17:58:02,492 INFO L145 ransitionTransformer]: executing heap partitioning transformation [2018-10-14 17:58:02,510 INFO L202 PluginConnector]: Adding new model 20051113-1.c_false-valid-memtrack.i_15.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.10 05:58:02 BasicIcfg [2018-10-14 17:58:02,510 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-14 17:58:02,512 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-14 17:58:02,512 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-14 17:58:02,515 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-14 17:58:02,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "20051113-1.c_false-valid-memtrack.i_15.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 05:56:25" (1/3) ... [2018-10-14 17:58:02,517 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32a578ed and model type 20051113-1.c_false-valid-memtrack.i_15.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:58:02, skipping insertion in model container [2018-10-14 17:58:02,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "20051113-1.c_false-valid-memtrack.i_15.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:56:25" (2/3) ... [2018-10-14 17:58:02,517 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32a578ed and model type 20051113-1.c_false-valid-memtrack.i_15.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 05:58:02, skipping insertion in model container [2018-10-14 17:58:02,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "20051113-1.c_false-valid-memtrack.i_15.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.10 05:58:02" (3/3) ... [2018-10-14 17:58:02,519 INFO L112 eAbstractionObserver]: Analyzing ICFG memPartitionedIcfg [2018-10-14 17:58:02,529 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-14 17:58:02,537 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-14 17:58:02,555 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-14 17:58:02,579 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-14 17:58:02,580 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-14 17:58:02,580 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-14 17:58:02,580 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-14 17:58:02,580 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-14 17:58:02,580 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-14 17:58:02,581 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-14 17:58:02,581 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-14 17:58:02,581 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-14 17:58:02,592 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2018-10-14 17:58:02,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-14 17:58:02,604 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:58:02,605 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:58:02,606 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:58:02,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:58:02,612 INFO L82 PathProgramCache]: Analyzing trace with hash 666963925, now seen corresponding path program 1 times [2018-10-14 17:58:02,668 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:58:02,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:58:02,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:58:02,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 17:58:02,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-14 17:58:02,968 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-14 17:58:02,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-14 17:58:02,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-14 17:58:02,984 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 4 states. [2018-10-14 17:58:03,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:58:03,105 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-10-14 17:58:03,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-14 17:58:03,107 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2018-10-14 17:58:03,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:58:03,212 INFO L225 Difference]: With dead ends: 79 [2018-10-14 17:58:03,212 INFO L226 Difference]: Without dead ends: 79 [2018-10-14 17:58:03,214 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-14 17:58:03,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-10-14 17:58:03,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 77. [2018-10-14 17:58:03,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-10-14 17:58:03,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-10-14 17:58:03,268 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 73 [2018-10-14 17:58:03,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:58:03,269 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-10-14 17:58:03,269 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-14 17:58:03,269 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-10-14 17:58:03,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-14 17:58:03,272 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:58:03,272 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:58:03,272 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:58:03,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:58:03,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1587936571, now seen corresponding path program 1 times [2018-10-14 17:58:03,274 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:58:03,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:58:03,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:58:03,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:58:03,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-14 17:58:03,533 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-14 17:58:03,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-14 17:58:03,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-14 17:58:03,534 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 5 states. [2018-10-14 17:58:03,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:58:03,723 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-10-14 17:58:03,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-14 17:58:03,724 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2018-10-14 17:58:03,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:58:03,725 INFO L225 Difference]: With dead ends: 82 [2018-10-14 17:58:03,726 INFO L226 Difference]: Without dead ends: 82 [2018-10-14 17:58:03,727 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-14 17:58:03,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-10-14 17:58:03,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2018-10-14 17:58:03,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-10-14 17:58:03,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-10-14 17:58:03,734 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 76 [2018-10-14 17:58:03,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:58:03,735 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-10-14 17:58:03,735 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-14 17:58:03,735 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-10-14 17:58:03,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-14 17:58:03,737 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:58:03,738 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:58:03,738 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:58:03,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:58:03,739 INFO L82 PathProgramCache]: Analyzing trace with hash 254863829, now seen corresponding path program 2 times [2018-10-14 17:58:03,739 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:58:03,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:58:04,020 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:58:04,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:58:04,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-10-14 17:58:04,021 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-14 17:58:04,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-14 17:58:04,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-14 17:58:04,022 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 6 states. [2018-10-14 17:58:04,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:58:04,201 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-10-14 17:58:04,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-14 17:58:04,202 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 79 [2018-10-14 17:58:04,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:58:04,204 INFO L225 Difference]: With dead ends: 85 [2018-10-14 17:58:04,204 INFO L226 Difference]: Without dead ends: 85 [2018-10-14 17:58:04,205 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-10-14 17:58:04,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-14 17:58:04,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2018-10-14 17:58:04,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-10-14 17:58:04,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-10-14 17:58:04,213 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 79 [2018-10-14 17:58:04,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:58:04,214 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-10-14 17:58:04,214 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-14 17:58:04,214 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-10-14 17:58:04,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-14 17:58:04,215 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:58:04,216 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:58:04,216 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:58:04,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:58:04,216 INFO L82 PathProgramCache]: Analyzing trace with hash 849602757, now seen corresponding path program 3 times [2018-10-14 17:58:04,217 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:58:04,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:58:04,372 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:58:04,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:58:04,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-14 17:58:04,373 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-14 17:58:04,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-14 17:58:04,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-14 17:58:04,374 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 7 states. [2018-10-14 17:58:04,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:58:04,540 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-10-14 17:58:04,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-14 17:58:04,540 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2018-10-14 17:58:04,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:58:04,542 INFO L225 Difference]: With dead ends: 88 [2018-10-14 17:58:04,542 INFO L226 Difference]: Without dead ends: 88 [2018-10-14 17:58:04,542 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-10-14 17:58:04,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-10-14 17:58:04,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2018-10-14 17:58:04,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-10-14 17:58:04,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-10-14 17:58:04,548 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 82 [2018-10-14 17:58:04,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:58:04,549 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-10-14 17:58:04,549 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-14 17:58:04,549 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-10-14 17:58:04,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-14 17:58:04,550 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:58:04,551 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:58:04,551 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:58:04,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:58:04,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1976910805, now seen corresponding path program 4 times [2018-10-14 17:58:04,552 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:58:04,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:58:04,830 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:58:04,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:58:04,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-14 17:58:04,832 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-14 17:58:04,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-14 17:58:04,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-10-14 17:58:04,832 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 8 states. [2018-10-14 17:58:05,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:58:05,099 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-10-14 17:58:05,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-14 17:58:05,100 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 85 [2018-10-14 17:58:05,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:58:05,101 INFO L225 Difference]: With dead ends: 91 [2018-10-14 17:58:05,101 INFO L226 Difference]: Without dead ends: 91 [2018-10-14 17:58:05,102 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-10-14 17:58:05,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-10-14 17:58:05,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2018-10-14 17:58:05,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-10-14 17:58:05,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-10-14 17:58:05,108 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 85 [2018-10-14 17:58:05,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:58:05,109 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-10-14 17:58:05,109 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-14 17:58:05,109 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-10-14 17:58:05,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-14 17:58:05,110 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:58:05,111 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:58:05,111 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:58:05,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:58:05,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1033285947, now seen corresponding path program 5 times [2018-10-14 17:58:05,112 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:58:05,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:58:05,276 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:58:05,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:58:05,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-14 17:58:05,277 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-14 17:58:05,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-14 17:58:05,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-10-14 17:58:05,277 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 9 states. [2018-10-14 17:58:05,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:58:05,518 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-10-14 17:58:05,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-14 17:58:05,520 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2018-10-14 17:58:05,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:58:05,521 INFO L225 Difference]: With dead ends: 94 [2018-10-14 17:58:05,521 INFO L226 Difference]: Without dead ends: 94 [2018-10-14 17:58:05,522 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-10-14 17:58:05,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-10-14 17:58:05,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2018-10-14 17:58:05,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-10-14 17:58:05,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-10-14 17:58:05,527 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 88 [2018-10-14 17:58:05,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:58:05,528 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-10-14 17:58:05,528 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-14 17:58:05,528 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-10-14 17:58:05,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-14 17:58:05,530 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:58:05,530 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:58:05,530 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:58:05,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:58:05,530 INFO L82 PathProgramCache]: Analyzing trace with hash 1112415701, now seen corresponding path program 6 times [2018-10-14 17:58:05,531 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:58:05,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:58:05,714 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:58:05,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:58:05,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-14 17:58:05,715 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-14 17:58:05,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-14 17:58:05,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-10-14 17:58:05,715 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 10 states. [2018-10-14 17:58:05,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:58:05,906 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-10-14 17:58:05,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-14 17:58:05,908 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 91 [2018-10-14 17:58:05,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:58:05,909 INFO L225 Difference]: With dead ends: 97 [2018-10-14 17:58:05,909 INFO L226 Difference]: Without dead ends: 97 [2018-10-14 17:58:05,910 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-10-14 17:58:05,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-10-14 17:58:05,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2018-10-14 17:58:05,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-10-14 17:58:05,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-10-14 17:58:05,915 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 91 [2018-10-14 17:58:05,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:58:05,916 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-10-14 17:58:05,916 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-14 17:58:05,916 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-10-14 17:58:05,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-14 17:58:05,917 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:58:05,917 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:58:05,918 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:58:05,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:58:05,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1711944901, now seen corresponding path program 7 times [2018-10-14 17:58:05,919 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:58:05,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:58:06,155 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:58:06,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:58:06,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-14 17:58:06,156 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-14 17:58:06,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-14 17:58:06,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2018-10-14 17:58:06,157 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 11 states. [2018-10-14 17:58:06,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:58:06,352 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-10-14 17:58:06,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-14 17:58:06,353 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 94 [2018-10-14 17:58:06,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:58:06,354 INFO L225 Difference]: With dead ends: 100 [2018-10-14 17:58:06,354 INFO L226 Difference]: Without dead ends: 100 [2018-10-14 17:58:06,354 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-10-14 17:58:06,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-10-14 17:58:06,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2018-10-14 17:58:06,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-10-14 17:58:06,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-10-14 17:58:06,359 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 94 [2018-10-14 17:58:06,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:58:06,359 INFO L481 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-10-14 17:58:06,359 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-14 17:58:06,359 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-10-14 17:58:06,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-10-14 17:58:06,361 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:58:06,361 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:58:06,361 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:58:06,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:58:06,362 INFO L82 PathProgramCache]: Analyzing trace with hash -482641963, now seen corresponding path program 8 times [2018-10-14 17:58:06,363 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:58:06,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:58:06,539 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:58:06,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:58:06,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-14 17:58:06,540 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-14 17:58:06,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-14 17:58:06,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2018-10-14 17:58:06,541 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 12 states. [2018-10-14 17:58:06,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:58:06,753 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-10-14 17:58:06,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-14 17:58:06,755 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 97 [2018-10-14 17:58:06,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:58:06,756 INFO L225 Difference]: With dead ends: 103 [2018-10-14 17:58:06,756 INFO L226 Difference]: Without dead ends: 103 [2018-10-14 17:58:06,757 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-10-14 17:58:06,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-10-14 17:58:06,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2018-10-14 17:58:06,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-10-14 17:58:06,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-10-14 17:58:06,762 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 97 [2018-10-14 17:58:06,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:58:06,762 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-10-14 17:58:06,762 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-14 17:58:06,762 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-10-14 17:58:06,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-14 17:58:06,763 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:58:06,764 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:58:06,764 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:58:06,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:58:06,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1427727675, now seen corresponding path program 9 times [2018-10-14 17:58:06,765 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:58:06,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:58:07,140 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:58:07,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:58:07,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-14 17:58:07,141 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-14 17:58:07,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-14 17:58:07,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2018-10-14 17:58:07,141 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 13 states. [2018-10-14 17:58:07,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:58:07,693 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-10-14 17:58:07,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-14 17:58:07,694 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 100 [2018-10-14 17:58:07,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:58:07,695 INFO L225 Difference]: With dead ends: 106 [2018-10-14 17:58:07,695 INFO L226 Difference]: Without dead ends: 106 [2018-10-14 17:58:07,696 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-10-14 17:58:07,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-10-14 17:58:07,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2018-10-14 17:58:07,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-10-14 17:58:07,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-10-14 17:58:07,699 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 100 [2018-10-14 17:58:07,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:58:07,699 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-10-14 17:58:07,699 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-14 17:58:07,699 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-10-14 17:58:07,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-14 17:58:07,702 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:58:07,702 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:58:07,702 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:58:07,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:58:07,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1329418709, now seen corresponding path program 10 times [2018-10-14 17:58:07,703 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:58:07,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:58:07,871 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:58:07,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:58:07,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-14 17:58:07,872 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-14 17:58:07,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-14 17:58:07,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2018-10-14 17:58:07,873 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 14 states. [2018-10-14 17:58:08,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:58:08,289 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-10-14 17:58:08,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-14 17:58:08,292 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 103 [2018-10-14 17:58:08,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:58:08,292 INFO L225 Difference]: With dead ends: 109 [2018-10-14 17:58:08,293 INFO L226 Difference]: Without dead ends: 109 [2018-10-14 17:58:08,293 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=221, Invalid=331, Unknown=0, NotChecked=0, Total=552 [2018-10-14 17:58:08,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-10-14 17:58:08,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2018-10-14 17:58:08,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-10-14 17:58:08,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-10-14 17:58:08,296 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 103 [2018-10-14 17:58:08,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:58:08,297 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-10-14 17:58:08,297 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-14 17:58:08,297 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-10-14 17:58:08,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-14 17:58:08,298 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:58:08,298 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:58:08,298 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:58:08,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:58:08,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1772191547, now seen corresponding path program 11 times [2018-10-14 17:58:08,300 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:58:08,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:58:09,193 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:58:09,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:58:09,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-14 17:58:09,194 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-14 17:58:09,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-14 17:58:09,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=116, Unknown=0, NotChecked=0, Total=210 [2018-10-14 17:58:09,194 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 15 states. [2018-10-14 17:58:09,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:58:09,504 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2018-10-14 17:58:09,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-14 17:58:09,512 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 106 [2018-10-14 17:58:09,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:58:09,513 INFO L225 Difference]: With dead ends: 112 [2018-10-14 17:58:09,513 INFO L226 Difference]: Without dead ends: 112 [2018-10-14 17:58:09,514 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=259, Invalid=391, Unknown=0, NotChecked=0, Total=650 [2018-10-14 17:58:09,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-10-14 17:58:09,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2018-10-14 17:58:09,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-10-14 17:58:09,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-10-14 17:58:09,517 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 106 [2018-10-14 17:58:09,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:58:09,517 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-10-14 17:58:09,517 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-14 17:58:09,517 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-10-14 17:58:09,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-14 17:58:09,518 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:58:09,518 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:58:09,518 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:58:09,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:58:09,519 INFO L82 PathProgramCache]: Analyzing trace with hash 83078101, now seen corresponding path program 12 times [2018-10-14 17:58:09,520 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:58:09,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:58:09,966 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:58:09,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:58:09,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-14 17:58:09,967 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-14 17:58:09,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-14 17:58:09,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=132, Unknown=0, NotChecked=0, Total=240 [2018-10-14 17:58:09,968 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 16 states. [2018-10-14 17:58:10,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:58:10,243 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-10-14 17:58:10,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-14 17:58:10,244 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 109 [2018-10-14 17:58:10,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:58:10,245 INFO L225 Difference]: With dead ends: 115 [2018-10-14 17:58:10,245 INFO L226 Difference]: Without dead ends: 115 [2018-10-14 17:58:10,246 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=300, Invalid=456, Unknown=0, NotChecked=0, Total=756 [2018-10-14 17:58:10,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-10-14 17:58:10,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2018-10-14 17:58:10,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-10-14 17:58:10,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-10-14 17:58:10,248 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 109 [2018-10-14 17:58:10,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:58:10,249 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-10-14 17:58:10,249 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-14 17:58:10,249 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-10-14 17:58:10,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-14 17:58:10,250 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:58:10,250 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:58:10,250 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:58:10,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:58:10,250 INFO L82 PathProgramCache]: Analyzing trace with hash -1512970555, now seen corresponding path program 13 times [2018-10-14 17:58:10,251 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:58:10,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:58:10,473 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:58:10,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:58:10,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-14 17:58:10,474 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-14 17:58:10,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-14 17:58:10,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=149, Unknown=0, NotChecked=0, Total=272 [2018-10-14 17:58:10,475 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 17 states. [2018-10-14 17:58:10,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:58:10,811 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2018-10-14 17:58:10,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-14 17:58:10,815 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 112 [2018-10-14 17:58:10,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:58:10,817 INFO L225 Difference]: With dead ends: 118 [2018-10-14 17:58:10,817 INFO L226 Difference]: Without dead ends: 118 [2018-10-14 17:58:10,817 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=344, Invalid=526, Unknown=0, NotChecked=0, Total=870 [2018-10-14 17:58:10,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-10-14 17:58:10,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2018-10-14 17:58:10,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-10-14 17:58:10,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2018-10-14 17:58:10,820 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 112 [2018-10-14 17:58:10,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:58:10,821 INFO L481 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2018-10-14 17:58:10,821 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-14 17:58:10,821 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2018-10-14 17:58:10,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-14 17:58:10,822 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:58:10,822 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:58:10,822 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:58:10,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:58:10,822 INFO L82 PathProgramCache]: Analyzing trace with hash 184452565, now seen corresponding path program 14 times [2018-10-14 17:58:10,823 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:58:10,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:58:11,245 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:58:11,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:58:11,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-14 17:58:11,246 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-14 17:58:11,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-14 17:58:11,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=167, Unknown=0, NotChecked=0, Total=306 [2018-10-14 17:58:11,247 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 18 states. [2018-10-14 17:58:11,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:58:11,625 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-10-14 17:58:11,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-14 17:58:11,626 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 115 [2018-10-14 17:58:11,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:58:11,626 INFO L225 Difference]: With dead ends: 121 [2018-10-14 17:58:11,626 INFO L226 Difference]: Without dead ends: 121 [2018-10-14 17:58:11,627 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=391, Invalid=601, Unknown=0, NotChecked=0, Total=992 [2018-10-14 17:58:11,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-10-14 17:58:11,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2018-10-14 17:58:11,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-10-14 17:58:11,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2018-10-14 17:58:11,630 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 115 [2018-10-14 17:58:11,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:58:11,630 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2018-10-14 17:58:11,631 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-14 17:58:11,631 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2018-10-14 17:58:11,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-14 17:58:11,631 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:58:11,632 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:58:11,632 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:58:11,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:58:11,632 INFO L82 PathProgramCache]: Analyzing trace with hash -828322619, now seen corresponding path program 15 times [2018-10-14 17:58:11,633 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:58:11,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:58:11,947 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:58:11,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:58:11,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-14 17:58:11,948 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-14 17:58:11,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-14 17:58:11,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=186, Unknown=0, NotChecked=0, Total=342 [2018-10-14 17:58:11,949 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 19 states. [2018-10-14 17:58:12,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:58:12,291 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2018-10-14 17:58:12,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-14 17:58:12,291 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 118 [2018-10-14 17:58:12,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:58:12,292 INFO L225 Difference]: With dead ends: 124 [2018-10-14 17:58:12,292 INFO L226 Difference]: Without dead ends: 124 [2018-10-14 17:58:12,293 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=441, Invalid=681, Unknown=0, NotChecked=0, Total=1122 [2018-10-14 17:58:12,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-10-14 17:58:12,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2018-10-14 17:58:12,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-10-14 17:58:12,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2018-10-14 17:58:12,298 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 118 [2018-10-14 17:58:12,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:58:12,299 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2018-10-14 17:58:12,299 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-14 17:58:12,299 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2018-10-14 17:58:12,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-14 17:58:12,299 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:58:12,299 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:58:12,299 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:58:12,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:58:12,300 INFO L82 PathProgramCache]: Analyzing trace with hash -268574763, now seen corresponding path program 16 times [2018-10-14 17:58:12,300 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:58:12,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:58:12,864 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:58:12,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:58:12,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-14 17:58:12,865 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-14 17:58:12,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-14 17:58:12,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=206, Unknown=0, NotChecked=0, Total=380 [2018-10-14 17:58:12,866 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 20 states. [2018-10-14 17:58:13,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:58:13,275 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-10-14 17:58:13,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-14 17:58:13,277 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 121 [2018-10-14 17:58:13,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:58:13,277 INFO L225 Difference]: With dead ends: 127 [2018-10-14 17:58:13,278 INFO L226 Difference]: Without dead ends: 127 [2018-10-14 17:58:13,278 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=494, Invalid=766, Unknown=0, NotChecked=0, Total=1260 [2018-10-14 17:58:13,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-10-14 17:58:13,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2018-10-14 17:58:13,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-10-14 17:58:13,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-10-14 17:58:13,281 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 121 [2018-10-14 17:58:13,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:58:13,282 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-10-14 17:58:13,282 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-14 17:58:13,282 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-10-14 17:58:13,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-14 17:58:13,283 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:58:13,283 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:58:13,283 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:58:13,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:58:13,283 INFO L82 PathProgramCache]: Analyzing trace with hash 2116760261, now seen corresponding path program 17 times [2018-10-14 17:58:13,284 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:58:13,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:58:13,871 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 0 proven. 425 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:58:13,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:58:13,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-14 17:58:13,872 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-14 17:58:13,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-14 17:58:13,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=227, Unknown=0, NotChecked=0, Total=420 [2018-10-14 17:58:13,873 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 21 states. [2018-10-14 17:58:14,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:58:14,255 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2018-10-14 17:58:14,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-14 17:58:14,260 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 124 [2018-10-14 17:58:14,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:58:14,261 INFO L225 Difference]: With dead ends: 130 [2018-10-14 17:58:14,261 INFO L226 Difference]: Without dead ends: 130 [2018-10-14 17:58:14,261 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=550, Invalid=856, Unknown=0, NotChecked=0, Total=1406 [2018-10-14 17:58:14,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-10-14 17:58:14,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 128. [2018-10-14 17:58:14,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-10-14 17:58:14,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2018-10-14 17:58:14,265 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 124 [2018-10-14 17:58:14,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:58:14,265 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2018-10-14 17:58:14,265 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-14 17:58:14,265 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2018-10-14 17:58:14,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-14 17:58:14,266 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:58:14,266 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:58:14,267 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:58:14,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:58:14,267 INFO L82 PathProgramCache]: Analyzing trace with hash -896419371, now seen corresponding path program 18 times [2018-10-14 17:58:14,268 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:58:14,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:58:15,142 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 0 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:58:15,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:58:15,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-14 17:58:15,143 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-14 17:58:15,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-14 17:58:15,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=249, Unknown=0, NotChecked=0, Total=462 [2018-10-14 17:58:15,144 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 22 states. [2018-10-14 17:58:15,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:58:15,579 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2018-10-14 17:58:15,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-14 17:58:15,587 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 127 [2018-10-14 17:58:15,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:58:15,588 INFO L225 Difference]: With dead ends: 133 [2018-10-14 17:58:15,588 INFO L226 Difference]: Without dead ends: 133 [2018-10-14 17:58:15,589 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=609, Invalid=951, Unknown=0, NotChecked=0, Total=1560 [2018-10-14 17:58:15,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-10-14 17:58:15,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2018-10-14 17:58:15,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-10-14 17:58:15,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-10-14 17:58:15,592 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 127 [2018-10-14 17:58:15,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:58:15,592 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-10-14 17:58:15,592 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-14 17:58:15,592 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-10-14 17:58:15,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-14 17:58:15,593 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:58:15,593 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:58:15,593 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:58:15,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:58:15,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1714349883, now seen corresponding path program 19 times [2018-10-14 17:58:15,594 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:58:15,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:58:16,218 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:58:16,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:58:16,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-14 17:58:16,219 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-14 17:58:16,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-14 17:58:16,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=272, Unknown=0, NotChecked=0, Total=506 [2018-10-14 17:58:16,220 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 23 states. [2018-10-14 17:58:16,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:58:16,672 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2018-10-14 17:58:16,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-14 17:58:16,673 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 130 [2018-10-14 17:58:16,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:58:16,674 INFO L225 Difference]: With dead ends: 136 [2018-10-14 17:58:16,675 INFO L226 Difference]: Without dead ends: 136 [2018-10-14 17:58:16,676 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=671, Invalid=1051, Unknown=0, NotChecked=0, Total=1722 [2018-10-14 17:58:16,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-10-14 17:58:16,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2018-10-14 17:58:16,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-10-14 17:58:16,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 134 transitions. [2018-10-14 17:58:16,678 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 134 transitions. Word has length 130 [2018-10-14 17:58:16,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:58:16,678 INFO L481 AbstractCegarLoop]: Abstraction has 134 states and 134 transitions. [2018-10-14 17:58:16,678 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-14 17:58:16,678 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2018-10-14 17:58:16,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-10-14 17:58:16,679 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:58:16,679 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:58:16,679 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:58:16,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:58:16,679 INFO L82 PathProgramCache]: Analyzing trace with hash 962204629, now seen corresponding path program 20 times [2018-10-14 17:58:16,680 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:58:16,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:58:17,355 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:58:17,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:58:17,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-14 17:58:17,356 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-14 17:58:17,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-14 17:58:17,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=296, Unknown=0, NotChecked=0, Total=552 [2018-10-14 17:58:17,357 INFO L87 Difference]: Start difference. First operand 134 states and 134 transitions. Second operand 24 states. [2018-10-14 17:58:17,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:58:17,935 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-10-14 17:58:17,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-14 17:58:17,935 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 133 [2018-10-14 17:58:17,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:58:17,936 INFO L225 Difference]: With dead ends: 139 [2018-10-14 17:58:17,936 INFO L226 Difference]: Without dead ends: 139 [2018-10-14 17:58:17,937 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=736, Invalid=1156, Unknown=0, NotChecked=0, Total=1892 [2018-10-14 17:58:17,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-10-14 17:58:17,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 137. [2018-10-14 17:58:17,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-10-14 17:58:17,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-10-14 17:58:17,940 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 133 [2018-10-14 17:58:17,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:58:17,940 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-10-14 17:58:17,940 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-14 17:58:17,940 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-10-14 17:58:17,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-14 17:58:17,941 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:58:17,941 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:58:17,941 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:58:17,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:58:17,941 INFO L82 PathProgramCache]: Analyzing trace with hash 2129821381, now seen corresponding path program 21 times [2018-10-14 17:58:17,942 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:58:17,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:58:18,352 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:58:18,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:58:18,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-14 17:58:18,353 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-14 17:58:18,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-14 17:58:18,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=321, Unknown=0, NotChecked=0, Total=600 [2018-10-14 17:58:18,354 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 25 states. [2018-10-14 17:58:18,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:58:18,836 INFO L93 Difference]: Finished difference Result 142 states and 142 transitions. [2018-10-14 17:58:18,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-14 17:58:18,838 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 136 [2018-10-14 17:58:18,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:58:18,838 INFO L225 Difference]: With dead ends: 142 [2018-10-14 17:58:18,838 INFO L226 Difference]: Without dead ends: 142 [2018-10-14 17:58:18,840 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=804, Invalid=1266, Unknown=0, NotChecked=0, Total=2070 [2018-10-14 17:58:18,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-10-14 17:58:18,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2018-10-14 17:58:18,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-10-14 17:58:18,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 140 transitions. [2018-10-14 17:58:18,842 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 140 transitions. Word has length 136 [2018-10-14 17:58:18,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:58:18,843 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 140 transitions. [2018-10-14 17:58:18,843 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-14 17:58:18,843 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 140 transitions. [2018-10-14 17:58:18,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-14 17:58:18,844 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:58:18,844 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:58:18,844 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:58:18,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:58:18,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1660349909, now seen corresponding path program 22 times [2018-10-14 17:58:18,845 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:58:18,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:58:19,281 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:58:19,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:58:19,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-14 17:58:19,282 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-14 17:58:19,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-14 17:58:19,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=347, Unknown=0, NotChecked=0, Total=650 [2018-10-14 17:58:19,283 INFO L87 Difference]: Start difference. First operand 140 states and 140 transitions. Second operand 26 states. [2018-10-14 17:58:19,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:58:19,923 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2018-10-14 17:58:19,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-14 17:58:19,923 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 139 [2018-10-14 17:58:19,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:58:19,924 INFO L225 Difference]: With dead ends: 145 [2018-10-14 17:58:19,924 INFO L226 Difference]: Without dead ends: 145 [2018-10-14 17:58:19,925 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=875, Invalid=1381, Unknown=0, NotChecked=0, Total=2256 [2018-10-14 17:58:19,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-10-14 17:58:19,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2018-10-14 17:58:19,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-10-14 17:58:19,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-10-14 17:58:19,928 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 139 [2018-10-14 17:58:19,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:58:19,928 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-10-14 17:58:19,928 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-14 17:58:19,928 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-10-14 17:58:19,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-14 17:58:19,929 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:58:19,929 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:58:19,930 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:58:19,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:58:19,930 INFO L82 PathProgramCache]: Analyzing trace with hash 49243333, now seen corresponding path program 23 times [2018-10-14 17:58:19,930 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:58:19,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:58:20,320 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 0 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:58:20,320 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:58:20,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-14 17:58:20,321 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-14 17:58:20,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-14 17:58:20,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=374, Unknown=0, NotChecked=0, Total=702 [2018-10-14 17:58:20,321 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 27 states. [2018-10-14 17:58:20,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:58:20,920 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2018-10-14 17:58:20,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-14 17:58:20,921 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 142 [2018-10-14 17:58:20,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:58:20,921 INFO L225 Difference]: With dead ends: 148 [2018-10-14 17:58:20,922 INFO L226 Difference]: Without dead ends: 148 [2018-10-14 17:58:20,922 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=949, Invalid=1501, Unknown=0, NotChecked=0, Total=2450 [2018-10-14 17:58:20,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-10-14 17:58:20,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 146. [2018-10-14 17:58:20,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-10-14 17:58:20,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2018-10-14 17:58:20,925 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 142 [2018-10-14 17:58:20,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:58:20,925 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2018-10-14 17:58:20,925 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-14 17:58:20,925 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2018-10-14 17:58:20,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-10-14 17:58:20,926 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:58:20,926 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:58:20,926 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:58:20,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:58:20,927 INFO L82 PathProgramCache]: Analyzing trace with hash -167229483, now seen corresponding path program 24 times [2018-10-14 17:58:20,927 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:58:20,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:58:21,410 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 0 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:58:21,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:58:21,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-14 17:58:21,410 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-14 17:58:21,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-14 17:58:21,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=402, Unknown=0, NotChecked=0, Total=756 [2018-10-14 17:58:21,411 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 28 states. [2018-10-14 17:58:22,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:58:22,100 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-10-14 17:58:22,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-14 17:58:22,100 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 145 [2018-10-14 17:58:22,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:58:22,101 INFO L225 Difference]: With dead ends: 151 [2018-10-14 17:58:22,101 INFO L226 Difference]: Without dead ends: 151 [2018-10-14 17:58:22,102 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1026, Invalid=1626, Unknown=0, NotChecked=0, Total=2652 [2018-10-14 17:58:22,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-10-14 17:58:22,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 149. [2018-10-14 17:58:22,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-10-14 17:58:22,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-10-14 17:58:22,105 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 145 [2018-10-14 17:58:22,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:58:22,106 INFO L481 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2018-10-14 17:58:22,106 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-14 17:58:22,106 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-10-14 17:58:22,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-14 17:58:22,107 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:58:22,107 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:58:22,107 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:58:22,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:58:22,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1931987653, now seen corresponding path program 25 times [2018-10-14 17:58:22,108 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:58:22,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:58:22,928 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 0 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:58:22,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:58:22,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-14 17:58:22,929 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-14 17:58:22,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-14 17:58:22,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=381, Invalid=431, Unknown=0, NotChecked=0, Total=812 [2018-10-14 17:58:22,930 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 29 states. [2018-10-14 17:58:23,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:58:23,672 INFO L93 Difference]: Finished difference Result 154 states and 154 transitions. [2018-10-14 17:58:23,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-14 17:58:23,672 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 148 [2018-10-14 17:58:23,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:58:23,673 INFO L225 Difference]: With dead ends: 154 [2018-10-14 17:58:23,673 INFO L226 Difference]: Without dead ends: 154 [2018-10-14 17:58:23,674 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1106, Invalid=1756, Unknown=0, NotChecked=0, Total=2862 [2018-10-14 17:58:23,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-10-14 17:58:23,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 152. [2018-10-14 17:58:23,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-10-14 17:58:23,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2018-10-14 17:58:23,676 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 148 [2018-10-14 17:58:23,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:58:23,677 INFO L481 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2018-10-14 17:58:23,677 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-14 17:58:23,677 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2018-10-14 17:58:23,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-14 17:58:23,677 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:58:23,678 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:58:23,678 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:58:23,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:58:23,678 INFO L82 PathProgramCache]: Analyzing trace with hash 690889173, now seen corresponding path program 26 times [2018-10-14 17:58:23,679 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:58:23,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:58:24,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 0 proven. 1001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:58:24,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:58:24,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-14 17:58:24,711 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-14 17:58:24,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-14 17:58:24,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=409, Invalid=461, Unknown=0, NotChecked=0, Total=870 [2018-10-14 17:58:24,712 INFO L87 Difference]: Start difference. First operand 152 states and 152 transitions. Second operand 30 states. [2018-10-14 17:58:25,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:58:25,478 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2018-10-14 17:58:25,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-14 17:58:25,478 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 151 [2018-10-14 17:58:25,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:58:25,479 INFO L225 Difference]: With dead ends: 157 [2018-10-14 17:58:25,479 INFO L226 Difference]: Without dead ends: 157 [2018-10-14 17:58:25,480 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1189, Invalid=1891, Unknown=0, NotChecked=0, Total=3080 [2018-10-14 17:58:25,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-10-14 17:58:25,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 155. [2018-10-14 17:58:25,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-10-14 17:58:25,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2018-10-14 17:58:25,483 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 151 [2018-10-14 17:58:25,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:58:25,483 INFO L481 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2018-10-14 17:58:25,484 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-14 17:58:25,484 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2018-10-14 17:58:25,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-14 17:58:25,484 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:58:25,485 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:58:25,485 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:58:25,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:58:25,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1795444539, now seen corresponding path program 27 times [2018-10-14 17:58:25,486 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:58:25,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:58:26,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 0 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:58:26,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:58:26,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-14 17:58:26,004 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-14 17:58:26,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-14 17:58:26,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=438, Invalid=492, Unknown=0, NotChecked=0, Total=930 [2018-10-14 17:58:26,005 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 31 states. [2018-10-14 17:58:26,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:58:26,756 INFO L93 Difference]: Finished difference Result 160 states and 160 transitions. [2018-10-14 17:58:26,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-14 17:58:26,764 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 154 [2018-10-14 17:58:26,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:58:26,765 INFO L225 Difference]: With dead ends: 160 [2018-10-14 17:58:26,765 INFO L226 Difference]: Without dead ends: 160 [2018-10-14 17:58:26,767 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1275, Invalid=2031, Unknown=0, NotChecked=0, Total=3306 [2018-10-14 17:58:26,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-10-14 17:58:26,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2018-10-14 17:58:26,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-10-14 17:58:26,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 158 transitions. [2018-10-14 17:58:26,770 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 158 transitions. Word has length 154 [2018-10-14 17:58:26,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:58:26,770 INFO L481 AbstractCegarLoop]: Abstraction has 158 states and 158 transitions. [2018-10-14 17:58:26,770 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-14 17:58:26,771 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 158 transitions. [2018-10-14 17:58:26,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-10-14 17:58:26,771 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:58:26,772 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:58:26,772 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:58:26,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:58:26,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1157071915, now seen corresponding path program 28 times [2018-10-14 17:58:26,773 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:58:26,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:58:28,079 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 0 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:58:28,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:58:28,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-14 17:58:28,080 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-14 17:58:28,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-14 17:58:28,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=468, Invalid=524, Unknown=0, NotChecked=0, Total=992 [2018-10-14 17:58:28,081 INFO L87 Difference]: Start difference. First operand 158 states and 158 transitions. Second operand 32 states. [2018-10-14 17:58:29,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:58:29,045 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-10-14 17:58:29,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-14 17:58:29,045 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 157 [2018-10-14 17:58:29,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:58:29,046 INFO L225 Difference]: With dead ends: 163 [2018-10-14 17:58:29,046 INFO L226 Difference]: Without dead ends: 163 [2018-10-14 17:58:29,047 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1364, Invalid=2176, Unknown=0, NotChecked=0, Total=3540 [2018-10-14 17:58:29,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-10-14 17:58:29,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 161. [2018-10-14 17:58:29,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-10-14 17:58:29,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-10-14 17:58:29,050 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 157 [2018-10-14 17:58:29,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:58:29,050 INFO L481 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-10-14 17:58:29,050 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-14 17:58:29,050 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-10-14 17:58:29,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-14 17:58:29,051 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:58:29,051 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:58:29,051 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:58:29,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:58:29,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1513417019, now seen corresponding path program 29 times [2018-10-14 17:58:29,052 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:58:29,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:58:30,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 0 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:58:30,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:58:30,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-14 17:58:30,230 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-14 17:58:30,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-14 17:58:30,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=499, Invalid=557, Unknown=0, NotChecked=0, Total=1056 [2018-10-14 17:58:30,231 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 33 states. [2018-10-14 17:58:31,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:58:31,048 INFO L93 Difference]: Finished difference Result 166 states and 166 transitions. [2018-10-14 17:58:31,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-14 17:58:31,048 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 160 [2018-10-14 17:58:31,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:58:31,049 INFO L225 Difference]: With dead ends: 166 [2018-10-14 17:58:31,049 INFO L226 Difference]: Without dead ends: 166 [2018-10-14 17:58:31,051 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1456, Invalid=2326, Unknown=0, NotChecked=0, Total=3782 [2018-10-14 17:58:31,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-10-14 17:58:31,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2018-10-14 17:58:31,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-10-14 17:58:31,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 164 transitions. [2018-10-14 17:58:31,054 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 164 transitions. Word has length 160 [2018-10-14 17:58:31,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:58:31,054 INFO L481 AbstractCegarLoop]: Abstraction has 164 states and 164 transitions. [2018-10-14 17:58:31,054 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-14 17:58:31,054 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 164 transitions. [2018-10-14 17:58:31,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-10-14 17:58:31,055 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:58:31,055 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:58:31,055 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:58:31,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:58:31,056 INFO L82 PathProgramCache]: Analyzing trace with hash -231254571, now seen corresponding path program 30 times [2018-10-14 17:58:31,056 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:58:31,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:58:32,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 0 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:58:32,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:58:32,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-14 17:58:32,100 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-14 17:58:32,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-14 17:58:32,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=531, Invalid=591, Unknown=0, NotChecked=0, Total=1122 [2018-10-14 17:58:32,101 INFO L87 Difference]: Start difference. First operand 164 states and 164 transitions. Second operand 34 states. [2018-10-14 17:58:32,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:58:32,986 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2018-10-14 17:58:32,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-14 17:58:32,987 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 163 [2018-10-14 17:58:32,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:58:32,988 INFO L225 Difference]: With dead ends: 169 [2018-10-14 17:58:32,988 INFO L226 Difference]: Without dead ends: 169 [2018-10-14 17:58:32,989 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1551, Invalid=2481, Unknown=0, NotChecked=0, Total=4032 [2018-10-14 17:58:32,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-10-14 17:58:32,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 167. [2018-10-14 17:58:32,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-10-14 17:58:32,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2018-10-14 17:58:32,992 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 163 [2018-10-14 17:58:32,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:58:32,993 INFO L481 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2018-10-14 17:58:32,993 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-14 17:58:32,993 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2018-10-14 17:58:32,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-10-14 17:58:32,994 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:58:32,994 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:58:32,994 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:58:32,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:58:32,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1526070469, now seen corresponding path program 31 times [2018-10-14 17:58:32,995 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:58:33,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:58:33,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:58:33,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:58:33,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-14 17:58:33,962 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-14 17:58:33,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-14 17:58:33,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=564, Invalid=626, Unknown=0, NotChecked=0, Total=1190 [2018-10-14 17:58:33,963 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 35 states. [2018-10-14 17:58:34,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:58:34,971 INFO L93 Difference]: Finished difference Result 172 states and 172 transitions. [2018-10-14 17:58:34,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-14 17:58:34,971 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 166 [2018-10-14 17:58:34,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:58:34,973 INFO L225 Difference]: With dead ends: 172 [2018-10-14 17:58:34,973 INFO L226 Difference]: Without dead ends: 172 [2018-10-14 17:58:34,974 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1649, Invalid=2641, Unknown=0, NotChecked=0, Total=4290 [2018-10-14 17:58:34,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-10-14 17:58:34,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 170. [2018-10-14 17:58:34,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-10-14 17:58:34,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 170 transitions. [2018-10-14 17:58:34,977 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 170 transitions. Word has length 166 [2018-10-14 17:58:34,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:58:34,978 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 170 transitions. [2018-10-14 17:58:34,978 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-14 17:58:34,978 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 170 transitions. [2018-10-14 17:58:34,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-10-14 17:58:34,979 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:58:34,979 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:58:34,979 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:58:34,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:58:34,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1655001131, now seen corresponding path program 32 times [2018-10-14 17:58:34,980 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:58:34,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:58:35,762 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 0 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:58:35,762 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:58:35,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-14 17:58:35,763 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-14 17:58:35,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-14 17:58:35,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=598, Invalid=662, Unknown=0, NotChecked=0, Total=1260 [2018-10-14 17:58:35,764 INFO L87 Difference]: Start difference. First operand 170 states and 170 transitions. Second operand 36 states. [2018-10-14 17:58:36,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:58:36,782 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-10-14 17:58:36,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-14 17:58:36,782 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 169 [2018-10-14 17:58:36,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:58:36,783 INFO L225 Difference]: With dead ends: 175 [2018-10-14 17:58:36,783 INFO L226 Difference]: Without dead ends: 175 [2018-10-14 17:58:36,785 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1750, Invalid=2806, Unknown=0, NotChecked=0, Total=4556 [2018-10-14 17:58:36,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-10-14 17:58:36,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 173. [2018-10-14 17:58:36,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-10-14 17:58:36,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-10-14 17:58:36,788 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 169 [2018-10-14 17:58:36,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:58:36,788 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-10-14 17:58:36,788 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-14 17:58:36,789 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-10-14 17:58:36,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-14 17:58:36,789 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:58:36,790 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:58:36,790 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:58:36,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:58:36,790 INFO L82 PathProgramCache]: Analyzing trace with hash -505650491, now seen corresponding path program 33 times [2018-10-14 17:58:36,791 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:58:36,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:58:37,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 0 proven. 1617 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:58:37,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:58:37,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-14 17:58:37,620 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-14 17:58:37,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-14 17:58:37,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=633, Invalid=699, Unknown=0, NotChecked=0, Total=1332 [2018-10-14 17:58:37,621 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 37 states. [2018-10-14 17:58:38,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:58:38,696 INFO L93 Difference]: Finished difference Result 178 states and 178 transitions. [2018-10-14 17:58:38,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-14 17:58:38,697 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 172 [2018-10-14 17:58:38,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:58:38,698 INFO L225 Difference]: With dead ends: 178 [2018-10-14 17:58:38,698 INFO L226 Difference]: Without dead ends: 178 [2018-10-14 17:58:38,699 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1854, Invalid=2976, Unknown=0, NotChecked=0, Total=4830 [2018-10-14 17:58:38,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-10-14 17:58:38,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 176. [2018-10-14 17:58:38,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-10-14 17:58:38,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2018-10-14 17:58:38,702 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 172 [2018-10-14 17:58:38,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:58:38,703 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2018-10-14 17:58:38,703 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-14 17:58:38,703 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2018-10-14 17:58:38,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-10-14 17:58:38,704 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:58:38,704 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:58:38,704 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:58:38,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:58:38,704 INFO L82 PathProgramCache]: Analyzing trace with hash 319982037, now seen corresponding path program 34 times [2018-10-14 17:58:38,705 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:58:38,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:58:39,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 0 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:58:39,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:58:39,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-14 17:58:39,451 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-14 17:58:39,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-14 17:58:39,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=669, Invalid=737, Unknown=0, NotChecked=0, Total=1406 [2018-10-14 17:58:39,451 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 38 states. [2018-10-14 17:58:40,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:58:40,626 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2018-10-14 17:58:40,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-14 17:58:40,626 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 175 [2018-10-14 17:58:40,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:58:40,627 INFO L225 Difference]: With dead ends: 181 [2018-10-14 17:58:40,627 INFO L226 Difference]: Without dead ends: 181 [2018-10-14 17:58:40,627 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1961, Invalid=3151, Unknown=0, NotChecked=0, Total=5112 [2018-10-14 17:58:40,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-10-14 17:58:40,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 179. [2018-10-14 17:58:40,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-10-14 17:58:40,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2018-10-14 17:58:40,630 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 179 transitions. Word has length 175 [2018-10-14 17:58:40,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:58:40,630 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 179 transitions. [2018-10-14 17:58:40,630 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-14 17:58:40,630 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 179 transitions. [2018-10-14 17:58:40,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-14 17:58:40,631 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:58:40,631 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:58:40,631 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:58:40,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:58:40,632 INFO L82 PathProgramCache]: Analyzing trace with hash -539080507, now seen corresponding path program 35 times [2018-10-14 17:58:40,632 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:58:40,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:58:41,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 0 proven. 1820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:58:41,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:58:41,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-14 17:58:41,459 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-14 17:58:41,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-14 17:58:41,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=706, Invalid=776, Unknown=0, NotChecked=0, Total=1482 [2018-10-14 17:58:41,460 INFO L87 Difference]: Start difference. First operand 179 states and 179 transitions. Second operand 39 states. [2018-10-14 17:58:42,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:58:42,482 INFO L93 Difference]: Finished difference Result 184 states and 184 transitions. [2018-10-14 17:58:42,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-14 17:58:42,482 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 178 [2018-10-14 17:58:42,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:58:42,484 INFO L225 Difference]: With dead ends: 184 [2018-10-14 17:58:42,484 INFO L226 Difference]: Without dead ends: 184 [2018-10-14 17:58:42,485 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2071, Invalid=3331, Unknown=0, NotChecked=0, Total=5402 [2018-10-14 17:58:42,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-10-14 17:58:42,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 182. [2018-10-14 17:58:42,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-10-14 17:58:42,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 182 transitions. [2018-10-14 17:58:42,488 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 182 transitions. Word has length 178 [2018-10-14 17:58:42,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:58:42,488 INFO L481 AbstractCegarLoop]: Abstraction has 182 states and 182 transitions. [2018-10-14 17:58:42,489 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-14 17:58:42,489 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 182 transitions. [2018-10-14 17:58:42,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-10-14 17:58:42,490 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:58:42,490 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:58:42,490 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:58:42,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:58:42,490 INFO L82 PathProgramCache]: Analyzing trace with hash 838788053, now seen corresponding path program 36 times [2018-10-14 17:58:42,491 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:58:42,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:58:43,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 0 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:58:43,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:58:43,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-14 17:58:43,392 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-14 17:58:43,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-14 17:58:43,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=744, Invalid=816, Unknown=0, NotChecked=0, Total=1560 [2018-10-14 17:58:43,393 INFO L87 Difference]: Start difference. First operand 182 states and 182 transitions. Second operand 40 states. [2018-10-14 17:58:44,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:58:44,536 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2018-10-14 17:58:44,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-14 17:58:44,537 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 181 [2018-10-14 17:58:44,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:58:44,538 INFO L225 Difference]: With dead ends: 187 [2018-10-14 17:58:44,538 INFO L226 Difference]: Without dead ends: 187 [2018-10-14 17:58:44,539 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2184, Invalid=3516, Unknown=0, NotChecked=0, Total=5700 [2018-10-14 17:58:44,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-10-14 17:58:44,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2018-10-14 17:58:44,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-10-14 17:58:44,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2018-10-14 17:58:44,542 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 181 [2018-10-14 17:58:44,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:58:44,542 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2018-10-14 17:58:44,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-14 17:58:44,542 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2018-10-14 17:58:44,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-14 17:58:44,543 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:58:44,543 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:58:44,544 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:58:44,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:58:44,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1918611141, now seen corresponding path program 37 times [2018-10-14 17:58:44,544 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:58:44,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:58:45,565 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 0 proven. 2035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:58:45,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:58:45,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-14 17:58:45,566 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-14 17:58:45,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-14 17:58:45,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=783, Invalid=857, Unknown=0, NotChecked=0, Total=1640 [2018-10-14 17:58:45,567 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 41 states. [2018-10-14 17:58:47,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:58:47,330 INFO L93 Difference]: Finished difference Result 190 states and 190 transitions. [2018-10-14 17:58:47,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-14 17:58:47,330 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 184 [2018-10-14 17:58:47,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:58:47,331 INFO L225 Difference]: With dead ends: 190 [2018-10-14 17:58:47,331 INFO L226 Difference]: Without dead ends: 190 [2018-10-14 17:58:47,332 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2300, Invalid=3706, Unknown=0, NotChecked=0, Total=6006 [2018-10-14 17:58:47,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-10-14 17:58:47,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 188. [2018-10-14 17:58:47,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-10-14 17:58:47,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 188 transitions. [2018-10-14 17:58:47,335 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 188 transitions. Word has length 184 [2018-10-14 17:58:47,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:58:47,335 INFO L481 AbstractCegarLoop]: Abstraction has 188 states and 188 transitions. [2018-10-14 17:58:47,335 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-14 17:58:47,335 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 188 transitions. [2018-10-14 17:58:47,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-10-14 17:58:47,336 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:58:47,336 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:58:47,336 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:58:47,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:58:47,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1623178709, now seen corresponding path program 38 times [2018-10-14 17:58:47,337 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:58:47,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:58:49,032 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 0 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:58:49,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:58:49,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-14 17:58:49,033 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-14 17:58:49,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-14 17:58:49,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=823, Invalid=899, Unknown=0, NotChecked=0, Total=1722 [2018-10-14 17:58:49,033 INFO L87 Difference]: Start difference. First operand 188 states and 188 transitions. Second operand 42 states. [2018-10-14 17:58:50,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:58:50,335 INFO L93 Difference]: Finished difference Result 193 states and 193 transitions. [2018-10-14 17:58:50,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-14 17:58:50,335 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 187 [2018-10-14 17:58:50,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:58:50,336 INFO L225 Difference]: With dead ends: 193 [2018-10-14 17:58:50,336 INFO L226 Difference]: Without dead ends: 193 [2018-10-14 17:58:50,337 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2419, Invalid=3901, Unknown=0, NotChecked=0, Total=6320 [2018-10-14 17:58:50,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-10-14 17:58:50,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 191. [2018-10-14 17:58:50,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-10-14 17:58:50,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2018-10-14 17:58:50,340 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 187 [2018-10-14 17:58:50,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:58:50,340 INFO L481 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2018-10-14 17:58:50,340 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-14 17:58:50,340 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2018-10-14 17:58:50,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-14 17:58:50,341 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:58:50,341 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:58:50,342 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:58:50,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:58:50,342 INFO L82 PathProgramCache]: Analyzing trace with hash 783586501, now seen corresponding path program 39 times [2018-10-14 17:58:50,343 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:58:50,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:58:51,333 INFO L134 CoverageAnalysis]: Checked inductivity of 2262 backedges. 0 proven. 2262 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:58:51,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:58:51,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-14 17:58:51,334 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-14 17:58:51,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-14 17:58:51,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=864, Invalid=942, Unknown=0, NotChecked=0, Total=1806 [2018-10-14 17:58:51,334 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 43 states. [2018-10-14 17:58:52,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:58:52,768 INFO L93 Difference]: Finished difference Result 196 states and 196 transitions. [2018-10-14 17:58:52,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-14 17:58:52,769 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 190 [2018-10-14 17:58:52,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:58:52,770 INFO L225 Difference]: With dead ends: 196 [2018-10-14 17:58:52,770 INFO L226 Difference]: Without dead ends: 196 [2018-10-14 17:58:52,771 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2541, Invalid=4101, Unknown=0, NotChecked=0, Total=6642 [2018-10-14 17:58:52,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-10-14 17:58:52,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 194. [2018-10-14 17:58:52,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-10-14 17:58:52,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 194 transitions. [2018-10-14 17:58:52,774 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 194 transitions. Word has length 190 [2018-10-14 17:58:52,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:58:52,774 INFO L481 AbstractCegarLoop]: Abstraction has 194 states and 194 transitions. [2018-10-14 17:58:52,774 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-14 17:58:52,774 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 194 transitions. [2018-10-14 17:58:52,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-10-14 17:58:52,775 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:58:52,775 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:58:52,776 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:58:52,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:58:52,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1913317419, now seen corresponding path program 40 times [2018-10-14 17:58:52,776 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:58:52,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:58:53,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 2380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:58:53,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:58:53,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-14 17:58:53,785 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-14 17:58:53,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-14 17:58:53,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=906, Invalid=986, Unknown=0, NotChecked=0, Total=1892 [2018-10-14 17:58:53,785 INFO L87 Difference]: Start difference. First operand 194 states and 194 transitions. Second operand 44 states. [2018-10-14 17:58:55,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:58:55,209 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2018-10-14 17:58:55,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-14 17:58:55,216 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 193 [2018-10-14 17:58:55,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:58:55,217 INFO L225 Difference]: With dead ends: 199 [2018-10-14 17:58:55,217 INFO L226 Difference]: Without dead ends: 199 [2018-10-14 17:58:55,218 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2666, Invalid=4306, Unknown=0, NotChecked=0, Total=6972 [2018-10-14 17:58:55,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-10-14 17:58:55,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 197. [2018-10-14 17:58:55,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-10-14 17:58:55,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2018-10-14 17:58:55,221 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 193 [2018-10-14 17:58:55,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:58:55,221 INFO L481 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2018-10-14 17:58:55,221 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-14 17:58:55,221 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2018-10-14 17:58:55,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-10-14 17:58:55,222 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:58:55,222 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:58:55,222 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:58:55,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:58:55,223 INFO L82 PathProgramCache]: Analyzing trace with hash 575208133, now seen corresponding path program 41 times [2018-10-14 17:58:55,223 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:58:55,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:58:56,221 INFO L134 CoverageAnalysis]: Checked inductivity of 2501 backedges. 0 proven. 2501 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:58:56,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:58:56,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-14 17:58:56,222 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-14 17:58:56,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-14 17:58:56,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=949, Invalid=1031, Unknown=0, NotChecked=0, Total=1980 [2018-10-14 17:58:56,222 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 45 states. [2018-10-14 17:58:57,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:58:57,844 INFO L93 Difference]: Finished difference Result 202 states and 202 transitions. [2018-10-14 17:58:57,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-14 17:58:57,845 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 196 [2018-10-14 17:58:57,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:58:57,846 INFO L225 Difference]: With dead ends: 202 [2018-10-14 17:58:57,846 INFO L226 Difference]: Without dead ends: 202 [2018-10-14 17:58:57,846 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2794, Invalid=4516, Unknown=0, NotChecked=0, Total=7310 [2018-10-14 17:58:57,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-10-14 17:58:57,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 200. [2018-10-14 17:58:57,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-10-14 17:58:57,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 200 transitions. [2018-10-14 17:58:57,850 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 200 transitions. Word has length 196 [2018-10-14 17:58:57,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:58:57,850 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 200 transitions. [2018-10-14 17:58:57,850 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-14 17:58:57,850 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 200 transitions. [2018-10-14 17:58:57,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-14 17:58:57,851 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:58:57,852 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:58:57,852 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:58:57,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:58:57,852 INFO L82 PathProgramCache]: Analyzing trace with hash 809431509, now seen corresponding path program 42 times [2018-10-14 17:58:57,853 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:58:57,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:58:58,919 INFO L134 CoverageAnalysis]: Checked inductivity of 2625 backedges. 0 proven. 2625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:58:58,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:58:58,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-14 17:58:58,920 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-14 17:58:58,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-14 17:58:58,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=993, Invalid=1077, Unknown=0, NotChecked=0, Total=2070 [2018-10-14 17:58:58,921 INFO L87 Difference]: Start difference. First operand 200 states and 200 transitions. Second operand 46 states. [2018-10-14 17:59:00,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:59:00,254 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2018-10-14 17:59:00,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-14 17:59:00,255 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 199 [2018-10-14 17:59:00,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:59:00,256 INFO L225 Difference]: With dead ends: 205 [2018-10-14 17:59:00,256 INFO L226 Difference]: Without dead ends: 205 [2018-10-14 17:59:00,256 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2925, Invalid=4731, Unknown=0, NotChecked=0, Total=7656 [2018-10-14 17:59:00,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-10-14 17:59:00,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 203. [2018-10-14 17:59:00,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-10-14 17:59:00,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 203 transitions. [2018-10-14 17:59:00,260 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 203 transitions. Word has length 199 [2018-10-14 17:59:00,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:59:00,260 INFO L481 AbstractCegarLoop]: Abstraction has 203 states and 203 transitions. [2018-10-14 17:59:00,260 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-14 17:59:00,260 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 203 transitions. [2018-10-14 17:59:00,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-10-14 17:59:00,261 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:59:00,261 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:59:00,261 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:59:00,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:59:00,262 INFO L82 PathProgramCache]: Analyzing trace with hash -763830075, now seen corresponding path program 43 times [2018-10-14 17:59:00,262 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:59:00,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:59:01,799 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 0 proven. 2752 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:59:01,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:59:01,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-14 17:59:01,800 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-14 17:59:01,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-14 17:59:01,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1038, Invalid=1124, Unknown=0, NotChecked=0, Total=2162 [2018-10-14 17:59:01,801 INFO L87 Difference]: Start difference. First operand 203 states and 203 transitions. Second operand 47 states. [2018-10-14 17:59:03,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:59:03,284 INFO L93 Difference]: Finished difference Result 208 states and 208 transitions. [2018-10-14 17:59:03,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-14 17:59:03,284 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 202 [2018-10-14 17:59:03,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:59:03,285 INFO L225 Difference]: With dead ends: 208 [2018-10-14 17:59:03,285 INFO L226 Difference]: Without dead ends: 208 [2018-10-14 17:59:03,286 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3059, Invalid=4951, Unknown=0, NotChecked=0, Total=8010 [2018-10-14 17:59:03,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-10-14 17:59:03,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 206. [2018-10-14 17:59:03,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-10-14 17:59:03,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 206 transitions. [2018-10-14 17:59:03,288 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 206 transitions. Word has length 202 [2018-10-14 17:59:03,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:59:03,289 INFO L481 AbstractCegarLoop]: Abstraction has 206 states and 206 transitions. [2018-10-14 17:59:03,289 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-14 17:59:03,289 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 206 transitions. [2018-10-14 17:59:03,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-10-14 17:59:03,289 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:59:03,290 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:59:03,290 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:59:03,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:59:03,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1178422229, now seen corresponding path program 44 times [2018-10-14 17:59:03,291 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:59:03,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:59:04,834 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 0 proven. 2882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:59:04,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:59:04,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-14 17:59:04,834 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-14 17:59:04,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-14 17:59:04,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1084, Invalid=1172, Unknown=0, NotChecked=0, Total=2256 [2018-10-14 17:59:04,835 INFO L87 Difference]: Start difference. First operand 206 states and 206 transitions. Second operand 48 states. [2018-10-14 17:59:06,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:59:06,323 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2018-10-14 17:59:06,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-14 17:59:06,323 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 205 [2018-10-14 17:59:06,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:59:06,324 INFO L225 Difference]: With dead ends: 211 [2018-10-14 17:59:06,324 INFO L226 Difference]: Without dead ends: 211 [2018-10-14 17:59:06,325 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 990 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3196, Invalid=5176, Unknown=0, NotChecked=0, Total=8372 [2018-10-14 17:59:06,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-10-14 17:59:06,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2018-10-14 17:59:06,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-10-14 17:59:06,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2018-10-14 17:59:06,328 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 205 [2018-10-14 17:59:06,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:59:06,328 INFO L481 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2018-10-14 17:59:06,328 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-14 17:59:06,328 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2018-10-14 17:59:06,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-10-14 17:59:06,329 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:59:06,330 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:59:06,330 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:59:06,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:59:06,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1017398981, now seen corresponding path program 45 times [2018-10-14 17:59:06,331 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:59:06,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:59:07,438 INFO L134 CoverageAnalysis]: Checked inductivity of 3015 backedges. 0 proven. 3015 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:59:07,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:59:07,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-14 17:59:07,439 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-14 17:59:07,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-14 17:59:07,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1131, Invalid=1221, Unknown=0, NotChecked=0, Total=2352 [2018-10-14 17:59:07,440 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 49 states. [2018-10-14 17:59:09,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:59:09,130 INFO L93 Difference]: Finished difference Result 214 states and 214 transitions. [2018-10-14 17:59:09,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-14 17:59:09,131 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 208 [2018-10-14 17:59:09,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:59:09,131 INFO L225 Difference]: With dead ends: 214 [2018-10-14 17:59:09,132 INFO L226 Difference]: Without dead ends: 214 [2018-10-14 17:59:09,132 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3336, Invalid=5406, Unknown=0, NotChecked=0, Total=8742 [2018-10-14 17:59:09,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-10-14 17:59:09,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 212. [2018-10-14 17:59:09,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-10-14 17:59:09,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 212 transitions. [2018-10-14 17:59:09,135 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 212 transitions. Word has length 208 [2018-10-14 17:59:09,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:59:09,136 INFO L481 AbstractCegarLoop]: Abstraction has 212 states and 212 transitions. [2018-10-14 17:59:09,136 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-14 17:59:09,136 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 212 transitions. [2018-10-14 17:59:09,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-10-14 17:59:09,137 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:59:09,137 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:59:09,137 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:59:09,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:59:09,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1452287445, now seen corresponding path program 46 times [2018-10-14 17:59:09,138 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:59:09,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:59:10,301 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:59:10,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:59:10,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-14 17:59:10,302 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-14 17:59:10,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-14 17:59:10,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1179, Invalid=1271, Unknown=0, NotChecked=0, Total=2450 [2018-10-14 17:59:10,303 INFO L87 Difference]: Start difference. First operand 212 states and 212 transitions. Second operand 50 states. [2018-10-14 17:59:12,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:59:12,082 INFO L93 Difference]: Finished difference Result 217 states and 217 transitions. [2018-10-14 17:59:12,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-14 17:59:12,082 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 211 [2018-10-14 17:59:12,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:59:12,083 INFO L225 Difference]: With dead ends: 217 [2018-10-14 17:59:12,083 INFO L226 Difference]: Without dead ends: 217 [2018-10-14 17:59:12,084 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1081 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3479, Invalid=5641, Unknown=0, NotChecked=0, Total=9120 [2018-10-14 17:59:12,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-10-14 17:59:12,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 215. [2018-10-14 17:59:12,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-10-14 17:59:12,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 215 transitions. [2018-10-14 17:59:12,086 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 215 transitions. Word has length 211 [2018-10-14 17:59:12,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:59:12,087 INFO L481 AbstractCegarLoop]: Abstraction has 215 states and 215 transitions. [2018-10-14 17:59:12,087 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-14 17:59:12,087 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 215 transitions. [2018-10-14 17:59:12,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-10-14 17:59:12,088 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:59:12,088 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:59:12,088 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:59:12,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:59:12,088 INFO L82 PathProgramCache]: Analyzing trace with hash -701813563, now seen corresponding path program 47 times [2018-10-14 17:59:12,089 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:59:12,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:59:13,332 INFO L134 CoverageAnalysis]: Checked inductivity of 3290 backedges. 0 proven. 3290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:59:13,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:59:13,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-14 17:59:13,333 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-14 17:59:13,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-14 17:59:13,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1228, Invalid=1322, Unknown=0, NotChecked=0, Total=2550 [2018-10-14 17:59:13,334 INFO L87 Difference]: Start difference. First operand 215 states and 215 transitions. Second operand 51 states. [2018-10-14 17:59:15,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:59:15,156 INFO L93 Difference]: Finished difference Result 220 states and 220 transitions. [2018-10-14 17:59:15,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-14 17:59:15,156 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 214 [2018-10-14 17:59:15,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:59:15,157 INFO L225 Difference]: With dead ends: 220 [2018-10-14 17:59:15,157 INFO L226 Difference]: Without dead ends: 220 [2018-10-14 17:59:15,158 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3625, Invalid=5881, Unknown=0, NotChecked=0, Total=9506 [2018-10-14 17:59:15,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-10-14 17:59:15,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 218. [2018-10-14 17:59:15,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-10-14 17:59:15,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 218 transitions. [2018-10-14 17:59:15,161 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 218 transitions. Word has length 214 [2018-10-14 17:59:15,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:59:15,161 INFO L481 AbstractCegarLoop]: Abstraction has 218 states and 218 transitions. [2018-10-14 17:59:15,162 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-14 17:59:15,162 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 218 transitions. [2018-10-14 17:59:15,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-10-14 17:59:15,163 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:59:15,163 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:59:15,163 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:59:15,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:59:15,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1876393941, now seen corresponding path program 48 times [2018-10-14 17:59:15,164 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:59:15,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:59:16,643 INFO L134 CoverageAnalysis]: Checked inductivity of 3432 backedges. 0 proven. 3432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:59:16,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:59:16,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-10-14 17:59:16,644 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-14 17:59:16,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-14 17:59:16,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1278, Invalid=1374, Unknown=0, NotChecked=0, Total=2652 [2018-10-14 17:59:16,645 INFO L87 Difference]: Start difference. First operand 218 states and 218 transitions. Second operand 52 states. [2018-10-14 17:59:18,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:59:18,521 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2018-10-14 17:59:18,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-14 17:59:18,521 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 217 [2018-10-14 17:59:18,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:59:18,522 INFO L225 Difference]: With dead ends: 223 [2018-10-14 17:59:18,522 INFO L226 Difference]: Without dead ends: 223 [2018-10-14 17:59:18,523 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3774, Invalid=6126, Unknown=0, NotChecked=0, Total=9900 [2018-10-14 17:59:18,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-10-14 17:59:18,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 221. [2018-10-14 17:59:18,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-10-14 17:59:18,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2018-10-14 17:59:18,526 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 217 [2018-10-14 17:59:18,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:59:18,526 INFO L481 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2018-10-14 17:59:18,526 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-14 17:59:18,526 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2018-10-14 17:59:18,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-10-14 17:59:18,527 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:59:18,527 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:59:18,527 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:59:18,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:59:18,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1938976059, now seen corresponding path program 49 times [2018-10-14 17:59:18,528 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:59:18,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:59:19,774 INFO L134 CoverageAnalysis]: Checked inductivity of 3577 backedges. 0 proven. 3577 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:59:19,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:59:19,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-14 17:59:19,774 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-14 17:59:19,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-14 17:59:19,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1329, Invalid=1427, Unknown=0, NotChecked=0, Total=2756 [2018-10-14 17:59:19,775 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 53 states. [2018-10-14 17:59:21,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:59:21,768 INFO L93 Difference]: Finished difference Result 226 states and 226 transitions. [2018-10-14 17:59:21,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-14 17:59:21,769 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 220 [2018-10-14 17:59:21,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:59:21,770 INFO L225 Difference]: With dead ends: 226 [2018-10-14 17:59:21,770 INFO L226 Difference]: Without dead ends: 226 [2018-10-14 17:59:21,771 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3926, Invalid=6376, Unknown=0, NotChecked=0, Total=10302 [2018-10-14 17:59:21,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-10-14 17:59:21,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 224. [2018-10-14 17:59:21,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-10-14 17:59:21,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 224 transitions. [2018-10-14 17:59:21,775 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 224 transitions. Word has length 220 [2018-10-14 17:59:21,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:59:21,775 INFO L481 AbstractCegarLoop]: Abstraction has 224 states and 224 transitions. [2018-10-14 17:59:21,775 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-14 17:59:21,775 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 224 transitions. [2018-10-14 17:59:21,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-10-14 17:59:21,776 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:59:21,777 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:59:21,777 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:59:21,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:59:21,777 INFO L82 PathProgramCache]: Analyzing trace with hash 682842581, now seen corresponding path program 50 times [2018-10-14 17:59:21,778 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:59:21,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:59:23,298 INFO L134 CoverageAnalysis]: Checked inductivity of 3725 backedges. 0 proven. 3725 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:59:23,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:59:23,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-10-14 17:59:23,298 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-14 17:59:23,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-14 17:59:23,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1381, Invalid=1481, Unknown=0, NotChecked=0, Total=2862 [2018-10-14 17:59:23,299 INFO L87 Difference]: Start difference. First operand 224 states and 224 transitions. Second operand 54 states. [2018-10-14 17:59:25,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:59:25,261 INFO L93 Difference]: Finished difference Result 229 states and 229 transitions. [2018-10-14 17:59:25,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-14 17:59:25,262 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 223 [2018-10-14 17:59:25,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:59:25,263 INFO L225 Difference]: With dead ends: 229 [2018-10-14 17:59:25,263 INFO L226 Difference]: Without dead ends: 229 [2018-10-14 17:59:25,264 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1275 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4081, Invalid=6631, Unknown=0, NotChecked=0, Total=10712 [2018-10-14 17:59:25,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-10-14 17:59:25,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 227. [2018-10-14 17:59:25,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-10-14 17:59:25,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2018-10-14 17:59:25,267 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 223 [2018-10-14 17:59:25,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:59:25,267 INFO L481 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2018-10-14 17:59:25,267 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-14 17:59:25,267 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2018-10-14 17:59:25,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-10-14 17:59:25,270 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:59:25,270 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:59:25,270 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:59:25,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:59:25,271 INFO L82 PathProgramCache]: Analyzing trace with hash -993298235, now seen corresponding path program 51 times [2018-10-14 17:59:25,271 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:59:25,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:59:26,936 INFO L134 CoverageAnalysis]: Checked inductivity of 3876 backedges. 0 proven. 3876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:59:26,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:59:26,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-14 17:59:26,937 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-14 17:59:26,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-14 17:59:26,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1434, Invalid=1536, Unknown=0, NotChecked=0, Total=2970 [2018-10-14 17:59:26,938 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 55 states. [2018-10-14 17:59:29,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:59:29,013 INFO L93 Difference]: Finished difference Result 232 states and 232 transitions. [2018-10-14 17:59:29,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-14 17:59:29,013 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 226 [2018-10-14 17:59:29,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:59:29,014 INFO L225 Difference]: With dead ends: 232 [2018-10-14 17:59:29,014 INFO L226 Difference]: Without dead ends: 232 [2018-10-14 17:59:29,015 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1326 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4239, Invalid=6891, Unknown=0, NotChecked=0, Total=11130 [2018-10-14 17:59:29,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-10-14 17:59:29,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 230. [2018-10-14 17:59:29,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-10-14 17:59:29,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 230 transitions. [2018-10-14 17:59:29,018 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 230 transitions. Word has length 226 [2018-10-14 17:59:29,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:59:29,019 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 230 transitions. [2018-10-14 17:59:29,019 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-14 17:59:29,019 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 230 transitions. [2018-10-14 17:59:29,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-10-14 17:59:29,020 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:59:29,020 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:59:29,020 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:59:29,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:59:29,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1614564395, now seen corresponding path program 52 times [2018-10-14 17:59:29,021 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:59:29,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:59:30,449 INFO L134 CoverageAnalysis]: Checked inductivity of 4030 backedges. 0 proven. 4030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:59:30,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:59:30,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-10-14 17:59:30,449 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-14 17:59:30,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-14 17:59:30,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1488, Invalid=1592, Unknown=0, NotChecked=0, Total=3080 [2018-10-14 17:59:30,450 INFO L87 Difference]: Start difference. First operand 230 states and 230 transitions. Second operand 56 states. [2018-10-14 17:59:32,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:59:32,615 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2018-10-14 17:59:32,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-14 17:59:32,615 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 229 [2018-10-14 17:59:32,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:59:32,617 INFO L225 Difference]: With dead ends: 235 [2018-10-14 17:59:32,617 INFO L226 Difference]: Without dead ends: 235 [2018-10-14 17:59:32,618 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1378 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4400, Invalid=7156, Unknown=0, NotChecked=0, Total=11556 [2018-10-14 17:59:32,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-10-14 17:59:32,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 233. [2018-10-14 17:59:32,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-10-14 17:59:32,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2018-10-14 17:59:32,621 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 229 [2018-10-14 17:59:32,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:59:32,621 INFO L481 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2018-10-14 17:59:32,621 INFO L482 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-14 17:59:32,621 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2018-10-14 17:59:32,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-10-14 17:59:32,622 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:59:32,624 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:59:32,624 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:59:32,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:59:32,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1554308805, now seen corresponding path program 53 times [2018-10-14 17:59:32,625 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:59:32,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:59:34,260 INFO L134 CoverageAnalysis]: Checked inductivity of 4187 backedges. 0 proven. 4187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:59:34,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:59:34,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-14 17:59:34,260 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-14 17:59:34,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-14 17:59:34,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1543, Invalid=1649, Unknown=0, NotChecked=0, Total=3192 [2018-10-14 17:59:34,261 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 57 states. [2018-10-14 17:59:36,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:59:36,467 INFO L93 Difference]: Finished difference Result 238 states and 238 transitions. [2018-10-14 17:59:36,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-14 17:59:36,467 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 232 [2018-10-14 17:59:36,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:59:36,468 INFO L225 Difference]: With dead ends: 238 [2018-10-14 17:59:36,468 INFO L226 Difference]: Without dead ends: 238 [2018-10-14 17:59:36,469 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1431 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4564, Invalid=7426, Unknown=0, NotChecked=0, Total=11990 [2018-10-14 17:59:36,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-10-14 17:59:36,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 236. [2018-10-14 17:59:36,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-10-14 17:59:36,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 236 transitions. [2018-10-14 17:59:36,471 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 236 transitions. Word has length 232 [2018-10-14 17:59:36,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:59:36,471 INFO L481 AbstractCegarLoop]: Abstraction has 236 states and 236 transitions. [2018-10-14 17:59:36,471 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-14 17:59:36,471 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 236 transitions. [2018-10-14 17:59:36,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-10-14 17:59:36,472 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:59:36,472 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:59:36,472 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:59:36,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:59:36,473 INFO L82 PathProgramCache]: Analyzing trace with hash 2074643925, now seen corresponding path program 54 times [2018-10-14 17:59:36,473 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:59:36,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:59:37,987 INFO L134 CoverageAnalysis]: Checked inductivity of 4347 backedges. 0 proven. 4347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:59:37,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:59:37,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-10-14 17:59:37,987 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-14 17:59:37,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-14 17:59:37,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1599, Invalid=1707, Unknown=0, NotChecked=0, Total=3306 [2018-10-14 17:59:37,988 INFO L87 Difference]: Start difference. First operand 236 states and 236 transitions. Second operand 58 states. [2018-10-14 17:59:40,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:59:40,110 INFO L93 Difference]: Finished difference Result 241 states and 241 transitions. [2018-10-14 17:59:40,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-14 17:59:40,110 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 235 [2018-10-14 17:59:40,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:59:40,111 INFO L225 Difference]: With dead ends: 241 [2018-10-14 17:59:40,111 INFO L226 Difference]: Without dead ends: 241 [2018-10-14 17:59:40,112 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1485 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4731, Invalid=7701, Unknown=0, NotChecked=0, Total=12432 [2018-10-14 17:59:40,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-10-14 17:59:40,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 239. [2018-10-14 17:59:40,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-10-14 17:59:40,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 239 transitions. [2018-10-14 17:59:40,115 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 239 transitions. Word has length 235 [2018-10-14 17:59:40,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:59:40,116 INFO L481 AbstractCegarLoop]: Abstraction has 239 states and 239 transitions. [2018-10-14 17:59:40,116 INFO L482 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-14 17:59:40,116 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 239 transitions. [2018-10-14 17:59:40,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-10-14 17:59:40,117 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:59:40,117 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:59:40,118 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:59:40,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:59:40,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1453734715, now seen corresponding path program 55 times [2018-10-14 17:59:40,118 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:59:40,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:59:41,812 INFO L134 CoverageAnalysis]: Checked inductivity of 4510 backedges. 0 proven. 4510 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:59:41,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:59:41,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-14 17:59:41,813 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-14 17:59:41,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-14 17:59:41,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1656, Invalid=1766, Unknown=0, NotChecked=0, Total=3422 [2018-10-14 17:59:41,814 INFO L87 Difference]: Start difference. First operand 239 states and 239 transitions. Second operand 59 states. [2018-10-14 17:59:44,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:59:44,172 INFO L93 Difference]: Finished difference Result 244 states and 244 transitions. [2018-10-14 17:59:44,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-14 17:59:44,172 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 238 [2018-10-14 17:59:44,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:59:44,173 INFO L225 Difference]: With dead ends: 244 [2018-10-14 17:59:44,173 INFO L226 Difference]: Without dead ends: 244 [2018-10-14 17:59:44,174 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1540 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4901, Invalid=7981, Unknown=0, NotChecked=0, Total=12882 [2018-10-14 17:59:44,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-10-14 17:59:44,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 242. [2018-10-14 17:59:44,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-10-14 17:59:44,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 242 transitions. [2018-10-14 17:59:44,177 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 242 transitions. Word has length 238 [2018-10-14 17:59:44,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:59:44,177 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 242 transitions. [2018-10-14 17:59:44,177 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-14 17:59:44,177 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 242 transitions. [2018-10-14 17:59:44,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-10-14 17:59:44,178 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:59:44,178 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:59:44,179 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:59:44,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:59:44,179 INFO L82 PathProgramCache]: Analyzing trace with hash -352196651, now seen corresponding path program 56 times [2018-10-14 17:59:44,179 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:59:44,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:59:45,843 INFO L134 CoverageAnalysis]: Checked inductivity of 4676 backedges. 0 proven. 4676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:59:45,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:59:45,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-10-14 17:59:45,844 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-14 17:59:45,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-14 17:59:45,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1714, Invalid=1826, Unknown=0, NotChecked=0, Total=3540 [2018-10-14 17:59:45,845 INFO L87 Difference]: Start difference. First operand 242 states and 242 transitions. Second operand 60 states. [2018-10-14 17:59:48,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:59:48,401 INFO L93 Difference]: Finished difference Result 247 states and 247 transitions. [2018-10-14 17:59:48,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-14 17:59:48,401 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 241 [2018-10-14 17:59:48,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:59:48,402 INFO L225 Difference]: With dead ends: 247 [2018-10-14 17:59:48,402 INFO L226 Difference]: Without dead ends: 247 [2018-10-14 17:59:48,403 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1596 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5074, Invalid=8266, Unknown=0, NotChecked=0, Total=13340 [2018-10-14 17:59:48,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-10-14 17:59:48,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 245. [2018-10-14 17:59:48,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-10-14 17:59:48,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2018-10-14 17:59:48,405 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 241 [2018-10-14 17:59:48,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:59:48,406 INFO L481 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2018-10-14 17:59:48,406 INFO L482 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-14 17:59:48,406 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2018-10-14 17:59:48,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-10-14 17:59:48,407 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:59:48,407 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:59:48,407 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:59:48,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:59:48,408 INFO L82 PathProgramCache]: Analyzing trace with hash 2018126533, now seen corresponding path program 57 times [2018-10-14 17:59:48,408 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:59:48,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:59:50,400 INFO L134 CoverageAnalysis]: Checked inductivity of 4845 backedges. 0 proven. 4845 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:59:50,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:59:50,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-14 17:59:50,401 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-14 17:59:50,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-14 17:59:50,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1773, Invalid=1887, Unknown=0, NotChecked=0, Total=3660 [2018-10-14 17:59:50,402 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 61 states. [2018-10-14 17:59:53,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:59:53,049 INFO L93 Difference]: Finished difference Result 250 states and 250 transitions. [2018-10-14 17:59:53,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-14 17:59:53,050 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 244 [2018-10-14 17:59:53,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:59:53,051 INFO L225 Difference]: With dead ends: 250 [2018-10-14 17:59:53,051 INFO L226 Difference]: Without dead ends: 250 [2018-10-14 17:59:53,052 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1653 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5250, Invalid=8556, Unknown=0, NotChecked=0, Total=13806 [2018-10-14 17:59:53,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-10-14 17:59:53,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2018-10-14 17:59:53,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-10-14 17:59:53,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 248 transitions. [2018-10-14 17:59:53,054 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 248 transitions. Word has length 244 [2018-10-14 17:59:53,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:59:53,054 INFO L481 AbstractCegarLoop]: Abstraction has 248 states and 248 transitions. [2018-10-14 17:59:53,054 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-14 17:59:53,054 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 248 transitions. [2018-10-14 17:59:53,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-10-14 17:59:53,055 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:59:53,055 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:59:53,056 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:59:53,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:59:53,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1536179755, now seen corresponding path program 58 times [2018-10-14 17:59:53,056 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:59:53,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:59:54,735 INFO L134 CoverageAnalysis]: Checked inductivity of 5017 backedges. 0 proven. 5017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:59:54,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:59:54,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-10-14 17:59:54,736 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-14 17:59:54,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-14 17:59:54,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1833, Invalid=1949, Unknown=0, NotChecked=0, Total=3782 [2018-10-14 17:59:54,737 INFO L87 Difference]: Start difference. First operand 248 states and 248 transitions. Second operand 62 states. [2018-10-14 17:59:57,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 17:59:57,497 INFO L93 Difference]: Finished difference Result 253 states and 253 transitions. [2018-10-14 17:59:57,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-14 17:59:57,498 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 247 [2018-10-14 17:59:57,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 17:59:57,499 INFO L225 Difference]: With dead ends: 253 [2018-10-14 17:59:57,499 INFO L226 Difference]: Without dead ends: 253 [2018-10-14 17:59:57,500 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1711 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5429, Invalid=8851, Unknown=0, NotChecked=0, Total=14280 [2018-10-14 17:59:57,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-10-14 17:59:57,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 251. [2018-10-14 17:59:57,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-10-14 17:59:57,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 251 transitions. [2018-10-14 17:59:57,503 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 251 transitions. Word has length 247 [2018-10-14 17:59:57,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 17:59:57,503 INFO L481 AbstractCegarLoop]: Abstraction has 251 states and 251 transitions. [2018-10-14 17:59:57,503 INFO L482 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-14 17:59:57,503 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 251 transitions. [2018-10-14 17:59:57,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-10-14 17:59:57,505 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 17:59:57,505 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 17:59:57,505 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 17:59:57,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 17:59:57,505 INFO L82 PathProgramCache]: Analyzing trace with hash 248910021, now seen corresponding path program 59 times [2018-10-14 17:59:57,506 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 17:59:57,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 17:59:59,367 INFO L134 CoverageAnalysis]: Checked inductivity of 5192 backedges. 0 proven. 5192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 17:59:59,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 17:59:59,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-14 17:59:59,368 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-14 17:59:59,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-14 17:59:59,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1894, Invalid=2012, Unknown=0, NotChecked=0, Total=3906 [2018-10-14 17:59:59,368 INFO L87 Difference]: Start difference. First operand 251 states and 251 transitions. Second operand 63 states. [2018-10-14 18:00:01,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:00:01,887 INFO L93 Difference]: Finished difference Result 256 states and 256 transitions. [2018-10-14 18:00:01,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-14 18:00:01,888 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 250 [2018-10-14 18:00:01,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:00:01,889 INFO L225 Difference]: With dead ends: 256 [2018-10-14 18:00:01,889 INFO L226 Difference]: Without dead ends: 256 [2018-10-14 18:00:01,889 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1770 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5611, Invalid=9151, Unknown=0, NotChecked=0, Total=14762 [2018-10-14 18:00:01,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-10-14 18:00:01,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 254. [2018-10-14 18:00:01,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-10-14 18:00:01,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 254 transitions. [2018-10-14 18:00:01,892 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 254 transitions. Word has length 250 [2018-10-14 18:00:01,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:00:01,892 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 254 transitions. [2018-10-14 18:00:01,893 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-14 18:00:01,893 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 254 transitions. [2018-10-14 18:00:01,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-10-14 18:00:01,894 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:00:01,894 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:00:01,894 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:00:01,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:00:01,895 INFO L82 PathProgramCache]: Analyzing trace with hash -426632235, now seen corresponding path program 60 times [2018-10-14 18:00:01,895 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:00:01,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:00:03,831 INFO L134 CoverageAnalysis]: Checked inductivity of 5370 backedges. 0 proven. 5370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:00:03,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:00:03,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-10-14 18:00:03,832 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-14 18:00:03,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-14 18:00:03,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1956, Invalid=2076, Unknown=0, NotChecked=0, Total=4032 [2018-10-14 18:00:03,833 INFO L87 Difference]: Start difference. First operand 254 states and 254 transitions. Second operand 64 states. [2018-10-14 18:00:06,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:00:06,525 INFO L93 Difference]: Finished difference Result 259 states and 259 transitions. [2018-10-14 18:00:06,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-14 18:00:06,526 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 253 [2018-10-14 18:00:06,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:00:06,527 INFO L225 Difference]: With dead ends: 259 [2018-10-14 18:00:06,527 INFO L226 Difference]: Without dead ends: 259 [2018-10-14 18:00:06,528 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1830 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5796, Invalid=9456, Unknown=0, NotChecked=0, Total=15252 [2018-10-14 18:00:06,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-10-14 18:00:06,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 257. [2018-10-14 18:00:06,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-10-14 18:00:06,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2018-10-14 18:00:06,530 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 253 [2018-10-14 18:00:06,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:00:06,530 INFO L481 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2018-10-14 18:00:06,530 INFO L482 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-14 18:00:06,530 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2018-10-14 18:00:06,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-10-14 18:00:06,531 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:00:06,531 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:00:06,531 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:00:06,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:00:06,532 INFO L82 PathProgramCache]: Analyzing trace with hash 710768325, now seen corresponding path program 61 times [2018-10-14 18:00:06,532 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:00:06,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:00:08,507 INFO L134 CoverageAnalysis]: Checked inductivity of 5551 backedges. 0 proven. 5551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:00:08,507 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:00:08,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-14 18:00:08,508 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-14 18:00:08,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-14 18:00:08,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2019, Invalid=2141, Unknown=0, NotChecked=0, Total=4160 [2018-10-14 18:00:08,508 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 65 states. [2018-10-14 18:00:11,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:00:11,085 INFO L93 Difference]: Finished difference Result 262 states and 262 transitions. [2018-10-14 18:00:11,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-14 18:00:11,086 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 256 [2018-10-14 18:00:11,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:00:11,087 INFO L225 Difference]: With dead ends: 262 [2018-10-14 18:00:11,087 INFO L226 Difference]: Without dead ends: 262 [2018-10-14 18:00:11,088 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1891 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5984, Invalid=9766, Unknown=0, NotChecked=0, Total=15750 [2018-10-14 18:00:11,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-10-14 18:00:11,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2018-10-14 18:00:11,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-10-14 18:00:11,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 260 transitions. [2018-10-14 18:00:11,091 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 260 transitions. Word has length 256 [2018-10-14 18:00:11,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:00:11,091 INFO L481 AbstractCegarLoop]: Abstraction has 260 states and 260 transitions. [2018-10-14 18:00:11,091 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-14 18:00:11,091 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 260 transitions. [2018-10-14 18:00:11,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-10-14 18:00:11,092 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:00:11,092 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:00:11,092 INFO L424 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:00:11,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:00:11,093 INFO L82 PathProgramCache]: Analyzing trace with hash 2013853141, now seen corresponding path program 62 times [2018-10-14 18:00:11,093 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:00:11,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:00:13,334 INFO L134 CoverageAnalysis]: Checked inductivity of 5735 backedges. 0 proven. 5735 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:00:13,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:00:13,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-10-14 18:00:13,335 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-14 18:00:13,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-14 18:00:13,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2083, Invalid=2207, Unknown=0, NotChecked=0, Total=4290 [2018-10-14 18:00:13,336 INFO L87 Difference]: Start difference. First operand 260 states and 260 transitions. Second operand 66 states. [2018-10-14 18:00:16,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:00:16,142 INFO L93 Difference]: Finished difference Result 265 states and 265 transitions. [2018-10-14 18:00:16,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-14 18:00:16,143 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 259 [2018-10-14 18:00:16,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:00:16,144 INFO L225 Difference]: With dead ends: 265 [2018-10-14 18:00:16,144 INFO L226 Difference]: Without dead ends: 265 [2018-10-14 18:00:16,145 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1953 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6175, Invalid=10081, Unknown=0, NotChecked=0, Total=16256 [2018-10-14 18:00:16,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-10-14 18:00:16,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 263. [2018-10-14 18:00:16,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-10-14 18:00:16,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 263 transitions. [2018-10-14 18:00:16,147 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 263 transitions. Word has length 259 [2018-10-14 18:00:16,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:00:16,147 INFO L481 AbstractCegarLoop]: Abstraction has 263 states and 263 transitions. [2018-10-14 18:00:16,147 INFO L482 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-14 18:00:16,147 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 263 transitions. [2018-10-14 18:00:16,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-10-14 18:00:16,148 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:00:16,149 INFO L375 BasicCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:00:16,149 INFO L424 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:00:16,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:00:16,149 INFO L82 PathProgramCache]: Analyzing trace with hash 4218053, now seen corresponding path program 63 times [2018-10-14 18:00:16,150 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:00:16,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:00:18,289 INFO L134 CoverageAnalysis]: Checked inductivity of 5922 backedges. 0 proven. 5922 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:00:18,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:00:18,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-14 18:00:18,290 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-14 18:00:18,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-14 18:00:18,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2148, Invalid=2274, Unknown=0, NotChecked=0, Total=4422 [2018-10-14 18:00:18,291 INFO L87 Difference]: Start difference. First operand 263 states and 263 transitions. Second operand 67 states. [2018-10-14 18:00:21,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:00:21,067 INFO L93 Difference]: Finished difference Result 268 states and 268 transitions. [2018-10-14 18:00:21,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-14 18:00:21,067 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 262 [2018-10-14 18:00:21,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:00:21,068 INFO L225 Difference]: With dead ends: 268 [2018-10-14 18:00:21,068 INFO L226 Difference]: Without dead ends: 268 [2018-10-14 18:00:21,070 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6369, Invalid=10401, Unknown=0, NotChecked=0, Total=16770 [2018-10-14 18:00:21,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-10-14 18:00:21,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 266. [2018-10-14 18:00:21,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-10-14 18:00:21,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 266 transitions. [2018-10-14 18:00:21,072 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 266 transitions. Word has length 262 [2018-10-14 18:00:21,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:00:21,073 INFO L481 AbstractCegarLoop]: Abstraction has 266 states and 266 transitions. [2018-10-14 18:00:21,073 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-14 18:00:21,073 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 266 transitions. [2018-10-14 18:00:21,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-10-14 18:00:21,074 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:00:21,074 INFO L375 BasicCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:00:21,074 INFO L424 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:00:21,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:00:21,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1485549611, now seen corresponding path program 64 times [2018-10-14 18:00:21,075 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:00:21,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:00:23,225 INFO L134 CoverageAnalysis]: Checked inductivity of 6112 backedges. 0 proven. 6112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:00:23,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:00:23,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-10-14 18:00:23,225 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-14 18:00:23,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-14 18:00:23,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2214, Invalid=2342, Unknown=0, NotChecked=0, Total=4556 [2018-10-14 18:00:23,226 INFO L87 Difference]: Start difference. First operand 266 states and 266 transitions. Second operand 68 states. [2018-10-14 18:00:26,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:00:26,211 INFO L93 Difference]: Finished difference Result 271 states and 271 transitions. [2018-10-14 18:00:26,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-14 18:00:26,212 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 265 [2018-10-14 18:00:26,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:00:26,213 INFO L225 Difference]: With dead ends: 271 [2018-10-14 18:00:26,213 INFO L226 Difference]: Without dead ends: 271 [2018-10-14 18:00:26,214 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2080 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6566, Invalid=10726, Unknown=0, NotChecked=0, Total=17292 [2018-10-14 18:00:26,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-10-14 18:00:26,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 269. [2018-10-14 18:00:26,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-10-14 18:00:26,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 269 transitions. [2018-10-14 18:00:26,216 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 269 transitions. Word has length 265 [2018-10-14 18:00:26,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:00:26,217 INFO L481 AbstractCegarLoop]: Abstraction has 269 states and 269 transitions. [2018-10-14 18:00:26,217 INFO L482 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-14 18:00:26,217 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 269 transitions. [2018-10-14 18:00:26,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-10-14 18:00:26,218 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:00:26,218 INFO L375 BasicCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:00:26,218 INFO L424 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:00:26,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:00:26,218 INFO L82 PathProgramCache]: Analyzing trace with hash 1038009029, now seen corresponding path program 65 times [2018-10-14 18:00:26,219 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:00:26,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:00:28,393 INFO L134 CoverageAnalysis]: Checked inductivity of 6305 backedges. 0 proven. 6305 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:00:28,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:00:28,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-14 18:00:28,394 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-14 18:00:28,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-14 18:00:28,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2281, Invalid=2411, Unknown=0, NotChecked=0, Total=4692 [2018-10-14 18:00:28,395 INFO L87 Difference]: Start difference. First operand 269 states and 269 transitions. Second operand 69 states. [2018-10-14 18:00:31,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:00:31,459 INFO L93 Difference]: Finished difference Result 274 states and 274 transitions. [2018-10-14 18:00:31,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-14 18:00:31,460 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 268 [2018-10-14 18:00:31,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:00:31,461 INFO L225 Difference]: With dead ends: 274 [2018-10-14 18:00:31,461 INFO L226 Difference]: Without dead ends: 274 [2018-10-14 18:00:31,462 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2145 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6766, Invalid=11056, Unknown=0, NotChecked=0, Total=17822 [2018-10-14 18:00:31,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-10-14 18:00:31,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 272. [2018-10-14 18:00:31,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-10-14 18:00:31,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 272 transitions. [2018-10-14 18:00:31,464 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 272 transitions. Word has length 268 [2018-10-14 18:00:31,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:00:31,465 INFO L481 AbstractCegarLoop]: Abstraction has 272 states and 272 transitions. [2018-10-14 18:00:31,465 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-14 18:00:31,465 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 272 transitions. [2018-10-14 18:00:31,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-10-14 18:00:31,466 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:00:31,466 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:00:31,466 INFO L424 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:00:31,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:00:31,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1265904085, now seen corresponding path program 66 times [2018-10-14 18:00:31,467 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:00:31,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:00:33,705 INFO L134 CoverageAnalysis]: Checked inductivity of 6501 backedges. 0 proven. 6501 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:00:33,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:00:33,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-10-14 18:00:33,706 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-10-14 18:00:33,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-10-14 18:00:33,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2349, Invalid=2481, Unknown=0, NotChecked=0, Total=4830 [2018-10-14 18:00:33,707 INFO L87 Difference]: Start difference. First operand 272 states and 272 transitions. Second operand 70 states. [2018-10-14 18:00:36,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:00:36,865 INFO L93 Difference]: Finished difference Result 277 states and 277 transitions. [2018-10-14 18:00:36,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-14 18:00:36,865 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 271 [2018-10-14 18:00:36,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:00:36,866 INFO L225 Difference]: With dead ends: 277 [2018-10-14 18:00:36,866 INFO L226 Difference]: Without dead ends: 277 [2018-10-14 18:00:36,867 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2211 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6969, Invalid=11391, Unknown=0, NotChecked=0, Total=18360 [2018-10-14 18:00:36,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-10-14 18:00:36,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 275. [2018-10-14 18:00:36,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-10-14 18:00:36,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 275 transitions. [2018-10-14 18:00:36,870 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 275 transitions. Word has length 271 [2018-10-14 18:00:36,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:00:36,870 INFO L481 AbstractCegarLoop]: Abstraction has 275 states and 275 transitions. [2018-10-14 18:00:36,870 INFO L482 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-10-14 18:00:36,870 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 275 transitions. [2018-10-14 18:00:36,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-10-14 18:00:36,871 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:00:36,871 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:00:36,871 INFO L424 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:00:36,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:00:36,872 INFO L82 PathProgramCache]: Analyzing trace with hash 144222405, now seen corresponding path program 67 times [2018-10-14 18:00:36,872 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:00:36,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:00:39,207 INFO L134 CoverageAnalysis]: Checked inductivity of 6700 backedges. 0 proven. 6700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:00:39,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:00:39,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-14 18:00:39,208 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-14 18:00:39,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-14 18:00:39,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2418, Invalid=2552, Unknown=0, NotChecked=0, Total=4970 [2018-10-14 18:00:39,209 INFO L87 Difference]: Start difference. First operand 275 states and 275 transitions. Second operand 71 states. [2018-10-14 18:00:42,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:00:42,366 INFO L93 Difference]: Finished difference Result 280 states and 280 transitions. [2018-10-14 18:00:42,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-14 18:00:42,366 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 274 [2018-10-14 18:00:42,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:00:42,368 INFO L225 Difference]: With dead ends: 280 [2018-10-14 18:00:42,368 INFO L226 Difference]: Without dead ends: 280 [2018-10-14 18:00:42,369 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2278 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=7175, Invalid=11731, Unknown=0, NotChecked=0, Total=18906 [2018-10-14 18:00:42,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-10-14 18:00:42,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 278. [2018-10-14 18:00:42,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-10-14 18:00:42,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 278 transitions. [2018-10-14 18:00:42,372 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 278 transitions. Word has length 274 [2018-10-14 18:00:42,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:00:42,373 INFO L481 AbstractCegarLoop]: Abstraction has 278 states and 278 transitions. [2018-10-14 18:00:42,373 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-14 18:00:42,373 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 278 transitions. [2018-10-14 18:00:42,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-10-14 18:00:42,374 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:00:42,374 INFO L375 BasicCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:00:42,374 INFO L424 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:00:42,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:00:42,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1029143595, now seen corresponding path program 68 times [2018-10-14 18:00:42,375 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:00:42,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:00:44,693 INFO L134 CoverageAnalysis]: Checked inductivity of 6902 backedges. 0 proven. 6902 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:00:44,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:00:44,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-10-14 18:00:44,694 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-14 18:00:44,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-14 18:00:44,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2488, Invalid=2624, Unknown=0, NotChecked=0, Total=5112 [2018-10-14 18:00:44,695 INFO L87 Difference]: Start difference. First operand 278 states and 278 transitions. Second operand 72 states. [2018-10-14 18:00:47,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:00:47,991 INFO L93 Difference]: Finished difference Result 283 states and 283 transitions. [2018-10-14 18:00:47,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-14 18:00:47,991 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 277 [2018-10-14 18:00:47,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:00:47,992 INFO L225 Difference]: With dead ends: 283 [2018-10-14 18:00:47,993 INFO L226 Difference]: Without dead ends: 283 [2018-10-14 18:00:47,994 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2346 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7384, Invalid=12076, Unknown=0, NotChecked=0, Total=19460 [2018-10-14 18:00:47,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-10-14 18:00:47,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 281. [2018-10-14 18:00:47,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-10-14 18:00:47,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2018-10-14 18:00:47,996 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 277 [2018-10-14 18:00:47,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:00:47,997 INFO L481 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2018-10-14 18:00:47,997 INFO L482 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-14 18:00:47,997 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2018-10-14 18:00:47,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-10-14 18:00:47,998 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:00:47,998 INFO L375 BasicCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:00:47,998 INFO L424 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:00:47,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:00:47,998 INFO L82 PathProgramCache]: Analyzing trace with hash -36827451, now seen corresponding path program 69 times [2018-10-14 18:00:47,999 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:00:48,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:00:50,396 INFO L134 CoverageAnalysis]: Checked inductivity of 7107 backedges. 0 proven. 7107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:00:50,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:00:50,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-14 18:00:50,397 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-14 18:00:50,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-14 18:00:50,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2559, Invalid=2697, Unknown=0, NotChecked=0, Total=5256 [2018-10-14 18:00:50,398 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 73 states. [2018-10-14 18:00:53,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:00:53,884 INFO L93 Difference]: Finished difference Result 286 states and 286 transitions. [2018-10-14 18:00:53,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-14 18:00:53,885 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 280 [2018-10-14 18:00:53,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:00:53,886 INFO L225 Difference]: With dead ends: 286 [2018-10-14 18:00:53,886 INFO L226 Difference]: Without dead ends: 286 [2018-10-14 18:00:53,888 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2415 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7596, Invalid=12426, Unknown=0, NotChecked=0, Total=20022 [2018-10-14 18:00:53,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-10-14 18:00:53,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 284. [2018-10-14 18:00:53,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-10-14 18:00:53,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 284 transitions. [2018-10-14 18:00:53,891 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 284 transitions. Word has length 280 [2018-10-14 18:00:53,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:00:53,891 INFO L481 AbstractCegarLoop]: Abstraction has 284 states and 284 transitions. [2018-10-14 18:00:53,891 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-14 18:00:53,891 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 284 transitions. [2018-10-14 18:00:53,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2018-10-14 18:00:53,892 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:00:53,892 INFO L375 BasicCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:00:53,892 INFO L424 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:00:53,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:00:53,892 INFO L82 PathProgramCache]: Analyzing trace with hash -206479915, now seen corresponding path program 70 times [2018-10-14 18:00:53,893 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:00:53,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:00:56,232 INFO L134 CoverageAnalysis]: Checked inductivity of 7315 backedges. 0 proven. 7315 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:00:56,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:00:56,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-10-14 18:00:56,233 INFO L460 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-10-14 18:00:56,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-10-14 18:00:56,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2631, Invalid=2771, Unknown=0, NotChecked=0, Total=5402 [2018-10-14 18:00:56,234 INFO L87 Difference]: Start difference. First operand 284 states and 284 transitions. Second operand 74 states. [2018-10-14 18:00:59,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:00:59,848 INFO L93 Difference]: Finished difference Result 289 states and 289 transitions. [2018-10-14 18:00:59,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-14 18:00:59,851 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 283 [2018-10-14 18:00:59,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:00:59,852 INFO L225 Difference]: With dead ends: 289 [2018-10-14 18:00:59,853 INFO L226 Difference]: Without dead ends: 289 [2018-10-14 18:00:59,855 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2485 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7811, Invalid=12781, Unknown=0, NotChecked=0, Total=20592 [2018-10-14 18:00:59,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-10-14 18:00:59,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 287. [2018-10-14 18:00:59,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-10-14 18:00:59,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 287 transitions. [2018-10-14 18:00:59,858 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 287 transitions. Word has length 283 [2018-10-14 18:00:59,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:00:59,858 INFO L481 AbstractCegarLoop]: Abstraction has 287 states and 287 transitions. [2018-10-14 18:00:59,858 INFO L482 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-10-14 18:00:59,858 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 287 transitions. [2018-10-14 18:00:59,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-10-14 18:00:59,860 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:00:59,860 INFO L375 BasicCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:00:59,860 INFO L424 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:00:59,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:00:59,861 INFO L82 PathProgramCache]: Analyzing trace with hash 853472453, now seen corresponding path program 71 times [2018-10-14 18:00:59,861 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:00:59,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:01:02,271 INFO L134 CoverageAnalysis]: Checked inductivity of 7526 backedges. 0 proven. 7526 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:01:02,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:01:02,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-14 18:01:02,272 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-14 18:01:02,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-14 18:01:02,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2704, Invalid=2846, Unknown=0, NotChecked=0, Total=5550 [2018-10-14 18:01:02,273 INFO L87 Difference]: Start difference. First operand 287 states and 287 transitions. Second operand 75 states. [2018-10-14 18:01:06,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:01:06,080 INFO L93 Difference]: Finished difference Result 292 states and 292 transitions. [2018-10-14 18:01:06,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-14 18:01:06,080 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 286 [2018-10-14 18:01:06,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:01:06,081 INFO L225 Difference]: With dead ends: 292 [2018-10-14 18:01:06,081 INFO L226 Difference]: Without dead ends: 292 [2018-10-14 18:01:06,082 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2556 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8029, Invalid=13141, Unknown=0, NotChecked=0, Total=21170 [2018-10-14 18:01:06,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-10-14 18:01:06,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 290. [2018-10-14 18:01:06,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-10-14 18:01:06,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 290 transitions. [2018-10-14 18:01:06,086 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 290 transitions. Word has length 286 [2018-10-14 18:01:06,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:01:06,086 INFO L481 AbstractCegarLoop]: Abstraction has 290 states and 290 transitions. [2018-10-14 18:01:06,086 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-14 18:01:06,087 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 290 transitions. [2018-10-14 18:01:06,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-10-14 18:01:06,087 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:01:06,088 INFO L375 BasicCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:01:06,088 INFO L424 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:01:06,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:01:06,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1294907349, now seen corresponding path program 72 times [2018-10-14 18:01:06,089 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:01:06,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:01:08,745 INFO L134 CoverageAnalysis]: Checked inductivity of 7740 backedges. 0 proven. 7740 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:01:08,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:01:08,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-10-14 18:01:08,745 INFO L460 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-10-14 18:01:08,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-10-14 18:01:08,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2778, Invalid=2922, Unknown=0, NotChecked=0, Total=5700 [2018-10-14 18:01:08,746 INFO L87 Difference]: Start difference. First operand 290 states and 290 transitions. Second operand 76 states. [2018-10-14 18:01:12,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:01:12,608 INFO L93 Difference]: Finished difference Result 295 states and 295 transitions. [2018-10-14 18:01:12,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-14 18:01:12,608 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 289 [2018-10-14 18:01:12,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:01:12,609 INFO L225 Difference]: With dead ends: 295 [2018-10-14 18:01:12,609 INFO L226 Difference]: Without dead ends: 295 [2018-10-14 18:01:12,611 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2628 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=8250, Invalid=13506, Unknown=0, NotChecked=0, Total=21756 [2018-10-14 18:01:12,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-10-14 18:01:12,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 293. [2018-10-14 18:01:12,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-10-14 18:01:12,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions. [2018-10-14 18:01:12,614 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 289 [2018-10-14 18:01:12,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:01:12,614 INFO L481 AbstractCegarLoop]: Abstraction has 293 states and 293 transitions. [2018-10-14 18:01:12,614 INFO L482 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-10-14 18:01:12,615 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 293 transitions. [2018-10-14 18:01:12,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-10-14 18:01:12,615 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:01:12,616 INFO L375 BasicCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:01:12,616 INFO L424 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:01:12,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:01:12,616 INFO L82 PathProgramCache]: Analyzing trace with hash 892033733, now seen corresponding path program 73 times [2018-10-14 18:01:12,616 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:01:12,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:01:15,255 INFO L134 CoverageAnalysis]: Checked inductivity of 7957 backedges. 0 proven. 7957 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:01:15,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:01:15,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-10-14 18:01:15,256 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-14 18:01:15,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-14 18:01:15,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2853, Invalid=2999, Unknown=0, NotChecked=0, Total=5852 [2018-10-14 18:01:15,257 INFO L87 Difference]: Start difference. First operand 293 states and 293 transitions. Second operand 77 states. [2018-10-14 18:01:19,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:01:19,111 INFO L93 Difference]: Finished difference Result 298 states and 298 transitions. [2018-10-14 18:01:19,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-14 18:01:19,111 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 292 [2018-10-14 18:01:19,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:01:19,112 INFO L225 Difference]: With dead ends: 298 [2018-10-14 18:01:19,112 INFO L226 Difference]: Without dead ends: 298 [2018-10-14 18:01:19,113 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2701 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=8474, Invalid=13876, Unknown=0, NotChecked=0, Total=22350 [2018-10-14 18:01:19,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-10-14 18:01:19,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 296. [2018-10-14 18:01:19,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-10-14 18:01:19,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 296 transitions. [2018-10-14 18:01:19,117 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 296 transitions. Word has length 292 [2018-10-14 18:01:19,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:01:19,117 INFO L481 AbstractCegarLoop]: Abstraction has 296 states and 296 transitions. [2018-10-14 18:01:19,117 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-14 18:01:19,117 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 296 transitions. [2018-10-14 18:01:19,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2018-10-14 18:01:19,118 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:01:19,118 INFO L375 BasicCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:01:19,119 INFO L424 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:01:19,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:01:19,119 INFO L82 PathProgramCache]: Analyzing trace with hash -977235499, now seen corresponding path program 74 times [2018-10-14 18:01:19,120 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:01:19,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:01:21,750 INFO L134 CoverageAnalysis]: Checked inductivity of 8177 backedges. 0 proven. 8177 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:01:21,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:01:21,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-10-14 18:01:21,750 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-14 18:01:21,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-14 18:01:21,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2929, Invalid=3077, Unknown=0, NotChecked=0, Total=6006 [2018-10-14 18:01:21,752 INFO L87 Difference]: Start difference. First operand 296 states and 296 transitions. Second operand 78 states. [2018-10-14 18:01:25,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:01:25,757 INFO L93 Difference]: Finished difference Result 301 states and 301 transitions. [2018-10-14 18:01:25,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-14 18:01:25,757 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 295 [2018-10-14 18:01:25,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:01:25,758 INFO L225 Difference]: With dead ends: 301 [2018-10-14 18:01:25,758 INFO L226 Difference]: Without dead ends: 301 [2018-10-14 18:01:25,760 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2775 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=8701, Invalid=14251, Unknown=0, NotChecked=0, Total=22952 [2018-10-14 18:01:25,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-10-14 18:01:25,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 299. [2018-10-14 18:01:25,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-10-14 18:01:25,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 299 transitions. [2018-10-14 18:01:25,763 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 299 transitions. Word has length 295 [2018-10-14 18:01:25,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:01:25,763 INFO L481 AbstractCegarLoop]: Abstraction has 299 states and 299 transitions. [2018-10-14 18:01:25,763 INFO L482 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-14 18:01:25,764 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 299 transitions. [2018-10-14 18:01:25,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-10-14 18:01:25,764 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:01:25,765 INFO L375 BasicCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:01:25,765 INFO L424 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:01:25,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:01:25,765 INFO L82 PathProgramCache]: Analyzing trace with hash 169033925, now seen corresponding path program 75 times [2018-10-14 18:01:25,766 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:01:25,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:01:28,554 INFO L134 CoverageAnalysis]: Checked inductivity of 8400 backedges. 0 proven. 8400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:01:28,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:01:28,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-10-14 18:01:28,555 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-14 18:01:28,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-14 18:01:28,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3006, Invalid=3156, Unknown=0, NotChecked=0, Total=6162 [2018-10-14 18:01:28,556 INFO L87 Difference]: Start difference. First operand 299 states and 299 transitions. Second operand 79 states. [2018-10-14 18:01:32,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:01:32,368 INFO L93 Difference]: Finished difference Result 304 states and 304 transitions. [2018-10-14 18:01:32,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-14 18:01:32,369 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 298 [2018-10-14 18:01:32,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:01:32,370 INFO L225 Difference]: With dead ends: 304 [2018-10-14 18:01:32,370 INFO L226 Difference]: Without dead ends: 304 [2018-10-14 18:01:32,371 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2850 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=8931, Invalid=14631, Unknown=0, NotChecked=0, Total=23562 [2018-10-14 18:01:32,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-10-14 18:01:32,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 302. [2018-10-14 18:01:32,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-10-14 18:01:32,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 302 transitions. [2018-10-14 18:01:32,374 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 302 transitions. Word has length 298 [2018-10-14 18:01:32,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:01:32,374 INFO L481 AbstractCegarLoop]: Abstraction has 302 states and 302 transitions. [2018-10-14 18:01:32,374 INFO L482 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-14 18:01:32,374 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 302 transitions. [2018-10-14 18:01:32,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-10-14 18:01:32,375 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:01:32,375 INFO L375 BasicCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:01:32,375 INFO L424 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:01:32,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:01:32,376 INFO L82 PathProgramCache]: Analyzing trace with hash -603526187, now seen corresponding path program 76 times [2018-10-14 18:01:32,376 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:01:32,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:01:35,176 INFO L134 CoverageAnalysis]: Checked inductivity of 8626 backedges. 0 proven. 8626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:01:35,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:01:35,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-10-14 18:01:35,176 INFO L460 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-10-14 18:01:35,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-10-14 18:01:35,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3084, Invalid=3236, Unknown=0, NotChecked=0, Total=6320 [2018-10-14 18:01:35,177 INFO L87 Difference]: Start difference. First operand 302 states and 302 transitions. Second operand 80 states. [2018-10-14 18:01:39,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:01:39,319 INFO L93 Difference]: Finished difference Result 307 states and 307 transitions. [2018-10-14 18:01:39,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-14 18:01:39,320 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 301 [2018-10-14 18:01:39,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:01:39,321 INFO L225 Difference]: With dead ends: 307 [2018-10-14 18:01:39,321 INFO L226 Difference]: Without dead ends: 307 [2018-10-14 18:01:39,323 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2926 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=9164, Invalid=15016, Unknown=0, NotChecked=0, Total=24180 [2018-10-14 18:01:39,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-10-14 18:01:39,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 305. [2018-10-14 18:01:39,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-10-14 18:01:39,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 305 transitions. [2018-10-14 18:01:39,325 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 305 transitions. Word has length 301 [2018-10-14 18:01:39,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:01:39,325 INFO L481 AbstractCegarLoop]: Abstraction has 305 states and 305 transitions. [2018-10-14 18:01:39,326 INFO L482 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-10-14 18:01:39,326 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 305 transitions. [2018-10-14 18:01:39,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-10-14 18:01:39,327 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:01:39,327 INFO L375 BasicCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:01:39,327 INFO L424 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:01:39,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:01:39,327 INFO L82 PathProgramCache]: Analyzing trace with hash 787916485, now seen corresponding path program 77 times [2018-10-14 18:01:39,328 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:01:39,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:01:42,188 INFO L134 CoverageAnalysis]: Checked inductivity of 8855 backedges. 0 proven. 8855 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:01:42,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:01:42,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-14 18:01:42,189 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-14 18:01:42,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-14 18:01:42,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3163, Invalid=3317, Unknown=0, NotChecked=0, Total=6480 [2018-10-14 18:01:42,190 INFO L87 Difference]: Start difference. First operand 305 states and 305 transitions. Second operand 81 states. [2018-10-14 18:01:46,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:01:46,556 INFO L93 Difference]: Finished difference Result 310 states and 310 transitions. [2018-10-14 18:01:46,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-14 18:01:46,557 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 304 [2018-10-14 18:01:46,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:01:46,558 INFO L225 Difference]: With dead ends: 310 [2018-10-14 18:01:46,558 INFO L226 Difference]: Without dead ends: 310 [2018-10-14 18:01:46,559 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3003 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=9400, Invalid=15406, Unknown=0, NotChecked=0, Total=24806 [2018-10-14 18:01:46,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-10-14 18:01:46,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 308. [2018-10-14 18:01:46,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-10-14 18:01:46,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 308 transitions. [2018-10-14 18:01:46,562 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 308 transitions. Word has length 304 [2018-10-14 18:01:46,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:01:46,562 INFO L481 AbstractCegarLoop]: Abstraction has 308 states and 308 transitions. [2018-10-14 18:01:46,562 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-14 18:01:46,562 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 308 transitions. [2018-10-14 18:01:46,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-10-14 18:01:46,563 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:01:46,563 INFO L375 BasicCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:01:46,563 INFO L424 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:01:46,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:01:46,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1767782955, now seen corresponding path program 78 times [2018-10-14 18:01:46,564 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:01:46,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:01:49,607 INFO L134 CoverageAnalysis]: Checked inductivity of 9087 backedges. 0 proven. 9087 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:01:49,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:01:49,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-10-14 18:01:49,608 INFO L460 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-10-14 18:01:49,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-10-14 18:01:49,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3243, Invalid=3399, Unknown=0, NotChecked=0, Total=6642 [2018-10-14 18:01:49,609 INFO L87 Difference]: Start difference. First operand 308 states and 308 transitions. Second operand 82 states. [2018-10-14 18:01:53,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:01:53,877 INFO L93 Difference]: Finished difference Result 313 states and 313 transitions. [2018-10-14 18:01:53,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-14 18:01:53,877 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 307 [2018-10-14 18:01:53,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:01:53,878 INFO L225 Difference]: With dead ends: 313 [2018-10-14 18:01:53,878 INFO L226 Difference]: Without dead ends: 313 [2018-10-14 18:01:53,881 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3081 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=9639, Invalid=15801, Unknown=0, NotChecked=0, Total=25440 [2018-10-14 18:01:53,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-10-14 18:01:53,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 311. [2018-10-14 18:01:53,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-10-14 18:01:53,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 311 transitions. [2018-10-14 18:01:53,883 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 311 transitions. Word has length 307 [2018-10-14 18:01:53,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:01:53,883 INFO L481 AbstractCegarLoop]: Abstraction has 311 states and 311 transitions. [2018-10-14 18:01:53,884 INFO L482 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-10-14 18:01:53,884 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 311 transitions. [2018-10-14 18:01:53,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-10-14 18:01:53,884 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:01:53,885 INFO L375 BasicCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:01:53,885 INFO L424 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:01:53,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:01:53,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1724543803, now seen corresponding path program 79 times [2018-10-14 18:01:53,886 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:01:53,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:01:57,023 INFO L134 CoverageAnalysis]: Checked inductivity of 9322 backedges. 0 proven. 9322 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:01:57,023 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:01:57,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-14 18:01:57,024 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-14 18:01:57,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-14 18:01:57,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3324, Invalid=3482, Unknown=0, NotChecked=0, Total=6806 [2018-10-14 18:01:57,025 INFO L87 Difference]: Start difference. First operand 311 states and 311 transitions. Second operand 83 states. [2018-10-14 18:02:01,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:02:01,439 INFO L93 Difference]: Finished difference Result 316 states and 316 transitions. [2018-10-14 18:02:01,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-10-14 18:02:01,440 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 310 [2018-10-14 18:02:01,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:02:01,441 INFO L225 Difference]: With dead ends: 316 [2018-10-14 18:02:01,441 INFO L226 Difference]: Without dead ends: 316 [2018-10-14 18:02:01,443 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3160 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=9881, Invalid=16201, Unknown=0, NotChecked=0, Total=26082 [2018-10-14 18:02:01,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-10-14 18:02:01,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 314. [2018-10-14 18:02:01,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2018-10-14 18:02:01,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 314 transitions. [2018-10-14 18:02:01,446 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 314 transitions. Word has length 310 [2018-10-14 18:02:01,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:02:01,447 INFO L481 AbstractCegarLoop]: Abstraction has 314 states and 314 transitions. [2018-10-14 18:02:01,447 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-14 18:02:01,447 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 314 transitions. [2018-10-14 18:02:01,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-10-14 18:02:01,448 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:02:01,448 INFO L375 BasicCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:02:01,448 INFO L424 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:02:01,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:02:01,448 INFO L82 PathProgramCache]: Analyzing trace with hash -2077155371, now seen corresponding path program 80 times [2018-10-14 18:02:01,449 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:02:01,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:02:04,578 INFO L134 CoverageAnalysis]: Checked inductivity of 9560 backedges. 0 proven. 9560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:02:04,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:02:04,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-10-14 18:02:04,579 INFO L460 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-10-14 18:02:04,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-10-14 18:02:04,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3406, Invalid=3566, Unknown=0, NotChecked=0, Total=6972 [2018-10-14 18:02:04,580 INFO L87 Difference]: Start difference. First operand 314 states and 314 transitions. Second operand 84 states. [2018-10-14 18:02:09,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:02:09,195 INFO L93 Difference]: Finished difference Result 319 states and 319 transitions. [2018-10-14 18:02:09,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-14 18:02:09,195 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 313 [2018-10-14 18:02:09,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:02:09,196 INFO L225 Difference]: With dead ends: 319 [2018-10-14 18:02:09,196 INFO L226 Difference]: Without dead ends: 319 [2018-10-14 18:02:09,198 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3240 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=10126, Invalid=16606, Unknown=0, NotChecked=0, Total=26732 [2018-10-14 18:02:09,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-10-14 18:02:09,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 317. [2018-10-14 18:02:09,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-10-14 18:02:09,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 317 transitions. [2018-10-14 18:02:09,200 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 317 transitions. Word has length 313 [2018-10-14 18:02:09,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:02:09,200 INFO L481 AbstractCegarLoop]: Abstraction has 317 states and 317 transitions. [2018-10-14 18:02:09,200 INFO L482 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-10-14 18:02:09,201 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 317 transitions. [2018-10-14 18:02:09,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2018-10-14 18:02:09,201 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:02:09,202 INFO L375 BasicCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:02:09,202 INFO L424 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:02:09,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:02:09,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1238371643, now seen corresponding path program 81 times [2018-10-14 18:02:09,203 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:02:09,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:02:12,482 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 0 proven. 9801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:02:12,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:02:12,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-10-14 18:02:12,483 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-14 18:02:12,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-14 18:02:12,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3489, Invalid=3651, Unknown=0, NotChecked=0, Total=7140 [2018-10-14 18:02:12,484 INFO L87 Difference]: Start difference. First operand 317 states and 317 transitions. Second operand 85 states. [2018-10-14 18:02:17,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:02:17,051 INFO L93 Difference]: Finished difference Result 322 states and 322 transitions. [2018-10-14 18:02:17,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-14 18:02:17,052 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 316 [2018-10-14 18:02:17,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:02:17,053 INFO L225 Difference]: With dead ends: 322 [2018-10-14 18:02:17,053 INFO L226 Difference]: Without dead ends: 322 [2018-10-14 18:02:17,054 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3321 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=10374, Invalid=17016, Unknown=0, NotChecked=0, Total=27390 [2018-10-14 18:02:17,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-10-14 18:02:17,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 320. [2018-10-14 18:02:17,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-10-14 18:02:17,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 320 transitions. [2018-10-14 18:02:17,057 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 320 transitions. Word has length 316 [2018-10-14 18:02:17,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:02:17,057 INFO L481 AbstractCegarLoop]: Abstraction has 320 states and 320 transitions. [2018-10-14 18:02:17,057 INFO L482 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-14 18:02:17,057 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 320 transitions. [2018-10-14 18:02:17,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2018-10-14 18:02:17,058 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:02:17,058 INFO L375 BasicCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:02:17,058 INFO L424 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:02:17,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:02:17,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1152058923, now seen corresponding path program 82 times [2018-10-14 18:02:17,059 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:02:17,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:02:20,353 INFO L134 CoverageAnalysis]: Checked inductivity of 10045 backedges. 0 proven. 10045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:02:20,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:02:20,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-10-14 18:02:20,354 INFO L460 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-10-14 18:02:20,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-10-14 18:02:20,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3573, Invalid=3737, Unknown=0, NotChecked=0, Total=7310 [2018-10-14 18:02:20,355 INFO L87 Difference]: Start difference. First operand 320 states and 320 transitions. Second operand 86 states. [2018-10-14 18:02:24,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:02:24,903 INFO L93 Difference]: Finished difference Result 325 states and 325 transitions. [2018-10-14 18:02:24,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-10-14 18:02:24,903 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 319 [2018-10-14 18:02:24,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:02:24,904 INFO L225 Difference]: With dead ends: 325 [2018-10-14 18:02:24,904 INFO L226 Difference]: Without dead ends: 325 [2018-10-14 18:02:24,906 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3403 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=10625, Invalid=17431, Unknown=0, NotChecked=0, Total=28056 [2018-10-14 18:02:24,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-10-14 18:02:24,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 323. [2018-10-14 18:02:24,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-10-14 18:02:24,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 323 transitions. [2018-10-14 18:02:24,909 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 323 transitions. Word has length 319 [2018-10-14 18:02:24,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:02:24,909 INFO L481 AbstractCegarLoop]: Abstraction has 323 states and 323 transitions. [2018-10-14 18:02:24,909 INFO L482 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-10-14 18:02:24,910 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 323 transitions. [2018-10-14 18:02:24,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-10-14 18:02:24,911 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:02:24,911 INFO L375 BasicCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:02:24,911 INFO L424 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:02:24,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:02:24,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1799739589, now seen corresponding path program 83 times [2018-10-14 18:02:24,912 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:02:24,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:02:28,301 INFO L134 CoverageAnalysis]: Checked inductivity of 10292 backedges. 0 proven. 10292 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:02:28,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:02:28,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-14 18:02:28,302 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-14 18:02:28,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-14 18:02:28,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3658, Invalid=3824, Unknown=0, NotChecked=0, Total=7482 [2018-10-14 18:02:28,303 INFO L87 Difference]: Start difference. First operand 323 states and 323 transitions. Second operand 87 states. [2018-10-14 18:02:33,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:02:33,023 INFO L93 Difference]: Finished difference Result 328 states and 328 transitions. [2018-10-14 18:02:33,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-14 18:02:33,023 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 322 [2018-10-14 18:02:33,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:02:33,024 INFO L225 Difference]: With dead ends: 328 [2018-10-14 18:02:33,025 INFO L226 Difference]: Without dead ends: 328 [2018-10-14 18:02:33,026 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3486 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=10879, Invalid=17851, Unknown=0, NotChecked=0, Total=28730 [2018-10-14 18:02:33,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-10-14 18:02:33,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 326. [2018-10-14 18:02:33,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-10-14 18:02:33,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 326 transitions. [2018-10-14 18:02:33,028 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 326 transitions. Word has length 322 [2018-10-14 18:02:33,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:02:33,028 INFO L481 AbstractCegarLoop]: Abstraction has 326 states and 326 transitions. [2018-10-14 18:02:33,028 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-14 18:02:33,028 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 326 transitions. [2018-10-14 18:02:33,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2018-10-14 18:02:33,029 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:02:33,030 INFO L375 BasicCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:02:33,030 INFO L424 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:02:33,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:02:33,030 INFO L82 PathProgramCache]: Analyzing trace with hash -626175019, now seen corresponding path program 84 times [2018-10-14 18:02:33,031 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:02:33,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:02:36,383 INFO L134 CoverageAnalysis]: Checked inductivity of 10542 backedges. 0 proven. 10542 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:02:36,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:02:36,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-10-14 18:02:36,384 INFO L460 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-10-14 18:02:36,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-10-14 18:02:36,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3744, Invalid=3912, Unknown=0, NotChecked=0, Total=7656 [2018-10-14 18:02:36,385 INFO L87 Difference]: Start difference. First operand 326 states and 326 transitions. Second operand 88 states. [2018-10-14 18:02:41,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:02:41,209 INFO L93 Difference]: Finished difference Result 331 states and 331 transitions. [2018-10-14 18:02:41,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-10-14 18:02:41,209 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 325 [2018-10-14 18:02:41,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:02:41,210 INFO L225 Difference]: With dead ends: 331 [2018-10-14 18:02:41,210 INFO L226 Difference]: Without dead ends: 331 [2018-10-14 18:02:41,212 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3570 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=11136, Invalid=18276, Unknown=0, NotChecked=0, Total=29412 [2018-10-14 18:02:41,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-10-14 18:02:41,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 329. [2018-10-14 18:02:41,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-10-14 18:02:41,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 329 transitions. [2018-10-14 18:02:41,217 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 329 transitions. Word has length 325 [2018-10-14 18:02:41,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:02:41,217 INFO L481 AbstractCegarLoop]: Abstraction has 329 states and 329 transitions. [2018-10-14 18:02:41,217 INFO L482 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-10-14 18:02:41,217 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 329 transitions. [2018-10-14 18:02:41,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-10-14 18:02:41,218 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:02:41,219 INFO L375 BasicCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:02:41,219 INFO L424 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:02:41,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:02:41,219 INFO L82 PathProgramCache]: Analyzing trace with hash 366427845, now seen corresponding path program 85 times [2018-10-14 18:02:41,220 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:02:41,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:02:44,630 INFO L134 CoverageAnalysis]: Checked inductivity of 10795 backedges. 0 proven. 10795 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:02:44,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:02:44,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-10-14 18:02:44,631 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-14 18:02:44,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-14 18:02:44,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3831, Invalid=4001, Unknown=0, NotChecked=0, Total=7832 [2018-10-14 18:02:44,632 INFO L87 Difference]: Start difference. First operand 329 states and 329 transitions. Second operand 89 states. [2018-10-14 18:02:49,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:02:49,614 INFO L93 Difference]: Finished difference Result 334 states and 334 transitions. [2018-10-14 18:02:49,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-10-14 18:02:49,614 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 328 [2018-10-14 18:02:49,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:02:49,615 INFO L225 Difference]: With dead ends: 334 [2018-10-14 18:02:49,615 INFO L226 Difference]: Without dead ends: 334 [2018-10-14 18:02:49,617 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3655 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=11396, Invalid=18706, Unknown=0, NotChecked=0, Total=30102 [2018-10-14 18:02:49,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-10-14 18:02:49,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 332. [2018-10-14 18:02:49,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-10-14 18:02:49,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 332 transitions. [2018-10-14 18:02:49,621 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 332 transitions. Word has length 328 [2018-10-14 18:02:49,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:02:49,621 INFO L481 AbstractCegarLoop]: Abstraction has 332 states and 332 transitions. [2018-10-14 18:02:49,621 INFO L482 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-14 18:02:49,621 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 332 transitions. [2018-10-14 18:02:49,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2018-10-14 18:02:49,623 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:02:49,623 INFO L375 BasicCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:02:49,623 INFO L424 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:02:49,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:02:49,623 INFO L82 PathProgramCache]: Analyzing trace with hash 148516309, now seen corresponding path program 86 times [2018-10-14 18:02:49,624 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:02:49,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:02:53,137 INFO L134 CoverageAnalysis]: Checked inductivity of 11051 backedges. 0 proven. 11051 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:02:53,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:02:53,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-10-14 18:02:53,138 INFO L460 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-10-14 18:02:53,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-10-14 18:02:53,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3919, Invalid=4091, Unknown=0, NotChecked=0, Total=8010 [2018-10-14 18:02:53,140 INFO L87 Difference]: Start difference. First operand 332 states and 332 transitions. Second operand 90 states. [2018-10-14 18:02:58,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:02:58,375 INFO L93 Difference]: Finished difference Result 337 states and 337 transitions. [2018-10-14 18:02:58,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-14 18:02:58,376 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 331 [2018-10-14 18:02:58,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:02:58,377 INFO L225 Difference]: With dead ends: 337 [2018-10-14 18:02:58,377 INFO L226 Difference]: Without dead ends: 337 [2018-10-14 18:02:58,378 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3741 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=11659, Invalid=19141, Unknown=0, NotChecked=0, Total=30800 [2018-10-14 18:02:58,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-10-14 18:02:58,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2018-10-14 18:02:58,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-10-14 18:02:58,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 335 transitions. [2018-10-14 18:02:58,381 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 335 transitions. Word has length 331 [2018-10-14 18:02:58,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:02:58,382 INFO L481 AbstractCegarLoop]: Abstraction has 335 states and 335 transitions. [2018-10-14 18:02:58,382 INFO L482 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-10-14 18:02:58,382 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 335 transitions. [2018-10-14 18:02:58,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2018-10-14 18:02:58,383 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:02:58,383 INFO L375 BasicCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:02:58,383 INFO L424 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:02:58,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:02:58,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1958468411, now seen corresponding path program 87 times [2018-10-14 18:02:58,384 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:02:58,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:03:02,086 INFO L134 CoverageAnalysis]: Checked inductivity of 11310 backedges. 0 proven. 11310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:03:02,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:03:02,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-10-14 18:03:02,087 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-14 18:03:02,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-14 18:03:02,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4008, Invalid=4182, Unknown=0, NotChecked=0, Total=8190 [2018-10-14 18:03:02,089 INFO L87 Difference]: Start difference. First operand 335 states and 335 transitions. Second operand 91 states. [2018-10-14 18:03:07,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:03:07,117 INFO L93 Difference]: Finished difference Result 340 states and 340 transitions. [2018-10-14 18:03:07,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-10-14 18:03:07,117 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 334 [2018-10-14 18:03:07,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:03:07,119 INFO L225 Difference]: With dead ends: 340 [2018-10-14 18:03:07,119 INFO L226 Difference]: Without dead ends: 340 [2018-10-14 18:03:07,121 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3828 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=11925, Invalid=19581, Unknown=0, NotChecked=0, Total=31506 [2018-10-14 18:03:07,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-10-14 18:03:07,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 338. [2018-10-14 18:03:07,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-10-14 18:03:07,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 338 transitions. [2018-10-14 18:03:07,124 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 338 transitions. Word has length 334 [2018-10-14 18:03:07,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:03:07,124 INFO L481 AbstractCegarLoop]: Abstraction has 338 states and 338 transitions. [2018-10-14 18:03:07,124 INFO L482 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-14 18:03:07,124 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 338 transitions. [2018-10-14 18:03:07,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2018-10-14 18:03:07,125 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:03:07,125 INFO L375 BasicCegarLoop]: trace histogram [88, 88, 88, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:03:07,126 INFO L424 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:03:07,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:03:07,126 INFO L82 PathProgramCache]: Analyzing trace with hash -193230891, now seen corresponding path program 88 times [2018-10-14 18:03:07,126 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:03:07,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:03:10,750 INFO L134 CoverageAnalysis]: Checked inductivity of 11572 backedges. 0 proven. 11572 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:03:10,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:03:10,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-10-14 18:03:10,751 INFO L460 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-10-14 18:03:10,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-10-14 18:03:10,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4098, Invalid=4274, Unknown=0, NotChecked=0, Total=8372 [2018-10-14 18:03:10,752 INFO L87 Difference]: Start difference. First operand 338 states and 338 transitions. Second operand 92 states. [2018-10-14 18:03:15,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:03:15,986 INFO L93 Difference]: Finished difference Result 343 states and 343 transitions. [2018-10-14 18:03:15,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-10-14 18:03:15,986 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 337 [2018-10-14 18:03:15,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:03:15,987 INFO L225 Difference]: With dead ends: 343 [2018-10-14 18:03:15,987 INFO L226 Difference]: Without dead ends: 343 [2018-10-14 18:03:15,990 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3916 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=12194, Invalid=20026, Unknown=0, NotChecked=0, Total=32220 [2018-10-14 18:03:15,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-10-14 18:03:15,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 341. [2018-10-14 18:03:15,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-10-14 18:03:15,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 341 transitions. [2018-10-14 18:03:15,993 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 341 transitions. Word has length 337 [2018-10-14 18:03:15,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:03:15,993 INFO L481 AbstractCegarLoop]: Abstraction has 341 states and 341 transitions. [2018-10-14 18:03:15,993 INFO L482 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-10-14 18:03:15,993 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 341 transitions. [2018-10-14 18:03:15,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2018-10-14 18:03:15,995 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:03:15,995 INFO L375 BasicCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:03:15,995 INFO L424 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:03:15,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:03:15,995 INFO L82 PathProgramCache]: Analyzing trace with hash 418155205, now seen corresponding path program 89 times [2018-10-14 18:03:15,996 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:03:16,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:03:19,733 INFO L134 CoverageAnalysis]: Checked inductivity of 11837 backedges. 0 proven. 11837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:03:19,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:03:19,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-14 18:03:19,734 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-14 18:03:19,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-14 18:03:19,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4189, Invalid=4367, Unknown=0, NotChecked=0, Total=8556 [2018-10-14 18:03:19,735 INFO L87 Difference]: Start difference. First operand 341 states and 341 transitions. Second operand 93 states. [2018-10-14 18:03:25,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:03:25,172 INFO L93 Difference]: Finished difference Result 346 states and 346 transitions. [2018-10-14 18:03:25,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-14 18:03:25,172 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 340 [2018-10-14 18:03:25,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:03:25,173 INFO L225 Difference]: With dead ends: 346 [2018-10-14 18:03:25,174 INFO L226 Difference]: Without dead ends: 346 [2018-10-14 18:03:25,176 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4005 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=12466, Invalid=20476, Unknown=0, NotChecked=0, Total=32942 [2018-10-14 18:03:25,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-10-14 18:03:25,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 344. [2018-10-14 18:03:25,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2018-10-14 18:03:25,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 344 transitions. [2018-10-14 18:03:25,179 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 344 transitions. Word has length 340 [2018-10-14 18:03:25,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:03:25,179 INFO L481 AbstractCegarLoop]: Abstraction has 344 states and 344 transitions. [2018-10-14 18:03:25,179 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-14 18:03:25,179 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 344 transitions. [2018-10-14 18:03:25,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2018-10-14 18:03:25,180 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:03:25,180 INFO L375 BasicCegarLoop]: trace histogram [90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:03:25,181 INFO L424 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:03:25,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:03:25,181 INFO L82 PathProgramCache]: Analyzing trace with hash -734961195, now seen corresponding path program 90 times [2018-10-14 18:03:25,181 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:03:25,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:03:28,984 INFO L134 CoverageAnalysis]: Checked inductivity of 12105 backedges. 0 proven. 12105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:03:28,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:03:28,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-10-14 18:03:28,985 INFO L460 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-10-14 18:03:28,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-10-14 18:03:28,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4281, Invalid=4461, Unknown=0, NotChecked=0, Total=8742 [2018-10-14 18:03:28,986 INFO L87 Difference]: Start difference. First operand 344 states and 344 transitions. Second operand 94 states. [2018-10-14 18:03:34,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:03:34,369 INFO L93 Difference]: Finished difference Result 349 states and 349 transitions. [2018-10-14 18:03:34,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-10-14 18:03:34,370 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 343 [2018-10-14 18:03:34,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:03:34,371 INFO L225 Difference]: With dead ends: 349 [2018-10-14 18:03:34,371 INFO L226 Difference]: Without dead ends: 349 [2018-10-14 18:03:34,372 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4095 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=12741, Invalid=20931, Unknown=0, NotChecked=0, Total=33672 [2018-10-14 18:03:34,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-10-14 18:03:34,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 347. [2018-10-14 18:03:34,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-10-14 18:03:34,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 347 transitions. [2018-10-14 18:03:34,375 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 347 transitions. Word has length 343 [2018-10-14 18:03:34,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:03:34,375 INFO L481 AbstractCegarLoop]: Abstraction has 347 states and 347 transitions. [2018-10-14 18:03:34,375 INFO L482 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-10-14 18:03:34,375 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 347 transitions. [2018-10-14 18:03:34,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2018-10-14 18:03:34,376 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:03:34,377 INFO L375 BasicCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:03:34,377 INFO L424 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:03:34,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:03:34,377 INFO L82 PathProgramCache]: Analyzing trace with hash -2077200187, now seen corresponding path program 91 times [2018-10-14 18:03:34,377 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:03:34,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:03:38,275 INFO L134 CoverageAnalysis]: Checked inductivity of 12376 backedges. 0 proven. 12376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:03:38,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:03:38,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-10-14 18:03:38,276 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-14 18:03:38,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-14 18:03:38,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4374, Invalid=4556, Unknown=0, NotChecked=0, Total=8930 [2018-10-14 18:03:38,277 INFO L87 Difference]: Start difference. First operand 347 states and 347 transitions. Second operand 95 states. [2018-10-14 18:03:43,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:03:43,604 INFO L93 Difference]: Finished difference Result 352 states and 352 transitions. [2018-10-14 18:03:43,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-10-14 18:03:43,604 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 346 [2018-10-14 18:03:43,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:03:43,605 INFO L225 Difference]: With dead ends: 352 [2018-10-14 18:03:43,605 INFO L226 Difference]: Without dead ends: 352 [2018-10-14 18:03:43,608 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4186 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=13019, Invalid=21391, Unknown=0, NotChecked=0, Total=34410 [2018-10-14 18:03:43,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2018-10-14 18:03:43,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 350. [2018-10-14 18:03:43,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-10-14 18:03:43,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 350 transitions. [2018-10-14 18:03:43,611 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 350 transitions. Word has length 346 [2018-10-14 18:03:43,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:03:43,611 INFO L481 AbstractCegarLoop]: Abstraction has 350 states and 350 transitions. [2018-10-14 18:03:43,611 INFO L482 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-14 18:03:43,611 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 350 transitions. [2018-10-14 18:03:43,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2018-10-14 18:03:43,612 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:03:43,613 INFO L375 BasicCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:03:43,613 INFO L424 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:03:43,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:03:43,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1721482197, now seen corresponding path program 92 times [2018-10-14 18:03:43,614 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:03:43,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:03:47,589 INFO L134 CoverageAnalysis]: Checked inductivity of 12650 backedges. 0 proven. 12650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:03:47,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:03:47,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-10-14 18:03:47,590 INFO L460 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-10-14 18:03:47,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-10-14 18:03:47,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4468, Invalid=4652, Unknown=0, NotChecked=0, Total=9120 [2018-10-14 18:03:47,591 INFO L87 Difference]: Start difference. First operand 350 states and 350 transitions. Second operand 96 states. [2018-10-14 18:03:53,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:03:53,316 INFO L93 Difference]: Finished difference Result 355 states and 355 transitions. [2018-10-14 18:03:53,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-14 18:03:53,316 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 349 [2018-10-14 18:03:53,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:03:53,318 INFO L225 Difference]: With dead ends: 355 [2018-10-14 18:03:53,318 INFO L226 Difference]: Without dead ends: 355 [2018-10-14 18:03:53,321 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4278 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=13300, Invalid=21856, Unknown=0, NotChecked=0, Total=35156 [2018-10-14 18:03:53,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-10-14 18:03:53,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 353. [2018-10-14 18:03:53,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-10-14 18:03:53,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 353 transitions. [2018-10-14 18:03:53,324 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 353 transitions. Word has length 349 [2018-10-14 18:03:53,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:03:53,324 INFO L481 AbstractCegarLoop]: Abstraction has 353 states and 353 transitions. [2018-10-14 18:03:53,324 INFO L482 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-10-14 18:03:53,324 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 353 transitions. [2018-10-14 18:03:53,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-10-14 18:03:53,325 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:03:53,325 INFO L375 BasicCegarLoop]: trace histogram [93, 93, 93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:03:53,326 INFO L424 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:03:53,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:03:53,326 INFO L82 PathProgramCache]: Analyzing trace with hash 175101637, now seen corresponding path program 93 times [2018-10-14 18:03:53,326 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:03:53,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:03:57,326 INFO L134 CoverageAnalysis]: Checked inductivity of 12927 backedges. 0 proven. 12927 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 18:03:57,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 18:03:57,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-10-14 18:03:57,326 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-10-14 18:03:57,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-10-14 18:03:57,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4563, Invalid=4749, Unknown=0, NotChecked=0, Total=9312 [2018-10-14 18:03:57,328 INFO L87 Difference]: Start difference. First operand 353 states and 353 transitions. Second operand 97 states. [2018-10-14 18:04:03,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:04:03,052 INFO L93 Difference]: Finished difference Result 356 states and 356 transitions. [2018-10-14 18:04:03,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-10-14 18:04:03,052 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 352 [2018-10-14 18:04:03,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:04:03,054 INFO L225 Difference]: With dead ends: 356 [2018-10-14 18:04:03,054 INFO L226 Difference]: Without dead ends: 356 [2018-10-14 18:04:03,056 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4371 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=13584, Invalid=22326, Unknown=0, NotChecked=0, Total=35910 [2018-10-14 18:04:03,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-10-14 18:04:03,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2018-10-14 18:04:03,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-10-14 18:04:03,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 356 transitions. [2018-10-14 18:04:03,059 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 356 transitions. Word has length 352 [2018-10-14 18:04:03,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:04:03,060 INFO L481 AbstractCegarLoop]: Abstraction has 356 states and 356 transitions. [2018-10-14 18:04:03,060 INFO L482 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-10-14 18:04:03,060 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 356 transitions. [2018-10-14 18:04:03,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2018-10-14 18:04:03,061 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 18:04:03,061 INFO L375 BasicCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 18:04:03,061 INFO L424 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 18:04:03,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 18:04:03,062 INFO L82 PathProgramCache]: Analyzing trace with hash -228944427, now seen corresponding path program 94 times [2018-10-14 18:04:03,062 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 18:04:03,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 18:04:03,641 INFO L134 CoverageAnalysis]: Checked inductivity of 13207 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13207 trivial. 0 not checked. [2018-10-14 18:04:03,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 18:04:03,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-14 18:04:03,642 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-14 18:04:03,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-14 18:04:03,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-14 18:04:03,643 INFO L87 Difference]: Start difference. First operand 356 states and 356 transitions. Second operand 8 states. [2018-10-14 18:04:04,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 18:04:04,066 INFO L93 Difference]: Finished difference Result 354 states and 354 transitions. [2018-10-14 18:04:04,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-14 18:04:04,067 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 355 [2018-10-14 18:04:04,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 18:04:04,067 INFO L225 Difference]: With dead ends: 354 [2018-10-14 18:04:04,067 INFO L226 Difference]: Without dead ends: 0 [2018-10-14 18:04:04,067 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-10-14 18:04:04,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-14 18:04:04,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-14 18:04:04,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-14 18:04:04,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-14 18:04:04,068 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 355 [2018-10-14 18:04:04,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 18:04:04,068 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-14 18:04:04,068 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-14 18:04:04,068 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-14 18:04:04,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-14 18:04:04,072 INFO L202 PluginConnector]: Adding new model 20051113-1.c_false-valid-memtrack.i_15.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 06:04:04 BasicIcfg [2018-10-14 18:04:04,072 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-14 18:04:04,073 INFO L168 Benchmark]: Toolchain (without parser) took 458996.21 ms. Allocated memory was 1.5 GB in the beginning and 4.3 GB in the end (delta: 2.8 GB). Free memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-10-14 18:04:04,074 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-14 18:04:04,074 INFO L168 Benchmark]: Boogie Preprocessor took 59.10 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-14 18:04:04,075 INFO L168 Benchmark]: RCFGBuilder took 748.68 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-14 18:04:04,075 INFO L168 Benchmark]: IcfgTransformer took 96623.25 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 175.9 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2018-10-14 18:04:04,076 INFO L168 Benchmark]: TraceAbstraction took 361560.26 ms. Allocated memory was 3.6 GB in the beginning and 4.3 GB in the end (delta: 721.4 MB). Free memory was 1.3 GB in the beginning and 2.7 GB in the end (delta: -1.5 GB). There was no memory consumed. Max. memory is 7.1 GB. [2018-10-14 18:04:04,078 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.17 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 59.10 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 748.68 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * IcfgTransformer took 96623.25 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 175.9 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. * TraceAbstraction took 361560.26 ms. Allocated memory was 3.6 GB in the beginning and 4.3 GB in the end (delta: 721.4 MB). Free memory was 1.3 GB in the beginning and 2.7 GB in the end (delta: -1.5 GB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 76 LocStat_MAX_WEQGRAPH_SIZE : 3 LocStat_MAX_SIZEOF_WEQEDGELABEL : 3 LocStat_NO_SUPPORTING_EQUALITIES : 2428 LocStat_NO_SUPPORTING_DISEQUALITIES : 462 LocStat_NO_DISJUNCTIONS : -152 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 78 TransStat_MAX_WEQGRAPH_SIZE : 3 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 103 TransStat_NO_SUPPORTING_DISEQUALITIES : 1 TransStat_NO_DISJUNCTIONS : 78 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqPostOperator statistics APPLY_NORMAL(MILLISECONDS) : 61952.84 APPLY_RETURN(MILLISECONDS) : 0.00 #APPLY_NORMAL : 163 #APPLY_RETURN : 0 * Results from de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation: - StatisticsResult: Abstract Interpretation statistics Visited 78 different actions 161 times. Merged at 52 different actions 80 times. Widened at 1 different actions 1 times. Found 3 fixpoints after 3 different actions. Largest state had 0 variables. - StatisticsResult: HeapSeparatorStatistics #COUNT_NEW_ARRAY_VARS_[#memory_int, ULTIMATE.start_write~int_old_#memory_int] : 0 COUNT_ARRAY_WRITES_for_[#memory_int, ULTIMATE.start_write~int_old_#memory_int]_at_dim_0 : null COUNT_BLOCKS_for_[#memory_int, ULTIMATE.start_write~int_old_#memory_int]_at_dim_0 : null COUNT_ARRAY_WRITES_for_[#memory_int, ULTIMATE.start_write~int_old_#memory_int]_at_dim_1 : 6 COUNT_BLOCKS_for_[#memory_int, ULTIMATE.start_write~int_old_#memory_int]_at_dim_1 : 1 COUNT_ARRAY_READS for [#memory_int, ULTIMATE.start_write~int_old_#memory_int] : null * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 126]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 78 locations, 1 error locations. SAFE Result, 361.5s OverallTime, 95 OverallIterations, 94 TraceHistogramMax, 207.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6725 SDtfs, 23085 SDslu, 229118 SDs, 0 SdLazy, 26173 SolverSat, 4605 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 25.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9130 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 8940 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138419 ImplicationChecksByTransitivity, 316.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=356occurred in iteration=94, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 95 MinimizatonAttempts, 186 StatesRemovedByMinimization, 93 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 147.6s InterpolantComputationTime, 20330 NumberOfCodeBlocks, 20330 NumberOfCodeBlocksAsserted, 95 NumberOfCheckSat, 20235 ConstructedInterpolants, 0 QuantifiedInterpolants, 19987731 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 95 InterpolantComputations, 2 PerfectInterpolantSequences, 13207/419710 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_15.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-Benchmark-0-2018-10-14_18-04-04-090.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_15.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-VPDomainBenchmark-0-2018-10-14_18-04-04-090.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_15.bpl_heapsep-2018-09-18.epf_AutomizerBplTransformed.xml/Csv-BenchmarkWithCounters-0-2018-10-14_18-04-04-090.csv The toolchain threw an exception: class java.lang.RuntimeException: java.lang.IllegalAccessException: Class de.uni_freiburg.informatik.ultimate.util.csv.SimpleCsvProvider can not access a member of class de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.AbsIntBenchmark with modifiers "private" RESULT: An exception occured during the execution of Ultimate: The toolchain threw an exception java.lang.RuntimeException: java.lang.IllegalAccessException: Class de.uni_freiburg.informatik.ultimate.util.csv.SimpleCsvProvider can not access a member of class de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.AbsIntBenchmark with modifiers "private" at de.uni_freiburg.informatik.ultimate.util.csv.SimpleCsvProvider.constructCsvProviderReflectively(SimpleCsvProvider.java:283) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.AbsIntBenchmark.createCsvProvider(AbsIntBenchmark.java:42) at de.uni_freiburg.informatik.ultimate.cli.CommandLineController.writeCsvLogs(CommandLineController.java:342) at de.uni_freiburg.informatik.ultimate.cli.CommandLineController.displayToolchainResults(CommandLineController.java:325) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:343) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.lang.IllegalAccessException: Class de.uni_freiburg.informatik.ultimate.util.csv.SimpleCsvProvider can not access a member of class de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.AbsIntBenchmark with modifiers "private" at sun.reflect.Reflection.ensureMemberAccess(Reflection.java:102) at java.lang.reflect.AccessibleObject.slowCheckMemberAccess(AccessibleObject.java:296) at java.lang.reflect.AccessibleObject.checkAccess(AccessibleObject.java:288) at java.lang.reflect.Field.get(Field.java:390) at de.uni_freiburg.informatik.ultimate.util.csv.SimpleCsvProvider.constructCsvProviderReflectively(SimpleCsvProvider.java:275) ... 6 more Received shutdown request...