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/ArraysOfVariableLength5_true-valid-memsafety.c_12.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-b8f97f7-m [2018-10-10 16:22:03,697 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 16:22:03,699 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 16:22:03,715 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 16:22:03,715 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 16:22:03,716 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 16:22:03,718 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 16:22:03,719 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 16:22:03,721 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 16:22:03,722 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 16:22:03,723 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 16:22:03,723 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 16:22:03,724 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 16:22:03,725 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 16:22:03,726 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 16:22:03,727 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 16:22:03,728 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 16:22:03,730 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 16:22:03,732 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 16:22:03,733 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 16:22:03,734 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 16:22:03,735 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 16:22:03,738 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 16:22:03,738 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 16:22:03,738 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 16:22:03,739 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 16:22:03,740 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 16:22:03,741 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 16:22:03,742 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 16:22:03,743 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 16:22:03,743 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 16:22:03,744 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 16:22:03,744 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 16:22:03,744 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 16:22:03,745 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 16:22:03,746 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 16:22:03,746 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-10 16:22:03,766 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 16:22:03,766 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 16:22:03,767 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-10 16:22:03,767 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-10 16:22:03,768 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-10 16:22:03,769 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-10 16:22:03,769 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 16:22:03,770 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-10 16:22:03,770 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 16:22:03,771 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-10 16:22:03,771 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-10 16:22:03,771 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-10 16:22:03,771 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-10 16:22:03,772 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-10 16:22:03,772 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-10 16:22:03,833 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 16:22:03,848 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 16:22:03,855 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 16:22:03,857 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-10 16:22:03,857 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-10 16:22:03,858 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysOfVariableLength5_true-valid-memsafety.c_12.bpl [2018-10-10 16:22:03,858 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysOfVariableLength5_true-valid-memsafety.c_12.bpl' [2018-10-10 16:22:03,920 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 16:22:03,922 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-10 16:22:03,922 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 16:22:03,923 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 16:22:03,923 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 16:22:03,949 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArraysOfVariableLength5_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:22:03" (1/1) ... [2018-10-10 16:22:03,951 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArraysOfVariableLength5_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:22:03" (1/1) ... [2018-10-10 16:22:03,966 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArraysOfVariableLength5_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:22:03" (1/1) ... [2018-10-10 16:22:03,966 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArraysOfVariableLength5_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:22:03" (1/1) ... [2018-10-10 16:22:03,971 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArraysOfVariableLength5_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:22:03" (1/1) ... [2018-10-10 16:22:03,973 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArraysOfVariableLength5_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:22:03" (1/1) ... [2018-10-10 16:22:03,975 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArraysOfVariableLength5_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:22:03" (1/1) ... [2018-10-10 16:22:03,978 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 16:22:03,979 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 16:22:03,980 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 16:22:03,980 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 16:22:03,981 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArraysOfVariableLength5_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:22:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-10 16:22:04,059 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-10 16:22:04,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 16:22:04,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 16:22:04,603 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 16:22:04,604 INFO L202 PluginConnector]: Adding new model ArraysOfVariableLength5_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 04:22:04 BoogieIcfgContainer [2018-10-10 16:22:04,604 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 16:22:04,604 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-10 16:22:04,604 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-10 16:22:04,605 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-10 16:22:04,609 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "ArraysOfVariableLength5_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 04:22:04" (1/1) ... [2018-10-10 16:22:04,618 INFO L137 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-10-10 16:22:04,618 INFO L138 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-10-10 16:22:04,658 INFO L191 apSepIcfgTransformer]: Heap separator: starting loc-array-style preprocessing [2018-10-10 16:22:04,725 INFO L217 apSepIcfgTransformer]: finished MemlocArrayUpdater [2018-10-10 16:22:04,747 INFO L280 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-10-10 16:22:04,831 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=1) [2018-10-10 16:22:18,634 INFO L315 AbstractInterpreter]: Visited 74 different actions 258 times. Merged at 43 different actions 175 times. Widened at 3 different actions 5 times. Found 8 fixpoints after 4 different actions. Largest state had 0 variables. [2018-10-10 16:22:18,639 INFO L304 apSepIcfgTransformer]: finished equality analysis [2018-10-10 16:22:18,644 INFO L316 apSepIcfgTransformer]: Finished detection of select terms ("array reads") [2018-10-10 16:22:18,687 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_7|) at (assume #memory_int == write~int_old_#memory_int[write~int_#ptr.base := write~int_old_#memory_int[write~int_#ptr.base][write~int_#ptr.offset := write~int_#value]];) [2018-10-10 16:22:18,691 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select |#loc_#memory_int_(Array-Int-#locsort1)| |v_ULTIMATE.start_read~int_#ptr.base_6|) at (assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value;) [2018-10-10 16:22:18,692 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select (select |#loc_#memory_int_(Array-Int-(Array-Int-#locsort2))| |v_ULTIMATE.start_read~int_#ptr.base_6|) |v_ULTIMATE.start_read~int_#ptr.offset_4|) at (assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value;) [2018-10-10 16:22:18,693 INFO L232 HeapPartitionManager]: partitioning result: [2018-10-10 16:22:18,694 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-10 16:22:18,694 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-10 16:22:18,694 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-10 16:22:18,695 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-10 16:22:18,695 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-10 16:22:18,695 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-10 16:22:18,695 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-10 16:22:18,696 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-10 16:22:18,696 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-10 16:22:18,697 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-10 16:22:18,697 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-10 16:22:18,697 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-10 16:22:18,697 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-10 16:22:18,699 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-10 16:22:18,701 INFO L145 ransitionTransformer]: executing heap partitioning transformation [2018-10-10 16:22:18,724 INFO L202 PluginConnector]: Adding new model ArraysOfVariableLength5_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.10 04:22:18 BasicIcfg [2018-10-10 16:22:18,725 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-10 16:22:18,726 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 16:22:18,726 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 16:22:18,730 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 16:22:18,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength5_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:22:03" (1/3) ... [2018-10-10 16:22:18,731 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7083394a and model type ArraysOfVariableLength5_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 04:22:18, skipping insertion in model container [2018-10-10 16:22:18,731 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength5_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 04:22:04" (2/3) ... [2018-10-10 16:22:18,732 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7083394a and model type ArraysOfVariableLength5_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 04:22:18, skipping insertion in model container [2018-10-10 16:22:18,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength5_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.10 04:22:18" (3/3) ... [2018-10-10 16:22:18,734 INFO L112 eAbstractionObserver]: Analyzing ICFG memPartitionedIcfg [2018-10-10 16:22:18,744 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-10 16:22:18,753 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-10 16:22:18,772 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-10 16:22:18,798 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 16:22:18,799 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 16:22:18,799 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 16:22:18,799 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-10 16:22:18,800 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 16:22:18,800 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 16:22:18,800 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 16:22:18,800 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 16:22:18,800 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 16:22:18,814 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2018-10-10 16:22:18,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-10 16:22:18,823 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:18,824 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] [2018-10-10 16:22:18,825 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:18,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:18,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1710141282, now seen corresponding path program 1 times [2018-10-10 16:22:18,899 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:18,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:19,685 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-10 16:22:21,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:22:21,083 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 16:22:21,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-10-10 16:22:21,088 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 16:22:21,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 16:22:21,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-10-10 16:22:21,184 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 12 states. [2018-10-10 16:22:21,646 WARN L178 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-10 16:22:22,120 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2018-10-10 16:22:22,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:22,297 INFO L93 Difference]: Finished difference Result 141 states and 144 transitions. [2018-10-10 16:22:22,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-10 16:22:22,305 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2018-10-10 16:22:22,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:22,320 INFO L225 Difference]: With dead ends: 141 [2018-10-10 16:22:22,321 INFO L226 Difference]: Without dead ends: 141 [2018-10-10 16:22:22,327 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=103, Invalid=359, Unknown=0, NotChecked=0, Total=462 [2018-10-10 16:22:22,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-10-10 16:22:22,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 103. [2018-10-10 16:22:22,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-10-10 16:22:22,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 105 transitions. [2018-10-10 16:22:22,385 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 105 transitions. Word has length 48 [2018-10-10 16:22:22,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:22,386 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 105 transitions. [2018-10-10 16:22:22,386 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 16:22:22,386 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 105 transitions. [2018-10-10 16:22:22,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-10 16:22:22,390 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:22,390 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:22:22,391 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:22,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:22,392 INFO L82 PathProgramCache]: Analyzing trace with hash 887259751, now seen corresponding path program 1 times [2018-10-10 16:22:22,393 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:22,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:22,700 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:22:22,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:22,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-10 16:22:22,702 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 16:22:22,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 16:22:22,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-10 16:22:22,703 INFO L87 Difference]: Start difference. First operand 103 states and 105 transitions. Second operand 8 states. [2018-10-10 16:22:23,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:23,143 INFO L93 Difference]: Finished difference Result 172 states and 175 transitions. [2018-10-10 16:22:23,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 16:22:23,143 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 74 [2018-10-10 16:22:23,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:23,146 INFO L225 Difference]: With dead ends: 172 [2018-10-10 16:22:23,147 INFO L226 Difference]: Without dead ends: 172 [2018-10-10 16:22:23,148 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-10-10 16:22:23,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-10-10 16:22:23,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 122. [2018-10-10 16:22:23,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-10-10 16:22:23,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 124 transitions. [2018-10-10 16:22:23,163 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 124 transitions. Word has length 74 [2018-10-10 16:22:23,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:23,163 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 124 transitions. [2018-10-10 16:22:23,163 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 16:22:23,164 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 124 transitions. [2018-10-10 16:22:23,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-10-10 16:22:23,166 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:23,169 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:22:23,169 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:23,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:23,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1411574741, now seen corresponding path program 1 times [2018-10-10 16:22:23,171 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:23,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:23,647 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-10 16:22:23,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:23,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-10 16:22:23,648 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-10 16:22:23,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-10 16:22:23,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-10-10 16:22:23,649 INFO L87 Difference]: Start difference. First operand 122 states and 124 transitions. Second operand 15 states. [2018-10-10 16:22:24,950 WARN L178 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-10-10 16:22:25,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:25,038 INFO L93 Difference]: Finished difference Result 182 states and 186 transitions. [2018-10-10 16:22:25,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-10 16:22:25,038 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 89 [2018-10-10 16:22:25,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:25,040 INFO L225 Difference]: With dead ends: 182 [2018-10-10 16:22:25,041 INFO L226 Difference]: Without dead ends: 182 [2018-10-10 16:22:25,041 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=192, Invalid=738, Unknown=0, NotChecked=0, Total=930 [2018-10-10 16:22:25,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-10-10 16:22:25,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 144. [2018-10-10 16:22:25,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-10-10 16:22:25,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 147 transitions. [2018-10-10 16:22:25,052 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 147 transitions. Word has length 89 [2018-10-10 16:22:25,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:25,053 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 147 transitions. [2018-10-10 16:22:25,053 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-10 16:22:25,054 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 147 transitions. [2018-10-10 16:22:25,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-10 16:22:25,055 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:25,056 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:22:25,056 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:25,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:25,056 INFO L82 PathProgramCache]: Analyzing trace with hash -1604927564, now seen corresponding path program 2 times [2018-10-10 16:22:25,057 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:25,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:25,231 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 18 proven. 46 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-10 16:22:25,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:25,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-10 16:22:25,232 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 16:22:25,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 16:22:25,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-10-10 16:22:25,233 INFO L87 Difference]: Start difference. First operand 144 states and 147 transitions. Second operand 10 states. [2018-10-10 16:22:26,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:26,015 INFO L93 Difference]: Finished difference Result 171 states and 174 transitions. [2018-10-10 16:22:26,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-10 16:22:26,016 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 115 [2018-10-10 16:22:26,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:26,019 INFO L225 Difference]: With dead ends: 171 [2018-10-10 16:22:26,019 INFO L226 Difference]: Without dead ends: 171 [2018-10-10 16:22:26,020 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2018-10-10 16:22:26,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-10-10 16:22:26,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 145. [2018-10-10 16:22:26,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-10-10 16:22:26,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 148 transitions. [2018-10-10 16:22:26,031 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 148 transitions. Word has length 115 [2018-10-10 16:22:26,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:26,031 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 148 transitions. [2018-10-10 16:22:26,032 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 16:22:26,032 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 148 transitions. [2018-10-10 16:22:26,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-10 16:22:26,034 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:26,034 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:22:26,034 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:26,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:26,035 INFO L82 PathProgramCache]: Analyzing trace with hash 78050110, now seen corresponding path program 3 times [2018-10-10 16:22:26,036 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:26,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:26,231 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 18 proven. 64 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-10 16:22:26,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:26,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-10 16:22:26,232 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 16:22:26,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 16:22:26,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-10-10 16:22:26,233 INFO L87 Difference]: Start difference. First operand 145 states and 148 transitions. Second operand 12 states. [2018-10-10 16:22:26,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:26,682 INFO L93 Difference]: Finished difference Result 173 states and 176 transitions. [2018-10-10 16:22:26,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-10 16:22:26,683 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 130 [2018-10-10 16:22:26,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:26,685 INFO L225 Difference]: With dead ends: 173 [2018-10-10 16:22:26,685 INFO L226 Difference]: Without dead ends: 173 [2018-10-10 16:22:26,686 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=477, Unknown=0, NotChecked=0, Total=600 [2018-10-10 16:22:26,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-10-10 16:22:26,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 160. [2018-10-10 16:22:26,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-10-10 16:22:26,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 163 transitions. [2018-10-10 16:22:26,695 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 163 transitions. Word has length 130 [2018-10-10 16:22:26,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:26,695 INFO L481 AbstractCegarLoop]: Abstraction has 160 states and 163 transitions. [2018-10-10 16:22:26,696 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 16:22:26,696 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 163 transitions. [2018-10-10 16:22:26,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-10-10 16:22:26,698 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:26,698 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:22:26,698 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:26,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:26,699 INFO L82 PathProgramCache]: Analyzing trace with hash 506198644, now seen corresponding path program 4 times [2018-10-10 16:22:26,700 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:26,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:27,296 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-10 16:22:27,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:27,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-10 16:22:27,297 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-10 16:22:27,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-10 16:22:27,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2018-10-10 16:22:27,298 INFO L87 Difference]: Start difference. First operand 160 states and 163 transitions. Second operand 18 states. [2018-10-10 16:22:28,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:28,645 INFO L93 Difference]: Finished difference Result 270 states and 275 transitions. [2018-10-10 16:22:28,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-10 16:22:28,652 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 145 [2018-10-10 16:22:28,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:28,654 INFO L225 Difference]: With dead ends: 270 [2018-10-10 16:22:28,654 INFO L226 Difference]: Without dead ends: 270 [2018-10-10 16:22:28,655 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=242, Invalid=1090, Unknown=0, NotChecked=0, Total=1332 [2018-10-10 16:22:28,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-10-10 16:22:28,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 216. [2018-10-10 16:22:28,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-10-10 16:22:28,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 220 transitions. [2018-10-10 16:22:28,667 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 220 transitions. Word has length 145 [2018-10-10 16:22:28,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:28,667 INFO L481 AbstractCegarLoop]: Abstraction has 216 states and 220 transitions. [2018-10-10 16:22:28,667 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-10 16:22:28,667 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 220 transitions. [2018-10-10 16:22:28,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-10-10 16:22:28,671 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:28,671 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:22:28,671 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:28,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:28,672 INFO L82 PathProgramCache]: Analyzing trace with hash 96956861, now seen corresponding path program 5 times [2018-10-10 16:22:28,672 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:28,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:29,005 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 88 proven. 196 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-10 16:22:29,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:29,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-10 16:22:29,006 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-10 16:22:29,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-10 16:22:29,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-10-10 16:22:29,007 INFO L87 Difference]: Start difference. First operand 216 states and 220 transitions. Second operand 16 states. [2018-10-10 16:22:29,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:29,828 INFO L93 Difference]: Finished difference Result 244 states and 248 transitions. [2018-10-10 16:22:29,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-10 16:22:29,829 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 201 [2018-10-10 16:22:29,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:29,831 INFO L225 Difference]: With dead ends: 244 [2018-10-10 16:22:29,831 INFO L226 Difference]: Without dead ends: 244 [2018-10-10 16:22:29,832 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=232, Invalid=958, Unknown=0, NotChecked=0, Total=1190 [2018-10-10 16:22:29,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-10-10 16:22:29,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 231. [2018-10-10 16:22:29,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-10-10 16:22:29,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 235 transitions. [2018-10-10 16:22:29,839 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 235 transitions. Word has length 201 [2018-10-10 16:22:29,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:29,840 INFO L481 AbstractCegarLoop]: Abstraction has 231 states and 235 transitions. [2018-10-10 16:22:29,840 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-10 16:22:29,840 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 235 transitions. [2018-10-10 16:22:29,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-10-10 16:22:29,843 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:29,843 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:22:29,843 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:29,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:29,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1805438485, now seen corresponding path program 6 times [2018-10-10 16:22:29,845 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:29,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:30,999 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 348 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-10-10 16:22:31,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:31,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-10 16:22:31,000 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-10 16:22:31,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-10 16:22:31,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=569, Unknown=0, NotChecked=0, Total=650 [2018-10-10 16:22:31,001 INFO L87 Difference]: Start difference. First operand 231 states and 235 transitions. Second operand 26 states. [2018-10-10 16:22:36,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:36,239 INFO L93 Difference]: Finished difference Result 472 states and 479 transitions. [2018-10-10 16:22:36,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-10 16:22:36,239 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 216 [2018-10-10 16:22:36,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:36,242 INFO L225 Difference]: With dead ends: 472 [2018-10-10 16:22:36,243 INFO L226 Difference]: Without dead ends: 472 [2018-10-10 16:22:36,250 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2053 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1316, Invalid=5994, Unknown=0, NotChecked=0, Total=7310 [2018-10-10 16:22:36,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2018-10-10 16:22:36,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 288. [2018-10-10 16:22:36,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-10-10 16:22:36,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 292 transitions. [2018-10-10 16:22:36,257 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 292 transitions. Word has length 216 [2018-10-10 16:22:36,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:36,258 INFO L481 AbstractCegarLoop]: Abstraction has 288 states and 292 transitions. [2018-10-10 16:22:36,258 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-10 16:22:36,258 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 292 transitions. [2018-10-10 16:22:36,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-10-10 16:22:36,261 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:36,262 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:22:36,262 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:36,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:36,262 INFO L82 PathProgramCache]: Analyzing trace with hash 607935316, now seen corresponding path program 7 times [2018-10-10 16:22:36,263 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:36,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:37,362 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 295 proven. 452 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2018-10-10 16:22:37,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:37,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-10 16:22:37,363 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-10 16:22:37,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-10 16:22:37,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2018-10-10 16:22:37,364 INFO L87 Difference]: Start difference. First operand 288 states and 292 transitions. Second operand 20 states. [2018-10-10 16:22:38,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:38,317 INFO L93 Difference]: Finished difference Result 316 states and 320 transitions. [2018-10-10 16:22:38,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-10 16:22:38,317 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 287 [2018-10-10 16:22:38,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:38,321 INFO L225 Difference]: With dead ends: 316 [2018-10-10 16:22:38,321 INFO L226 Difference]: Without dead ends: 316 [2018-10-10 16:22:38,322 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=375, Invalid=1517, Unknown=0, NotChecked=0, Total=1892 [2018-10-10 16:22:38,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-10-10 16:22:38,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 303. [2018-10-10 16:22:38,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-10-10 16:22:38,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 307 transitions. [2018-10-10 16:22:38,327 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 307 transitions. Word has length 287 [2018-10-10 16:22:38,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:38,327 INFO L481 AbstractCegarLoop]: Abstraction has 303 states and 307 transitions. [2018-10-10 16:22:38,327 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-10 16:22:38,328 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 307 transitions. [2018-10-10 16:22:38,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-10-10 16:22:38,331 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:38,331 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:22:38,332 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:38,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:38,332 INFO L82 PathProgramCache]: Analyzing trace with hash -425548898, now seen corresponding path program 8 times [2018-10-10 16:22:38,333 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:38,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:39,328 INFO L134 CoverageAnalysis]: Checked inductivity of 953 backedges. 0 proven. 842 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2018-10-10 16:22:39,328 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:39,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-10 16:22:39,329 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-10 16:22:39,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-10 16:22:39,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=662, Unknown=0, NotChecked=0, Total=756 [2018-10-10 16:22:39,330 INFO L87 Difference]: Start difference. First operand 303 states and 307 transitions. Second operand 28 states. [2018-10-10 16:22:45,566 WARN L178 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-10-10 16:22:45,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:45,931 INFO L93 Difference]: Finished difference Result 588 states and 596 transitions. [2018-10-10 16:22:45,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-10 16:22:45,931 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 302 [2018-10-10 16:22:45,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:45,934 INFO L225 Difference]: With dead ends: 588 [2018-10-10 16:22:45,934 INFO L226 Difference]: Without dead ends: 588 [2018-10-10 16:22:45,936 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2876 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=1695, Invalid=8007, Unknown=0, NotChecked=0, Total=9702 [2018-10-10 16:22:45,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2018-10-10 16:22:45,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 389. [2018-10-10 16:22:45,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2018-10-10 16:22:45,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 394 transitions. [2018-10-10 16:22:45,944 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 394 transitions. Word has length 302 [2018-10-10 16:22:45,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:45,945 INFO L481 AbstractCegarLoop]: Abstraction has 389 states and 394 transitions. [2018-10-10 16:22:45,945 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-10 16:22:45,945 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 394 transitions. [2018-10-10 16:22:45,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2018-10-10 16:22:45,947 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:45,948 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:22:45,948 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:45,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:45,948 INFO L82 PathProgramCache]: Analyzing trace with hash -7670681, now seen corresponding path program 9 times [2018-10-10 16:22:45,949 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:45,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:47,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1799 backedges. 0 proven. 1594 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2018-10-10 16:22:47,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:47,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-10 16:22:47,118 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-10 16:22:47,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-10 16:22:47,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=761, Unknown=0, NotChecked=0, Total=870 [2018-10-10 16:22:47,119 INFO L87 Difference]: Start difference. First operand 389 states and 394 transitions. Second operand 30 states. [2018-10-10 16:22:54,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:54,642 INFO L93 Difference]: Finished difference Result 674 states and 683 transitions. [2018-10-10 16:22:54,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-10-10 16:22:54,645 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 388 [2018-10-10 16:22:54,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:54,648 INFO L225 Difference]: With dead ends: 674 [2018-10-10 16:22:54,648 INFO L226 Difference]: Without dead ends: 674 [2018-10-10 16:22:54,651 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3851 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=2133, Invalid=10299, Unknown=0, NotChecked=0, Total=12432 [2018-10-10 16:22:54,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2018-10-10 16:22:54,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 475. [2018-10-10 16:22:54,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 475 states. [2018-10-10 16:22:54,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 481 transitions. [2018-10-10 16:22:54,660 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 481 transitions. Word has length 388 [2018-10-10 16:22:54,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:54,661 INFO L481 AbstractCegarLoop]: Abstraction has 475 states and 481 transitions. [2018-10-10 16:22:54,661 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-10 16:22:54,661 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 481 transitions. [2018-10-10 16:22:54,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2018-10-10 16:22:54,664 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:54,664 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:22:54,665 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:54,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:54,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1209806736, now seen corresponding path program 10 times [2018-10-10 16:22:54,666 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:54,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:55,558 INFO L134 CoverageAnalysis]: Checked inductivity of 2919 backedges. 1503 proven. 1162 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2018-10-10 16:22:55,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:55,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-10 16:22:55,559 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-10 16:22:55,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-10 16:22:55,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2018-10-10 16:22:55,560 INFO L87 Difference]: Start difference. First operand 475 states and 481 transitions. Second operand 26 states. [2018-10-10 16:22:57,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:22:57,148 INFO L93 Difference]: Finished difference Result 516 states and 522 transitions. [2018-10-10 16:22:57,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-10 16:22:57,148 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 474 [2018-10-10 16:22:57,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:22:57,152 INFO L225 Difference]: With dead ends: 516 [2018-10-10 16:22:57,153 INFO L226 Difference]: Without dead ends: 516 [2018-10-10 16:22:57,154 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=554, Invalid=2308, Unknown=0, NotChecked=0, Total=2862 [2018-10-10 16:22:57,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2018-10-10 16:22:57,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 490. [2018-10-10 16:22:57,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2018-10-10 16:22:57,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 496 transitions. [2018-10-10 16:22:57,161 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 496 transitions. Word has length 474 [2018-10-10 16:22:57,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:22:57,162 INFO L481 AbstractCegarLoop]: Abstraction has 490 states and 496 transitions. [2018-10-10 16:22:57,162 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-10 16:22:57,162 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 496 transitions. [2018-10-10 16:22:57,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 490 [2018-10-10 16:22:57,165 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:22:57,166 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:22:57,166 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:22:57,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:22:57,166 INFO L82 PathProgramCache]: Analyzing trace with hash 108450562, now seen corresponding path program 11 times [2018-10-10 16:22:57,167 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:22:57,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:22:58,374 INFO L134 CoverageAnalysis]: Checked inductivity of 3196 backedges. 1503 proven. 1439 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2018-10-10 16:22:58,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:22:58,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-10 16:22:58,375 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-10 16:22:58,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-10 16:22:58,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=651, Unknown=0, NotChecked=0, Total=756 [2018-10-10 16:22:58,376 INFO L87 Difference]: Start difference. First operand 490 states and 496 transitions. Second operand 28 states. [2018-10-10 16:23:00,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:00,207 INFO L93 Difference]: Finished difference Result 518 states and 524 transitions. [2018-10-10 16:23:00,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-10 16:23:00,208 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 489 [2018-10-10 16:23:00,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:00,210 INFO L225 Difference]: With dead ends: 518 [2018-10-10 16:23:00,210 INFO L226 Difference]: Without dead ends: 518 [2018-10-10 16:23:00,211 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=783, Invalid=3249, Unknown=0, NotChecked=0, Total=4032 [2018-10-10 16:23:00,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2018-10-10 16:23:00,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 505. [2018-10-10 16:23:00,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2018-10-10 16:23:00,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 511 transitions. [2018-10-10 16:23:00,219 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 511 transitions. Word has length 489 [2018-10-10 16:23:00,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:00,220 INFO L481 AbstractCegarLoop]: Abstraction has 505 states and 511 transitions. [2018-10-10 16:23:00,220 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-10 16:23:00,220 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 511 transitions. [2018-10-10 16:23:00,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2018-10-10 16:23:00,223 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:00,224 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:23:00,224 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:00,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:00,224 INFO L82 PathProgramCache]: Analyzing trace with hash 678435376, now seen corresponding path program 12 times [2018-10-10 16:23:00,225 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:00,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:01,538 INFO L134 CoverageAnalysis]: Checked inductivity of 3488 backedges. 2213 proven. 877 refuted. 0 times theorem prover too weak. 398 trivial. 0 not checked. [2018-10-10 16:23:01,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:01,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-10 16:23:01,539 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-10 16:23:01,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-10 16:23:01,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2018-10-10 16:23:01,540 INFO L87 Difference]: Start difference. First operand 505 states and 511 transitions. Second operand 24 states. [2018-10-10 16:23:02,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:02,746 INFO L93 Difference]: Finished difference Result 520 states and 526 transitions. [2018-10-10 16:23:02,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-10 16:23:02,747 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 504 [2018-10-10 16:23:02,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:02,751 INFO L225 Difference]: With dead ends: 520 [2018-10-10 16:23:02,751 INFO L226 Difference]: Without dead ends: 520 [2018-10-10 16:23:02,753 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=560, Invalid=2302, Unknown=0, NotChecked=0, Total=2862 [2018-10-10 16:23:02,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2018-10-10 16:23:02,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 520. [2018-10-10 16:23:02,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-10-10 16:23:02,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 526 transitions. [2018-10-10 16:23:02,761 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 526 transitions. Word has length 504 [2018-10-10 16:23:02,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:02,761 INFO L481 AbstractCegarLoop]: Abstraction has 520 states and 526 transitions. [2018-10-10 16:23:02,761 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-10 16:23:02,762 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 526 transitions. [2018-10-10 16:23:02,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2018-10-10 16:23:02,765 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:02,765 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:23:02,765 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:02,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:02,766 INFO L82 PathProgramCache]: Analyzing trace with hash 23776756, now seen corresponding path program 13 times [2018-10-10 16:23:02,767 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:02,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:04,319 INFO L134 CoverageAnalysis]: Checked inductivity of 3795 backedges. 0 proven. 3330 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2018-10-10 16:23:04,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:04,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-10 16:23:04,320 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-10 16:23:04,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-10 16:23:04,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=866, Unknown=0, NotChecked=0, Total=992 [2018-10-10 16:23:04,321 INFO L87 Difference]: Start difference. First operand 520 states and 526 transitions. Second operand 32 states. [2018-10-10 16:23:10,664 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2018-10-10 16:23:12,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:12,464 INFO L93 Difference]: Finished difference Result 865 states and 875 transitions. [2018-10-10 16:23:12,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-10-10 16:23:12,465 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 519 [2018-10-10 16:23:12,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:12,469 INFO L225 Difference]: With dead ends: 865 [2018-10-10 16:23:12,470 INFO L226 Difference]: Without dead ends: 865 [2018-10-10 16:23:12,474 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4978 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=2630, Invalid=12870, Unknown=0, NotChecked=0, Total=15500 [2018-10-10 16:23:12,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2018-10-10 16:23:12,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 636. [2018-10-10 16:23:12,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2018-10-10 16:23:12,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 643 transitions. [2018-10-10 16:23:12,484 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 643 transitions. Word has length 519 [2018-10-10 16:23:12,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:12,485 INFO L481 AbstractCegarLoop]: Abstraction has 636 states and 643 transitions. [2018-10-10 16:23:12,485 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-10 16:23:12,485 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 643 transitions. [2018-10-10 16:23:12,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 636 [2018-10-10 16:23:12,489 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:12,490 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:23:12,490 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:12,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:12,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1377153219, now seen corresponding path program 14 times [2018-10-10 16:23:12,491 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:12,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:14,997 INFO L134 CoverageAnalysis]: Checked inductivity of 6153 backedges. 0 proven. 5457 refuted. 0 times theorem prover too weak. 696 trivial. 0 not checked. [2018-10-10 16:23:14,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:14,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-10 16:23:14,999 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-10 16:23:14,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-10 16:23:14,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=977, Unknown=0, NotChecked=0, Total=1122 [2018-10-10 16:23:14,999 INFO L87 Difference]: Start difference. First operand 636 states and 643 transitions. Second operand 34 states. [2018-10-10 16:23:24,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:24,251 INFO L93 Difference]: Finished difference Result 981 states and 992 transitions. [2018-10-10 16:23:24,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-10-10 16:23:24,252 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 635 [2018-10-10 16:23:24,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:24,256 INFO L225 Difference]: With dead ends: 981 [2018-10-10 16:23:24,256 INFO L226 Difference]: Without dead ends: 981 [2018-10-10 16:23:24,258 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6257 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=3186, Invalid=15720, Unknown=0, NotChecked=0, Total=18906 [2018-10-10 16:23:24,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2018-10-10 16:23:24,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 752. [2018-10-10 16:23:24,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 752 states. [2018-10-10 16:23:24,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 760 transitions. [2018-10-10 16:23:24,268 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 760 transitions. Word has length 635 [2018-10-10 16:23:24,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:24,269 INFO L481 AbstractCegarLoop]: Abstraction has 752 states and 760 transitions. [2018-10-10 16:23:24,269 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-10 16:23:24,269 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 760 transitions. [2018-10-10 16:23:24,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 752 [2018-10-10 16:23:24,274 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:24,275 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:23:24,275 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:24,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:24,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1854069242, now seen corresponding path program 15 times [2018-10-10 16:23:24,276 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:24,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:26,761 INFO L134 CoverageAnalysis]: Checked inductivity of 9089 backedges. 0 proven. 8162 refuted. 0 times theorem prover too weak. 927 trivial. 0 not checked. [2018-10-10 16:23:26,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:26,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-10 16:23:26,762 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-10 16:23:26,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-10 16:23:26,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1094, Unknown=0, NotChecked=0, Total=1260 [2018-10-10 16:23:26,763 INFO L87 Difference]: Start difference. First operand 752 states and 760 transitions. Second operand 36 states. [2018-10-10 16:23:37,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:37,065 INFO L93 Difference]: Finished difference Result 1097 states and 1109 transitions. [2018-10-10 16:23:37,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-10-10 16:23:37,065 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 751 [2018-10-10 16:23:37,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:37,070 INFO L225 Difference]: With dead ends: 1097 [2018-10-10 16:23:37,071 INFO L226 Difference]: Without dead ends: 1097 [2018-10-10 16:23:37,074 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7688 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=3801, Invalid=18849, Unknown=0, NotChecked=0, Total=22650 [2018-10-10 16:23:37,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2018-10-10 16:23:37,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 868. [2018-10-10 16:23:37,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 868 states. [2018-10-10 16:23:37,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 877 transitions. [2018-10-10 16:23:37,085 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 877 transitions. Word has length 751 [2018-10-10 16:23:37,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:37,086 INFO L481 AbstractCegarLoop]: Abstraction has 868 states and 877 transitions. [2018-10-10 16:23:37,086 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-10 16:23:37,086 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 877 transitions. [2018-10-10 16:23:37,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 868 [2018-10-10 16:23:37,093 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:37,093 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:23:37,094 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:37,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:37,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1803522639, now seen corresponding path program 16 times [2018-10-10 16:23:37,095 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:37,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:38,235 INFO L134 CoverageAnalysis]: Checked inductivity of 12603 backedges. 8583 proven. 3005 refuted. 0 times theorem prover too weak. 1015 trivial. 0 not checked. [2018-10-10 16:23:38,236 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:38,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-10 16:23:38,237 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-10 16:23:38,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-10 16:23:38,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=970, Unknown=0, NotChecked=0, Total=1122 [2018-10-10 16:23:38,237 INFO L87 Difference]: Start difference. First operand 868 states and 877 transitions. Second operand 34 states. [2018-10-10 16:23:40,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:40,019 INFO L93 Difference]: Finished difference Result 924 states and 933 transitions. [2018-10-10 16:23:40,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-10 16:23:40,019 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 867 [2018-10-10 16:23:40,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:40,025 INFO L225 Difference]: With dead ends: 924 [2018-10-10 16:23:40,025 INFO L226 Difference]: Without dead ends: 924 [2018-10-10 16:23:40,025 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1112 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=976, Invalid=4136, Unknown=0, NotChecked=0, Total=5112 [2018-10-10 16:23:40,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2018-10-10 16:23:40,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 898. [2018-10-10 16:23:40,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 898 states. [2018-10-10 16:23:40,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 907 transitions. [2018-10-10 16:23:40,035 INFO L78 Accepts]: Start accepts. Automaton has 898 states and 907 transitions. Word has length 867 [2018-10-10 16:23:40,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:40,036 INFO L481 AbstractCegarLoop]: Abstraction has 898 states and 907 transitions. [2018-10-10 16:23:40,036 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-10 16:23:40,036 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 907 transitions. [2018-10-10 16:23:40,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 898 [2018-10-10 16:23:40,043 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:40,044 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:23:40,044 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:40,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:40,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1668655907, now seen corresponding path program 17 times [2018-10-10 16:23:40,045 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:40,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:41,711 INFO L134 CoverageAnalysis]: Checked inductivity of 13808 backedges. 9415 proven. 2414 refuted. 0 times theorem prover too weak. 1979 trivial. 0 not checked. [2018-10-10 16:23:41,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:41,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-10 16:23:41,712 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-10 16:23:41,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-10 16:23:41,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=857, Unknown=0, NotChecked=0, Total=992 [2018-10-10 16:23:41,713 INFO L87 Difference]: Start difference. First operand 898 states and 907 transitions. Second operand 32 states. [2018-10-10 16:23:43,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:43,852 INFO L93 Difference]: Finished difference Result 913 states and 922 transitions. [2018-10-10 16:23:43,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-10 16:23:43,852 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 897 [2018-10-10 16:23:43,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:43,857 INFO L225 Difference]: With dead ends: 913 [2018-10-10 16:23:43,857 INFO L226 Difference]: Without dead ends: 913 [2018-10-10 16:23:43,858 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1133 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1044, Invalid=4358, Unknown=0, NotChecked=0, Total=5402 [2018-10-10 16:23:43,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2018-10-10 16:23:43,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 913. [2018-10-10 16:23:43,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 913 states. [2018-10-10 16:23:43,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 922 transitions. [2018-10-10 16:23:43,867 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 922 transitions. Word has length 897 [2018-10-10 16:23:43,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:43,868 INFO L481 AbstractCegarLoop]: Abstraction has 913 states and 922 transitions. [2018-10-10 16:23:43,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-10 16:23:43,868 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 922 transitions. [2018-10-10 16:23:43,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 913 [2018-10-10 16:23:43,876 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:43,876 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:23:43,877 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:43,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:43,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1369695285, now seen corresponding path program 18 times [2018-10-10 16:23:43,878 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:43,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:45,207 INFO L134 CoverageAnalysis]: Checked inductivity of 14433 backedges. 9620 proven. 3616 refuted. 0 times theorem prover too weak. 1197 trivial. 0 not checked. [2018-10-10 16:23:45,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:45,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-10 16:23:45,209 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-10 16:23:45,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-10 16:23:45,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1091, Unknown=0, NotChecked=0, Total=1260 [2018-10-10 16:23:45,210 INFO L87 Difference]: Start difference. First operand 913 states and 922 transitions. Second operand 36 states. [2018-10-10 16:23:47,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:23:47,924 INFO L93 Difference]: Finished difference Result 943 states and 952 transitions. [2018-10-10 16:23:47,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-10 16:23:47,925 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 912 [2018-10-10 16:23:47,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:23:47,930 INFO L225 Difference]: With dead ends: 943 [2018-10-10 16:23:47,930 INFO L226 Difference]: Without dead ends: 943 [2018-10-10 16:23:47,931 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1499 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1343, Invalid=5629, Unknown=0, NotChecked=0, Total=6972 [2018-10-10 16:23:47,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2018-10-10 16:23:47,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 943. [2018-10-10 16:23:47,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 943 states. [2018-10-10 16:23:47,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 952 transitions. [2018-10-10 16:23:47,941 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 952 transitions. Word has length 912 [2018-10-10 16:23:47,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:23:47,942 INFO L481 AbstractCegarLoop]: Abstraction has 943 states and 952 transitions. [2018-10-10 16:23:47,942 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-10 16:23:47,942 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 952 transitions. [2018-10-10 16:23:47,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 943 [2018-10-10 16:23:47,950 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:23:47,951 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:23:47,951 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:23:47,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:23:47,951 INFO L82 PathProgramCache]: Analyzing trace with hash 58605671, now seen corresponding path program 19 times [2018-10-10 16:23:47,952 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:23:48,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:23:51,289 INFO L134 CoverageAnalysis]: Checked inductivity of 15728 backedges. 0 proven. 14117 refuted. 0 times theorem prover too weak. 1611 trivial. 0 not checked. [2018-10-10 16:23:51,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:23:51,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-10 16:23:51,290 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-10 16:23:51,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-10 16:23:51,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1217, Unknown=0, NotChecked=0, Total=1406 [2018-10-10 16:23:51,291 INFO L87 Difference]: Start difference. First operand 943 states and 952 transitions. Second operand 38 states. [2018-10-10 16:24:01,680 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2018-10-10 16:24:02,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:24:02,576 INFO L93 Difference]: Finished difference Result 1348 states and 1361 transitions. [2018-10-10 16:24:02,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-10-10 16:24:02,577 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 942 [2018-10-10 16:24:02,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:24:02,581 INFO L225 Difference]: With dead ends: 1348 [2018-10-10 16:24:02,581 INFO L226 Difference]: Without dead ends: 1348 [2018-10-10 16:24:02,582 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9271 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=4475, Invalid=22257, Unknown=0, NotChecked=0, Total=26732 [2018-10-10 16:24:02,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1348 states. [2018-10-10 16:24:02,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1348 to 1089. [2018-10-10 16:24:02,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1089 states. [2018-10-10 16:24:02,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 1089 states and 1099 transitions. [2018-10-10 16:24:02,595 INFO L78 Accepts]: Start accepts. Automaton has 1089 states and 1099 transitions. Word has length 942 [2018-10-10 16:24:02,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:24:02,596 INFO L481 AbstractCegarLoop]: Abstraction has 1089 states and 1099 transitions. [2018-10-10 16:24:02,596 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-10 16:24:02,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1089 states and 1099 transitions. [2018-10-10 16:24:02,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1089 [2018-10-10 16:24:02,606 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:24:02,606 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:24:02,607 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:24:02,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:24:02,607 INFO L82 PathProgramCache]: Analyzing trace with hash -47898640, now seen corresponding path program 20 times [2018-10-10 16:24:02,608 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:24:02,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:24:06,806 INFO L134 CoverageAnalysis]: Checked inductivity of 21812 backedges. 0 proven. 19773 refuted. 0 times theorem prover too weak. 2039 trivial. 0 not checked. [2018-10-10 16:24:06,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:24:06,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-10 16:24:06,807 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-10 16:24:06,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-10 16:24:06,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=1346, Unknown=0, NotChecked=0, Total=1560 [2018-10-10 16:24:06,808 INFO L87 Difference]: Start difference. First operand 1089 states and 1099 transitions. Second operand 40 states. [2018-10-10 16:24:19,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:24:19,730 INFO L93 Difference]: Finished difference Result 1494 states and 1508 transitions. [2018-10-10 16:24:19,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-10-10 16:24:19,733 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 1088 [2018-10-10 16:24:19,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:24:19,737 INFO L225 Difference]: With dead ends: 1494 [2018-10-10 16:24:19,737 INFO L226 Difference]: Without dead ends: 1494 [2018-10-10 16:24:19,739 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11006 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=5208, Invalid=25944, Unknown=0, NotChecked=0, Total=31152 [2018-10-10 16:24:19,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1494 states. [2018-10-10 16:24:19,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1494 to 1235. [2018-10-10 16:24:19,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1235 states. [2018-10-10 16:24:19,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1246 transitions. [2018-10-10 16:24:19,752 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 1246 transitions. Word has length 1088 [2018-10-10 16:24:19,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:24:19,753 INFO L481 AbstractCegarLoop]: Abstraction has 1235 states and 1246 transitions. [2018-10-10 16:24:19,753 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-10 16:24:19,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1246 transitions. [2018-10-10 16:24:19,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1235 [2018-10-10 16:24:19,766 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:24:19,766 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:24:19,767 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:24:19,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:24:19,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1608319175, now seen corresponding path program 21 times [2018-10-10 16:24:19,768 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:24:19,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:24:24,965 INFO L134 CoverageAnalysis]: Checked inductivity of 28898 backedges. 0 proven. 26431 refuted. 0 times theorem prover too weak. 2467 trivial. 0 not checked. [2018-10-10 16:24:24,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:24:24,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-10 16:24:24,967 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-10 16:24:24,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-10 16:24:24,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=1481, Unknown=0, NotChecked=0, Total=1722 [2018-10-10 16:24:24,967 INFO L87 Difference]: Start difference. First operand 1235 states and 1246 transitions. Second operand 42 states. [2018-10-10 16:24:34,302 WARN L178 SmtUtils]: Spent 234.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-10-10 16:24:40,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:24:40,004 INFO L93 Difference]: Finished difference Result 1640 states and 1655 transitions. [2018-10-10 16:24:40,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2018-10-10 16:24:40,004 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 1234 [2018-10-10 16:24:40,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:24:40,010 INFO L225 Difference]: With dead ends: 1640 [2018-10-10 16:24:40,010 INFO L226 Difference]: Without dead ends: 1640 [2018-10-10 16:24:40,012 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12893 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=6000, Invalid=29910, Unknown=0, NotChecked=0, Total=35910 [2018-10-10 16:24:40,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1640 states. [2018-10-10 16:24:40,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1640 to 1381. [2018-10-10 16:24:40,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1381 states. [2018-10-10 16:24:40,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1381 states and 1393 transitions. [2018-10-10 16:24:40,025 INFO L78 Accepts]: Start accepts. Automaton has 1381 states and 1393 transitions. Word has length 1234 [2018-10-10 16:24:40,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:24:40,026 INFO L481 AbstractCegarLoop]: Abstraction has 1381 states and 1393 transitions. [2018-10-10 16:24:40,026 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-10 16:24:40,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 1393 transitions. [2018-10-10 16:24:40,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1381 [2018-10-10 16:24:40,042 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:24:40,042 INFO L375 BasicCegarLoop]: trace histogram [68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:24:40,043 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:24:40,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:24:40,043 INFO L82 PathProgramCache]: Analyzing trace with hash 291728962, now seen corresponding path program 22 times [2018-10-10 16:24:40,044 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:24:40,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:24:41,182 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-10 16:24:47,011 INFO L134 CoverageAnalysis]: Checked inductivity of 36986 backedges. 0 proven. 34091 refuted. 0 times theorem prover too weak. 2895 trivial. 0 not checked. [2018-10-10 16:24:47,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:24:47,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-10 16:24:47,012 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-10 16:24:47,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-10 16:24:47,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=1622, Unknown=0, NotChecked=0, Total=1892 [2018-10-10 16:24:47,013 INFO L87 Difference]: Start difference. First operand 1381 states and 1393 transitions. Second operand 44 states. [2018-10-10 16:25:02,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:25:02,817 INFO L93 Difference]: Finished difference Result 1786 states and 1802 transitions. [2018-10-10 16:25:02,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2018-10-10 16:25:02,818 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 1380 [2018-10-10 16:25:02,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:25:02,824 INFO L225 Difference]: With dead ends: 1786 [2018-10-10 16:25:02,824 INFO L226 Difference]: Without dead ends: 1786 [2018-10-10 16:25:02,826 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14932 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=6851, Invalid=34155, Unknown=0, NotChecked=0, Total=41006 [2018-10-10 16:25:02,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1786 states. [2018-10-10 16:25:02,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1786 to 1527. [2018-10-10 16:25:02,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1527 states. [2018-10-10 16:25:02,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1527 states to 1527 states and 1540 transitions. [2018-10-10 16:25:02,840 INFO L78 Accepts]: Start accepts. Automaton has 1527 states and 1540 transitions. Word has length 1380 [2018-10-10 16:25:02,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:25:02,841 INFO L481 AbstractCegarLoop]: Abstraction has 1527 states and 1540 transitions. [2018-10-10 16:25:02,841 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-10 16:25:02,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1527 states and 1540 transitions. [2018-10-10 16:25:02,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1527 [2018-10-10 16:25:02,859 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:25:02,860 INFO L375 BasicCegarLoop]: trace histogram [76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:25:02,860 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:25:02,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:25:02,860 INFO L82 PathProgramCache]: Analyzing trace with hash -15860469, now seen corresponding path program 23 times [2018-10-10 16:25:02,861 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:25:02,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:25:05,283 WARN L178 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-10 16:25:12,059 INFO L134 CoverageAnalysis]: Checked inductivity of 46076 backedges. 0 proven. 42753 refuted. 0 times theorem prover too weak. 3323 trivial. 0 not checked. [2018-10-10 16:25:12,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:25:12,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-10 16:25:12,061 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-10 16:25:12,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-10 16:25:12,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=1769, Unknown=0, NotChecked=0, Total=2070 [2018-10-10 16:25:12,061 INFO L87 Difference]: Start difference. First operand 1527 states and 1540 transitions. Second operand 46 states. [2018-10-10 16:25:29,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:25:29,319 INFO L93 Difference]: Finished difference Result 1932 states and 1949 transitions. [2018-10-10 16:25:29,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2018-10-10 16:25:29,320 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 1526 [2018-10-10 16:25:29,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:25:29,325 INFO L225 Difference]: With dead ends: 1932 [2018-10-10 16:25:29,325 INFO L226 Difference]: Without dead ends: 1932 [2018-10-10 16:25:29,327 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17123 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=7761, Invalid=38679, Unknown=0, NotChecked=0, Total=46440 [2018-10-10 16:25:29,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1932 states. [2018-10-10 16:25:29,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1932 to 1673. [2018-10-10 16:25:29,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1673 states. [2018-10-10 16:25:29,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 1673 states and 1687 transitions. [2018-10-10 16:25:29,340 INFO L78 Accepts]: Start accepts. Automaton has 1673 states and 1687 transitions. Word has length 1526 [2018-10-10 16:25:29,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:25:29,341 INFO L481 AbstractCegarLoop]: Abstraction has 1673 states and 1687 transitions. [2018-10-10 16:25:29,341 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-10 16:25:29,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1673 states and 1687 transitions. [2018-10-10 16:25:29,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1673 [2018-10-10 16:25:29,362 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:25:29,363 INFO L375 BasicCegarLoop]: trace histogram [84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 84, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:25:29,363 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:25:29,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:25:29,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1987691628, now seen corresponding path program 24 times [2018-10-10 16:25:29,364 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:25:29,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:25:31,740 INFO L134 CoverageAnalysis]: Checked inductivity of 56168 backedges. 37510 proven. 5167 refuted. 0 times theorem prover too weak. 13491 trivial. 0 not checked. [2018-10-10 16:25:31,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:25:31,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-10 16:25:31,741 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-10 16:25:31,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-10 16:25:31,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1353, Unknown=0, NotChecked=0, Total=1560 [2018-10-10 16:25:31,742 INFO L87 Difference]: Start difference. First operand 1673 states and 1687 transitions. Second operand 40 states. [2018-10-10 16:25:35,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:25:35,104 INFO L93 Difference]: Finished difference Result 1763 states and 1777 transitions. [2018-10-10 16:25:35,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-10 16:25:35,105 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 1672 [2018-10-10 16:25:35,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:25:35,110 INFO L225 Difference]: With dead ends: 1763 [2018-10-10 16:25:35,110 INFO L226 Difference]: Without dead ends: 1763 [2018-10-10 16:25:35,111 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1916 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1680, Invalid=7062, Unknown=0, NotChecked=0, Total=8742 [2018-10-10 16:25:35,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1763 states. [2018-10-10 16:25:35,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1763 to 1763. [2018-10-10 16:25:35,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1763 states. [2018-10-10 16:25:35,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1763 states to 1763 states and 1777 transitions. [2018-10-10 16:25:35,121 INFO L78 Accepts]: Start accepts. Automaton has 1763 states and 1777 transitions. Word has length 1672 [2018-10-10 16:25:35,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:25:35,122 INFO L481 AbstractCegarLoop]: Abstraction has 1763 states and 1777 transitions. [2018-10-10 16:25:35,122 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-10 16:25:35,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1763 states and 1777 transitions. [2018-10-10 16:25:35,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1763 [2018-10-10 16:25:35,144 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:25:35,145 INFO L375 BasicCegarLoop]: trace histogram [90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:25:35,145 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:25:35,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:25:35,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1032357506, now seen corresponding path program 25 times [2018-10-10 16:25:35,146 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:25:35,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:25:45,041 INFO L134 CoverageAnalysis]: Checked inductivity of 64043 backedges. 0 proven. 59582 refuted. 0 times theorem prover too weak. 4461 trivial. 0 not checked. [2018-10-10 16:25:45,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:25:45,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-10 16:25:45,043 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-10 16:25:45,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-10 16:25:45,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=334, Invalid=1922, Unknown=0, NotChecked=0, Total=2256 [2018-10-10 16:25:45,043 INFO L87 Difference]: Start difference. First operand 1763 states and 1777 transitions. Second operand 48 states. [2018-10-10 16:26:01,901 WARN L178 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2018-10-10 16:26:02,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:26:02,973 INFO L93 Difference]: Finished difference Result 2198 states and 2216 transitions. [2018-10-10 16:26:02,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 187 states. [2018-10-10 16:26:02,973 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 1762 [2018-10-10 16:26:02,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:26:02,979 INFO L225 Difference]: With dead ends: 2198 [2018-10-10 16:26:02,979 INFO L226 Difference]: Without dead ends: 2198 [2018-10-10 16:26:02,981 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19466 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=8730, Invalid=43482, Unknown=0, NotChecked=0, Total=52212 [2018-10-10 16:26:02,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2198 states. [2018-10-10 16:26:02,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2198 to 1924. [2018-10-10 16:26:02,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1924 states. [2018-10-10 16:26:02,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1924 states to 1924 states and 1939 transitions. [2018-10-10 16:26:02,994 INFO L78 Accepts]: Start accepts. Automaton has 1924 states and 1939 transitions. Word has length 1762 [2018-10-10 16:26:02,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:26:02,995 INFO L481 AbstractCegarLoop]: Abstraction has 1924 states and 1939 transitions. [2018-10-10 16:26:02,995 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-10 16:26:02,995 INFO L276 IsEmpty]: Start isEmpty. Operand 1924 states and 1939 transitions. [2018-10-10 16:26:03,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1924 [2018-10-10 16:26:03,020 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:26:03,021 INFO L375 BasicCegarLoop]: trace histogram [99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 99, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:26:03,022 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:26:03,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:26:03,022 INFO L82 PathProgramCache]: Analyzing trace with hash -607942325, now seen corresponding path program 26 times [2018-10-10 16:26:03,023 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:26:03,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:26:14,635 INFO L134 CoverageAnalysis]: Checked inductivity of 77349 backedges. 0 proven. 72339 refuted. 0 times theorem prover too weak. 5010 trivial. 0 not checked. [2018-10-10 16:26:14,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:26:14,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-10 16:26:14,637 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-10 16:26:14,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-10 16:26:14,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=369, Invalid=2081, Unknown=0, NotChecked=0, Total=2450 [2018-10-10 16:26:14,638 INFO L87 Difference]: Start difference. First operand 1924 states and 1939 transitions. Second operand 50 states. [2018-10-10 16:26:31,343 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2018-10-10 16:26:35,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:26:35,018 INFO L93 Difference]: Finished difference Result 2359 states and 2378 transitions. [2018-10-10 16:26:35,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 198 states. [2018-10-10 16:26:35,018 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 1923 [2018-10-10 16:26:35,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:26:35,025 INFO L225 Difference]: With dead ends: 2359 [2018-10-10 16:26:35,025 INFO L226 Difference]: Without dead ends: 2359 [2018-10-10 16:26:35,027 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21961 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=9758, Invalid=48564, Unknown=0, NotChecked=0, Total=58322 [2018-10-10 16:26:35,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2359 states. [2018-10-10 16:26:35,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2359 to 2085. [2018-10-10 16:26:35,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2085 states. [2018-10-10 16:26:35,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2085 states to 2085 states and 2101 transitions. [2018-10-10 16:26:35,041 INFO L78 Accepts]: Start accepts. Automaton has 2085 states and 2101 transitions. Word has length 1923 [2018-10-10 16:26:35,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:26:35,042 INFO L481 AbstractCegarLoop]: Abstraction has 2085 states and 2101 transitions. [2018-10-10 16:26:35,042 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-10 16:26:35,042 INFO L276 IsEmpty]: Start isEmpty. Operand 2085 states and 2101 transitions. [2018-10-10 16:26:35,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2085 [2018-10-10 16:26:35,065 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:26:35,066 INFO L375 BasicCegarLoop]: trace histogram [108, 108, 108, 108, 108, 108, 108, 108, 108, 108, 108, 108, 108, 108, 108, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:26:35,066 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:26:35,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:26:35,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1718957854, now seen corresponding path program 27 times [2018-10-10 16:26:35,067 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:26:35,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:26:47,966 INFO L134 CoverageAnalysis]: Checked inductivity of 91914 backedges. 0 proven. 86355 refuted. 0 times theorem prover too weak. 5559 trivial. 0 not checked. [2018-10-10 16:26:47,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:26:47,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-10-10 16:26:47,968 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-10 16:26:47,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-10 16:26:47,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=2246, Unknown=0, NotChecked=0, Total=2652 [2018-10-10 16:26:47,968 INFO L87 Difference]: Start difference. First operand 2085 states and 2101 transitions. Second operand 52 states. [2018-10-10 16:27:05,053 WARN L178 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2018-10-10 16:27:09,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:27:09,771 INFO L93 Difference]: Finished difference Result 2520 states and 2540 transitions. [2018-10-10 16:27:09,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 209 states. [2018-10-10 16:27:09,771 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 2084 [2018-10-10 16:27:09,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:27:09,778 INFO L225 Difference]: With dead ends: 2520 [2018-10-10 16:27:09,778 INFO L226 Difference]: Without dead ends: 2520 [2018-10-10 16:27:09,781 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24608 ImplicationChecksByTransitivity, 20.2s TimeCoverageRelationStatistics Valid=10845, Invalid=53925, Unknown=0, NotChecked=0, Total=64770 [2018-10-10 16:27:09,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2520 states. [2018-10-10 16:27:09,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2520 to 2246. [2018-10-10 16:27:09,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2246 states. [2018-10-10 16:27:09,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 2246 states and 2263 transitions. [2018-10-10 16:27:09,796 INFO L78 Accepts]: Start accepts. Automaton has 2246 states and 2263 transitions. Word has length 2084 [2018-10-10 16:27:09,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:27:09,797 INFO L481 AbstractCegarLoop]: Abstraction has 2246 states and 2263 transitions. [2018-10-10 16:27:09,797 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-10 16:27:09,797 INFO L276 IsEmpty]: Start isEmpty. Operand 2246 states and 2263 transitions. [2018-10-10 16:27:09,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2246 [2018-10-10 16:27:09,823 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:27:09,824 INFO L375 BasicCegarLoop]: trace histogram [117, 117, 117, 117, 117, 117, 117, 117, 117, 117, 117, 117, 117, 117, 117, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:27:09,824 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:27:09,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:27:09,824 INFO L82 PathProgramCache]: Analyzing trace with hash -45744213, now seen corresponding path program 28 times [2018-10-10 16:27:09,825 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:27:09,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:27:24,753 INFO L134 CoverageAnalysis]: Checked inductivity of 107738 backedges. 0 proven. 101630 refuted. 0 times theorem prover too weak. 6108 trivial. 0 not checked. [2018-10-10 16:27:24,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:27:24,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-10-10 16:27:24,755 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-10 16:27:24,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-10 16:27:24,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=445, Invalid=2417, Unknown=0, NotChecked=0, Total=2862 [2018-10-10 16:27:24,756 INFO L87 Difference]: Start difference. First operand 2246 states and 2263 transitions. Second operand 54 states. [2018-10-10 16:27:31,388 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2018-10-10 16:27:48,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:27:48,390 INFO L93 Difference]: Finished difference Result 2681 states and 2702 transitions. [2018-10-10 16:27:48,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 220 states. [2018-10-10 16:27:48,390 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 2245 [2018-10-10 16:27:48,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:27:48,399 INFO L225 Difference]: With dead ends: 2681 [2018-10-10 16:27:48,399 INFO L226 Difference]: Without dead ends: 2681 [2018-10-10 16:27:48,403 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 266 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27407 ImplicationChecksByTransitivity, 21.3s TimeCoverageRelationStatistics Valid=11991, Invalid=59565, Unknown=0, NotChecked=0, Total=71556 [2018-10-10 16:27:48,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2681 states. [2018-10-10 16:27:48,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2681 to 2407. [2018-10-10 16:27:48,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2407 states. [2018-10-10 16:27:48,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2407 states to 2407 states and 2425 transitions. [2018-10-10 16:27:48,420 INFO L78 Accepts]: Start accepts. Automaton has 2407 states and 2425 transitions. Word has length 2245 [2018-10-10 16:27:48,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:27:48,421 INFO L481 AbstractCegarLoop]: Abstraction has 2407 states and 2425 transitions. [2018-10-10 16:27:48,421 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-10 16:27:48,421 INFO L276 IsEmpty]: Start isEmpty. Operand 2407 states and 2425 transitions. [2018-10-10 16:27:48,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2407 [2018-10-10 16:27:48,450 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:27:48,451 INFO L375 BasicCegarLoop]: trace histogram [126, 126, 126, 126, 126, 126, 126, 126, 126, 126, 126, 126, 126, 126, 126, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:27:48,452 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:27:48,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:27:48,452 INFO L82 PathProgramCache]: Analyzing trace with hash -225899330, now seen corresponding path program 29 times [2018-10-10 16:27:48,453 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:27:48,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:27:53,928 INFO L134 CoverageAnalysis]: Checked inductivity of 124821 backedges. 101272 proven. 17312 refuted. 0 times theorem prover too weak. 6237 trivial. 0 not checked. [2018-10-10 16:27:53,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:27:53,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-10-10 16:27:53,929 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-10 16:27:53,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-10 16:27:53,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=489, Invalid=3051, Unknown=0, NotChecked=0, Total=3540 [2018-10-10 16:27:53,930 INFO L87 Difference]: Start difference. First operand 2407 states and 2425 transitions. Second operand 60 states. [2018-10-10 16:27:59,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:27:59,475 INFO L93 Difference]: Finished difference Result 2448 states and 2466 transitions. [2018-10-10 16:27:59,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-10-10 16:27:59,476 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 2406 [2018-10-10 16:27:59,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:27:59,483 INFO L225 Difference]: With dead ends: 2448 [2018-10-10 16:27:59,483 INFO L226 Difference]: Without dead ends: 2448 [2018-10-10 16:27:59,484 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3779 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3087, Invalid=12915, Unknown=0, NotChecked=0, Total=16002 [2018-10-10 16:27:59,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2448 states. [2018-10-10 16:27:59,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2448 to 2422. [2018-10-10 16:27:59,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2422 states. [2018-10-10 16:27:59,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2422 states to 2422 states and 2440 transitions. [2018-10-10 16:27:59,507 INFO L78 Accepts]: Start accepts. Automaton has 2422 states and 2440 transitions. Word has length 2406 [2018-10-10 16:27:59,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:27:59,508 INFO L481 AbstractCegarLoop]: Abstraction has 2422 states and 2440 transitions. [2018-10-10 16:27:59,509 INFO L482 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-10 16:27:59,509 INFO L276 IsEmpty]: Start isEmpty. Operand 2422 states and 2440 transitions. [2018-10-10 16:27:59,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2422 [2018-10-10 16:27:59,541 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:27:59,542 INFO L375 BasicCegarLoop]: trace histogram [127, 127, 127, 127, 127, 127, 127, 127, 127, 127, 127, 127, 127, 127, 127, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:27:59,542 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:27:59,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:27:59,543 INFO L82 PathProgramCache]: Analyzing trace with hash 2007216372, now seen corresponding path program 30 times [2018-10-10 16:27:59,543 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:27:59,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:28:16,247 INFO L134 CoverageAnalysis]: Checked inductivity of 126730 backedges. 0 proven. 119953 refuted. 0 times theorem prover too weak. 6777 trivial. 0 not checked. [2018-10-10 16:28:16,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:28:16,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-10-10 16:28:16,249 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-10 16:28:16,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-10 16:28:16,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=486, Invalid=2594, Unknown=0, NotChecked=0, Total=3080 [2018-10-10 16:28:16,250 INFO L87 Difference]: Start difference. First operand 2422 states and 2440 transitions. Second operand 56 states. [2018-10-10 16:28:32,140 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2018-10-10 16:28:40,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:28:40,299 INFO L93 Difference]: Finished difference Result 2887 states and 2909 transitions. [2018-10-10 16:28:40,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 231 states. [2018-10-10 16:28:40,299 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 2421 [2018-10-10 16:28:40,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:28:40,303 INFO L225 Difference]: With dead ends: 2887 [2018-10-10 16:28:40,303 INFO L226 Difference]: Without dead ends: 2887 [2018-10-10 16:28:40,307 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 279 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30358 ImplicationChecksByTransitivity, 22.6s TimeCoverageRelationStatistics Valid=13196, Invalid=65484, Unknown=0, NotChecked=0, Total=78680 [2018-10-10 16:28:40,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2887 states. [2018-10-10 16:28:40,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2887 to 2598. [2018-10-10 16:28:40,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2598 states. [2018-10-10 16:28:40,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2598 states to 2598 states and 2617 transitions. [2018-10-10 16:28:40,328 INFO L78 Accepts]: Start accepts. Automaton has 2598 states and 2617 transitions. Word has length 2421 [2018-10-10 16:28:40,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:28:40,329 INFO L481 AbstractCegarLoop]: Abstraction has 2598 states and 2617 transitions. [2018-10-10 16:28:40,329 INFO L482 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-10 16:28:40,329 INFO L276 IsEmpty]: Start isEmpty. Operand 2598 states and 2617 transitions. [2018-10-10 16:28:40,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2598 [2018-10-10 16:28:40,363 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:28:40,364 INFO L375 BasicCegarLoop]: trace histogram [137, 137, 137, 137, 137, 137, 137, 137, 137, 137, 137, 137, 137, 137, 137, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:28:40,364 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:28:40,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:28:40,365 INFO L82 PathProgramCache]: Analyzing trace with hash 846904381, now seen corresponding path program 31 times [2018-10-10 16:28:40,365 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:28:40,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:28:59,661 INFO L134 CoverageAnalysis]: Checked inductivity of 147268 backedges. 0 proven. 139806 refuted. 0 times theorem prover too weak. 7462 trivial. 0 not checked. [2018-10-10 16:28:59,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:28:59,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-10-10 16:28:59,663 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-10 16:28:59,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-10 16:28:59,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=529, Invalid=2777, Unknown=0, NotChecked=0, Total=3306 [2018-10-10 16:28:59,664 INFO L87 Difference]: Start difference. First operand 2598 states and 2617 transitions. Second operand 58 states. [2018-10-10 16:29:27,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:29:27,966 INFO L93 Difference]: Finished difference Result 3063 states and 3086 transitions. [2018-10-10 16:29:27,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 242 states. [2018-10-10 16:29:27,966 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 2597 [2018-10-10 16:29:27,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:29:27,971 INFO L225 Difference]: With dead ends: 3063 [2018-10-10 16:29:27,971 INFO L226 Difference]: Without dead ends: 3063 [2018-10-10 16:29:27,975 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 292 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33461 ImplicationChecksByTransitivity, 25.2s TimeCoverageRelationStatistics Valid=14460, Invalid=71682, Unknown=0, NotChecked=0, Total=86142 [2018-10-10 16:29:27,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3063 states. [2018-10-10 16:29:27,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3063 to 2774. [2018-10-10 16:29:27,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2774 states. [2018-10-10 16:29:27,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2774 states to 2774 states and 2794 transitions. [2018-10-10 16:29:27,999 INFO L78 Accepts]: Start accepts. Automaton has 2774 states and 2794 transitions. Word has length 2597 [2018-10-10 16:29:28,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:29:28,001 INFO L481 AbstractCegarLoop]: Abstraction has 2774 states and 2794 transitions. [2018-10-10 16:29:28,001 INFO L482 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-10 16:29:28,001 INFO L276 IsEmpty]: Start isEmpty. Operand 2774 states and 2794 transitions. [2018-10-10 16:29:28,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2774 [2018-10-10 16:29:28,059 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:29:28,061 INFO L375 BasicCegarLoop]: trace histogram [147, 147, 147, 147, 147, 147, 147, 147, 147, 147, 147, 147, 147, 147, 147, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:29:28,061 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:29:28,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:29:28,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1471209082, now seen corresponding path program 32 times [2018-10-10 16:29:28,062 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:29:28,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:29:49,879 INFO L134 CoverageAnalysis]: Checked inductivity of 169352 backedges. 0 proven. 161205 refuted. 0 times theorem prover too weak. 8147 trivial. 0 not checked. [2018-10-10 16:29:49,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:29:49,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-10-10 16:29:49,881 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-10 16:29:49,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-10 16:29:49,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=574, Invalid=2966, Unknown=0, NotChecked=0, Total=3540 [2018-10-10 16:29:49,882 INFO L87 Difference]: Start difference. First operand 2774 states and 2794 transitions. Second operand 60 states. [2018-10-10 16:30:01,141 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2018-10-10 16:30:19,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:30:19,049 INFO L93 Difference]: Finished difference Result 3239 states and 3263 transitions. [2018-10-10 16:30:19,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 253 states. [2018-10-10 16:30:19,049 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 2773 [2018-10-10 16:30:19,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:30:19,054 INFO L225 Difference]: With dead ends: 3239 [2018-10-10 16:30:19,055 INFO L226 Difference]: Without dead ends: 3239 [2018-10-10 16:30:19,057 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 305 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36716 ImplicationChecksByTransitivity, 26.2s TimeCoverageRelationStatistics Valid=15783, Invalid=78159, Unknown=0, NotChecked=0, Total=93942 [2018-10-10 16:30:19,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3239 states. [2018-10-10 16:30:19,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3239 to 2950. [2018-10-10 16:30:19,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2950 states. [2018-10-10 16:30:19,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2950 states to 2950 states and 2971 transitions. [2018-10-10 16:30:19,079 INFO L78 Accepts]: Start accepts. Automaton has 2950 states and 2971 transitions. Word has length 2773 [2018-10-10 16:30:19,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:30:19,080 INFO L481 AbstractCegarLoop]: Abstraction has 2950 states and 2971 transitions. [2018-10-10 16:30:19,081 INFO L482 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-10 16:30:19,081 INFO L276 IsEmpty]: Start isEmpty. Operand 2950 states and 2971 transitions. [2018-10-10 16:30:19,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2950 [2018-10-10 16:30:19,148 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:30:19,150 INFO L375 BasicCegarLoop]: trace histogram [157, 157, 157, 157, 157, 157, 157, 157, 157, 157, 157, 157, 157, 157, 157, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:30:19,150 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:30:19,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:30:19,151 INFO L82 PathProgramCache]: Analyzing trace with hash 2074403023, now seen corresponding path program 33 times [2018-10-10 16:30:19,151 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:30:19,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat