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-502d2f4 [2018-10-12 22:30:28,519 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-12 22:30:28,523 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-12 22:30:28,536 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-12 22:30:28,536 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-12 22:30:28,538 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-12 22:30:28,539 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-12 22:30:28,541 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-12 22:30:28,544 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-12 22:30:28,545 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-12 22:30:28,553 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-12 22:30:28,554 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-12 22:30:28,555 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-12 22:30:28,556 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-12 22:30:28,558 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-12 22:30:28,560 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-12 22:30:28,561 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-12 22:30:28,565 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-12 22:30:28,568 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-12 22:30:28,570 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-12 22:30:28,571 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-12 22:30:28,575 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-12 22:30:28,580 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-12 22:30:28,580 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-12 22:30:28,581 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-12 22:30:28,581 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-12 22:30:28,582 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-12 22:30:28,583 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-12 22:30:28,585 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-12 22:30:28,587 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-12 22:30:28,587 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-12 22:30:28,588 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-12 22:30:28,589 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-12 22:30:28,590 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-12 22:30:28,593 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-12 22:30:28,594 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-12 22:30:28,594 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-12 22:30:28,609 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-12 22:30:28,610 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-12 22:30:28,611 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-12 22:30:28,611 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-12 22:30:28,611 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-12 22:30:28,611 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-12 22:30:28,612 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-12 22:30:28,612 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-12 22:30:28,612 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-12 22:30:28,613 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-12 22:30:28,613 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-12 22:30:28,613 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-12 22:30:28,613 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-12 22:30:28,615 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-12 22:30:28,615 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-12 22:30:28,684 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-12 22:30:28,699 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-12 22:30:28,704 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-12 22:30:28,706 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-12 22:30:28,707 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-12 22:30:28,707 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-12 22:30:28,708 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-12 22:30:28,795 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-12 22:30:28,797 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-12 22:30:28,797 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-12 22:30:28,798 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-12 22:30:28,798 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-12 22:30:28,826 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 12.10 10:30:28" (1/1) ... [2018-10-12 22:30:28,828 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 12.10 10:30:28" (1/1) ... [2018-10-12 22:30:28,846 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 12.10 10:30:28" (1/1) ... [2018-10-12 22:30:28,847 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 12.10 10:30:28" (1/1) ... [2018-10-12 22:30:28,855 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 12.10 10:30:28" (1/1) ... [2018-10-12 22:30:28,864 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 12.10 10:30:28" (1/1) ... [2018-10-12 22:30:28,870 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 12.10 10:30:28" (1/1) ... [2018-10-12 22:30:28,872 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-12 22:30:28,873 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-12 22:30:28,874 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-12 22:30:28,874 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-12 22:30:28,875 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 12.10 10:30:28" (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-12 22:30:28,952 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-12 22:30:28,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-12 22:30:28,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-12 22:30:29,509 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-12 22:30:29,510 INFO L202 PluginConnector]: Adding new model ArraysOfVariableLength5_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 10:30:29 BoogieIcfgContainer [2018-10-12 22:30:29,510 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-12 22:30:29,510 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-12 22:30:29,511 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-12 22:30:29,512 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-12 22:30:29,515 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 12.10 10:30:29" (1/1) ... [2018-10-12 22:30:29,524 INFO L137 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-10-12 22:30:29,524 INFO L138 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-10-12 22:30:29,563 INFO L191 apSepIcfgTransformer]: Heap separator: starting loc-array-style preprocessing [2018-10-12 22:30:29,626 INFO L219 apSepIcfgTransformer]: finished MemlocArrayUpdater [2018-10-12 22:30:29,649 INFO L282 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-10-12 22:30:29,717 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=1) [2018-10-12 22:31:19,779 INFO L315 AbstractInterpreter]: Visited 74 different actions 384 times. Merged at 43 different actions 294 times. Widened at 5 different actions 15 times. Found 13 fixpoints after 4 different actions. Largest state had 0 variables. [2018-10-12 22:31:19,782 INFO L306 apSepIcfgTransformer]: finished equality analysis [2018-10-12 22:31:19,787 INFO L318 apSepIcfgTransformer]: Finished detection of select terms ("array reads") [2018-10-12 22:31:19,861 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-12 22:31:19,882 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-12 22:31:19,883 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-12 22:31:19,884 INFO L232 HeapPartitionManager]: partitioning result: [2018-10-12 22:31:19,885 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-12 22:31:19,885 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-12 22:31:19,885 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-12 22:31:19,885 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-12 22:31:19,885 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-12 22:31:19,885 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-12 22:31:19,886 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-12 22:31:19,886 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-12 22:31:19,886 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-12 22:31:19,886 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-12 22:31:19,886 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-12 22:31:19,886 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-12 22:31:19,887 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-12 22:31:19,887 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-12 22:31:19,888 INFO L145 ransitionTransformer]: executing heap partitioning transformation [2018-10-12 22:31:19,907 INFO L202 PluginConnector]: Adding new model ArraysOfVariableLength5_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 12.10 10:31:19 BasicIcfg [2018-10-12 22:31:19,907 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-12 22:31:19,908 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-12 22:31:19,908 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-12 22:31:19,913 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-12 22:31:19,913 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 12.10 10:30:28" (1/3) ... [2018-10-12 22:31:19,916 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47f9b64a and model type ArraysOfVariableLength5_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 10:31:19, skipping insertion in model container [2018-10-12 22:31:19,916 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 12.10 10:30:29" (2/3) ... [2018-10-12 22:31:19,917 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47f9b64a and model type ArraysOfVariableLength5_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 10:31:19, skipping insertion in model container [2018-10-12 22:31:19,917 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 12.10 10:31:19" (3/3) ... [2018-10-12 22:31:19,919 INFO L112 eAbstractionObserver]: Analyzing ICFG memPartitionedIcfg [2018-10-12 22:31:19,928 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-12 22:31:19,937 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-12 22:31:19,954 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-12 22:31:19,977 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-12 22:31:19,978 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-12 22:31:19,979 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-12 22:31:19,979 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-12 22:31:19,979 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-12 22:31:19,979 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-12 22:31:19,979 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-12 22:31:19,980 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-12 22:31:19,980 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-12 22:31:19,992 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states. [2018-10-12 22:31:19,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-12 22:31:20,000 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:31:20,001 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-12 22:31:20,002 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:31:20,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:31:20,007 INFO L82 PathProgramCache]: Analyzing trace with hash -1710141282, now seen corresponding path program 1 times [2018-10-12 22:31:20,067 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:31:20,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:31:21,271 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-12 22:31:21,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-12 22:31:21,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-10-12 22:31:21,280 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-12 22:31:21,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-12 22:31:21,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-10-12 22:31:21,393 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 12 states. [2018-10-12 22:31:22,075 WARN L178 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-10-12 22:31:22,687 WARN L178 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-10-12 22:31:23,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:31:23,314 INFO L93 Difference]: Finished difference Result 141 states and 144 transitions. [2018-10-12 22:31:23,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-12 22:31:23,319 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 48 [2018-10-12 22:31:23,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:31:23,334 INFO L225 Difference]: With dead ends: 141 [2018-10-12 22:31:23,334 INFO L226 Difference]: Without dead ends: 141 [2018-10-12 22:31:23,338 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=103, Invalid=359, Unknown=0, NotChecked=0, Total=462 [2018-10-12 22:31:23,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-10-12 22:31:23,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 103. [2018-10-12 22:31:23,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-10-12 22:31:23,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 105 transitions. [2018-10-12 22:31:23,399 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 105 transitions. Word has length 48 [2018-10-12 22:31:23,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:31:23,400 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 105 transitions. [2018-10-12 22:31:23,401 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-12 22:31:23,401 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 105 transitions. [2018-10-12 22:31:23,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-12 22:31:23,403 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:31:23,405 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-12 22:31:23,405 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:31:23,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:31:23,406 INFO L82 PathProgramCache]: Analyzing trace with hash 887259751, now seen corresponding path program 1 times [2018-10-12 22:31:23,408 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:31:23,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:31:23,596 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-12 22:31:23,596 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:31:23,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-12 22:31:23,598 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-12 22:31:23,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-12 22:31:23,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-12 22:31:23,599 INFO L87 Difference]: Start difference. First operand 103 states and 105 transitions. Second operand 8 states. [2018-10-12 22:31:23,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:31:23,910 INFO L93 Difference]: Finished difference Result 172 states and 175 transitions. [2018-10-12 22:31:23,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-12 22:31:23,911 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 74 [2018-10-12 22:31:23,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:31:23,915 INFO L225 Difference]: With dead ends: 172 [2018-10-12 22:31:23,916 INFO L226 Difference]: Without dead ends: 172 [2018-10-12 22:31:23,917 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-10-12 22:31:23,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-10-12 22:31:23,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 122. [2018-10-12 22:31:23,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-10-12 22:31:23,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 124 transitions. [2018-10-12 22:31:23,932 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 124 transitions. Word has length 74 [2018-10-12 22:31:23,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:31:23,933 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 124 transitions. [2018-10-12 22:31:23,933 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-12 22:31:23,933 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 124 transitions. [2018-10-12 22:31:23,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-10-12 22:31:23,937 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:31:23,937 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-12 22:31:23,937 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:31:23,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:31:23,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1411574741, now seen corresponding path program 1 times [2018-10-12 22:31:23,939 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:31:23,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:31:24,396 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-12 22:31:24,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:31:24,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-12 22:31:24,398 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-12 22:31:24,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-12 22:31:24,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-10-12 22:31:24,399 INFO L87 Difference]: Start difference. First operand 122 states and 124 transitions. Second operand 15 states. [2018-10-12 22:31:25,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:31:25,485 INFO L93 Difference]: Finished difference Result 182 states and 186 transitions. [2018-10-12 22:31:25,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-12 22:31:25,485 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 89 [2018-10-12 22:31:25,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:31:25,488 INFO L225 Difference]: With dead ends: 182 [2018-10-12 22:31:25,488 INFO L226 Difference]: Without dead ends: 182 [2018-10-12 22:31:25,489 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=192, Invalid=738, Unknown=0, NotChecked=0, Total=930 [2018-10-12 22:31:25,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-10-12 22:31:25,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 144. [2018-10-12 22:31:25,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-10-12 22:31:25,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 147 transitions. [2018-10-12 22:31:25,500 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 147 transitions. Word has length 89 [2018-10-12 22:31:25,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:31:25,500 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 147 transitions. [2018-10-12 22:31:25,500 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-12 22:31:25,501 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 147 transitions. [2018-10-12 22:31:25,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-12 22:31:25,503 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:31:25,503 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-12 22:31:25,504 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:31:25,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:31:25,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1604927564, now seen corresponding path program 2 times [2018-10-12 22:31:25,505 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:31:25,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:31:25,663 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-12 22:31:25,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:31:25,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-12 22:31:25,664 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-12 22:31:25,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-12 22:31:25,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-10-12 22:31:25,665 INFO L87 Difference]: Start difference. First operand 144 states and 147 transitions. Second operand 10 states. [2018-10-12 22:31:26,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:31:26,444 INFO L93 Difference]: Finished difference Result 171 states and 174 transitions. [2018-10-12 22:31:26,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-12 22:31:26,446 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 115 [2018-10-12 22:31:26,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:31:26,448 INFO L225 Difference]: With dead ends: 171 [2018-10-12 22:31:26,448 INFO L226 Difference]: Without dead ends: 171 [2018-10-12 22:31:26,449 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2018-10-12 22:31:26,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-10-12 22:31:26,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 145. [2018-10-12 22:31:26,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-10-12 22:31:26,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 148 transitions. [2018-10-12 22:31:26,460 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 148 transitions. Word has length 115 [2018-10-12 22:31:26,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:31:26,460 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 148 transitions. [2018-10-12 22:31:26,460 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-12 22:31:26,461 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 148 transitions. [2018-10-12 22:31:26,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-12 22:31:26,463 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:31:26,463 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-12 22:31:26,463 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:31:26,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:31:26,464 INFO L82 PathProgramCache]: Analyzing trace with hash 78050110, now seen corresponding path program 3 times [2018-10-12 22:31:26,465 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:31:26,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:31:26,781 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-12 22:31:26,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:31:26,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-12 22:31:26,782 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-12 22:31:26,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-12 22:31:26,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-10-12 22:31:26,783 INFO L87 Difference]: Start difference. First operand 145 states and 148 transitions. Second operand 12 states. [2018-10-12 22:31:27,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:31:27,297 INFO L93 Difference]: Finished difference Result 173 states and 176 transitions. [2018-10-12 22:31:27,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-12 22:31:27,298 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 130 [2018-10-12 22:31:27,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:31:27,300 INFO L225 Difference]: With dead ends: 173 [2018-10-12 22:31:27,301 INFO L226 Difference]: Without dead ends: 173 [2018-10-12 22:31:27,301 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=477, Unknown=0, NotChecked=0, Total=600 [2018-10-12 22:31:27,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-10-12 22:31:27,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 160. [2018-10-12 22:31:27,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-10-12 22:31:27,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 163 transitions. [2018-10-12 22:31:27,310 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 163 transitions. Word has length 130 [2018-10-12 22:31:27,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:31:27,311 INFO L481 AbstractCegarLoop]: Abstraction has 160 states and 163 transitions. [2018-10-12 22:31:27,311 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-12 22:31:27,311 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 163 transitions. [2018-10-12 22:31:27,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-10-12 22:31:27,313 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:31:27,314 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-12 22:31:27,314 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:31:27,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:31:27,314 INFO L82 PathProgramCache]: Analyzing trace with hash 506198644, now seen corresponding path program 4 times [2018-10-12 22:31:27,315 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:31:27,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:31:28,130 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-12 22:31:28,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:31:28,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-12 22:31:28,131 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-12 22:31:28,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-12 22:31:28,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2018-10-12 22:31:28,132 INFO L87 Difference]: Start difference. First operand 160 states and 163 transitions. Second operand 18 states. [2018-10-12 22:31:29,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:31:29,488 INFO L93 Difference]: Finished difference Result 270 states and 275 transitions. [2018-10-12 22:31:29,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-12 22:31:29,494 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 145 [2018-10-12 22:31:29,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:31:29,496 INFO L225 Difference]: With dead ends: 270 [2018-10-12 22:31:29,496 INFO L226 Difference]: Without dead ends: 270 [2018-10-12 22:31:29,497 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=242, Invalid=1090, Unknown=0, NotChecked=0, Total=1332 [2018-10-12 22:31:29,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-10-12 22:31:29,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 216. [2018-10-12 22:31:29,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-10-12 22:31:29,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 220 transitions. [2018-10-12 22:31:29,507 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 220 transitions. Word has length 145 [2018-10-12 22:31:29,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:31:29,507 INFO L481 AbstractCegarLoop]: Abstraction has 216 states and 220 transitions. [2018-10-12 22:31:29,508 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-12 22:31:29,508 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 220 transitions. [2018-10-12 22:31:29,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-10-12 22:31:29,511 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:31:29,511 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-12 22:31:29,512 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:31:29,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:31:29,512 INFO L82 PathProgramCache]: Analyzing trace with hash 96956861, now seen corresponding path program 5 times [2018-10-12 22:31:29,513 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:31:29,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:31:29,753 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-12 22:31:29,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:31:29,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-12 22:31:29,754 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-12 22:31:29,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-12 22:31:29,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-10-12 22:31:29,755 INFO L87 Difference]: Start difference. First operand 216 states and 220 transitions. Second operand 16 states. [2018-10-12 22:31:30,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:31:30,437 INFO L93 Difference]: Finished difference Result 244 states and 248 transitions. [2018-10-12 22:31:30,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-12 22:31:30,439 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 201 [2018-10-12 22:31:30,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:31:30,441 INFO L225 Difference]: With dead ends: 244 [2018-10-12 22:31:30,442 INFO L226 Difference]: Without dead ends: 244 [2018-10-12 22:31:30,443 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=232, Invalid=958, Unknown=0, NotChecked=0, Total=1190 [2018-10-12 22:31:30,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-10-12 22:31:30,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 231. [2018-10-12 22:31:30,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-10-12 22:31:30,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 235 transitions. [2018-10-12 22:31:30,451 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 235 transitions. Word has length 201 [2018-10-12 22:31:30,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:31:30,451 INFO L481 AbstractCegarLoop]: Abstraction has 231 states and 235 transitions. [2018-10-12 22:31:30,452 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-12 22:31:30,452 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 235 transitions. [2018-10-12 22:31:30,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-10-12 22:31:30,455 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:31:30,456 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-12 22:31:30,456 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:31:30,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:31:30,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1805438485, now seen corresponding path program 6 times [2018-10-12 22:31:30,457 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:31:30,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:31:31,583 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-12 22:31:31,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:31:31,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-12 22:31:31,584 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-12 22:31:31,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-12 22:31:31,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=569, Unknown=0, NotChecked=0, Total=650 [2018-10-12 22:31:31,585 INFO L87 Difference]: Start difference. First operand 231 states and 235 transitions. Second operand 26 states. [2018-10-12 22:31:36,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:31:36,727 INFO L93 Difference]: Finished difference Result 472 states and 479 transitions. [2018-10-12 22:31:36,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-12 22:31:36,734 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 216 [2018-10-12 22:31:36,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:31:36,737 INFO L225 Difference]: With dead ends: 472 [2018-10-12 22:31:36,737 INFO L226 Difference]: Without dead ends: 472 [2018-10-12 22:31:36,740 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2053 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1316, Invalid=5994, Unknown=0, NotChecked=0, Total=7310 [2018-10-12 22:31:36,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2018-10-12 22:31:36,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 288. [2018-10-12 22:31:36,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-10-12 22:31:36,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 292 transitions. [2018-10-12 22:31:36,748 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 292 transitions. Word has length 216 [2018-10-12 22:31:36,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:31:36,748 INFO L481 AbstractCegarLoop]: Abstraction has 288 states and 292 transitions. [2018-10-12 22:31:36,748 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-12 22:31:36,749 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 292 transitions. [2018-10-12 22:31:36,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-10-12 22:31:36,753 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:31:36,753 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-12 22:31:36,753 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:31:36,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:31:36,754 INFO L82 PathProgramCache]: Analyzing trace with hash 607935316, now seen corresponding path program 7 times [2018-10-12 22:31:36,754 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:31:36,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:31:38,206 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-12 22:31:38,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:31:38,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-12 22:31:38,208 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-12 22:31:38,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-12 22:31:38,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2018-10-12 22:31:38,209 INFO L87 Difference]: Start difference. First operand 288 states and 292 transitions. Second operand 20 states. [2018-10-12 22:31:39,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:31:39,134 INFO L93 Difference]: Finished difference Result 316 states and 320 transitions. [2018-10-12 22:31:39,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-12 22:31:39,134 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 287 [2018-10-12 22:31:39,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:31:39,137 INFO L225 Difference]: With dead ends: 316 [2018-10-12 22:31:39,137 INFO L226 Difference]: Without dead ends: 316 [2018-10-12 22:31:39,139 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=375, Invalid=1517, Unknown=0, NotChecked=0, Total=1892 [2018-10-12 22:31:39,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-10-12 22:31:39,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 303. [2018-10-12 22:31:39,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-10-12 22:31:39,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 307 transitions. [2018-10-12 22:31:39,144 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 307 transitions. Word has length 287 [2018-10-12 22:31:39,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:31:39,145 INFO L481 AbstractCegarLoop]: Abstraction has 303 states and 307 transitions. [2018-10-12 22:31:39,145 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-12 22:31:39,145 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 307 transitions. [2018-10-12 22:31:39,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-10-12 22:31:39,149 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:31:39,149 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-12 22:31:39,149 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:31:39,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:31:39,150 INFO L82 PathProgramCache]: Analyzing trace with hash -425548898, now seen corresponding path program 8 times [2018-10-12 22:31:39,151 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:31:39,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:31:40,054 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-12 22:31:40,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:31:40,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-12 22:31:40,055 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-12 22:31:40,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-12 22:31:40,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=662, Unknown=0, NotChecked=0, Total=756 [2018-10-12 22:31:40,056 INFO L87 Difference]: Start difference. First operand 303 states and 307 transitions. Second operand 28 states. [2018-10-12 22:31:44,579 WARN L178 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2018-10-12 22:31:46,610 WARN L178 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-10-12 22:31:46,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:31:46,948 INFO L93 Difference]: Finished difference Result 588 states and 596 transitions. [2018-10-12 22:31:46,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-12 22:31:46,949 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 302 [2018-10-12 22:31:46,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:31:46,952 INFO L225 Difference]: With dead ends: 588 [2018-10-12 22:31:46,952 INFO L226 Difference]: Without dead ends: 588 [2018-10-12 22:31:46,955 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2876 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=1695, Invalid=8007, Unknown=0, NotChecked=0, Total=9702 [2018-10-12 22:31:46,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2018-10-12 22:31:46,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 389. [2018-10-12 22:31:46,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2018-10-12 22:31:46,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 394 transitions. [2018-10-12 22:31:46,962 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 394 transitions. Word has length 302 [2018-10-12 22:31:46,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:31:46,963 INFO L481 AbstractCegarLoop]: Abstraction has 389 states and 394 transitions. [2018-10-12 22:31:46,963 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-12 22:31:46,963 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 394 transitions. [2018-10-12 22:31:46,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2018-10-12 22:31:46,965 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:31:46,966 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-12 22:31:46,966 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:31:46,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:31:46,966 INFO L82 PathProgramCache]: Analyzing trace with hash -7670681, now seen corresponding path program 9 times [2018-10-12 22:31:46,967 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:31:46,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:31:48,356 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-12 22:31:48,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:31:48,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-12 22:31:48,357 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-12 22:31:48,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-12 22:31:48,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=761, Unknown=0, NotChecked=0, Total=870 [2018-10-12 22:31:48,358 INFO L87 Difference]: Start difference. First operand 389 states and 394 transitions. Second operand 30 states. [2018-10-12 22:31:49,266 WARN L178 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 27 [2018-10-12 22:31:52,249 WARN L178 SmtUtils]: Spent 689.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2018-10-12 22:31:52,847 WARN L178 SmtUtils]: Spent 273.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-10-12 22:31:58,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:31:58,179 INFO L93 Difference]: Finished difference Result 674 states and 683 transitions. [2018-10-12 22:31:58,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-10-12 22:31:58,185 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 388 [2018-10-12 22:31:58,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:31:58,188 INFO L225 Difference]: With dead ends: 674 [2018-10-12 22:31:58,188 INFO L226 Difference]: Without dead ends: 674 [2018-10-12 22:31:58,193 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3851 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=2133, Invalid=10299, Unknown=0, NotChecked=0, Total=12432 [2018-10-12 22:31:58,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2018-10-12 22:31:58,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 475. [2018-10-12 22:31:58,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 475 states. [2018-10-12 22:31:58,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 481 transitions. [2018-10-12 22:31:58,205 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 481 transitions. Word has length 388 [2018-10-12 22:31:58,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:31:58,206 INFO L481 AbstractCegarLoop]: Abstraction has 475 states and 481 transitions. [2018-10-12 22:31:58,206 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-12 22:31:58,206 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 481 transitions. [2018-10-12 22:31:58,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 475 [2018-10-12 22:31:58,210 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:31:58,210 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-12 22:31:58,210 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:31:58,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:31:58,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1209806736, now seen corresponding path program 10 times [2018-10-12 22:31:58,212 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:31:58,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:31:59,076 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-12 22:31:59,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:31:59,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-12 22:31:59,077 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-12 22:31:59,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-12 22:31:59,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2018-10-12 22:31:59,078 INFO L87 Difference]: Start difference. First operand 475 states and 481 transitions. Second operand 26 states. [2018-10-12 22:32:00,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:32:00,775 INFO L93 Difference]: Finished difference Result 516 states and 522 transitions. [2018-10-12 22:32:00,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-12 22:32:00,780 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 474 [2018-10-12 22:32:00,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:32:00,783 INFO L225 Difference]: With dead ends: 516 [2018-10-12 22:32:00,783 INFO L226 Difference]: Without dead ends: 516 [2018-10-12 22:32:00,788 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 576 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=554, Invalid=2308, Unknown=0, NotChecked=0, Total=2862 [2018-10-12 22:32:00,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2018-10-12 22:32:00,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 490. [2018-10-12 22:32:00,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2018-10-12 22:32:00,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 496 transitions. [2018-10-12 22:32:00,795 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 496 transitions. Word has length 474 [2018-10-12 22:32:00,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:32:00,796 INFO L481 AbstractCegarLoop]: Abstraction has 490 states and 496 transitions. [2018-10-12 22:32:00,796 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-12 22:32:00,797 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 496 transitions. [2018-10-12 22:32:00,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 490 [2018-10-12 22:32:00,800 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:32:00,802 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-12 22:32:00,802 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:32:00,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:32:00,803 INFO L82 PathProgramCache]: Analyzing trace with hash 108450562, now seen corresponding path program 11 times [2018-10-12 22:32:00,803 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:32:00,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:32:01,962 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-12 22:32:01,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:32:01,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-12 22:32:01,963 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-12 22:32:01,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-12 22:32:01,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=651, Unknown=0, NotChecked=0, Total=756 [2018-10-12 22:32:01,964 INFO L87 Difference]: Start difference. First operand 490 states and 496 transitions. Second operand 28 states. [2018-10-12 22:32:03,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:32:03,846 INFO L93 Difference]: Finished difference Result 518 states and 524 transitions. [2018-10-12 22:32:03,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-12 22:32:03,847 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 489 [2018-10-12 22:32:03,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:32:03,851 INFO L225 Difference]: With dead ends: 518 [2018-10-12 22:32:03,851 INFO L226 Difference]: Without dead ends: 518 [2018-10-12 22:32:03,853 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-12 22:32:03,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2018-10-12 22:32:03,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 505. [2018-10-12 22:32:03,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2018-10-12 22:32:03,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 511 transitions. [2018-10-12 22:32:03,860 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 511 transitions. Word has length 489 [2018-10-12 22:32:03,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:32:03,861 INFO L481 AbstractCegarLoop]: Abstraction has 505 states and 511 transitions. [2018-10-12 22:32:03,861 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-12 22:32:03,861 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 511 transitions. [2018-10-12 22:32:03,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 505 [2018-10-12 22:32:03,864 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:32:03,865 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-12 22:32:03,865 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:32:03,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:32:03,865 INFO L82 PathProgramCache]: Analyzing trace with hash 678435376, now seen corresponding path program 12 times [2018-10-12 22:32:03,866 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:32:03,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:32:04,624 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-12 22:32:04,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:32:04,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-12 22:32:04,626 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-12 22:32:04,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-12 22:32:04,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2018-10-12 22:32:04,627 INFO L87 Difference]: Start difference. First operand 505 states and 511 transitions. Second operand 24 states. [2018-10-12 22:32:05,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:32:05,804 INFO L93 Difference]: Finished difference Result 520 states and 526 transitions. [2018-10-12 22:32:05,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-12 22:32:05,804 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 504 [2018-10-12 22:32:05,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:32:05,809 INFO L225 Difference]: With dead ends: 520 [2018-10-12 22:32:05,809 INFO L226 Difference]: Without dead ends: 520 [2018-10-12 22:32:05,810 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=560, Invalid=2302, Unknown=0, NotChecked=0, Total=2862 [2018-10-12 22:32:05,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2018-10-12 22:32:05,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 520. [2018-10-12 22:32:05,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-10-12 22:32:05,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 526 transitions. [2018-10-12 22:32:05,817 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 526 transitions. Word has length 504 [2018-10-12 22:32:05,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:32:05,818 INFO L481 AbstractCegarLoop]: Abstraction has 520 states and 526 transitions. [2018-10-12 22:32:05,818 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-12 22:32:05,818 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 526 transitions. [2018-10-12 22:32:05,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2018-10-12 22:32:05,822 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:32:05,822 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-12 22:32:05,822 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:32:05,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:32:05,823 INFO L82 PathProgramCache]: Analyzing trace with hash 23776756, now seen corresponding path program 13 times [2018-10-12 22:32:05,823 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:32:05,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:32:07,465 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-12 22:32:07,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:32:07,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-12 22:32:07,466 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-12 22:32:07,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-12 22:32:07,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=866, Unknown=0, NotChecked=0, Total=992 [2018-10-12 22:32:07,467 INFO L87 Difference]: Start difference. First operand 520 states and 526 transitions. Second operand 32 states. [2018-10-12 22:32:14,851 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-10-12 22:32:15,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:32:15,691 INFO L93 Difference]: Finished difference Result 865 states and 875 transitions. [2018-10-12 22:32:15,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-10-12 22:32:15,692 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 519 [2018-10-12 22:32:15,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:32:15,697 INFO L225 Difference]: With dead ends: 865 [2018-10-12 22:32:15,697 INFO L226 Difference]: Without dead ends: 865 [2018-10-12 22:32:15,702 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4978 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=2630, Invalid=12870, Unknown=0, NotChecked=0, Total=15500 [2018-10-12 22:32:15,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2018-10-12 22:32:15,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 636. [2018-10-12 22:32:15,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2018-10-12 22:32:15,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 643 transitions. [2018-10-12 22:32:15,712 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 643 transitions. Word has length 519 [2018-10-12 22:32:15,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:32:15,713 INFO L481 AbstractCegarLoop]: Abstraction has 636 states and 643 transitions. [2018-10-12 22:32:15,713 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-12 22:32:15,713 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 643 transitions. [2018-10-12 22:32:15,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 636 [2018-10-12 22:32:15,718 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:32:15,718 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-12 22:32:15,719 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:32:15,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:32:15,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1377153219, now seen corresponding path program 14 times [2018-10-12 22:32:15,720 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:32:15,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:32:17,671 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-12 22:32:17,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:32:17,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-12 22:32:17,672 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-12 22:32:17,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-12 22:32:17,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=977, Unknown=0, NotChecked=0, Total=1122 [2018-10-12 22:32:17,673 INFO L87 Difference]: Start difference. First operand 636 states and 643 transitions. Second operand 34 states. [2018-10-12 22:32:26,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:32:26,762 INFO L93 Difference]: Finished difference Result 981 states and 992 transitions. [2018-10-12 22:32:26,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-10-12 22:32:26,762 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 635 [2018-10-12 22:32:26,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:32:26,766 INFO L225 Difference]: With dead ends: 981 [2018-10-12 22:32:26,767 INFO L226 Difference]: Without dead ends: 981 [2018-10-12 22:32:26,769 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6257 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=3186, Invalid=15720, Unknown=0, NotChecked=0, Total=18906 [2018-10-12 22:32:26,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2018-10-12 22:32:26,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 752. [2018-10-12 22:32:26,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 752 states. [2018-10-12 22:32:26,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 760 transitions. [2018-10-12 22:32:26,779 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 760 transitions. Word has length 635 [2018-10-12 22:32:26,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:32:26,780 INFO L481 AbstractCegarLoop]: Abstraction has 752 states and 760 transitions. [2018-10-12 22:32:26,780 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-12 22:32:26,781 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 760 transitions. [2018-10-12 22:32:26,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 752 [2018-10-12 22:32:26,786 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:32:26,787 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-12 22:32:26,787 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:32:26,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:32:26,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1854069242, now seen corresponding path program 15 times [2018-10-12 22:32:26,788 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:32:26,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:32:30,141 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-12 22:32:30,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:32:30,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-12 22:32:30,142 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-12 22:32:30,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-12 22:32:30,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1094, Unknown=0, NotChecked=0, Total=1260 [2018-10-12 22:32:30,143 INFO L87 Difference]: Start difference. First operand 752 states and 760 transitions. Second operand 36 states. [2018-10-12 22:32:40,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:32:40,301 INFO L93 Difference]: Finished difference Result 1097 states and 1109 transitions. [2018-10-12 22:32:40,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-10-12 22:32:40,301 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 751 [2018-10-12 22:32:40,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:32:40,307 INFO L225 Difference]: With dead ends: 1097 [2018-10-12 22:32:40,307 INFO L226 Difference]: Without dead ends: 1097 [2018-10-12 22:32:40,310 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7688 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=3801, Invalid=18849, Unknown=0, NotChecked=0, Total=22650 [2018-10-12 22:32:40,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1097 states. [2018-10-12 22:32:40,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1097 to 868. [2018-10-12 22:32:40,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 868 states. [2018-10-12 22:32:40,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 877 transitions. [2018-10-12 22:32:40,321 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 877 transitions. Word has length 751 [2018-10-12 22:32:40,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:32:40,322 INFO L481 AbstractCegarLoop]: Abstraction has 868 states and 877 transitions. [2018-10-12 22:32:40,322 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-12 22:32:40,323 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 877 transitions. [2018-10-12 22:32:40,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 868 [2018-10-12 22:32:40,330 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:32:40,330 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-12 22:32:40,330 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:32:40,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:32:40,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1803522639, now seen corresponding path program 16 times [2018-10-12 22:32:40,332 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:32:40,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:32:41,438 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-12 22:32:41,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:32:41,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-12 22:32:41,440 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-12 22:32:41,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-12 22:32:41,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=970, Unknown=0, NotChecked=0, Total=1122 [2018-10-12 22:32:41,440 INFO L87 Difference]: Start difference. First operand 868 states and 877 transitions. Second operand 34 states. [2018-10-12 22:32:43,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:32:43,171 INFO L93 Difference]: Finished difference Result 924 states and 933 transitions. [2018-10-12 22:32:43,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-12 22:32:43,171 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 867 [2018-10-12 22:32:43,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:32:43,177 INFO L225 Difference]: With dead ends: 924 [2018-10-12 22:32:43,177 INFO L226 Difference]: Without dead ends: 924 [2018-10-12 22:32:43,178 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1112 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=976, Invalid=4136, Unknown=0, NotChecked=0, Total=5112 [2018-10-12 22:32:43,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 924 states. [2018-10-12 22:32:43,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 924 to 898. [2018-10-12 22:32:43,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 898 states. [2018-10-12 22:32:43,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 907 transitions. [2018-10-12 22:32:43,188 INFO L78 Accepts]: Start accepts. Automaton has 898 states and 907 transitions. Word has length 867 [2018-10-12 22:32:43,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:32:43,189 INFO L481 AbstractCegarLoop]: Abstraction has 898 states and 907 transitions. [2018-10-12 22:32:43,189 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-12 22:32:43,189 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 907 transitions. [2018-10-12 22:32:43,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 898 [2018-10-12 22:32:43,196 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:32:43,197 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-12 22:32:43,197 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:32:43,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:32:43,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1668655907, now seen corresponding path program 17 times [2018-10-12 22:32:43,198 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:32:43,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:32:44,907 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-12 22:32:44,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:32:44,908 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-12 22:32:44,908 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-12 22:32:44,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-12 22:32:44,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=857, Unknown=0, NotChecked=0, Total=992 [2018-10-12 22:32:44,909 INFO L87 Difference]: Start difference. First operand 898 states and 907 transitions. Second operand 32 states. [2018-10-12 22:32:47,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:32:47,032 INFO L93 Difference]: Finished difference Result 913 states and 922 transitions. [2018-10-12 22:32:47,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-12 22:32:47,033 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 897 [2018-10-12 22:32:47,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:32:47,037 INFO L225 Difference]: With dead ends: 913 [2018-10-12 22:32:47,038 INFO L226 Difference]: Without dead ends: 913 [2018-10-12 22:32:47,039 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-12 22:32:47,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 913 states. [2018-10-12 22:32:47,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 913 to 913. [2018-10-12 22:32:47,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 913 states. [2018-10-12 22:32:47,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 922 transitions. [2018-10-12 22:32:47,055 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 922 transitions. Word has length 897 [2018-10-12 22:32:47,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:32:47,055 INFO L481 AbstractCegarLoop]: Abstraction has 913 states and 922 transitions. [2018-10-12 22:32:47,056 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-12 22:32:47,056 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 922 transitions. [2018-10-12 22:32:47,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 913 [2018-10-12 22:32:47,064 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:32:47,065 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-12 22:32:47,065 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:32:47,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:32:47,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1369695285, now seen corresponding path program 18 times [2018-10-12 22:32:47,066 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:32:47,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:32:49,528 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-12 22:32:49,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:32:49,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-12 22:32:49,529 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-12 22:32:49,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-12 22:32:49,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1091, Unknown=0, NotChecked=0, Total=1260 [2018-10-12 22:32:49,530 INFO L87 Difference]: Start difference. First operand 913 states and 922 transitions. Second operand 36 states. [2018-10-12 22:32:52,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:32:52,145 INFO L93 Difference]: Finished difference Result 943 states and 952 transitions. [2018-10-12 22:32:52,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-12 22:32:52,146 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 912 [2018-10-12 22:32:52,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:32:52,151 INFO L225 Difference]: With dead ends: 943 [2018-10-12 22:32:52,151 INFO L226 Difference]: Without dead ends: 943 [2018-10-12 22:32:52,152 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1499 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1343, Invalid=5629, Unknown=0, NotChecked=0, Total=6972 [2018-10-12 22:32:52,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2018-10-12 22:32:52,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 943. [2018-10-12 22:32:52,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 943 states. [2018-10-12 22:32:52,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 952 transitions. [2018-10-12 22:32:52,161 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 952 transitions. Word has length 912 [2018-10-12 22:32:52,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:32:52,162 INFO L481 AbstractCegarLoop]: Abstraction has 943 states and 952 transitions. [2018-10-12 22:32:52,162 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-12 22:32:52,162 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 952 transitions. [2018-10-12 22:32:52,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 943 [2018-10-12 22:32:52,170 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:32:52,171 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-12 22:32:52,171 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:32:52,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:32:52,171 INFO L82 PathProgramCache]: Analyzing trace with hash 58605671, now seen corresponding path program 19 times [2018-10-12 22:32:52,172 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:32:52,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:32:56,198 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-12 22:32:56,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:32:56,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-12 22:32:56,199 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-12 22:32:56,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-12 22:32:56,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1217, Unknown=0, NotChecked=0, Total=1406 [2018-10-12 22:32:56,200 INFO L87 Difference]: Start difference. First operand 943 states and 952 transitions. Second operand 38 states. [2018-10-12 22:33:07,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:33:07,262 INFO L93 Difference]: Finished difference Result 1348 states and 1361 transitions. [2018-10-12 22:33:07,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-10-12 22:33:07,263 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 942 [2018-10-12 22:33:07,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:33:07,267 INFO L225 Difference]: With dead ends: 1348 [2018-10-12 22:33:07,267 INFO L226 Difference]: Without dead ends: 1348 [2018-10-12 22:33:07,269 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9271 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=4475, Invalid=22257, Unknown=0, NotChecked=0, Total=26732 [2018-10-12 22:33:07,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1348 states. [2018-10-12 22:33:07,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1348 to 1089. [2018-10-12 22:33:07,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1089 states. [2018-10-12 22:33:07,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1089 states to 1089 states and 1099 transitions. [2018-10-12 22:33:07,280 INFO L78 Accepts]: Start accepts. Automaton has 1089 states and 1099 transitions. Word has length 942 [2018-10-12 22:33:07,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:33:07,281 INFO L481 AbstractCegarLoop]: Abstraction has 1089 states and 1099 transitions. [2018-10-12 22:33:07,281 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-12 22:33:07,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1089 states and 1099 transitions. [2018-10-12 22:33:07,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1089 [2018-10-12 22:33:07,292 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:33:07,292 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-12 22:33:07,293 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:33:07,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:33:07,293 INFO L82 PathProgramCache]: Analyzing trace with hash -47898640, now seen corresponding path program 20 times [2018-10-12 22:33:07,294 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:33:07,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:33:12,464 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-12 22:33:12,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:33:12,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-12 22:33:12,465 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-12 22:33:12,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-12 22:33:12,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=1346, Unknown=0, NotChecked=0, Total=1560 [2018-10-12 22:33:12,466 INFO L87 Difference]: Start difference. First operand 1089 states and 1099 transitions. Second operand 40 states. [2018-10-12 22:33:25,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:33:25,568 INFO L93 Difference]: Finished difference Result 1494 states and 1508 transitions. [2018-10-12 22:33:25,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-10-12 22:33:25,571 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 1088 [2018-10-12 22:33:25,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:33:25,576 INFO L225 Difference]: With dead ends: 1494 [2018-10-12 22:33:25,576 INFO L226 Difference]: Without dead ends: 1494 [2018-10-12 22:33:25,578 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11006 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=5208, Invalid=25944, Unknown=0, NotChecked=0, Total=31152 [2018-10-12 22:33:25,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1494 states. [2018-10-12 22:33:25,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1494 to 1235. [2018-10-12 22:33:25,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1235 states. [2018-10-12 22:33:25,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 1246 transitions. [2018-10-12 22:33:25,591 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 1246 transitions. Word has length 1088 [2018-10-12 22:33:25,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:33:25,592 INFO L481 AbstractCegarLoop]: Abstraction has 1235 states and 1246 transitions. [2018-10-12 22:33:25,592 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-12 22:33:25,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 1246 transitions. [2018-10-12 22:33:25,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1235 [2018-10-12 22:33:25,605 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:33:25,605 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-12 22:33:25,606 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:33:25,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:33:25,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1608319175, now seen corresponding path program 21 times [2018-10-12 22:33:25,607 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:33:25,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:33:30,812 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-12 22:33:30,813 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:33:30,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-12 22:33:30,814 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-12 22:33:30,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-12 22:33:30,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=1481, Unknown=0, NotChecked=0, Total=1722 [2018-10-12 22:33:30,815 INFO L87 Difference]: Start difference. First operand 1235 states and 1246 transitions. Second operand 42 states. [2018-10-12 22:33:40,133 WARN L178 SmtUtils]: Spent 260.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-10-12 22:33:45,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:33:45,912 INFO L93 Difference]: Finished difference Result 1640 states and 1655 transitions. [2018-10-12 22:33:45,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2018-10-12 22:33:45,913 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 1234 [2018-10-12 22:33:45,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:33:45,918 INFO L225 Difference]: With dead ends: 1640 [2018-10-12 22:33:45,918 INFO L226 Difference]: Without dead ends: 1640 [2018-10-12 22:33:45,921 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12893 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=6000, Invalid=29910, Unknown=0, NotChecked=0, Total=35910 [2018-10-12 22:33:45,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1640 states. [2018-10-12 22:33:45,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1640 to 1381. [2018-10-12 22:33:45,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1381 states. [2018-10-12 22:33:45,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1381 states and 1393 transitions. [2018-10-12 22:33:45,934 INFO L78 Accepts]: Start accepts. Automaton has 1381 states and 1393 transitions. Word has length 1234 [2018-10-12 22:33:45,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:33:45,935 INFO L481 AbstractCegarLoop]: Abstraction has 1381 states and 1393 transitions. [2018-10-12 22:33:45,935 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-12 22:33:45,935 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 1393 transitions. [2018-10-12 22:33:45,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1381 [2018-10-12 22:33:45,950 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:33:45,951 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-12 22:33:45,951 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:33:45,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:33:45,951 INFO L82 PathProgramCache]: Analyzing trace with hash 291728962, now seen corresponding path program 22 times [2018-10-12 22:33:45,952 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:33:46,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:33:52,142 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-12 22:33:52,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:33:52,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-12 22:33:52,143 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-12 22:33:52,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-12 22:33:52,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=1622, Unknown=0, NotChecked=0, Total=1892 [2018-10-12 22:33:52,143 INFO L87 Difference]: Start difference. First operand 1381 states and 1393 transitions. Second operand 44 states. [2018-10-12 22:34:07,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:34:07,791 INFO L93 Difference]: Finished difference Result 1786 states and 1802 transitions. [2018-10-12 22:34:07,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2018-10-12 22:34:07,791 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 1380 [2018-10-12 22:34:07,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:34:07,798 INFO L225 Difference]: With dead ends: 1786 [2018-10-12 22:34:07,798 INFO L226 Difference]: Without dead ends: 1786 [2018-10-12 22:34:07,801 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14932 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=6851, Invalid=34155, Unknown=0, NotChecked=0, Total=41006 [2018-10-12 22:34:07,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1786 states. [2018-10-12 22:34:07,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1786 to 1527. [2018-10-12 22:34:07,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1527 states. [2018-10-12 22:34:07,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1527 states to 1527 states and 1540 transitions. [2018-10-12 22:34:07,814 INFO L78 Accepts]: Start accepts. Automaton has 1527 states and 1540 transitions. Word has length 1380 [2018-10-12 22:34:07,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:34:07,814 INFO L481 AbstractCegarLoop]: Abstraction has 1527 states and 1540 transitions. [2018-10-12 22:34:07,815 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-12 22:34:07,815 INFO L276 IsEmpty]: Start isEmpty. Operand 1527 states and 1540 transitions. [2018-10-12 22:34:07,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1527 [2018-10-12 22:34:07,832 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:34:07,833 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-12 22:34:07,833 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:34:07,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:34:07,834 INFO L82 PathProgramCache]: Analyzing trace with hash -15860469, now seen corresponding path program 23 times [2018-10-12 22:34:07,835 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:34:07,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:34:15,082 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-12 22:34:15,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:34:15,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-12 22:34:15,083 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-12 22:34:15,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-12 22:34:15,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=1769, Unknown=0, NotChecked=0, Total=2070 [2018-10-12 22:34:15,084 INFO L87 Difference]: Start difference. First operand 1527 states and 1540 transitions. Second operand 46 states. [2018-10-12 22:34:32,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:34:32,179 INFO L93 Difference]: Finished difference Result 1932 states and 1949 transitions. [2018-10-12 22:34:32,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2018-10-12 22:34:32,179 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 1526 [2018-10-12 22:34:32,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:34:32,185 INFO L225 Difference]: With dead ends: 1932 [2018-10-12 22:34:32,185 INFO L226 Difference]: Without dead ends: 1932 [2018-10-12 22:34:32,188 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17123 ImplicationChecksByTransitivity, 15.2s TimeCoverageRelationStatistics Valid=7761, Invalid=38679, Unknown=0, NotChecked=0, Total=46440 [2018-10-12 22:34:32,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1932 states. [2018-10-12 22:34:32,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1932 to 1673. [2018-10-12 22:34:32,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1673 states. [2018-10-12 22:34:32,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1673 states to 1673 states and 1687 transitions. [2018-10-12 22:34:32,201 INFO L78 Accepts]: Start accepts. Automaton has 1673 states and 1687 transitions. Word has length 1526 [2018-10-12 22:34:32,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:34:32,202 INFO L481 AbstractCegarLoop]: Abstraction has 1673 states and 1687 transitions. [2018-10-12 22:34:32,202 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-12 22:34:32,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1673 states and 1687 transitions. [2018-10-12 22:34:32,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1673 [2018-10-12 22:34:32,222 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:34:32,223 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-12 22:34:32,223 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:34:32,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:34:32,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1987691628, now seen corresponding path program 24 times [2018-10-12 22:34:32,224 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:34:32,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:34:34,614 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-12 22:34:34,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:34:34,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-12 22:34:34,616 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-12 22:34:34,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-12 22:34:34,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1353, Unknown=0, NotChecked=0, Total=1560 [2018-10-12 22:34:34,616 INFO L87 Difference]: Start difference. First operand 1673 states and 1687 transitions. Second operand 40 states. [2018-10-12 22:34:37,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:34:37,966 INFO L93 Difference]: Finished difference Result 1763 states and 1777 transitions. [2018-10-12 22:34:37,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-12 22:34:37,966 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 1672 [2018-10-12 22:34:37,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:34:37,971 INFO L225 Difference]: With dead ends: 1763 [2018-10-12 22:34:37,971 INFO L226 Difference]: Without dead ends: 1763 [2018-10-12 22:34:37,972 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-12 22:34:37,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1763 states. [2018-10-12 22:34:37,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1763 to 1763. [2018-10-12 22:34:37,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1763 states. [2018-10-12 22:34:37,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1763 states to 1763 states and 1777 transitions. [2018-10-12 22:34:37,988 INFO L78 Accepts]: Start accepts. Automaton has 1763 states and 1777 transitions. Word has length 1672 [2018-10-12 22:34:37,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:34:37,989 INFO L481 AbstractCegarLoop]: Abstraction has 1763 states and 1777 transitions. [2018-10-12 22:34:37,989 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-12 22:34:37,989 INFO L276 IsEmpty]: Start isEmpty. Operand 1763 states and 1777 transitions. [2018-10-12 22:34:38,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1763 [2018-10-12 22:34:38,008 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:34:38,009 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-12 22:34:38,009 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:34:38,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:34:38,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1032357506, now seen corresponding path program 25 times [2018-10-12 22:34:38,010 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:34:38,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:34:48,626 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-12 22:34:48,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:34:48,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-12 22:34:48,627 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-12 22:34:48,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-12 22:34:48,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=334, Invalid=1922, Unknown=0, NotChecked=0, Total=2256 [2018-10-12 22:34:48,628 INFO L87 Difference]: Start difference. First operand 1763 states and 1777 transitions. Second operand 48 states. [2018-10-12 22:35:06,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:35:06,405 INFO L93 Difference]: Finished difference Result 2198 states and 2216 transitions. [2018-10-12 22:35:06,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 187 states. [2018-10-12 22:35:06,405 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 1762 [2018-10-12 22:35:06,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:35:06,412 INFO L225 Difference]: With dead ends: 2198 [2018-10-12 22:35:06,412 INFO L226 Difference]: Without dead ends: 2198 [2018-10-12 22:35:06,416 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19466 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=8730, Invalid=43482, Unknown=0, NotChecked=0, Total=52212 [2018-10-12 22:35:06,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2198 states. [2018-10-12 22:35:06,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2198 to 1924. [2018-10-12 22:35:06,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1924 states. [2018-10-12 22:35:06,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1924 states to 1924 states and 1939 transitions. [2018-10-12 22:35:06,430 INFO L78 Accepts]: Start accepts. Automaton has 1924 states and 1939 transitions. Word has length 1762 [2018-10-12 22:35:06,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:35:06,431 INFO L481 AbstractCegarLoop]: Abstraction has 1924 states and 1939 transitions. [2018-10-12 22:35:06,431 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-12 22:35:06,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1924 states and 1939 transitions. [2018-10-12 22:35:06,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1924 [2018-10-12 22:35:06,451 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:35:06,452 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-12 22:35:06,452 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:35:06,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:35:06,453 INFO L82 PathProgramCache]: Analyzing trace with hash -607942325, now seen corresponding path program 26 times [2018-10-12 22:35:06,453 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:35:06,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:35:17,891 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-12 22:35:17,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:35:17,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-12 22:35:17,892 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-12 22:35:17,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-12 22:35:17,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=369, Invalid=2081, Unknown=0, NotChecked=0, Total=2450 [2018-10-12 22:35:17,893 INFO L87 Difference]: Start difference. First operand 1924 states and 1939 transitions. Second operand 50 states. [2018-10-12 22:35:38,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:35:38,214 INFO L93 Difference]: Finished difference Result 2359 states and 2378 transitions. [2018-10-12 22:35:38,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 198 states. [2018-10-12 22:35:38,214 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 1923 [2018-10-12 22:35:38,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:35:38,221 INFO L225 Difference]: With dead ends: 2359 [2018-10-12 22:35:38,221 INFO L226 Difference]: Without dead ends: 2359 [2018-10-12 22:35:38,226 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-12 22:35:38,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2359 states. [2018-10-12 22:35:38,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2359 to 2085. [2018-10-12 22:35:38,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2085 states. [2018-10-12 22:35:38,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2085 states to 2085 states and 2101 transitions. [2018-10-12 22:35:38,241 INFO L78 Accepts]: Start accepts. Automaton has 2085 states and 2101 transitions. Word has length 1923 [2018-10-12 22:35:38,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:35:38,242 INFO L481 AbstractCegarLoop]: Abstraction has 2085 states and 2101 transitions. [2018-10-12 22:35:38,242 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-12 22:35:38,242 INFO L276 IsEmpty]: Start isEmpty. Operand 2085 states and 2101 transitions. [2018-10-12 22:35:38,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2085 [2018-10-12 22:35:38,265 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:35:38,266 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-12 22:35:38,266 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:35:38,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:35:38,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1718957854, now seen corresponding path program 27 times [2018-10-12 22:35:38,267 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:35:38,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:35:51,172 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-12 22:35:51,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:35:51,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-10-12 22:35:51,173 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-12 22:35:51,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-12 22:35:51,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=2246, Unknown=0, NotChecked=0, Total=2652 [2018-10-12 22:35:51,174 INFO L87 Difference]: Start difference. First operand 2085 states and 2101 transitions. Second operand 52 states. [2018-10-12 22:35:57,354 WARN L178 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2018-10-12 22:36:12,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:36:12,563 INFO L93 Difference]: Finished difference Result 2520 states and 2540 transitions. [2018-10-12 22:36:12,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 209 states. [2018-10-12 22:36:12,563 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 2084 [2018-10-12 22:36:12,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:36:12,571 INFO L225 Difference]: With dead ends: 2520 [2018-10-12 22:36:12,571 INFO L226 Difference]: Without dead ends: 2520 [2018-10-12 22:36:12,577 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24608 ImplicationChecksByTransitivity, 20.0s TimeCoverageRelationStatistics Valid=10845, Invalid=53925, Unknown=0, NotChecked=0, Total=64770 [2018-10-12 22:36:12,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2520 states. [2018-10-12 22:36:12,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2520 to 2246. [2018-10-12 22:36:12,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2246 states. [2018-10-12 22:36:12,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 2246 states and 2263 transitions. [2018-10-12 22:36:12,593 INFO L78 Accepts]: Start accepts. Automaton has 2246 states and 2263 transitions. Word has length 2084 [2018-10-12 22:36:12,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:36:12,594 INFO L481 AbstractCegarLoop]: Abstraction has 2246 states and 2263 transitions. [2018-10-12 22:36:12,594 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-12 22:36:12,594 INFO L276 IsEmpty]: Start isEmpty. Operand 2246 states and 2263 transitions. [2018-10-12 22:36:12,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2246 [2018-10-12 22:36:12,628 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:36:12,629 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-12 22:36:12,630 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:36:12,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:36:12,630 INFO L82 PathProgramCache]: Analyzing trace with hash -45744213, now seen corresponding path program 28 times [2018-10-12 22:36:12,631 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:36:12,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:36:27,173 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-12 22:36:27,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:36:27,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-10-12 22:36:27,174 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-12 22:36:27,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-12 22:36:27,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=445, Invalid=2417, Unknown=0, NotChecked=0, Total=2862 [2018-10-12 22:36:27,175 INFO L87 Difference]: Start difference. First operand 2246 states and 2263 transitions. Second operand 54 states. [2018-10-12 22:36:50,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:36:50,926 INFO L93 Difference]: Finished difference Result 2681 states and 2702 transitions. [2018-10-12 22:36:50,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 220 states. [2018-10-12 22:36:50,926 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 2245 [2018-10-12 22:36:50,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:36:50,935 INFO L225 Difference]: With dead ends: 2681 [2018-10-12 22:36:50,935 INFO L226 Difference]: Without dead ends: 2681 [2018-10-12 22:36:50,938 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 266 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27407 ImplicationChecksByTransitivity, 21.2s TimeCoverageRelationStatistics Valid=11991, Invalid=59565, Unknown=0, NotChecked=0, Total=71556 [2018-10-12 22:36:50,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2681 states. [2018-10-12 22:36:50,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2681 to 2407. [2018-10-12 22:36:50,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2407 states. [2018-10-12 22:36:50,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2407 states to 2407 states and 2425 transitions. [2018-10-12 22:36:50,955 INFO L78 Accepts]: Start accepts. Automaton has 2407 states and 2425 transitions. Word has length 2245 [2018-10-12 22:36:50,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:36:50,956 INFO L481 AbstractCegarLoop]: Abstraction has 2407 states and 2425 transitions. [2018-10-12 22:36:50,956 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-12 22:36:50,957 INFO L276 IsEmpty]: Start isEmpty. Operand 2407 states and 2425 transitions. [2018-10-12 22:36:50,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2407 [2018-10-12 22:36:50,986 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:36:50,987 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-12 22:36:50,987 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:36:50,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:36:50,988 INFO L82 PathProgramCache]: Analyzing trace with hash -225899330, now seen corresponding path program 29 times [2018-10-12 22:36:50,988 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:36:51,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:36:56,443 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-12 22:36:56,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:36:56,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-10-12 22:36:56,444 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-12 22:36:56,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-12 22:36:56,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=489, Invalid=3051, Unknown=0, NotChecked=0, Total=3540 [2018-10-12 22:36:56,445 INFO L87 Difference]: Start difference. First operand 2407 states and 2425 transitions. Second operand 60 states. [2018-10-12 22:37:02,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:37:02,308 INFO L93 Difference]: Finished difference Result 2448 states and 2466 transitions. [2018-10-12 22:37:02,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-10-12 22:37:02,309 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 2406 [2018-10-12 22:37:02,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:37:02,316 INFO L225 Difference]: With dead ends: 2448 [2018-10-12 22:37:02,317 INFO L226 Difference]: Without dead ends: 2448 [2018-10-12 22:37:02,318 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3779 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3087, Invalid=12915, Unknown=0, NotChecked=0, Total=16002 [2018-10-12 22:37:02,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2448 states. [2018-10-12 22:37:02,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2448 to 2422. [2018-10-12 22:37:02,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2422 states. [2018-10-12 22:37:02,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2422 states to 2422 states and 2440 transitions. [2018-10-12 22:37:02,343 INFO L78 Accepts]: Start accepts. Automaton has 2422 states and 2440 transitions. Word has length 2406 [2018-10-12 22:37:02,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:37:02,345 INFO L481 AbstractCegarLoop]: Abstraction has 2422 states and 2440 transitions. [2018-10-12 22:37:02,345 INFO L482 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-12 22:37:02,345 INFO L276 IsEmpty]: Start isEmpty. Operand 2422 states and 2440 transitions. [2018-10-12 22:37:02,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2422 [2018-10-12 22:37:02,382 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:37:02,383 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-12 22:37:02,383 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:37:02,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:37:02,384 INFO L82 PathProgramCache]: Analyzing trace with hash 2007216372, now seen corresponding path program 30 times [2018-10-12 22:37:02,384 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:37:02,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:37:19,577 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-12 22:37:19,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:37:19,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-10-12 22:37:19,579 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-12 22:37:19,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-12 22:37:19,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=486, Invalid=2594, Unknown=0, NotChecked=0, Total=3080 [2018-10-12 22:37:19,580 INFO L87 Difference]: Start difference. First operand 2422 states and 2440 transitions. Second operand 56 states. [2018-10-12 22:37:44,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:37:44,561 INFO L93 Difference]: Finished difference Result 2887 states and 2909 transitions. [2018-10-12 22:37:44,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 231 states. [2018-10-12 22:37:44,562 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 2421 [2018-10-12 22:37:44,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:37:44,568 INFO L225 Difference]: With dead ends: 2887 [2018-10-12 22:37:44,568 INFO L226 Difference]: Without dead ends: 2887 [2018-10-12 22:37:44,572 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 279 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30358 ImplicationChecksByTransitivity, 23.7s TimeCoverageRelationStatistics Valid=13196, Invalid=65484, Unknown=0, NotChecked=0, Total=78680 [2018-10-12 22:37:44,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2887 states. [2018-10-12 22:37:44,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2887 to 2598. [2018-10-12 22:37:44,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2598 states. [2018-10-12 22:37:44,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2598 states to 2598 states and 2617 transitions. [2018-10-12 22:37:44,587 INFO L78 Accepts]: Start accepts. Automaton has 2598 states and 2617 transitions. Word has length 2421 [2018-10-12 22:37:44,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:37:44,588 INFO L481 AbstractCegarLoop]: Abstraction has 2598 states and 2617 transitions. [2018-10-12 22:37:44,588 INFO L482 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-12 22:37:44,588 INFO L276 IsEmpty]: Start isEmpty. Operand 2598 states and 2617 transitions. [2018-10-12 22:37:44,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2598 [2018-10-12 22:37:44,625 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:37:44,626 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-12 22:37:44,626 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:37:44,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:37:44,626 INFO L82 PathProgramCache]: Analyzing trace with hash 846904381, now seen corresponding path program 31 times [2018-10-12 22:37:44,627 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:37:44,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:38:03,670 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-12 22:38:03,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:38:03,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-10-12 22:38:03,672 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-12 22:38:03,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-12 22:38:03,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=529, Invalid=2777, Unknown=0, NotChecked=0, Total=3306 [2018-10-12 22:38:03,673 INFO L87 Difference]: Start difference. First operand 2598 states and 2617 transitions. Second operand 58 states. [2018-10-12 22:38:17,486 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2018-10-12 22:38:31,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:38:31,895 INFO L93 Difference]: Finished difference Result 3063 states and 3086 transitions. [2018-10-12 22:38:31,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 242 states. [2018-10-12 22:38:31,895 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 2597 [2018-10-12 22:38:31,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:38:31,900 INFO L225 Difference]: With dead ends: 3063 [2018-10-12 22:38:31,900 INFO L226 Difference]: Without dead ends: 3063 [2018-10-12 22:38:31,907 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 292 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33461 ImplicationChecksByTransitivity, 25.4s TimeCoverageRelationStatistics Valid=14460, Invalid=71682, Unknown=0, NotChecked=0, Total=86142 [2018-10-12 22:38:31,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3063 states. [2018-10-12 22:38:31,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3063 to 2774. [2018-10-12 22:38:31,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2774 states. [2018-10-12 22:38:31,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2774 states to 2774 states and 2794 transitions. [2018-10-12 22:38:31,924 INFO L78 Accepts]: Start accepts. Automaton has 2774 states and 2794 transitions. Word has length 2597 [2018-10-12 22:38:31,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:38:31,925 INFO L481 AbstractCegarLoop]: Abstraction has 2774 states and 2794 transitions. [2018-10-12 22:38:31,926 INFO L482 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-12 22:38:31,926 INFO L276 IsEmpty]: Start isEmpty. Operand 2774 states and 2794 transitions. [2018-10-12 22:38:31,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2774 [2018-10-12 22:38:31,965 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:38:31,966 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-12 22:38:31,966 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:38:31,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:38:31,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1471209082, now seen corresponding path program 32 times [2018-10-12 22:38:31,967 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:38:32,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:38:53,716 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-12 22:38:53,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:38:53,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-10-12 22:38:53,718 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-12 22:38:53,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-12 22:38:53,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=574, Invalid=2966, Unknown=0, NotChecked=0, Total=3540 [2018-10-12 22:38:53,718 INFO L87 Difference]: Start difference. First operand 2774 states and 2794 transitions. Second operand 60 states.