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/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_13.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-b8f97f7-m [2018-10-10 16:26:38,756 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 16:26:38,758 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 16:26:38,773 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 16:26:38,773 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 16:26:38,774 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 16:26:38,776 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 16:26:38,777 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 16:26:38,779 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 16:26:38,780 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 16:26:38,781 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 16:26:38,781 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 16:26:38,782 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 16:26:38,783 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 16:26:38,784 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 16:26:38,785 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 16:26:38,786 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 16:26:38,788 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 16:26:38,793 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 16:26:38,795 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 16:26:38,796 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 16:26:38,797 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 16:26:38,799 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 16:26:38,799 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 16:26:38,800 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 16:26:38,800 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 16:26:38,801 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 16:26:38,802 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 16:26:38,803 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 16:26:38,804 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 16:26:38,804 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 16:26:38,805 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 16:26:38,805 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 16:26:38,805 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 16:26:38,806 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 16:26:38,807 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 16:26:38,807 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-10 16:26:38,818 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 16:26:38,819 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 16:26:38,820 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-10 16:26:38,820 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-10 16:26:38,820 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-10 16:26:38,820 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-10 16:26:38,821 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 16:26:38,821 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-10 16:26:38,821 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 16:26:38,821 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-10 16:26:38,822 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-10 16:26:38,822 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-10 16:26:38,822 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-10 16:26:38,823 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-10 16:26:38,823 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-10 16:26:38,878 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 16:26:38,894 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 16:26:38,899 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 16:26:38,901 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-10 16:26:38,901 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-10 16:26:38,902 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_13.bpl [2018-10-10 16:26:38,903 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_13.bpl' [2018-10-10 16:26:38,994 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 16:26:38,999 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-10 16:26:38,999 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 16:26:38,999 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 16:26:39,000 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 16:26:39,028 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:26:38" (1/1) ... [2018-10-10 16:26:39,030 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:26:38" (1/1) ... [2018-10-10 16:26:39,047 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:26:38" (1/1) ... [2018-10-10 16:26:39,047 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:26:38" (1/1) ... [2018-10-10 16:26:39,053 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:26:38" (1/1) ... [2018-10-10 16:26:39,055 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:26:38" (1/1) ... [2018-10-10 16:26:39,062 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:26:38" (1/1) ... [2018-10-10 16:26:39,068 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 16:26:39,069 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 16:26:39,069 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 16:26:39,070 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 16:26:39,071 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:26:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-10 16:26:39,134 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-10 16:26:39,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 16:26:39,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 16:26:39,642 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 16:26:39,643 INFO L202 PluginConnector]: Adding new model ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 04:26:39 BoogieIcfgContainer [2018-10-10 16:26:39,643 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 16:26:39,644 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-10 16:26:39,644 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-10 16:26:39,645 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-10 16:26:39,648 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 04:26:39" (1/1) ... [2018-10-10 16:26:39,657 INFO L137 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-10-10 16:26:39,657 INFO L138 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-10-10 16:26:39,695 INFO L191 apSepIcfgTransformer]: Heap separator: starting loc-array-style preprocessing [2018-10-10 16:26:39,734 INFO L217 apSepIcfgTransformer]: finished MemlocArrayUpdater [2018-10-10 16:26:39,750 INFO L280 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-10-10 16:26:39,816 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=1) [2018-10-10 16:26:51,842 INFO L315 AbstractInterpreter]: Visited 71 different actions 252 times. Merged at 42 different actions 172 times. Widened at 3 different actions 5 times. Found 8 fixpoints after 4 different actions. Largest state had 0 variables. [2018-10-10 16:26:51,845 INFO L304 apSepIcfgTransformer]: finished equality analysis [2018-10-10 16:26:51,850 INFO L316 apSepIcfgTransformer]: Finished detection of select terms ("array reads") [2018-10-10 16:26:51,861 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select |#loc_#memory_int_(Array-Int-#locsort1)| |v_ULTIMATE.start_read~int_#ptr.base_6|) at (assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value;) [2018-10-10 16:26:51,864 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select (select |#loc_#memory_int_(Array-Int-(Array-Int-#locsort2))| |v_ULTIMATE.start_read~int_#ptr.base_6|) |v_ULTIMATE.start_read~int_#ptr.offset_4|) at (assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value;) [2018-10-10 16:26:51,889 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select |v_#locv_ULTIMATE.start_write~int_old_#memory_int_2_1_1| |v_ULTIMATE.start_write~int_#ptr.base_7|) at (assume #memory_int == write~int_old_#memory_int[write~int_#ptr.base := write~int_old_#memory_int[write~int_#ptr.base][write~int_#ptr.offset := write~int_#value]];) [2018-10-10 16:26:51,891 INFO L232 HeapPartitionManager]: partitioning result: [2018-10-10 16:26:51,891 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-10 16:26:51,891 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-10 16:26:51,892 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-10 16:26:51,892 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-10 16:26:51,892 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-10 16:26:51,892 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-10 16:26:51,893 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-10 16:26:51,893 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-10 16:26:51,893 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-10 16:26:51,893 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-10 16:26:51,894 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-10 16:26:51,894 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-10 16:26:51,894 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-10 16:26:51,895 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-10 16:26:51,896 INFO L145 ransitionTransformer]: executing heap partitioning transformation [2018-10-10 16:26:51,918 INFO L202 PluginConnector]: Adding new model ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_13.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.10 04:26:51 BasicIcfg [2018-10-10 16:26:51,918 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-10 16:26:51,920 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 16:26:51,920 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 16:26:51,923 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 16:26:51,924 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_13.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:26:38" (1/3) ... [2018-10-10 16:26:51,925 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ba14e3b and model type ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 04:26:51, skipping insertion in model container [2018-10-10 16:26:51,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 04:26:39" (2/3) ... [2018-10-10 16:26:51,926 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ba14e3b and model type ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_13.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 04:26:51, skipping insertion in model container [2018-10-10 16:26:51,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysWithLenghtAtDeclaration_false-valid-deref-read.c_13.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.10 04:26:51" (3/3) ... [2018-10-10 16:26:51,928 INFO L112 eAbstractionObserver]: Analyzing ICFG memPartitionedIcfg [2018-10-10 16:26:51,939 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-10 16:26:51,950 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-10 16:26:51,968 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-10 16:26:52,002 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 16:26:52,003 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 16:26:52,004 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 16:26:52,004 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-10 16:26:52,004 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 16:26:52,005 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 16:26:52,005 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 16:26:52,005 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 16:26:52,005 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 16:26:52,025 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states. [2018-10-10 16:26:52,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-10 16:26:52,037 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:26:52,038 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] [2018-10-10 16:26:52,039 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:26:52,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:26:52,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1737293029, now seen corresponding path program 1 times [2018-10-10 16:26:52,114 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:26:52,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:26:52,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:26:52,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 16:26:52,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-10 16:26:52,723 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 16:26:52,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 16:26:52,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-10 16:26:52,741 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 6 states. [2018-10-10 16:26:53,172 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-10 16:26:53,356 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-10 16:26:53,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:26:53,755 INFO L93 Difference]: Finished difference Result 127 states and 129 transitions. [2018-10-10 16:26:53,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 16:26:53,758 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2018-10-10 16:26:53,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:26:53,841 INFO L225 Difference]: With dead ends: 127 [2018-10-10 16:26:53,841 INFO L226 Difference]: Without dead ends: 127 [2018-10-10 16:26:53,843 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-10-10 16:26:53,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-10-10 16:26:53,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 78. [2018-10-10 16:26:53,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-10-10 16:26:53,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2018-10-10 16:26:53,896 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 45 [2018-10-10 16:26:53,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:26:53,898 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2018-10-10 16:26:53,898 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 16:26:53,898 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2018-10-10 16:26:53,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-10 16:26:53,900 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:26:53,901 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:26:53,901 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:26:53,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:26:53,902 INFO L82 PathProgramCache]: Analyzing trace with hash 415592299, now seen corresponding path program 1 times [2018-10-10 16:26:53,904 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:26:53,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:26:54,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:26:54,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:26:54,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-10 16:26:54,177 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 16:26:54,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 16:26:54,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-10-10 16:26:54,178 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 8 states. [2018-10-10 16:26:54,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:26:54,702 INFO L93 Difference]: Finished difference Result 129 states and 131 transitions. [2018-10-10 16:26:54,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 16:26:54,704 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2018-10-10 16:26:54,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:26:54,707 INFO L225 Difference]: With dead ends: 129 [2018-10-10 16:26:54,707 INFO L226 Difference]: Without dead ends: 129 [2018-10-10 16:26:54,708 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=133, Unknown=0, NotChecked=0, Total=210 [2018-10-10 16:26:54,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-10-10 16:26:54,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 93. [2018-10-10 16:26:54,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-10-10 16:26:54,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2018-10-10 16:26:54,717 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 60 [2018-10-10 16:26:54,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:26:54,718 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2018-10-10 16:26:54,718 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 16:26:54,718 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2018-10-10 16:26:54,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-10 16:26:54,722 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:26:54,723 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-10 16:26:54,723 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:26:54,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:26:54,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1318921957, now seen corresponding path program 2 times [2018-10-10 16:26:54,725 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:26:54,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:26:55,281 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-10-10 16:26:55,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 16:26:55,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-10-10 16:26:55,283 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 16:26:55,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 16:26:55,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-10-10 16:26:55,284 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 12 states. [2018-10-10 16:26:56,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:26:56,124 INFO L93 Difference]: Finished difference Result 152 states and 155 transitions. [2018-10-10 16:26:56,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-10 16:26:56,125 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 75 [2018-10-10 16:26:56,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:26:56,127 INFO L225 Difference]: With dead ends: 152 [2018-10-10 16:26:56,127 INFO L226 Difference]: Without dead ends: 152 [2018-10-10 16:26:56,128 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=103, Invalid=359, Unknown=0, NotChecked=0, Total=462 [2018-10-10 16:26:56,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-10-10 16:26:56,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 115. [2018-10-10 16:26:56,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-10-10 16:26:56,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 117 transitions. [2018-10-10 16:26:56,137 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 117 transitions. Word has length 75 [2018-10-10 16:26:56,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:26:56,137 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 117 transitions. [2018-10-10 16:26:56,138 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 16:26:56,138 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 117 transitions. [2018-10-10 16:26:56,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-10 16:26:56,139 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:26:56,140 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:26:56,140 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:26:56,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:26:56,141 INFO L82 PathProgramCache]: Analyzing trace with hash -539520045, now seen corresponding path program 1 times [2018-10-10 16:26:56,141 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:26:56,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:26:56,299 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-10-10 16:26:56,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:26:56,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-10 16:26:56,301 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 16:26:56,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 16:26:56,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-10 16:26:56,301 INFO L87 Difference]: Start difference. First operand 115 states and 117 transitions. Second operand 8 states. [2018-10-10 16:26:56,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:26:56,489 INFO L93 Difference]: Finished difference Result 182 states and 185 transitions. [2018-10-10 16:26:56,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 16:26:56,490 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 100 [2018-10-10 16:26:56,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:26:56,492 INFO L225 Difference]: With dead ends: 182 [2018-10-10 16:26:56,493 INFO L226 Difference]: Without dead ends: 182 [2018-10-10 16:26:56,493 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-10 16:26:56,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-10-10 16:26:56,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 133. [2018-10-10 16:26:56,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-10-10 16:26:56,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 135 transitions. [2018-10-10 16:26:56,502 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 135 transitions. Word has length 100 [2018-10-10 16:26:56,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:26:56,503 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 135 transitions. [2018-10-10 16:26:56,503 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 16:26:56,503 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 135 transitions. [2018-10-10 16:26:56,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-10 16:26:56,505 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:26:56,505 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:26:56,505 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:26:56,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:26:56,506 INFO L82 PathProgramCache]: Analyzing trace with hash -897165389, now seen corresponding path program 2 times [2018-10-10 16:26:56,507 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:26:56,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:26:56,756 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 7 proven. 44 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-10-10 16:26:56,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:26:56,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-10 16:26:56,756 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 16:26:56,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 16:26:56,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-10-10 16:26:56,757 INFO L87 Difference]: Start difference. First operand 133 states and 135 transitions. Second operand 10 states. [2018-10-10 16:26:57,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:26:57,089 INFO L93 Difference]: Finished difference Result 197 states and 200 transitions. [2018-10-10 16:26:57,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-10 16:26:57,096 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 115 [2018-10-10 16:26:57,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:26:57,098 INFO L225 Difference]: With dead ends: 197 [2018-10-10 16:26:57,098 INFO L226 Difference]: Without dead ends: 197 [2018-10-10 16:26:57,099 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2018-10-10 16:26:57,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-10-10 16:26:57,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 148. [2018-10-10 16:26:57,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-10-10 16:26:57,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 150 transitions. [2018-10-10 16:26:57,109 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 150 transitions. Word has length 115 [2018-10-10 16:26:57,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:26:57,109 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 150 transitions. [2018-10-10 16:26:57,109 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 16:26:57,109 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 150 transitions. [2018-10-10 16:26:57,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-10 16:26:57,112 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:26:57,112 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2018-10-10 16:26:57,112 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:26:57,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:26:57,113 INFO L82 PathProgramCache]: Analyzing trace with hash -373598253, now seen corresponding path program 3 times [2018-10-10 16:26:57,113 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:26:57,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:26:57,623 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 7 proven. 91 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-10-10 16:26:57,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:26:57,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-10 16:26:57,624 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 16:26:57,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 16:26:57,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-10-10 16:26:57,625 INFO L87 Difference]: Start difference. First operand 148 states and 150 transitions. Second operand 12 states. [2018-10-10 16:26:58,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:26:58,102 INFO L93 Difference]: Finished difference Result 199 states and 202 transitions. [2018-10-10 16:26:58,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-10 16:26:58,103 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 130 [2018-10-10 16:26:58,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:26:58,104 INFO L225 Difference]: With dead ends: 199 [2018-10-10 16:26:58,104 INFO L226 Difference]: Without dead ends: 199 [2018-10-10 16:26:58,105 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2018-10-10 16:26:58,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-10-10 16:26:58,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 163. [2018-10-10 16:26:58,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-10-10 16:26:58,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 165 transitions. [2018-10-10 16:26:58,113 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 165 transitions. Word has length 130 [2018-10-10 16:26:58,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:26:58,114 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 165 transitions. [2018-10-10 16:26:58,114 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 16:26:58,114 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 165 transitions. [2018-10-10 16:26:58,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-10-10 16:26:58,116 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:26:58,116 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2018-10-10 16:26:58,117 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:26:58,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:26:58,117 INFO L82 PathProgramCache]: Analyzing trace with hash 203559859, now seen corresponding path program 4 times [2018-10-10 16:26:58,118 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:26:58,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:26:58,506 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-10-10 16:26:58,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:26:58,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-10 16:26:58,507 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-10 16:26:58,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-10 16:26:58,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-10-10 16:26:58,507 INFO L87 Difference]: Start difference. First operand 163 states and 165 transitions. Second operand 15 states. [2018-10-10 16:26:59,332 WARN L178 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2018-10-10 16:26:59,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:26:59,928 INFO L93 Difference]: Finished difference Result 222 states and 226 transitions. [2018-10-10 16:26:59,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-10 16:26:59,935 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 145 [2018-10-10 16:26:59,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:26:59,937 INFO L225 Difference]: With dead ends: 222 [2018-10-10 16:26:59,937 INFO L226 Difference]: Without dead ends: 222 [2018-10-10 16:26:59,938 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=192, Invalid=738, Unknown=0, NotChecked=0, Total=930 [2018-10-10 16:26:59,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-10-10 16:26:59,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 185. [2018-10-10 16:26:59,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-10-10 16:26:59,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 188 transitions. [2018-10-10 16:26:59,953 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 188 transitions. Word has length 145 [2018-10-10 16:26:59,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:26:59,953 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 188 transitions. [2018-10-10 16:26:59,954 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-10 16:26:59,954 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 188 transitions. [2018-10-10 16:26:59,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-10 16:26:59,956 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:26:59,957 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2018-10-10 16:26:59,957 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:26:59,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:26:59,958 INFO L82 PathProgramCache]: Analyzing trace with hash 534180923, now seen corresponding path program 5 times [2018-10-10 16:26:59,959 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:26:59,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:27:00,392 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 17 proven. 142 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-10-10 16:27:00,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:27:00,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-10 16:27:00,393 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 16:27:00,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 16:27:00,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-10-10 16:27:00,394 INFO L87 Difference]: Start difference. First operand 185 states and 188 transitions. Second operand 10 states. [2018-10-10 16:27:00,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:27:00,753 INFO L93 Difference]: Finished difference Result 211 states and 214 transitions. [2018-10-10 16:27:00,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-10 16:27:00,758 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 170 [2018-10-10 16:27:00,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:27:00,760 INFO L225 Difference]: With dead ends: 211 [2018-10-10 16:27:00,760 INFO L226 Difference]: Without dead ends: 211 [2018-10-10 16:27:00,761 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2018-10-10 16:27:00,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-10-10 16:27:00,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 186. [2018-10-10 16:27:00,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-10-10 16:27:00,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 189 transitions. [2018-10-10 16:27:00,767 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 189 transitions. Word has length 170 [2018-10-10 16:27:00,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:27:00,768 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 189 transitions. [2018-10-10 16:27:00,768 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 16:27:00,768 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 189 transitions. [2018-10-10 16:27:00,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-10-10 16:27:00,771 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:27:00,771 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2018-10-10 16:27:00,771 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:27:00,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:27:00,772 INFO L82 PathProgramCache]: Analyzing trace with hash 52238923, now seen corresponding path program 6 times [2018-10-10 16:27:00,773 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:27:00,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:27:01,828 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 17 proven. 220 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-10-10 16:27:01,829 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:27:01,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-10 16:27:01,830 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 16:27:01,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 16:27:01,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-10-10 16:27:01,831 INFO L87 Difference]: Start difference. First operand 186 states and 189 transitions. Second operand 12 states. [2018-10-10 16:27:02,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:27:02,247 INFO L93 Difference]: Finished difference Result 226 states and 229 transitions. [2018-10-10 16:27:02,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-10 16:27:02,247 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 185 [2018-10-10 16:27:02,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:27:02,249 INFO L225 Difference]: With dead ends: 226 [2018-10-10 16:27:02,250 INFO L226 Difference]: Without dead ends: 226 [2018-10-10 16:27:02,251 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2018-10-10 16:27:02,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-10-10 16:27:02,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 201. [2018-10-10 16:27:02,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-10-10 16:27:02,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 204 transitions. [2018-10-10 16:27:02,256 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 204 transitions. Word has length 185 [2018-10-10 16:27:02,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:27:02,256 INFO L481 AbstractCegarLoop]: Abstraction has 201 states and 204 transitions. [2018-10-10 16:27:02,257 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 16:27:02,257 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 204 transitions. [2018-10-10 16:27:02,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-10-10 16:27:02,259 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:27:02,259 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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] [2018-10-10 16:27:02,259 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:27:02,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:27:02,260 INFO L82 PathProgramCache]: Analyzing trace with hash 723784251, now seen corresponding path program 7 times [2018-10-10 16:27:02,261 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:27:02,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:27:02,613 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 17 proven. 313 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-10-10 16:27:02,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:27:02,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-10 16:27:02,614 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-10 16:27:02,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-10 16:27:02,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-10-10 16:27:02,615 INFO L87 Difference]: Start difference. First operand 201 states and 204 transitions. Second operand 14 states. [2018-10-10 16:27:03,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:27:03,067 INFO L93 Difference]: Finished difference Result 241 states and 244 transitions. [2018-10-10 16:27:03,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-10 16:27:03,068 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 200 [2018-10-10 16:27:03,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:27:03,069 INFO L225 Difference]: With dead ends: 241 [2018-10-10 16:27:03,070 INFO L226 Difference]: Without dead ends: 241 [2018-10-10 16:27:03,070 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=166, Invalid=590, Unknown=0, NotChecked=0, Total=756 [2018-10-10 16:27:03,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-10-10 16:27:03,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 216. [2018-10-10 16:27:03,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-10-10 16:27:03,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 219 transitions. [2018-10-10 16:27:03,076 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 219 transitions. Word has length 200 [2018-10-10 16:27:03,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:27:03,076 INFO L481 AbstractCegarLoop]: Abstraction has 216 states and 219 transitions. [2018-10-10 16:27:03,076 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-10 16:27:03,076 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 219 transitions. [2018-10-10 16:27:03,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-10-10 16:27:03,079 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:27:03,079 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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] [2018-10-10 16:27:03,079 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:27:03,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:27:03,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1815100491, now seen corresponding path program 8 times [2018-10-10 16:27:03,081 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:27:03,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:27:03,361 INFO L134 CoverageAnalysis]: Checked inductivity of 503 backedges. 17 proven. 421 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-10-10 16:27:03,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:27:03,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-10 16:27:03,363 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-10 16:27:03,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-10 16:27:03,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2018-10-10 16:27:03,364 INFO L87 Difference]: Start difference. First operand 216 states and 219 transitions. Second operand 16 states. [2018-10-10 16:27:04,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:27:04,090 INFO L93 Difference]: Finished difference Result 243 states and 246 transitions. [2018-10-10 16:27:04,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-10 16:27:04,090 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 215 [2018-10-10 16:27:04,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:27:04,092 INFO L225 Difference]: With dead ends: 243 [2018-10-10 16:27:04,093 INFO L226 Difference]: Without dead ends: 243 [2018-10-10 16:27:04,094 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=253, Invalid=937, Unknown=0, NotChecked=0, Total=1190 [2018-10-10 16:27:04,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-10-10 16:27:04,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 231. [2018-10-10 16:27:04,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-10-10 16:27:04,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 234 transitions. [2018-10-10 16:27:04,106 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 234 transitions. Word has length 215 [2018-10-10 16:27:04,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:27:04,106 INFO L481 AbstractCegarLoop]: Abstraction has 231 states and 234 transitions. [2018-10-10 16:27:04,106 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-10 16:27:04,107 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 234 transitions. [2018-10-10 16:27:04,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-10-10 16:27:04,108 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:27:04,109 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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] [2018-10-10 16:27:04,109 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:27:04,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:27:04,109 INFO L82 PathProgramCache]: Analyzing trace with hash 2032709691, now seen corresponding path program 9 times [2018-10-10 16:27:04,110 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:27:04,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:27:05,184 INFO L134 CoverageAnalysis]: Checked inductivity of 626 backedges. 0 proven. 467 refuted. 0 times theorem prover too weak. 159 trivial. 0 not checked. [2018-10-10 16:27:05,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:27:05,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-10 16:27:05,185 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-10 16:27:05,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-10 16:27:05,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2018-10-10 16:27:05,186 INFO L87 Difference]: Start difference. First operand 231 states and 234 transitions. Second operand 18 states. [2018-10-10 16:27:06,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:27:06,623 INFO L93 Difference]: Finished difference Result 399 states and 404 transitions. [2018-10-10 16:27:06,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-10 16:27:06,626 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 230 [2018-10-10 16:27:06,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:27:06,629 INFO L225 Difference]: With dead ends: 399 [2018-10-10 16:27:06,629 INFO L226 Difference]: Without dead ends: 399 [2018-10-10 16:27:06,630 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=242, Invalid=1090, Unknown=0, NotChecked=0, Total=1332 [2018-10-10 16:27:06,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2018-10-10 16:27:06,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 316. [2018-10-10 16:27:06,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-10-10 16:27:06,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 320 transitions. [2018-10-10 16:27:06,636 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 320 transitions. Word has length 230 [2018-10-10 16:27:06,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:27:06,637 INFO L481 AbstractCegarLoop]: Abstraction has 316 states and 320 transitions. [2018-10-10 16:27:06,637 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-10 16:27:06,637 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 320 transitions. [2018-10-10 16:27:06,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2018-10-10 16:27:06,639 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:27:06,639 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 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] [2018-10-10 16:27:06,639 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:27:06,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:27:06,640 INFO L82 PathProgramCache]: Analyzing trace with hash -31000397, now seen corresponding path program 10 times [2018-10-10 16:27:06,640 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:27:06,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:27:07,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1348 backedges. 0 proven. 1095 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2018-10-10 16:27:07,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:27:07,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-10 16:27:07,689 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-10 16:27:07,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-10 16:27:07,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=399, Unknown=0, NotChecked=0, Total=462 [2018-10-10 16:27:07,689 INFO L87 Difference]: Start difference. First operand 316 states and 320 transitions. Second operand 22 states. [2018-10-10 16:27:09,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:27:09,301 INFO L93 Difference]: Finished difference Result 484 states and 490 transitions. [2018-10-10 16:27:09,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-10 16:27:09,303 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 315 [2018-10-10 16:27:09,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:27:09,306 INFO L225 Difference]: With dead ends: 484 [2018-10-10 16:27:09,306 INFO L226 Difference]: Without dead ends: 484 [2018-10-10 16:27:09,307 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=390, Invalid=1590, Unknown=0, NotChecked=0, Total=1980 [2018-10-10 16:27:09,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2018-10-10 16:27:09,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 401. [2018-10-10 16:27:09,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2018-10-10 16:27:09,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 406 transitions. [2018-10-10 16:27:09,315 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 406 transitions. Word has length 315 [2018-10-10 16:27:09,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:27:09,316 INFO L481 AbstractCegarLoop]: Abstraction has 401 states and 406 transitions. [2018-10-10 16:27:09,316 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-10 16:27:09,316 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 406 transitions. [2018-10-10 16:27:09,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2018-10-10 16:27:09,318 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:27:09,318 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 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] [2018-10-10 16:27:09,319 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:27:09,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:27:09,319 INFO L82 PathProgramCache]: Analyzing trace with hash 305982267, now seen corresponding path program 11 times [2018-10-10 16:27:09,320 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:27:09,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:27:09,818 INFO L134 CoverageAnalysis]: Checked inductivity of 2343 backedges. 1133 proven. 950 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2018-10-10 16:27:09,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:27:09,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-10 16:27:09,820 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-10 16:27:09,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-10 16:27:09,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2018-10-10 16:27:09,821 INFO L87 Difference]: Start difference. First operand 401 states and 406 transitions. Second operand 20 states. [2018-10-10 16:27:10,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:27:10,904 INFO L93 Difference]: Finished difference Result 431 states and 436 transitions. [2018-10-10 16:27:10,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-10 16:27:10,907 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 400 [2018-10-10 16:27:10,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:27:10,910 INFO L225 Difference]: With dead ends: 431 [2018-10-10 16:27:10,910 INFO L226 Difference]: Without dead ends: 431 [2018-10-10 16:27:10,911 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 348 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=402, Invalid=1578, Unknown=0, NotChecked=0, Total=1980 [2018-10-10 16:27:10,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-10-10 16:27:10,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 431. [2018-10-10 16:27:10,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2018-10-10 16:27:10,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 436 transitions. [2018-10-10 16:27:10,920 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 436 transitions. Word has length 400 [2018-10-10 16:27:10,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:27:10,921 INFO L481 AbstractCegarLoop]: Abstraction has 431 states and 436 transitions. [2018-10-10 16:27:10,921 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-10 16:27:10,921 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 436 transitions. [2018-10-10 16:27:10,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2018-10-10 16:27:10,924 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:27:10,925 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 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] [2018-10-10 16:27:10,925 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:27:10,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:27:10,926 INFO L82 PathProgramCache]: Analyzing trace with hash -819310229, now seen corresponding path program 12 times [2018-10-10 16:27:10,927 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:27:10,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:27:11,986 INFO L134 CoverageAnalysis]: Checked inductivity of 2878 backedges. 841 proven. 1723 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2018-10-10 16:27:11,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:27:11,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-10 16:27:11,987 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-10 16:27:11,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-10 16:27:11,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2018-10-10 16:27:11,987 INFO L87 Difference]: Start difference. First operand 431 states and 436 transitions. Second operand 24 states. [2018-10-10 16:27:13,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:27:13,967 INFO L93 Difference]: Finished difference Result 458 states and 463 transitions. [2018-10-10 16:27:13,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-10 16:27:13,968 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 430 [2018-10-10 16:27:13,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:27:13,971 INFO L225 Difference]: With dead ends: 458 [2018-10-10 16:27:13,971 INFO L226 Difference]: Without dead ends: 458 [2018-10-10 16:27:13,972 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=589, Invalid=2381, Unknown=0, NotChecked=0, Total=2970 [2018-10-10 16:27:13,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2018-10-10 16:27:13,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 446. [2018-10-10 16:27:13,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2018-10-10 16:27:13,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 451 transitions. [2018-10-10 16:27:13,980 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 451 transitions. Word has length 430 [2018-10-10 16:27:13,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:27:13,981 INFO L481 AbstractCegarLoop]: Abstraction has 446 states and 451 transitions. [2018-10-10 16:27:13,981 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-10 16:27:13,981 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 451 transitions. [2018-10-10 16:27:13,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2018-10-10 16:27:13,983 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:27:13,983 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 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] [2018-10-10 16:27:13,984 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:27:13,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:27:13,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1403144421, now seen corresponding path program 13 times [2018-10-10 16:27:13,985 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:27:14,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:27:15,257 INFO L134 CoverageAnalysis]: Checked inductivity of 3168 backedges. 0 proven. 2623 refuted. 0 times theorem prover too weak. 545 trivial. 0 not checked. [2018-10-10 16:27:15,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:27:15,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-10 16:27:15,259 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-10 16:27:15,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-10 16:27:15,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=404, Unknown=0, NotChecked=0, Total=462 [2018-10-10 16:27:15,259 INFO L87 Difference]: Start difference. First operand 446 states and 451 transitions. Second operand 22 states. [2018-10-10 16:27:17,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:27:17,933 INFO L93 Difference]: Finished difference Result 674 states and 681 transitions. [2018-10-10 16:27:17,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-10 16:27:17,934 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 445 [2018-10-10 16:27:17,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:27:17,939 INFO L225 Difference]: With dead ends: 674 [2018-10-10 16:27:17,940 INFO L226 Difference]: Without dead ends: 674 [2018-10-10 16:27:17,941 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 416 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=328, Invalid=1834, Unknown=0, NotChecked=0, Total=2162 [2018-10-10 16:27:17,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2018-10-10 16:27:17,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 561. [2018-10-10 16:27:17,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2018-10-10 16:27:17,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 567 transitions. [2018-10-10 16:27:17,953 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 567 transitions. Word has length 445 [2018-10-10 16:27:17,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:27:17,954 INFO L481 AbstractCegarLoop]: Abstraction has 561 states and 567 transitions. [2018-10-10 16:27:17,954 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-10 16:27:17,954 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 567 transitions. [2018-10-10 16:27:17,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 561 [2018-10-10 16:27:17,959 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:27:17,959 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 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] [2018-10-10 16:27:17,959 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:27:17,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:27:17,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1888109011, now seen corresponding path program 14 times [2018-10-10 16:27:17,960 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:27:18,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:27:20,557 INFO L134 CoverageAnalysis]: Checked inductivity of 5366 backedges. 0 proven. 4590 refuted. 0 times theorem prover too weak. 776 trivial. 0 not checked. [2018-10-10 16:27:20,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:27:20,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-10 16:27:20,558 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-10 16:27:20,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-10 16:27:20,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=488, Unknown=0, NotChecked=0, Total=552 [2018-10-10 16:27:20,559 INFO L87 Difference]: Start difference. First operand 561 states and 567 transitions. Second operand 24 states. [2018-10-10 16:27:23,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:27:23,339 INFO L93 Difference]: Finished difference Result 789 states and 797 transitions. [2018-10-10 16:27:23,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-10 16:27:23,339 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 560 [2018-10-10 16:27:23,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:27:23,343 INFO L225 Difference]: With dead ends: 789 [2018-10-10 16:27:23,343 INFO L226 Difference]: Without dead ends: 789 [2018-10-10 16:27:23,345 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 517 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=371, Invalid=2281, Unknown=0, NotChecked=0, Total=2652 [2018-10-10 16:27:23,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2018-10-10 16:27:23,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 676. [2018-10-10 16:27:23,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 676 states. [2018-10-10 16:27:23,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 683 transitions. [2018-10-10 16:27:23,354 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 683 transitions. Word has length 560 [2018-10-10 16:27:23,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:27:23,355 INFO L481 AbstractCegarLoop]: Abstraction has 676 states and 683 transitions. [2018-10-10 16:27:23,355 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-10 16:27:23,355 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 683 transitions. [2018-10-10 16:27:23,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 676 [2018-10-10 16:27:23,360 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:27:23,360 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 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] [2018-10-10 16:27:23,360 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:27:23,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:27:23,361 INFO L82 PathProgramCache]: Analyzing trace with hash -481416165, now seen corresponding path program 15 times [2018-10-10 16:27:23,361 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:27:23,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:27:24,289 INFO L134 CoverageAnalysis]: Checked inductivity of 8141 backedges. 3808 proven. 3557 refuted. 0 times theorem prover too weak. 776 trivial. 0 not checked. [2018-10-10 16:27:24,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:27:24,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-10 16:27:24,290 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-10 16:27:24,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-10 16:27:24,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=750, Unknown=0, NotChecked=0, Total=870 [2018-10-10 16:27:24,291 INFO L87 Difference]: Start difference. First operand 676 states and 683 transitions. Second operand 30 states. [2018-10-10 16:27:26,075 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-10 16:27:26,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:27:26,427 INFO L93 Difference]: Finished difference Result 716 states and 723 transitions. [2018-10-10 16:27:26,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-10 16:27:26,428 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 675 [2018-10-10 16:27:26,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:27:26,431 INFO L225 Difference]: With dead ends: 716 [2018-10-10 16:27:26,431 INFO L226 Difference]: Without dead ends: 716 [2018-10-10 16:27:26,433 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 842 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=786, Invalid=3246, Unknown=0, NotChecked=0, Total=4032 [2018-10-10 16:27:26,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2018-10-10 16:27:26,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 691. [2018-10-10 16:27:26,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2018-10-10 16:27:26,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 698 transitions. [2018-10-10 16:27:26,442 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 698 transitions. Word has length 675 [2018-10-10 16:27:26,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:27:26,443 INFO L481 AbstractCegarLoop]: Abstraction has 691 states and 698 transitions. [2018-10-10 16:27:26,443 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-10 16:27:26,443 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 698 transitions. [2018-10-10 16:27:26,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 691 [2018-10-10 16:27:26,448 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:27:26,448 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 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] [2018-10-10 16:27:26,449 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:27:26,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:27:26,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1189927317, now seen corresponding path program 16 times [2018-10-10 16:27:26,450 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:27:26,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:27:28,720 INFO L134 CoverageAnalysis]: Checked inductivity of 8628 backedges. 0 proven. 7530 refuted. 0 times theorem prover too weak. 1098 trivial. 0 not checked. [2018-10-10 16:27:28,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:27:28,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-10 16:27:28,721 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-10 16:27:28,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-10 16:27:28,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=580, Unknown=0, NotChecked=0, Total=650 [2018-10-10 16:27:28,722 INFO L87 Difference]: Start difference. First operand 691 states and 698 transitions. Second operand 26 states. [2018-10-10 16:27:32,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:27:32,093 INFO L93 Difference]: Finished difference Result 949 states and 958 transitions. [2018-10-10 16:27:32,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-10 16:27:32,093 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 690 [2018-10-10 16:27:32,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:27:32,097 INFO L225 Difference]: With dead ends: 949 [2018-10-10 16:27:32,097 INFO L226 Difference]: Without dead ends: 949 [2018-10-10 16:27:32,099 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 619 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=414, Invalid=2778, Unknown=0, NotChecked=0, Total=3192 [2018-10-10 16:27:32,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 949 states. [2018-10-10 16:27:32,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 949 to 821. [2018-10-10 16:27:32,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 821 states. [2018-10-10 16:27:32,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 829 transitions. [2018-10-10 16:27:32,111 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 829 transitions. Word has length 690 [2018-10-10 16:27:32,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:27:32,111 INFO L481 AbstractCegarLoop]: Abstraction has 821 states and 829 transitions. [2018-10-10 16:27:32,111 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-10 16:27:32,111 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 829 transitions. [2018-10-10 16:27:32,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 821 [2018-10-10 16:27:32,119 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:27:32,119 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 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] [2018-10-10 16:27:32,119 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:27:32,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:27:32,120 INFO L82 PathProgramCache]: Analyzing trace with hash 2087961859, now seen corresponding path program 17 times [2018-10-10 16:27:32,121 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:27:32,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:27:35,352 INFO L134 CoverageAnalysis]: Checked inductivity of 12664 backedges. 0 proven. 11244 refuted. 0 times theorem prover too weak. 1420 trivial. 0 not checked. [2018-10-10 16:27:35,352 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:27:35,352 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-10 16:27:35,353 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-10 16:27:35,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-10 16:27:35,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=680, Unknown=0, NotChecked=0, Total=756 [2018-10-10 16:27:35,354 INFO L87 Difference]: Start difference. First operand 821 states and 829 transitions. Second operand 28 states. [2018-10-10 16:27:38,836 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2018-10-10 16:27:39,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:27:39,346 INFO L93 Difference]: Finished difference Result 1079 states and 1089 transitions. [2018-10-10 16:27:39,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-10 16:27:39,347 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 820 [2018-10-10 16:27:39,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:27:39,354 INFO L225 Difference]: With dead ends: 1079 [2018-10-10 16:27:39,354 INFO L226 Difference]: Without dead ends: 1079 [2018-10-10 16:27:39,355 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 734 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=457, Invalid=3325, Unknown=0, NotChecked=0, Total=3782 [2018-10-10 16:27:39,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2018-10-10 16:27:39,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 951. [2018-10-10 16:27:39,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 951 states. [2018-10-10 16:27:39,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 960 transitions. [2018-10-10 16:27:39,367 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 960 transitions. Word has length 820 [2018-10-10 16:27:39,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:27:39,367 INFO L481 AbstractCegarLoop]: Abstraction has 951 states and 960 transitions. [2018-10-10 16:27:39,367 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-10 16:27:39,368 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 960 transitions. [2018-10-10 16:27:39,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 951 [2018-10-10 16:27:39,376 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:27:39,376 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 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] [2018-10-10 16:27:39,376 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:27:39,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:27:39,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1778016869, now seen corresponding path program 18 times [2018-10-10 16:27:39,378 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:27:39,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:27:40,831 INFO L134 CoverageAnalysis]: Checked inductivity of 17474 backedges. 10835 proven. 2785 refuted. 0 times theorem prover too weak. 3854 trivial. 0 not checked. [2018-10-10 16:27:40,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:27:40,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-10 16:27:40,832 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-10 16:27:40,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-10 16:27:40,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=649, Unknown=0, NotChecked=0, Total=756 [2018-10-10 16:27:40,833 INFO L87 Difference]: Start difference. First operand 951 states and 960 transitions. Second operand 28 states. [2018-10-10 16:27:42,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:27:42,298 INFO L93 Difference]: Finished difference Result 966 states and 975 transitions. [2018-10-10 16:27:42,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-10 16:27:42,298 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 950 [2018-10-10 16:27:42,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:27:42,303 INFO L225 Difference]: With dead ends: 966 [2018-10-10 16:27:42,303 INFO L226 Difference]: Without dead ends: 966 [2018-10-10 16:27:42,304 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 839 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=814, Invalid=3346, Unknown=0, NotChecked=0, Total=4160 [2018-10-10 16:27:42,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2018-10-10 16:27:42,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 966. [2018-10-10 16:27:42,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 966 states. [2018-10-10 16:27:42,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 975 transitions. [2018-10-10 16:27:42,315 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 975 transitions. Word has length 950 [2018-10-10 16:27:42,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:27:42,315 INFO L481 AbstractCegarLoop]: Abstraction has 966 states and 975 transitions. [2018-10-10 16:27:42,316 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-10 16:27:42,316 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 975 transitions. [2018-10-10 16:27:42,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 966 [2018-10-10 16:27:42,324 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:27:42,324 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 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] [2018-10-10 16:27:42,324 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:27:42,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:27:42,325 INFO L82 PathProgramCache]: Analyzing trace with hash -753017477, now seen corresponding path program 19 times [2018-10-10 16:27:42,326 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:27:42,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:27:43,643 INFO L134 CoverageAnalysis]: Checked inductivity of 18188 backedges. 11708 proven. 4181 refuted. 0 times theorem prover too weak. 2299 trivial. 0 not checked. [2018-10-10 16:27:43,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:27:43,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-10 16:27:43,644 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-10 16:27:43,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-10 16:27:43,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=855, Unknown=0, NotChecked=0, Total=992 [2018-10-10 16:27:43,645 INFO L87 Difference]: Start difference. First operand 966 states and 975 transitions. Second operand 32 states. [2018-10-10 16:27:45,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:27:45,861 INFO L93 Difference]: Finished difference Result 1011 states and 1020 transitions. [2018-10-10 16:27:45,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-10 16:27:45,864 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 965 [2018-10-10 16:27:45,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:27:45,868 INFO L225 Difference]: With dead ends: 1011 [2018-10-10 16:27:45,868 INFO L226 Difference]: Without dead ends: 1011 [2018-10-10 16:27:45,869 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1161 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1077, Invalid=4473, Unknown=0, NotChecked=0, Total=5550 [2018-10-10 16:27:45,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2018-10-10 16:27:45,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 1011. [2018-10-10 16:27:45,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1011 states. [2018-10-10 16:27:45,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1020 transitions. [2018-10-10 16:27:45,880 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1020 transitions. Word has length 965 [2018-10-10 16:27:45,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:27:45,881 INFO L481 AbstractCegarLoop]: Abstraction has 1011 states and 1020 transitions. [2018-10-10 16:27:45,881 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-10 16:27:45,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1020 transitions. [2018-10-10 16:27:45,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1011 [2018-10-10 16:27:45,891 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:27:45,891 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 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] [2018-10-10 16:27:45,891 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:27:45,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:27:45,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1408281285, now seen corresponding path program 20 times [2018-10-10 16:27:45,893 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:27:45,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:27:50,107 INFO L134 CoverageAnalysis]: Checked inductivity of 20420 backedges. 0 proven. 18269 refuted. 0 times theorem prover too weak. 2151 trivial. 0 not checked. [2018-10-10 16:27:50,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:27:50,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-10 16:27:50,109 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-10 16:27:50,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-10 16:27:50,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=788, Unknown=0, NotChecked=0, Total=870 [2018-10-10 16:27:50,110 INFO L87 Difference]: Start difference. First operand 1011 states and 1020 transitions. Second operand 30 states. [2018-10-10 16:27:54,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:27:54,772 INFO L93 Difference]: Finished difference Result 1299 states and 1310 transitions. [2018-10-10 16:27:54,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-10 16:27:54,774 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 1010 [2018-10-10 16:27:54,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:27:54,779 INFO L225 Difference]: With dead ends: 1299 [2018-10-10 16:27:54,779 INFO L226 Difference]: Without dead ends: 1299 [2018-10-10 16:27:54,781 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 858 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=500, Invalid=3922, Unknown=0, NotChecked=0, Total=4422 [2018-10-10 16:27:54,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1299 states. [2018-10-10 16:27:54,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1299 to 1156. [2018-10-10 16:27:54,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1156 states. [2018-10-10 16:27:54,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1166 transitions. [2018-10-10 16:27:54,793 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1166 transitions. Word has length 1010 [2018-10-10 16:27:54,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:27:54,794 INFO L481 AbstractCegarLoop]: Abstraction has 1156 states and 1166 transitions. [2018-10-10 16:27:54,794 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-10 16:27:54,794 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1166 transitions. [2018-10-10 16:27:54,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1156 [2018-10-10 16:27:54,806 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:27:54,807 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 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] [2018-10-10 16:27:54,807 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:27:54,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:27:54,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1090131021, now seen corresponding path program 21 times [2018-10-10 16:27:54,808 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:27:54,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:27:59,982 INFO L134 CoverageAnalysis]: Checked inductivity of 27308 backedges. 0 proven. 24729 refuted. 0 times theorem prover too weak. 2579 trivial. 0 not checked. [2018-10-10 16:27:59,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:27:59,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-10 16:27:59,984 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-10 16:27:59,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-10 16:27:59,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=904, Unknown=0, NotChecked=0, Total=992 [2018-10-10 16:27:59,984 INFO L87 Difference]: Start difference. First operand 1156 states and 1166 transitions. Second operand 32 states. [2018-10-10 16:28:05,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:28:05,237 INFO L93 Difference]: Finished difference Result 1444 states and 1456 transitions. [2018-10-10 16:28:05,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-10 16:28:05,240 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 1155 [2018-10-10 16:28:05,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:28:05,245 INFO L225 Difference]: With dead ends: 1444 [2018-10-10 16:28:05,245 INFO L226 Difference]: Without dead ends: 1444 [2018-10-10 16:28:05,246 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 995 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=543, Invalid=4569, Unknown=0, NotChecked=0, Total=5112 [2018-10-10 16:28:05,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2018-10-10 16:28:05,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 1301. [2018-10-10 16:28:05,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1301 states. [2018-10-10 16:28:05,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1301 states to 1301 states and 1312 transitions. [2018-10-10 16:28:05,259 INFO L78 Accepts]: Start accepts. Automaton has 1301 states and 1312 transitions. Word has length 1155 [2018-10-10 16:28:05,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:28:05,261 INFO L481 AbstractCegarLoop]: Abstraction has 1301 states and 1312 transitions. [2018-10-10 16:28:05,261 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-10 16:28:05,261 INFO L276 IsEmpty]: Start isEmpty. Operand 1301 states and 1312 transitions. [2018-10-10 16:28:05,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1301 [2018-10-10 16:28:05,275 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:28:05,276 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 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] [2018-10-10 16:28:05,276 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:28:05,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:28:05,276 INFO L82 PathProgramCache]: Analyzing trace with hash 144675899, now seen corresponding path program 22 times [2018-10-10 16:28:05,277 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:28:05,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:28:11,292 INFO L134 CoverageAnalysis]: Checked inductivity of 35197 backedges. 0 proven. 32190 refuted. 0 times theorem prover too weak. 3007 trivial. 0 not checked. [2018-10-10 16:28:11,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:28:11,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-10 16:28:11,293 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-10 16:28:11,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-10 16:28:11,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=1028, Unknown=0, NotChecked=0, Total=1122 [2018-10-10 16:28:11,294 INFO L87 Difference]: Start difference. First operand 1301 states and 1312 transitions. Second operand 34 states. [2018-10-10 16:28:17,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:28:17,097 INFO L93 Difference]: Finished difference Result 1589 states and 1602 transitions. [2018-10-10 16:28:17,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-10 16:28:17,098 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 1300 [2018-10-10 16:28:17,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:28:17,104 INFO L225 Difference]: With dead ends: 1589 [2018-10-10 16:28:17,104 INFO L226 Difference]: Without dead ends: 1589 [2018-10-10 16:28:17,106 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1133 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=586, Invalid=5266, Unknown=0, NotChecked=0, Total=5852 [2018-10-10 16:28:17,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1589 states. [2018-10-10 16:28:17,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1589 to 1446. [2018-10-10 16:28:17,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1446 states. [2018-10-10 16:28:17,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1446 states to 1446 states and 1458 transitions. [2018-10-10 16:28:17,117 INFO L78 Accepts]: Start accepts. Automaton has 1446 states and 1458 transitions. Word has length 1300 [2018-10-10 16:28:17,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:28:17,118 INFO L481 AbstractCegarLoop]: Abstraction has 1446 states and 1458 transitions. [2018-10-10 16:28:17,119 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-10 16:28:17,119 INFO L276 IsEmpty]: Start isEmpty. Operand 1446 states and 1458 transitions. [2018-10-10 16:28:17,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1446 [2018-10-10 16:28:17,134 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:28:17,135 INFO L375 BasicCegarLoop]: trace histogram [75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 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] [2018-10-10 16:28:17,135 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:28:17,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:28:17,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1072984909, now seen corresponding path program 23 times [2018-10-10 16:28:17,136 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:28:17,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:28:24,630 INFO L134 CoverageAnalysis]: Checked inductivity of 44087 backedges. 0 proven. 40652 refuted. 0 times theorem prover too weak. 3435 trivial. 0 not checked. [2018-10-10 16:28:24,631 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:28:24,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-10 16:28:24,632 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-10 16:28:24,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-10 16:28:24,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1160, Unknown=0, NotChecked=0, Total=1260 [2018-10-10 16:28:24,632 INFO L87 Difference]: Start difference. First operand 1446 states and 1458 transitions. Second operand 36 states. [2018-10-10 16:28:31,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:28:31,661 INFO L93 Difference]: Finished difference Result 1734 states and 1748 transitions. [2018-10-10 16:28:31,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-10 16:28:31,661 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 1445 [2018-10-10 16:28:31,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:28:31,666 INFO L225 Difference]: With dead ends: 1734 [2018-10-10 16:28:31,666 INFO L226 Difference]: Without dead ends: 1734 [2018-10-10 16:28:31,667 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1284 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=629, Invalid=6013, Unknown=0, NotChecked=0, Total=6642 [2018-10-10 16:28:31,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1734 states. [2018-10-10 16:28:31,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1734 to 1591. [2018-10-10 16:28:31,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1591 states. [2018-10-10 16:28:31,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1591 states and 1604 transitions. [2018-10-10 16:28:31,678 INFO L78 Accepts]: Start accepts. Automaton has 1591 states and 1604 transitions. Word has length 1445 [2018-10-10 16:28:31,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:28:31,679 INFO L481 AbstractCegarLoop]: Abstraction has 1591 states and 1604 transitions. [2018-10-10 16:28:31,679 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-10 16:28:31,679 INFO L276 IsEmpty]: Start isEmpty. Operand 1591 states and 1604 transitions. [2018-10-10 16:28:31,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1591 [2018-10-10 16:28:31,700 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:28:31,701 INFO L375 BasicCegarLoop]: trace histogram [83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 83, 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] [2018-10-10 16:28:31,701 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:28:31,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:28:31,701 INFO L82 PathProgramCache]: Analyzing trace with hash 176165691, now seen corresponding path program 24 times [2018-10-10 16:28:31,702 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:28:31,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:28:32,834 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-10 16:28:33,013 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-10 16:28:34,436 WARN L178 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-10 16:28:42,384 INFO L134 CoverageAnalysis]: Checked inductivity of 53978 backedges. 0 proven. 50115 refuted. 0 times theorem prover too weak. 3863 trivial. 0 not checked. [2018-10-10 16:28:42,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:28:42,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-10 16:28:42,385 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-10 16:28:42,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-10 16:28:42,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1300, Unknown=0, NotChecked=0, Total=1406 [2018-10-10 16:28:42,386 INFO L87 Difference]: Start difference. First operand 1591 states and 1604 transitions. Second operand 38 states. [2018-10-10 16:28:49,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:28:49,975 INFO L93 Difference]: Finished difference Result 1879 states and 1894 transitions. [2018-10-10 16:28:49,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-10 16:28:49,976 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 1590 [2018-10-10 16:28:49,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:28:49,982 INFO L225 Difference]: With dead ends: 1879 [2018-10-10 16:28:49,982 INFO L226 Difference]: Without dead ends: 1879 [2018-10-10 16:28:49,983 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1444 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=672, Invalid=6810, Unknown=0, NotChecked=0, Total=7482 [2018-10-10 16:28:49,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1879 states. [2018-10-10 16:28:49,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1879 to 1736. [2018-10-10 16:28:49,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1736 states. [2018-10-10 16:28:49,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1736 states to 1736 states and 1750 transitions. [2018-10-10 16:28:49,996 INFO L78 Accepts]: Start accepts. Automaton has 1736 states and 1750 transitions. Word has length 1590 [2018-10-10 16:28:49,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:28:49,996 INFO L481 AbstractCegarLoop]: Abstraction has 1736 states and 1750 transitions. [2018-10-10 16:28:49,996 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-10 16:28:49,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1736 states and 1750 transitions. [2018-10-10 16:28:50,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1736 [2018-10-10 16:28:50,018 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:28:50,019 INFO L375 BasicCegarLoop]: trace histogram [91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 91, 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] [2018-10-10 16:28:50,019 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:28:50,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:28:50,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1572278861, now seen corresponding path program 25 times [2018-10-10 16:28:50,020 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:28:50,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:28:53,606 INFO L134 CoverageAnalysis]: Checked inductivity of 64870 backedges. 46501 proven. 8472 refuted. 0 times theorem prover too weak. 9897 trivial. 0 not checked. [2018-10-10 16:28:53,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:28:53,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-10 16:28:53,608 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-10 16:28:53,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-10 16:28:53,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1353, Unknown=0, NotChecked=0, Total=1560 [2018-10-10 16:28:53,609 INFO L87 Difference]: Start difference. First operand 1736 states and 1750 transitions. Second operand 40 states. [2018-10-10 16:28:56,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:28:56,562 INFO L93 Difference]: Finished difference Result 1876 states and 1890 transitions. [2018-10-10 16:28:56,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-10 16:28:56,563 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 1735 [2018-10-10 16:28:56,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:28:56,569 INFO L225 Difference]: With dead ends: 1876 [2018-10-10 16:28:56,570 INFO L226 Difference]: Without dead ends: 1876 [2018-10-10 16:28:56,570 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1648 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1392, Invalid=5918, Unknown=0, NotChecked=0, Total=7310 [2018-10-10 16:28:56,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1876 states. [2018-10-10 16:28:56,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1876 to 1811. [2018-10-10 16:28:56,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1811 states. [2018-10-10 16:28:56,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 1811 states and 1825 transitions. [2018-10-10 16:28:56,584 INFO L78 Accepts]: Start accepts. Automaton has 1811 states and 1825 transitions. Word has length 1735 [2018-10-10 16:28:56,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:28:56,585 INFO L481 AbstractCegarLoop]: Abstraction has 1811 states and 1825 transitions. [2018-10-10 16:28:56,585 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-10 16:28:56,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 1825 transitions. [2018-10-10 16:28:56,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1811 [2018-10-10 16:28:56,602 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:28:56,603 INFO L375 BasicCegarLoop]: trace histogram [96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 96, 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] [2018-10-10 16:28:56,603 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:28:56,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:28:56,604 INFO L82 PathProgramCache]: Analyzing trace with hash -359252429, now seen corresponding path program 26 times [2018-10-10 16:28:56,604 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:28:56,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:29:08,109 INFO L134 CoverageAnalysis]: Checked inductivity of 71915 backedges. 0 proven. 67019 refuted. 0 times theorem prover too weak. 4896 trivial. 0 not checked. [2018-10-10 16:29:08,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:29:08,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-10 16:29:08,111 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-10 16:29:08,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-10 16:29:08,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1448, Unknown=0, NotChecked=0, Total=1560 [2018-10-10 16:29:08,111 INFO L87 Difference]: Start difference. First operand 1811 states and 1825 transitions. Second operand 40 states. [2018-10-10 16:29:16,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:29:16,682 INFO L93 Difference]: Finished difference Result 2129 states and 2145 transitions. [2018-10-10 16:29:16,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-10 16:29:16,683 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 1810 [2018-10-10 16:29:16,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:29:16,691 INFO L225 Difference]: With dead ends: 2129 [2018-10-10 16:29:16,691 INFO L226 Difference]: Without dead ends: 2129 [2018-10-10 16:29:16,693 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1613 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=715, Invalid=7657, Unknown=0, NotChecked=0, Total=8372 [2018-10-10 16:29:16,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2129 states. [2018-10-10 16:29:16,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2129 to 1971. [2018-10-10 16:29:16,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1971 states. [2018-10-10 16:29:16,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1971 states to 1971 states and 1986 transitions. [2018-10-10 16:29:16,709 INFO L78 Accepts]: Start accepts. Automaton has 1971 states and 1986 transitions. Word has length 1810 [2018-10-10 16:29:16,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:29:16,710 INFO L481 AbstractCegarLoop]: Abstraction has 1971 states and 1986 transitions. [2018-10-10 16:29:16,711 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-10 16:29:16,711 INFO L276 IsEmpty]: Start isEmpty. Operand 1971 states and 1986 transitions. [2018-10-10 16:29:16,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1971 [2018-10-10 16:29:16,734 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:29:16,735 INFO L375 BasicCegarLoop]: trace histogram [105, 105, 105, 105, 105, 105, 105, 105, 105, 105, 105, 105, 105, 105, 105, 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] [2018-10-10 16:29:16,735 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:29:16,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:29:16,736 INFO L82 PathProgramCache]: Analyzing trace with hash 905891019, now seen corresponding path program 27 times [2018-10-10 16:29:16,737 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:29:16,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:29:29,782 INFO L134 CoverageAnalysis]: Checked inductivity of 85988 backedges. 0 proven. 80543 refuted. 0 times theorem prover too weak. 5445 trivial. 0 not checked. [2018-10-10 16:29:29,783 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:29:29,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-10 16:29:29,784 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-10 16:29:29,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-10 16:29:29,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1604, Unknown=0, NotChecked=0, Total=1722 [2018-10-10 16:29:29,784 INFO L87 Difference]: Start difference. First operand 1971 states and 1986 transitions. Second operand 42 states. [2018-10-10 16:29:39,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:29:39,716 INFO L93 Difference]: Finished difference Result 2289 states and 2306 transitions. [2018-10-10 16:29:39,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-10 16:29:39,716 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 1970 [2018-10-10 16:29:39,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:29:39,723 INFO L225 Difference]: With dead ends: 2289 [2018-10-10 16:29:39,723 INFO L226 Difference]: Without dead ends: 2289 [2018-10-10 16:29:39,725 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1791 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=758, Invalid=8554, Unknown=0, NotChecked=0, Total=9312 [2018-10-10 16:29:39,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2289 states. [2018-10-10 16:29:39,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2289 to 2131. [2018-10-10 16:29:39,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2131 states. [2018-10-10 16:29:39,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2131 states to 2131 states and 2147 transitions. [2018-10-10 16:29:39,746 INFO L78 Accepts]: Start accepts. Automaton has 2131 states and 2147 transitions. Word has length 1970 [2018-10-10 16:29:39,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:29:39,747 INFO L481 AbstractCegarLoop]: Abstraction has 2131 states and 2147 transitions. [2018-10-10 16:29:39,747 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-10 16:29:39,747 INFO L276 IsEmpty]: Start isEmpty. Operand 2131 states and 2147 transitions. [2018-10-10 16:29:39,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2131 [2018-10-10 16:29:39,779 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:29:39,780 INFO L375 BasicCegarLoop]: trace histogram [114, 114, 114, 114, 114, 114, 114, 114, 114, 114, 114, 114, 114, 114, 114, 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] [2018-10-10 16:29:39,780 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:29:39,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:29:39,781 INFO L82 PathProgramCache]: Analyzing trace with hash 1279621987, now seen corresponding path program 28 times [2018-10-10 16:29:39,782 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:29:39,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:29:54,734 INFO L134 CoverageAnalysis]: Checked inductivity of 101319 backedges. 0 proven. 95325 refuted. 0 times theorem prover too weak. 5994 trivial. 0 not checked. [2018-10-10 16:29:54,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:29:54,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-10 16:29:54,735 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-10 16:29:54,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-10 16:29:54,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1768, Unknown=0, NotChecked=0, Total=1892 [2018-10-10 16:29:54,736 INFO L87 Difference]: Start difference. First operand 2131 states and 2147 transitions. Second operand 44 states. [2018-10-10 16:30:05,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:30:05,869 INFO L93 Difference]: Finished difference Result 2449 states and 2467 transitions. [2018-10-10 16:30:05,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-10 16:30:05,870 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 2130 [2018-10-10 16:30:05,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:30:05,877 INFO L225 Difference]: With dead ends: 2449 [2018-10-10 16:30:05,877 INFO L226 Difference]: Without dead ends: 2449 [2018-10-10 16:30:05,878 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1978 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=801, Invalid=9501, Unknown=0, NotChecked=0, Total=10302 [2018-10-10 16:30:05,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2449 states. [2018-10-10 16:30:05,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2449 to 2291. [2018-10-10 16:30:05,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2291 states. [2018-10-10 16:30:05,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2291 states to 2291 states and 2308 transitions. [2018-10-10 16:30:05,893 INFO L78 Accepts]: Start accepts. Automaton has 2291 states and 2308 transitions. Word has length 2130 [2018-10-10 16:30:05,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:30:05,895 INFO L481 AbstractCegarLoop]: Abstraction has 2291 states and 2308 transitions. [2018-10-10 16:30:05,895 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-10 16:30:05,895 INFO L276 IsEmpty]: Start isEmpty. Operand 2291 states and 2308 transitions. [2018-10-10 16:30:05,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2291 [2018-10-10 16:30:05,923 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:30:05,924 INFO L375 BasicCegarLoop]: trace histogram [123, 123, 123, 123, 123, 123, 123, 123, 123, 123, 123, 123, 123, 123, 123, 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] [2018-10-10 16:30:05,924 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:30:05,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:30:05,925 INFO L82 PathProgramCache]: Analyzing trace with hash 719997435, now seen corresponding path program 29 times [2018-10-10 16:30:05,926 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:30:06,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:30:10,895 INFO L134 CoverageAnalysis]: Checked inductivity of 117908 backedges. 91725 proven. 20189 refuted. 0 times theorem prover too weak. 5994 trivial. 0 not checked. [2018-10-10 16:30:10,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:30:10,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-10-10 16:30:10,897 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-10 16:30:10,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-10 16:30:10,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=417, Invalid=2663, Unknown=0, NotChecked=0, Total=3080 [2018-10-10 16:30:10,898 INFO L87 Difference]: Start difference. First operand 2291 states and 2308 transitions. Second operand 56 states. [2018-10-10 16:30:16,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:30:16,273 INFO L93 Difference]: Finished difference Result 2331 states and 2348 transitions. [2018-10-10 16:30:16,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-10 16:30:16,274 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 2290 [2018-10-10 16:30:16,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:30:16,283 INFO L225 Difference]: With dead ends: 2331 [2018-10-10 16:30:16,283 INFO L226 Difference]: Without dead ends: 2331 [2018-10-10 16:30:16,284 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3311 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2679, Invalid=11363, Unknown=0, NotChecked=0, Total=14042 [2018-10-10 16:30:16,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2331 states. [2018-10-10 16:30:16,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2331 to 2306. [2018-10-10 16:30:16,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2306 states. [2018-10-10 16:30:16,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2306 states to 2306 states and 2323 transitions. [2018-10-10 16:30:16,300 INFO L78 Accepts]: Start accepts. Automaton has 2306 states and 2323 transitions. Word has length 2290 [2018-10-10 16:30:16,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:30:16,301 INFO L481 AbstractCegarLoop]: Abstraction has 2306 states and 2323 transitions. [2018-10-10 16:30:16,301 INFO L482 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-10 16:30:16,301 INFO L276 IsEmpty]: Start isEmpty. Operand 2306 states and 2323 transitions. [2018-10-10 16:30:16,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2306 [2018-10-10 16:30:16,329 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:30:16,330 INFO L375 BasicCegarLoop]: trace histogram [124, 124, 124, 124, 124, 124, 124, 124, 124, 124, 124, 124, 124, 124, 124, 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] [2018-10-10 16:30:16,331 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:30:16,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:30:16,331 INFO L82 PathProgramCache]: Analyzing trace with hash -1413772149, now seen corresponding path program 30 times [2018-10-10 16:30:16,332 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:30:16,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:30:21,095 INFO L134 CoverageAnalysis]: Checked inductivity of 119770 backedges. 91725 proven. 22051 refuted. 0 times theorem prover too weak. 5994 trivial. 0 not checked. [2018-10-10 16:30:21,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:30:21,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-10-10 16:30:21,098 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-10 16:30:21,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-10 16:30:21,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=2866, Unknown=0, NotChecked=0, Total=3306 [2018-10-10 16:30:21,099 INFO L87 Difference]: Start difference. First operand 2306 states and 2323 transitions. Second operand 58 states. [2018-10-10 16:30:26,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:30:26,886 INFO L93 Difference]: Finished difference Result 2346 states and 2363 transitions. [2018-10-10 16:30:26,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-10 16:30:26,887 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 2305 [2018-10-10 16:30:26,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:30:26,897 INFO L225 Difference]: With dead ends: 2346 [2018-10-10 16:30:26,897 INFO L226 Difference]: Without dead ends: 2346 [2018-10-10 16:30:26,898 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3628 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2888, Invalid=12364, Unknown=0, NotChecked=0, Total=15252 [2018-10-10 16:30:26,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2346 states. [2018-10-10 16:30:26,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2346 to 2321. [2018-10-10 16:30:26,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2321 states. [2018-10-10 16:30:26,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2321 states to 2321 states and 2338 transitions. [2018-10-10 16:30:26,917 INFO L78 Accepts]: Start accepts. Automaton has 2321 states and 2338 transitions. Word has length 2305 [2018-10-10 16:30:26,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:30:26,919 INFO L481 AbstractCegarLoop]: Abstraction has 2321 states and 2338 transitions. [2018-10-10 16:30:26,919 INFO L482 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-10 16:30:26,919 INFO L276 IsEmpty]: Start isEmpty. Operand 2321 states and 2338 transitions. [2018-10-10 16:30:26,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2321 [2018-10-10 16:30:26,950 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:30:26,950 INFO L375 BasicCegarLoop]: trace histogram [125, 125, 125, 125, 125, 125, 125, 125, 125, 125, 125, 125, 125, 125, 125, 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] [2018-10-10 16:30:26,951 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:30:26,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:30:26,951 INFO L82 PathProgramCache]: Analyzing trace with hash -871704581, now seen corresponding path program 31 times [2018-10-10 16:30:26,952 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:30:27,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:30:31,675 INFO L134 CoverageAnalysis]: Checked inductivity of 121647 backedges. 91725 proven. 23928 refuted. 0 times theorem prover too weak. 5994 trivial. 0 not checked. [2018-10-10 16:30:31,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:30:31,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-10-10 16:30:31,678 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-10 16:30:31,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-10 16:30:31,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=3075, Unknown=0, NotChecked=0, Total=3540 [2018-10-10 16:30:31,678 INFO L87 Difference]: Start difference. First operand 2321 states and 2338 transitions. Second operand 60 states. [2018-10-10 16:30:37,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:30:37,943 INFO L93 Difference]: Finished difference Result 2361 states and 2378 transitions. [2018-10-10 16:30:37,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-10-10 16:30:37,944 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 2320 [2018-10-10 16:30:37,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:30:37,957 INFO L225 Difference]: With dead ends: 2361 [2018-10-10 16:30:37,957 INFO L226 Difference]: Without dead ends: 2361 [2018-10-10 16:30:37,958 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3957 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3111, Invalid=13401, Unknown=0, NotChecked=0, Total=16512 [2018-10-10 16:30:37,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2361 states. [2018-10-10 16:30:37,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2361 to 2336. [2018-10-10 16:30:37,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2336 states. [2018-10-10 16:30:37,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2336 states to 2336 states and 2353 transitions. [2018-10-10 16:30:37,977 INFO L78 Accepts]: Start accepts. Automaton has 2336 states and 2353 transitions. Word has length 2320 [2018-10-10 16:30:37,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:30:37,979 INFO L481 AbstractCegarLoop]: Abstraction has 2336 states and 2353 transitions. [2018-10-10 16:30:37,979 INFO L482 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-10 16:30:37,979 INFO L276 IsEmpty]: Start isEmpty. Operand 2336 states and 2353 transitions. [2018-10-10 16:30:38,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2336 [2018-10-10 16:30:38,015 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:30:38,016 INFO L375 BasicCegarLoop]: trace histogram [126, 126, 126, 126, 126, 126, 126, 126, 126, 126, 126, 126, 126, 126, 126, 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] [2018-10-10 16:30:38,016 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:30:38,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:30:38,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1884471669, now seen corresponding path program 32 times [2018-10-10 16:30:38,018 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:30:38,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:30:42,764 INFO L134 CoverageAnalysis]: Checked inductivity of 123539 backedges. 91725 proven. 25820 refuted. 0 times theorem prover too weak. 5994 trivial. 0 not checked. [2018-10-10 16:30:42,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:30:42,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-10-10 16:30:42,766 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-10 16:30:42,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-10 16:30:42,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=492, Invalid=3290, Unknown=0, NotChecked=0, Total=3782 [2018-10-10 16:30:42,766 INFO L87 Difference]: Start difference. First operand 2336 states and 2353 transitions. Second operand 62 states. [2018-10-10 16:30:49,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:30:49,530 INFO L93 Difference]: Finished difference Result 2376 states and 2393 transitions. [2018-10-10 16:30:49,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-10-10 16:30:49,530 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 2335 [2018-10-10 16:30:49,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:30:49,536 INFO L225 Difference]: With dead ends: 2376 [2018-10-10 16:30:49,536 INFO L226 Difference]: Without dead ends: 2376 [2018-10-10 16:30:49,537 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4298 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3348, Invalid=14474, Unknown=0, NotChecked=0, Total=17822 [2018-10-10 16:30:49,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2376 states. [2018-10-10 16:30:49,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2376 to 2351. [2018-10-10 16:30:49,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2351 states. [2018-10-10 16:30:49,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2351 states to 2351 states and 2368 transitions. [2018-10-10 16:30:49,551 INFO L78 Accepts]: Start accepts. Automaton has 2351 states and 2368 transitions. Word has length 2335 [2018-10-10 16:30:49,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:30:49,552 INFO L481 AbstractCegarLoop]: Abstraction has 2351 states and 2368 transitions. [2018-10-10 16:30:49,552 INFO L482 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-10 16:30:49,552 INFO L276 IsEmpty]: Start isEmpty. Operand 2351 states and 2368 transitions. [2018-10-10 16:30:49,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2351 [2018-10-10 16:30:49,582 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:30:49,583 INFO L375 BasicCegarLoop]: trace histogram [127, 127, 127, 127, 127, 127, 127, 127, 127, 127, 127, 127, 127, 127, 127, 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] [2018-10-10 16:30:49,583 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:30:49,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:30:49,583 INFO L82 PathProgramCache]: Analyzing trace with hash -734075397, now seen corresponding path program 33 times [2018-10-10 16:30:49,584 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:30:49,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:30:54,847 INFO L134 CoverageAnalysis]: Checked inductivity of 125446 backedges. 91725 proven. 27727 refuted. 0 times theorem prover too weak. 5994 trivial. 0 not checked. [2018-10-10 16:30:54,847 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:30:54,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-10-10 16:30:54,849 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-10 16:30:54,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-10 16:30:54,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=521, Invalid=3511, Unknown=0, NotChecked=0, Total=4032 [2018-10-10 16:30:54,849 INFO L87 Difference]: Start difference. First operand 2351 states and 2368 transitions. Second operand 64 states. [2018-10-10 16:30:58,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:30:58,435 INFO L93 Difference]: Finished difference Result 2391 states and 2408 transitions. [2018-10-10 16:30:58,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-10-10 16:30:58,435 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 2350 [2018-10-10 16:30:58,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:30:58,441 INFO L225 Difference]: With dead ends: 2391 [2018-10-10 16:30:58,441 INFO L226 Difference]: Without dead ends: 2391 [2018-10-10 16:30:58,442 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4651 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3599, Invalid=15583, Unknown=0, NotChecked=0, Total=19182 [2018-10-10 16:30:58,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2391 states. [2018-10-10 16:30:58,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2391 to 2366. [2018-10-10 16:30:58,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2366 states. [2018-10-10 16:30:58,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2366 states to 2366 states and 2383 transitions. [2018-10-10 16:30:58,454 INFO L78 Accepts]: Start accepts. Automaton has 2366 states and 2383 transitions. Word has length 2350 [2018-10-10 16:30:58,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:30:58,455 INFO L481 AbstractCegarLoop]: Abstraction has 2366 states and 2383 transitions. [2018-10-10 16:30:58,455 INFO L482 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-10 16:30:58,455 INFO L276 IsEmpty]: Start isEmpty. Operand 2366 states and 2383 transitions. [2018-10-10 16:30:58,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2366 [2018-10-10 16:30:58,483 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:30:58,484 INFO L375 BasicCegarLoop]: trace histogram [128, 128, 128, 128, 128, 128, 128, 128, 128, 128, 128, 128, 128, 128, 128, 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] [2018-10-10 16:30:58,484 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:30:58,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:30:58,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1826918261, now seen corresponding path program 34 times [2018-10-10 16:30:58,485 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:30:58,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:31:15,711 INFO L134 CoverageAnalysis]: Checked inductivity of 127368 backedges. 0 proven. 119995 refuted. 0 times theorem prover too weak. 7373 trivial. 0 not checked. [2018-10-10 16:31:15,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:31:15,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-10 16:31:15,714 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-10 16:31:15,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-10 16:31:15,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1940, Unknown=0, NotChecked=0, Total=2070 [2018-10-10 16:31:15,714 INFO L87 Difference]: Start difference. First operand 2366 states and 2383 transitions. Second operand 46 states. [2018-10-10 16:31:27,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:31:27,822 INFO L93 Difference]: Finished difference Result 2834 states and 2853 transitions. [2018-10-10 16:31:27,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-10 16:31:27,822 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 2365 [2018-10-10 16:31:27,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:31:27,827 INFO L225 Difference]: With dead ends: 2834 [2018-10-10 16:31:27,827 INFO L226 Difference]: Without dead ends: 2834 [2018-10-10 16:31:27,828 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2174 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=844, Invalid=10498, Unknown=0, NotChecked=0, Total=11342 [2018-10-10 16:31:27,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2834 states. [2018-10-10 16:31:27,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2834 to 2601. [2018-10-10 16:31:27,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2601 states. [2018-10-10 16:31:27,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2601 states to 2601 states and 2619 transitions. [2018-10-10 16:31:27,848 INFO L78 Accepts]: Start accepts. Automaton has 2601 states and 2619 transitions. Word has length 2365 [2018-10-10 16:31:27,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:31:27,850 INFO L481 AbstractCegarLoop]: Abstraction has 2601 states and 2619 transitions. [2018-10-10 16:31:27,850 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-10 16:31:27,850 INFO L276 IsEmpty]: Start isEmpty. Operand 2601 states and 2619 transitions. [2018-10-10 16:31:27,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2601 [2018-10-10 16:31:27,897 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:31:27,899 INFO L375 BasicCegarLoop]: trace histogram [142, 142, 142, 142, 142, 142, 142, 142, 142, 142, 142, 142, 142, 142, 142, 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] [2018-10-10 16:31:27,899 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:31:27,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:31:27,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1157721501, now seen corresponding path program 35 times [2018-10-10 16:31:27,900 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:31:28,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:31:48,442 INFO L134 CoverageAnalysis]: Checked inductivity of 156410 backedges. 0 proven. 147658 refuted. 0 times theorem prover too weak. 8752 trivial. 0 not checked. [2018-10-10 16:31:48,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:31:48,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-10 16:31:48,443 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-10 16:31:48,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-10 16:31:48,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=2120, Unknown=0, NotChecked=0, Total=2256 [2018-10-10 16:31:48,444 INFO L87 Difference]: Start difference. First operand 2601 states and 2619 transitions. Second operand 48 states. [2018-10-10 16:32:01,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:32:01,097 INFO L93 Difference]: Finished difference Result 3069 states and 3089 transitions. [2018-10-10 16:32:01,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-10 16:32:01,097 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 2600 [2018-10-10 16:32:01,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:32:01,102 INFO L225 Difference]: With dead ends: 3069 [2018-10-10 16:32:01,102 INFO L226 Difference]: Without dead ends: 3069 [2018-10-10 16:32:01,103 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2379 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=887, Invalid=11545, Unknown=0, NotChecked=0, Total=12432 [2018-10-10 16:32:01,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3069 states. [2018-10-10 16:32:01,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3069 to 2836. [2018-10-10 16:32:01,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2836 states. [2018-10-10 16:32:01,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2836 states to 2836 states and 2855 transitions. [2018-10-10 16:32:01,124 INFO L78 Accepts]: Start accepts. Automaton has 2836 states and 2855 transitions. Word has length 2600 [2018-10-10 16:32:01,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:32:01,125 INFO L481 AbstractCegarLoop]: Abstraction has 2836 states and 2855 transitions. [2018-10-10 16:32:01,126 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-10 16:32:01,126 INFO L276 IsEmpty]: Start isEmpty. Operand 2836 states and 2855 transitions. [2018-10-10 16:32:01,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2836 [2018-10-10 16:32:01,190 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:32:01,191 INFO L375 BasicCegarLoop]: trace histogram [156, 156, 156, 156, 156, 156, 156, 156, 156, 156, 156, 156, 156, 156, 156, 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] [2018-10-10 16:32:01,191 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:32:01,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:32:01,192 INFO L82 PathProgramCache]: Analyzing trace with hash 501348747, now seen corresponding path program 36 times [2018-10-10 16:32:01,193 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:32:01,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:32:25,767 INFO L134 CoverageAnalysis]: Checked inductivity of 188445 backedges. 0 proven. 178314 refuted. 0 times theorem prover too weak. 10131 trivial. 0 not checked. [2018-10-10 16:32:25,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:32:25,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-10 16:32:25,768 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-10 16:32:25,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-10 16:32:25,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=2308, Unknown=0, NotChecked=0, Total=2450 [2018-10-10 16:32:25,769 INFO L87 Difference]: Start difference. First operand 2836 states and 2855 transitions. Second operand 50 states. [2018-10-10 16:32:39,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:32:39,997 INFO L93 Difference]: Finished difference Result 3304 states and 3325 transitions. [2018-10-10 16:32:39,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-10 16:32:39,997 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 2835 [2018-10-10 16:32:39,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:32:40,002 INFO L225 Difference]: With dead ends: 3304 [2018-10-10 16:32:40,002 INFO L226 Difference]: Without dead ends: 3304 [2018-10-10 16:32:40,003 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2593 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=930, Invalid=12642, Unknown=0, NotChecked=0, Total=13572 [2018-10-10 16:32:40,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3304 states. [2018-10-10 16:32:40,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3304 to 3071. [2018-10-10 16:32:40,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3071 states. [2018-10-10 16:32:40,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3071 states to 3071 states and 3091 transitions. [2018-10-10 16:32:40,027 INFO L78 Accepts]: Start accepts. Automaton has 3071 states and 3091 transitions. Word has length 2835 [2018-10-10 16:32:40,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:32:40,029 INFO L481 AbstractCegarLoop]: Abstraction has 3071 states and 3091 transitions. [2018-10-10 16:32:40,029 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-10 16:32:40,029 INFO L276 IsEmpty]: Start isEmpty. Operand 3071 states and 3091 transitions. [2018-10-10 16:32:40,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3071 [2018-10-10 16:32:40,097 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:32:40,098 INFO L375 BasicCegarLoop]: trace histogram [170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 170, 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] [2018-10-10 16:32:40,098 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:32:40,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:32:40,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1714710883, now seen corresponding path program 37 times [2018-10-10 16:32:40,100 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:32:40,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:33:08,347 INFO L134 CoverageAnalysis]: Checked inductivity of 223473 backedges. 0 proven. 211963 refuted. 0 times theorem prover too weak. 11510 trivial. 0 not checked. [2018-10-10 16:33:08,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:33:08,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-10-10 16:33:08,349 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-10 16:33:08,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-10 16:33:08,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=2504, Unknown=0, NotChecked=0, Total=2652 [2018-10-10 16:33:08,350 INFO L87 Difference]: Start difference. First operand 3071 states and 3091 transitions. Second operand 52 states. [2018-10-10 16:33:23,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:33:23,920 INFO L93 Difference]: Finished difference Result 3539 states and 3561 transitions. [2018-10-10 16:33:23,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-10 16:33:23,920 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 3070 [2018-10-10 16:33:23,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:33:23,923 INFO L225 Difference]: With dead ends: 3539 [2018-10-10 16:33:23,923 INFO L226 Difference]: Without dead ends: 3539 [2018-10-10 16:33:23,924 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2816 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=973, Invalid=13789, Unknown=0, NotChecked=0, Total=14762 [2018-10-10 16:33:23,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3539 states. [2018-10-10 16:33:23,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3539 to 3306. [2018-10-10 16:33:23,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3306 states. [2018-10-10 16:33:23,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3306 states to 3306 states and 3327 transitions. [2018-10-10 16:33:23,951 INFO L78 Accepts]: Start accepts. Automaton has 3306 states and 3327 transitions. Word has length 3070 [2018-10-10 16:33:23,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:33:23,953 INFO L481 AbstractCegarLoop]: Abstraction has 3306 states and 3327 transitions. [2018-10-10 16:33:23,953 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-10 16:33:23,953 INFO L276 IsEmpty]: Start isEmpty. Operand 3306 states and 3327 transitions. [2018-10-10 16:33:24,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3306 [2018-10-10 16:33:24,030 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:33:24,031 INFO L375 BasicCegarLoop]: trace histogram [184, 184, 184, 184, 184, 184, 184, 184, 184, 184, 184, 184, 184, 184, 184, 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] [2018-10-10 16:33:24,031 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:33:24,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:33:24,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1471398539, now seen corresponding path program 38 times [2018-10-10 16:33:24,032 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:33:24,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:33:32,761 INFO L134 CoverageAnalysis]: Checked inductivity of 261494 backedges. 206591 proven. 43393 refuted. 0 times theorem prover too weak. 11510 trivial. 0 not checked. [2018-10-10 16:33:32,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:33:32,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-10-10 16:33:32,763 INFO L460 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-10-10 16:33:32,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-10-10 16:33:32,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=704, Invalid=4698, Unknown=0, NotChecked=0, Total=5402 [2018-10-10 16:33:32,764 INFO L87 Difference]: Start difference. First operand 3306 states and 3327 transitions. Second operand 74 states. [2018-10-10 16:33:42,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:33:42,603 INFO L93 Difference]: Finished difference Result 3346 states and 3367 transitions. [2018-10-10 16:33:42,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-10-10 16:33:42,604 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 3305 [2018-10-10 16:33:42,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:33:42,608 INFO L225 Difference]: With dead ends: 3346 [2018-10-10 16:33:42,608 INFO L226 Difference]: Without dead ends: 3346 [2018-10-10 16:33:42,609 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6236 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=4780, Invalid=20660, Unknown=0, NotChecked=0, Total=25440 [2018-10-10 16:33:42,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3346 states. [2018-10-10 16:33:42,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3346 to 3321. [2018-10-10 16:33:42,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3321 states. [2018-10-10 16:33:42,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3321 states to 3321 states and 3342 transitions. [2018-10-10 16:33:42,626 INFO L78 Accepts]: Start accepts. Automaton has 3321 states and 3342 transitions. Word has length 3305 [2018-10-10 16:33:42,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:33:42,627 INFO L481 AbstractCegarLoop]: Abstraction has 3321 states and 3342 transitions. [2018-10-10 16:33:42,627 INFO L482 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-10-10 16:33:42,627 INFO L276 IsEmpty]: Start isEmpty. Operand 3321 states and 3342 transitions. [2018-10-10 16:33:42,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3321 [2018-10-10 16:33:42,684 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:33:42,685 INFO L375 BasicCegarLoop]: trace histogram [185, 185, 185, 185, 185, 185, 185, 185, 185, 185, 185, 185, 185, 185, 185, 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] [2018-10-10 16:33:42,686 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:33:42,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:33:42,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1977606651, now seen corresponding path program 39 times [2018-10-10 16:33:42,687 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:33:43,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:33:51,977 INFO L134 CoverageAnalysis]: Checked inductivity of 264275 backedges. 206591 proven. 46174 refuted. 0 times theorem prover too weak. 11510 trivial. 0 not checked. [2018-10-10 16:33:51,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:33:51,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-10-10 16:33:51,979 INFO L460 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-10-10 16:33:51,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-10-10 16:33:51,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=737, Invalid=4963, Unknown=0, NotChecked=0, Total=5700 [2018-10-10 16:33:51,980 INFO L87 Difference]: Start difference. First operand 3321 states and 3342 transitions. Second operand 76 states. [2018-10-10 16:34:02,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:34:02,038 INFO L93 Difference]: Finished difference Result 3361 states and 3382 transitions. [2018-10-10 16:34:02,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-10-10 16:34:02,039 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 3320 [2018-10-10 16:34:02,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:34:02,043 INFO L225 Difference]: With dead ends: 3361 [2018-10-10 16:34:02,043 INFO L226 Difference]: Without dead ends: 3361 [2018-10-10 16:34:02,045 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6665 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=5071, Invalid=21989, Unknown=0, NotChecked=0, Total=27060 [2018-10-10 16:34:02,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3361 states. [2018-10-10 16:34:02,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3361 to 3336. [2018-10-10 16:34:02,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3336 states. [2018-10-10 16:34:02,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3336 states to 3336 states and 3357 transitions. [2018-10-10 16:34:02,063 INFO L78 Accepts]: Start accepts. Automaton has 3336 states and 3357 transitions. Word has length 3320 [2018-10-10 16:34:02,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:34:02,065 INFO L481 AbstractCegarLoop]: Abstraction has 3336 states and 3357 transitions. [2018-10-10 16:34:02,065 INFO L482 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-10-10 16:34:02,065 INFO L276 IsEmpty]: Start isEmpty. Operand 3336 states and 3357 transitions. [2018-10-10 16:34:02,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3336 [2018-10-10 16:34:02,120 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:34:02,121 INFO L375 BasicCegarLoop]: trace histogram [186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 186, 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] [2018-10-10 16:34:02,121 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:34:02,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:34:02,122 INFO L82 PathProgramCache]: Analyzing trace with hash 333640843, now seen corresponding path program 40 times [2018-10-10 16:34:02,123 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:34:02,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:34:10,280 INFO L134 CoverageAnalysis]: Checked inductivity of 267071 backedges. 215174 proven. 36521 refuted. 0 times theorem prover too weak. 15376 trivial. 0 not checked. [2018-10-10 16:34:10,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:34:10,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-10-10 16:34:10,283 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-10-10 16:34:10,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-10-10 16:34:10,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=624, Invalid=4206, Unknown=0, NotChecked=0, Total=4830 [2018-10-10 16:34:10,284 INFO L87 Difference]: Start difference. First operand 3336 states and 3357 transitions. Second operand 70 states. [2018-10-10 16:34:19,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:34:19,160 INFO L93 Difference]: Finished difference Result 3392 states and 3413 transitions. [2018-10-10 16:34:19,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-10-10 16:34:19,160 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 3335 [2018-10-10 16:34:19,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:34:19,164 INFO L225 Difference]: With dead ends: 3392 [2018-10-10 16:34:19,164 INFO L226 Difference]: Without dead ends: 3392 [2018-10-10 16:34:19,166 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5614 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4302, Invalid=18650, Unknown=0, NotChecked=0, Total=22952 [2018-10-10 16:34:19,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3392 states. [2018-10-10 16:34:19,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3392 to 3366. [2018-10-10 16:34:19,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3366 states. [2018-10-10 16:34:19,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3366 states to 3366 states and 3387 transitions. [2018-10-10 16:34:19,183 INFO L78 Accepts]: Start accepts. Automaton has 3366 states and 3387 transitions. Word has length 3335 [2018-10-10 16:34:19,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:34:19,185 INFO L481 AbstractCegarLoop]: Abstraction has 3366 states and 3387 transitions. [2018-10-10 16:34:19,185 INFO L482 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-10-10 16:34:19,185 INFO L276 IsEmpty]: Start isEmpty. Operand 3366 states and 3387 transitions. [2018-10-10 16:34:19,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3366 [2018-10-10 16:34:19,245 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:34:19,247 INFO L375 BasicCegarLoop]: trace histogram [188, 188, 188, 188, 188, 188, 188, 188, 188, 188, 188, 188, 188, 188, 188, 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] [2018-10-10 16:34:19,247 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:34:19,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:34:19,247 INFO L82 PathProgramCache]: Analyzing trace with hash -6832549, now seen corresponding path program 41 times [2018-10-10 16:34:19,248 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:34:19,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:34:28,027 INFO L134 CoverageAnalysis]: Checked inductivity of 272708 backedges. 218000 proven. 38880 refuted. 0 times theorem prover too weak. 15828 trivial. 0 not checked. [2018-10-10 16:34:28,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:34:28,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-10-10 16:34:28,029 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-10 16:34:28,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-10 16:34:28,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=657, Invalid=4455, Unknown=0, NotChecked=0, Total=5112 [2018-10-10 16:34:28,030 INFO L87 Difference]: Start difference. First operand 3366 states and 3387 transitions. Second operand 72 states. [2018-10-10 16:34:37,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:34:37,418 INFO L93 Difference]: Finished difference Result 3435 states and 3456 transitions. [2018-10-10 16:34:37,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-10-10 16:34:37,418 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 3365 [2018-10-10 16:34:37,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:34:37,421 INFO L225 Difference]: With dead ends: 3435 [2018-10-10 16:34:37,421 INFO L226 Difference]: Without dead ends: 3435 [2018-10-10 16:34:37,423 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6017 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=4587, Invalid=19905, Unknown=0, NotChecked=0, Total=24492 [2018-10-10 16:34:37,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3435 states. [2018-10-10 16:34:37,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3435 to 3396. [2018-10-10 16:34:37,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3396 states. [2018-10-10 16:34:37,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3396 states to 3396 states and 3417 transitions. [2018-10-10 16:34:37,441 INFO L78 Accepts]: Start accepts. Automaton has 3396 states and 3417 transitions. Word has length 3365 [2018-10-10 16:34:37,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:34:37,443 INFO L481 AbstractCegarLoop]: Abstraction has 3396 states and 3417 transitions. [2018-10-10 16:34:37,443 INFO L482 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-10 16:34:37,443 INFO L276 IsEmpty]: Start isEmpty. Operand 3396 states and 3417 transitions. [2018-10-10 16:34:37,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3396 [2018-10-10 16:34:37,501 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:34:37,503 INFO L375 BasicCegarLoop]: trace histogram [190, 190, 190, 190, 190, 190, 190, 190, 190, 190, 190, 190, 190, 190, 190, 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] [2018-10-10 16:34:37,503 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:34:37,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:34:37,504 INFO L82 PathProgramCache]: Analyzing trace with hash 157990539, now seen corresponding path program 42 times [2018-10-10 16:34:37,504 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:34:38,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:34:46,960 INFO L134 CoverageAnalysis]: Checked inductivity of 278405 backedges. 215963 proven. 50058 refuted. 0 times theorem prover too weak. 12384 trivial. 0 not checked. [2018-10-10 16:34:46,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:34:46,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-10-10 16:34:46,962 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-10 16:34:46,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-10 16:34:46,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=772, Invalid=5234, Unknown=0, NotChecked=0, Total=6006 [2018-10-10 16:34:46,963 INFO L87 Difference]: Start difference. First operand 3396 states and 3417 transitions. Second operand 78 states. [2018-10-10 16:34:54,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:34:54,618 INFO L93 Difference]: Finished difference Result 3436 states and 3457 transitions. [2018-10-10 16:34:54,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-10-10 16:34:54,619 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 3395 [2018-10-10 16:34:54,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:34:54,624 INFO L225 Difference]: With dead ends: 3436 [2018-10-10 16:34:54,624 INFO L226 Difference]: Without dead ends: 3436 [2018-10-10 16:34:54,626 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7106 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=5376, Invalid=23354, Unknown=0, NotChecked=0, Total=28730 [2018-10-10 16:34:54,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3436 states. [2018-10-10 16:34:54,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3436 to 3411. [2018-10-10 16:34:54,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3411 states. [2018-10-10 16:34:54,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3411 states to 3411 states and 3432 transitions. [2018-10-10 16:34:54,643 INFO L78 Accepts]: Start accepts. Automaton has 3411 states and 3432 transitions. Word has length 3395 [2018-10-10 16:34:54,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:34:54,645 INFO L481 AbstractCegarLoop]: Abstraction has 3411 states and 3432 transitions. [2018-10-10 16:34:54,645 INFO L482 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-10 16:34:54,645 INFO L276 IsEmpty]: Start isEmpty. Operand 3411 states and 3432 transitions. [2018-10-10 16:34:54,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3411 [2018-10-10 16:34:54,704 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:34:54,705 INFO L375 BasicCegarLoop]: trace histogram [191, 191, 191, 191, 191, 191, 191, 191, 191, 191, 191, 191, 191, 191, 191, 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] [2018-10-10 16:34:54,705 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:34:54,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:34:54,706 INFO L82 PathProgramCache]: Analyzing trace with hash -137271813, now seen corresponding path program 43 times [2018-10-10 16:34:54,707 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:34:55,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat