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/standard_strcpy_false-valid-deref_ground.i_8.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-b8f97f7-m [2018-10-10 16:44:48,933 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 16:44:48,935 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 16:44:48,947 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 16:44:48,948 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 16:44:48,949 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 16:44:48,950 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 16:44:48,953 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 16:44:48,954 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 16:44:48,955 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 16:44:48,956 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 16:44:48,956 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 16:44:48,957 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 16:44:48,959 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 16:44:48,960 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 16:44:48,960 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 16:44:48,961 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 16:44:48,963 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 16:44:48,965 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 16:44:48,967 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 16:44:48,968 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 16:44:48,969 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 16:44:48,972 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 16:44:48,972 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 16:44:48,972 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 16:44:48,973 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 16:44:48,974 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 16:44:48,975 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 16:44:48,976 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 16:44:48,977 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 16:44:48,977 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 16:44:48,978 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 16:44:48,978 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 16:44:48,979 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 16:44:48,980 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 16:44:48,980 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 16:44:48,981 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:44:48,991 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 16:44:48,992 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 16:44:48,992 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-10 16:44:48,993 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-10 16:44:48,993 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-10 16:44:48,993 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-10 16:44:48,994 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 16:44:48,994 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-10 16:44:48,994 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 16:44:48,995 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-10 16:44:48,995 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-10 16:44:48,995 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-10 16:44:48,995 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-10 16:44:48,996 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-10 16:44:48,996 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-10 16:44:49,039 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 16:44:49,057 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 16:44:49,063 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 16:44:49,064 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-10 16:44:49,065 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-10 16:44:49,066 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/standard_strcpy_false-valid-deref_ground.i_8.bpl [2018-10-10 16:44:49,066 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/standard_strcpy_false-valid-deref_ground.i_8.bpl' [2018-10-10 16:44:49,152 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 16:44:49,154 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-10 16:44:49,154 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 16:44:49,154 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 16:44:49,155 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 16:44:49,183 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "standard_strcpy_false-valid-deref_ground.i_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:44:49" (1/1) ... [2018-10-10 16:44:49,185 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "standard_strcpy_false-valid-deref_ground.i_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:44:49" (1/1) ... [2018-10-10 16:44:49,203 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "standard_strcpy_false-valid-deref_ground.i_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:44:49" (1/1) ... [2018-10-10 16:44:49,204 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "standard_strcpy_false-valid-deref_ground.i_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:44:49" (1/1) ... [2018-10-10 16:44:49,214 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "standard_strcpy_false-valid-deref_ground.i_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:44:49" (1/1) ... [2018-10-10 16:44:49,216 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "standard_strcpy_false-valid-deref_ground.i_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:44:49" (1/1) ... [2018-10-10 16:44:49,218 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "standard_strcpy_false-valid-deref_ground.i_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:44:49" (1/1) ... [2018-10-10 16:44:49,226 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 16:44:49,227 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 16:44:49,227 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 16:44:49,228 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 16:44:49,229 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "standard_strcpy_false-valid-deref_ground.i_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:44:49" (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:44:49,304 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-10 16:44:49,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 16:44:49,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 16:44:49,843 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 16:44:49,844 INFO L202 PluginConnector]: Adding new model standard_strcpy_false-valid-deref_ground.i_8.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 04:44:49 BoogieIcfgContainer [2018-10-10 16:44:49,844 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 16:44:49,848 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-10 16:44:49,848 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-10 16:44:49,849 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-10 16:44:49,853 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "standard_strcpy_false-valid-deref_ground.i_8.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 04:44:49" (1/1) ... [2018-10-10 16:44:49,860 INFO L137 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-10-10 16:44:49,861 INFO L138 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-10-10 16:44:49,899 INFO L191 apSepIcfgTransformer]: Heap separator: starting loc-array-style preprocessing [2018-10-10 16:44:49,941 INFO L217 apSepIcfgTransformer]: finished MemlocArrayUpdater [2018-10-10 16:44:49,963 INFO L280 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-10-10 16:44:50,044 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=1) [2018-10-10 16:45:00,013 INFO L315 AbstractInterpreter]: Visited 58 different actions 120 times. Merged at 30 different actions 60 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-10-10 16:45:00,016 INFO L304 apSepIcfgTransformer]: finished equality analysis [2018-10-10 16:45:00,020 INFO L316 apSepIcfgTransformer]: Finished detection of select terms ("array reads") [2018-10-10 16:45:00,031 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_7|) at (assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value;) [2018-10-10 16:45:00,033 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_7|) |v_ULTIMATE.start_read~int_#ptr.offset_5|) at (assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value;) [2018-10-10 16:45:00,038 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_13|) at (assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value;) [2018-10-10 16:45:00,039 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_13|) |v_ULTIMATE.start_read~int_#ptr.offset_9|) at (assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value;) [2018-10-10 16:45:00,082 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select |v_#locv_ULTIMATE.start_write~int_old_#memory_int_2_1_1| |v_ULTIMATE.start_write~int_#ptr.base_6|) at (assume #memory_int == write~int_old_#memory_int[write~int_#ptr.base := write~int_old_#memory_int[write~int_#ptr.base][write~int_#ptr.offset := write~int_#value]];) [2018-10-10 16:45:00,083 INFO L232 HeapPartitionManager]: partitioning result: [2018-10-10 16:45:00,084 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-10 16:45:00,084 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-10 16:45:00,084 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-10 16:45:00,085 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-10 16:45:00,085 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-10 16:45:00,085 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-10 16:45:00,085 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-10 16:45:00,085 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-10 16:45:00,086 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-10 16:45:00,086 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-10 16:45:00,086 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-10 16:45:00,086 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-10 16:45:00,087 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-10 16:45:00,087 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-10 16:45:00,088 INFO L145 ransitionTransformer]: executing heap partitioning transformation [2018-10-10 16:45:00,106 INFO L202 PluginConnector]: Adding new model standard_strcpy_false-valid-deref_ground.i_8.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.10 04:45:00 BasicIcfg [2018-10-10 16:45:00,106 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-10 16:45:00,107 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 16:45:00,108 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 16:45:00,111 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 16:45:00,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "standard_strcpy_false-valid-deref_ground.i_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:44:49" (1/3) ... [2018-10-10 16:45:00,112 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7db8c58a and model type standard_strcpy_false-valid-deref_ground.i_8.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 04:45:00, skipping insertion in model container [2018-10-10 16:45:00,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "standard_strcpy_false-valid-deref_ground.i_8.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 04:44:49" (2/3) ... [2018-10-10 16:45:00,113 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7db8c58a and model type standard_strcpy_false-valid-deref_ground.i_8.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 04:45:00, skipping insertion in model container [2018-10-10 16:45:00,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "standard_strcpy_false-valid-deref_ground.i_8.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.10 04:45:00" (3/3) ... [2018-10-10 16:45:00,114 INFO L112 eAbstractionObserver]: Analyzing ICFG memPartitionedIcfg [2018-10-10 16:45:00,125 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-10 16:45:00,133 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-10 16:45:00,150 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-10 16:45:00,175 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 16:45:00,176 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 16:45:00,177 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 16:45:00,177 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-10 16:45:00,177 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 16:45:00,177 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 16:45:00,177 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 16:45:00,177 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 16:45:00,178 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 16:45:00,191 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2018-10-10 16:45:00,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-10 16:45:00,198 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:45:00,199 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] [2018-10-10 16:45:00,200 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:45:00,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:45:00,206 INFO L82 PathProgramCache]: Analyzing trace with hash 935810993, now seen corresponding path program 1 times [2018-10-10 16:45:00,269 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:45:00,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:45:01,357 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:45:01,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 16:45:01,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-10-10 16:45:01,365 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 16:45:01,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 16:45:01,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-10-10 16:45:01,381 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 12 states. [2018-10-10 16:45:02,189 WARN L178 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-10 16:45:02,513 WARN L178 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-10 16:45:03,107 WARN L178 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-10-10 16:45:03,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:45:03,409 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-10-10 16:45:03,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-10 16:45:03,411 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2018-10-10 16:45:03,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:45:03,422 INFO L225 Difference]: With dead ends: 85 [2018-10-10 16:45:03,422 INFO L226 Difference]: Without dead ends: 85 [2018-10-10 16:45:03,424 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=154, Invalid=398, Unknown=0, NotChecked=0, Total=552 [2018-10-10 16:45:03,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-10 16:45:03,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 59. [2018-10-10 16:45:03,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-10 16:45:03,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-10-10 16:45:03,468 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 30 [2018-10-10 16:45:03,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:45:03,468 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-10-10 16:45:03,469 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 16:45:03,469 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-10-10 16:45:03,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-10 16:45:03,471 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:45:03,471 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:45:03,471 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:45:03,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:45:03,472 INFO L82 PathProgramCache]: Analyzing trace with hash 465255713, now seen corresponding path program 1 times [2018-10-10 16:45:03,473 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:45:03,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:45:04,165 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:45:04,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:45:04,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-10 16:45:04,168 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-10 16:45:04,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-10 16:45:04,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2018-10-10 16:45:04,168 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 15 states. [2018-10-10 16:45:05,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:45:05,477 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-10-10 16:45:05,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-10 16:45:05,477 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 58 [2018-10-10 16:45:05,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:45:05,482 INFO L225 Difference]: With dead ends: 113 [2018-10-10 16:45:05,482 INFO L226 Difference]: Without dead ends: 113 [2018-10-10 16:45:05,484 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=260, Invalid=670, Unknown=0, NotChecked=0, Total=930 [2018-10-10 16:45:05,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-10-10 16:45:05,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 87. [2018-10-10 16:45:05,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-10-10 16:45:05,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-10-10 16:45:05,494 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 58 [2018-10-10 16:45:05,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:45:05,495 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-10-10 16:45:05,495 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-10 16:45:05,495 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-10-10 16:45:05,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-10 16:45:05,498 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:45:05,498 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-10 16:45:05,499 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:45:05,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:45:05,499 INFO L82 PathProgramCache]: Analyzing trace with hash -276194671, now seen corresponding path program 2 times [2018-10-10 16:45:05,500 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:45:05,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:45:05,944 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:45:05,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:45:05,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-10 16:45:05,946 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-10 16:45:05,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-10 16:45:05,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2018-10-10 16:45:05,946 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 16 states. [2018-10-10 16:45:07,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:45:07,224 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-10-10 16:45:07,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-10 16:45:07,225 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 86 [2018-10-10 16:45:07,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:45:07,227 INFO L225 Difference]: With dead ends: 141 [2018-10-10 16:45:07,227 INFO L226 Difference]: Without dead ends: 141 [2018-10-10 16:45:07,228 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=284, Invalid=772, Unknown=0, NotChecked=0, Total=1056 [2018-10-10 16:45:07,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-10-10 16:45:07,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 115. [2018-10-10 16:45:07,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-10-10 16:45:07,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-10-10 16:45:07,240 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 86 [2018-10-10 16:45:07,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:45:07,240 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-10-10 16:45:07,240 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-10 16:45:07,241 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-10-10 16:45:07,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-10-10 16:45:07,244 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:45:07,245 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 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:45:07,245 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:45:07,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:45:07,245 INFO L82 PathProgramCache]: Analyzing trace with hash 994996225, now seen corresponding path program 3 times [2018-10-10 16:45:07,246 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:45:07,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:45:07,838 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:45:07,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:45:07,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-10 16:45:07,839 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-10 16:45:07,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-10 16:45:07,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2018-10-10 16:45:07,840 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 17 states. [2018-10-10 16:45:09,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:45:09,711 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2018-10-10 16:45:09,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-10 16:45:09,712 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 114 [2018-10-10 16:45:09,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:45:09,715 INFO L225 Difference]: With dead ends: 169 [2018-10-10 16:45:09,715 INFO L226 Difference]: Without dead ends: 169 [2018-10-10 16:45:09,716 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=308, Invalid=882, Unknown=0, NotChecked=0, Total=1190 [2018-10-10 16:45:09,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-10-10 16:45:09,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 143. [2018-10-10 16:45:09,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-10-10 16:45:09,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-10-10 16:45:09,726 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 114 [2018-10-10 16:45:09,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:45:09,727 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-10-10 16:45:09,727 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-10 16:45:09,727 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-10-10 16:45:09,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-10 16:45:09,731 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:45:09,731 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:45:09,731 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:45:09,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:45:09,732 INFO L82 PathProgramCache]: Analyzing trace with hash -2061124239, now seen corresponding path program 4 times [2018-10-10 16:45:09,733 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:45:09,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:45:10,911 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:45:10,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:45:10,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-10 16:45:10,912 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-10 16:45:10,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-10 16:45:10,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2018-10-10 16:45:10,913 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 18 states. [2018-10-10 16:45:12,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:45:12,635 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2018-10-10 16:45:12,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-10 16:45:12,646 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 142 [2018-10-10 16:45:12,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:45:12,647 INFO L225 Difference]: With dead ends: 197 [2018-10-10 16:45:12,648 INFO L226 Difference]: Without dead ends: 197 [2018-10-10 16:45:12,649 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=332, Invalid=1000, Unknown=0, NotChecked=0, Total=1332 [2018-10-10 16:45:12,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-10-10 16:45:12,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 171. [2018-10-10 16:45:12,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-10-10 16:45:12,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-10-10 16:45:12,663 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 142 [2018-10-10 16:45:12,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:45:12,664 INFO L481 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-10-10 16:45:12,664 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-10 16:45:12,664 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-10-10 16:45:12,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-10 16:45:12,668 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:45:12,668 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:45:12,668 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:45:12,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:45:12,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1361806049, now seen corresponding path program 5 times [2018-10-10 16:45:12,670 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:45:12,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:45:13,434 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 295 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:45:13,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:45:13,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-10 16:45:13,435 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-10 16:45:13,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-10 16:45:13,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2018-10-10 16:45:13,436 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 19 states. [2018-10-10 16:45:15,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:45:15,439 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2018-10-10 16:45:15,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-10 16:45:15,440 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 170 [2018-10-10 16:45:15,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:45:15,442 INFO L225 Difference]: With dead ends: 225 [2018-10-10 16:45:15,443 INFO L226 Difference]: Without dead ends: 225 [2018-10-10 16:45:15,444 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=356, Invalid=1126, Unknown=0, NotChecked=0, Total=1482 [2018-10-10 16:45:15,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-10-10 16:45:15,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 199. [2018-10-10 16:45:15,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-10-10 16:45:15,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 199 transitions. [2018-10-10 16:45:15,456 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 199 transitions. Word has length 170 [2018-10-10 16:45:15,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:45:15,456 INFO L481 AbstractCegarLoop]: Abstraction has 199 states and 199 transitions. [2018-10-10 16:45:15,456 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-10 16:45:15,456 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 199 transitions. [2018-10-10 16:45:15,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-10-10 16:45:15,460 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:45:15,460 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:45:15,460 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:45:15,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:45:15,461 INFO L82 PathProgramCache]: Analyzing trace with hash 561758289, now seen corresponding path program 6 times [2018-10-10 16:45:15,461 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:45:15,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:45:16,288 INFO L134 CoverageAnalysis]: Checked inductivity of 438 backedges. 0 proven. 438 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:45:16,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:45:16,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-10 16:45:16,289 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-10 16:45:16,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-10 16:45:16,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2018-10-10 16:45:16,290 INFO L87 Difference]: Start difference. First operand 199 states and 199 transitions. Second operand 20 states. [2018-10-10 16:45:18,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:45:18,784 INFO L93 Difference]: Finished difference Result 253 states and 253 transitions. [2018-10-10 16:45:18,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-10 16:45:18,784 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 198 [2018-10-10 16:45:18,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:45:18,786 INFO L225 Difference]: With dead ends: 253 [2018-10-10 16:45:18,786 INFO L226 Difference]: Without dead ends: 253 [2018-10-10 16:45:18,787 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=380, Invalid=1260, Unknown=0, NotChecked=0, Total=1640 [2018-10-10 16:45:18,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-10-10 16:45:18,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 227. [2018-10-10 16:45:18,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-10-10 16:45:18,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2018-10-10 16:45:18,795 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 198 [2018-10-10 16:45:18,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:45:18,795 INFO L481 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2018-10-10 16:45:18,796 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-10 16:45:18,796 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2018-10-10 16:45:18,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-10-10 16:45:18,799 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:45:18,800 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:45:18,800 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:45:18,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:45:18,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1983018433, now seen corresponding path program 7 times [2018-10-10 16:45:18,801 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:45:18,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:45:20,145 INFO L134 CoverageAnalysis]: Checked inductivity of 609 backedges. 0 proven. 609 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:45:20,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:45:20,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-10 16:45:20,146 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-10 16:45:20,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-10 16:45:20,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=364, Unknown=0, NotChecked=0, Total=420 [2018-10-10 16:45:20,147 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 21 states. [2018-10-10 16:45:22,856 WARN L178 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2018-10-10 16:45:23,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:45:23,266 INFO L93 Difference]: Finished difference Result 281 states and 281 transitions. [2018-10-10 16:45:23,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-10 16:45:23,267 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 226 [2018-10-10 16:45:23,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:45:23,269 INFO L225 Difference]: With dead ends: 281 [2018-10-10 16:45:23,269 INFO L226 Difference]: Without dead ends: 281 [2018-10-10 16:45:23,271 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=404, Invalid=1402, Unknown=0, NotChecked=0, Total=1806 [2018-10-10 16:45:23,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-10-10 16:45:23,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 255. [2018-10-10 16:45:23,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-10-10 16:45:23,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 255 transitions. [2018-10-10 16:45:23,277 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 255 transitions. Word has length 226 [2018-10-10 16:45:23,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:45:23,277 INFO L481 AbstractCegarLoop]: Abstraction has 255 states and 255 transitions. [2018-10-10 16:45:23,277 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-10 16:45:23,278 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 255 transitions. [2018-10-10 16:45:23,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-10-10 16:45:23,281 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:45:23,281 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:45:23,282 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:45:23,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:45:23,282 INFO L82 PathProgramCache]: Analyzing trace with hash -848583887, now seen corresponding path program 8 times [2018-10-10 16:45:23,283 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:45:23,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:45:24,285 INFO L134 CoverageAnalysis]: Checked inductivity of 808 backedges. 0 proven. 808 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:45:24,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:45:24,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-10 16:45:24,287 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-10 16:45:24,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-10 16:45:24,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2018-10-10 16:45:24,288 INFO L87 Difference]: Start difference. First operand 255 states and 255 transitions. Second operand 22 states. [2018-10-10 16:45:27,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:45:27,574 INFO L93 Difference]: Finished difference Result 309 states and 309 transitions. [2018-10-10 16:45:27,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-10 16:45:27,580 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 254 [2018-10-10 16:45:27,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:45:27,582 INFO L225 Difference]: With dead ends: 309 [2018-10-10 16:45:27,582 INFO L226 Difference]: Without dead ends: 309 [2018-10-10 16:45:27,583 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=428, Invalid=1552, Unknown=0, NotChecked=0, Total=1980 [2018-10-10 16:45:27,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-10-10 16:45:27,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 283. [2018-10-10 16:45:27,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-10-10 16:45:27,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 283 transitions. [2018-10-10 16:45:27,588 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 283 transitions. Word has length 254 [2018-10-10 16:45:27,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:45:27,588 INFO L481 AbstractCegarLoop]: Abstraction has 283 states and 283 transitions. [2018-10-10 16:45:27,588 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-10 16:45:27,589 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 283 transitions. [2018-10-10 16:45:27,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-10-10 16:45:27,590 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:45:27,591 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:45:27,591 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:45:27,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:45:27,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1555871583, now seen corresponding path program 9 times [2018-10-10 16:45:27,592 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:45:27,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:45:28,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:45:28,695 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:45:28,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-10 16:45:28,695 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-10 16:45:28,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-10 16:45:28,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2018-10-10 16:45:28,696 INFO L87 Difference]: Start difference. First operand 283 states and 283 transitions. Second operand 23 states. [2018-10-10 16:45:32,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:45:32,010 INFO L93 Difference]: Finished difference Result 337 states and 337 transitions. [2018-10-10 16:45:32,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-10 16:45:32,011 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 282 [2018-10-10 16:45:32,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:45:32,012 INFO L225 Difference]: With dead ends: 337 [2018-10-10 16:45:32,012 INFO L226 Difference]: Without dead ends: 337 [2018-10-10 16:45:32,016 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=452, Invalid=1710, Unknown=0, NotChecked=0, Total=2162 [2018-10-10 16:45:32,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-10-10 16:45:32,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 311. [2018-10-10 16:45:32,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-10-10 16:45:32,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 311 transitions. [2018-10-10 16:45:32,021 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 311 transitions. Word has length 282 [2018-10-10 16:45:32,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:45:32,021 INFO L481 AbstractCegarLoop]: Abstraction has 311 states and 311 transitions. [2018-10-10 16:45:32,022 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-10 16:45:32,022 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 311 transitions. [2018-10-10 16:45:32,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-10-10 16:45:32,023 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:45:32,024 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:45:32,024 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:45:32,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:45:32,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1909810705, now seen corresponding path program 10 times [2018-10-10 16:45:32,025 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:45:32,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:45:33,313 INFO L134 CoverageAnalysis]: Checked inductivity of 1290 backedges. 0 proven. 1290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:45:33,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:45:33,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-10 16:45:33,314 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-10 16:45:33,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-10 16:45:33,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2018-10-10 16:45:33,315 INFO L87 Difference]: Start difference. First operand 311 states and 311 transitions. Second operand 24 states. [2018-10-10 16:45:37,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:45:37,111 INFO L93 Difference]: Finished difference Result 365 states and 365 transitions. [2018-10-10 16:45:37,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-10 16:45:37,112 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 310 [2018-10-10 16:45:37,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:45:37,115 INFO L225 Difference]: With dead ends: 365 [2018-10-10 16:45:37,115 INFO L226 Difference]: Without dead ends: 365 [2018-10-10 16:45:37,117 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=476, Invalid=1876, Unknown=0, NotChecked=0, Total=2352 [2018-10-10 16:45:37,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-10-10 16:45:37,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 339. [2018-10-10 16:45:37,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-10-10 16:45:37,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 339 transitions. [2018-10-10 16:45:37,123 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 339 transitions. Word has length 310 [2018-10-10 16:45:37,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:45:37,124 INFO L481 AbstractCegarLoop]: Abstraction has 339 states and 339 transitions. [2018-10-10 16:45:37,124 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-10 16:45:37,124 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 339 transitions. [2018-10-10 16:45:37,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2018-10-10 16:45:37,126 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:45:37,126 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:45:37,127 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:45:37,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:45:37,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1321337983, now seen corresponding path program 11 times [2018-10-10 16:45:37,128 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:45:37,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:45:38,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1573 backedges. 0 proven. 1573 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:45:38,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:45:38,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-10 16:45:38,253 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-10 16:45:38,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-10 16:45:38,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2018-10-10 16:45:38,256 INFO L87 Difference]: Start difference. First operand 339 states and 339 transitions. Second operand 25 states. [2018-10-10 16:45:38,564 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-10 16:45:42,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:45:42,741 INFO L93 Difference]: Finished difference Result 393 states and 393 transitions. [2018-10-10 16:45:42,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-10 16:45:42,742 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 338 [2018-10-10 16:45:42,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:45:42,745 INFO L225 Difference]: With dead ends: 393 [2018-10-10 16:45:42,745 INFO L226 Difference]: Without dead ends: 393 [2018-10-10 16:45:42,746 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 410 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=500, Invalid=2050, Unknown=0, NotChecked=0, Total=2550 [2018-10-10 16:45:42,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2018-10-10 16:45:42,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 367. [2018-10-10 16:45:42,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 367 states. [2018-10-10 16:45:42,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 367 transitions. [2018-10-10 16:45:42,752 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 367 transitions. Word has length 338 [2018-10-10 16:45:42,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:45:42,753 INFO L481 AbstractCegarLoop]: Abstraction has 367 states and 367 transitions. [2018-10-10 16:45:42,753 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-10 16:45:42,753 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 367 transitions. [2018-10-10 16:45:42,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2018-10-10 16:45:42,755 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:45:42,755 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:45:42,756 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:45:42,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:45:42,756 INFO L82 PathProgramCache]: Analyzing trace with hash -677836559, now seen corresponding path program 12 times [2018-10-10 16:45:42,757 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:45:42,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:45:43,972 INFO L134 CoverageAnalysis]: Checked inductivity of 1884 backedges. 0 proven. 1884 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:45:43,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:45:43,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-10 16:45:43,973 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-10 16:45:43,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-10 16:45:43,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=579, Unknown=0, NotChecked=0, Total=650 [2018-10-10 16:45:43,974 INFO L87 Difference]: Start difference. First operand 367 states and 367 transitions. Second operand 26 states. [2018-10-10 16:45:48,716 WARN L178 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2018-10-10 16:45:49,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:45:49,124 INFO L93 Difference]: Finished difference Result 421 states and 421 transitions. [2018-10-10 16:45:49,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-10 16:45:49,131 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 366 [2018-10-10 16:45:49,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:45:49,133 INFO L225 Difference]: With dead ends: 421 [2018-10-10 16:45:49,133 INFO L226 Difference]: Without dead ends: 421 [2018-10-10 16:45:49,134 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=524, Invalid=2232, Unknown=0, NotChecked=0, Total=2756 [2018-10-10 16:45:49,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2018-10-10 16:45:49,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 395. [2018-10-10 16:45:49,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-10-10 16:45:49,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 395 transitions. [2018-10-10 16:45:49,141 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 395 transitions. Word has length 366 [2018-10-10 16:45:49,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:45:49,142 INFO L481 AbstractCegarLoop]: Abstraction has 395 states and 395 transitions. [2018-10-10 16:45:49,142 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-10 16:45:49,142 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 395 transitions. [2018-10-10 16:45:49,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2018-10-10 16:45:49,145 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:45:49,146 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:45:49,146 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:45:49,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:45:49,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1493339745, now seen corresponding path program 13 times [2018-10-10 16:45:49,147 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:45:49,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:45:50,602 INFO L134 CoverageAnalysis]: Checked inductivity of 2223 backedges. 0 proven. 2223 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:45:50,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:45:50,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-10 16:45:50,603 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-10 16:45:50,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-10 16:45:50,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=628, Unknown=0, NotChecked=0, Total=702 [2018-10-10 16:45:50,604 INFO L87 Difference]: Start difference. First operand 395 states and 395 transitions. Second operand 27 states. [2018-10-10 16:45:56,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:45:56,452 INFO L93 Difference]: Finished difference Result 449 states and 449 transitions. [2018-10-10 16:45:56,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-10 16:45:56,453 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 394 [2018-10-10 16:45:56,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:45:56,455 INFO L225 Difference]: With dead ends: 449 [2018-10-10 16:45:56,455 INFO L226 Difference]: Without dead ends: 449 [2018-10-10 16:45:56,456 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=548, Invalid=2422, Unknown=0, NotChecked=0, Total=2970 [2018-10-10 16:45:56,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2018-10-10 16:45:56,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 423. [2018-10-10 16:45:56,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-10-10 16:45:56,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 423 transitions. [2018-10-10 16:45:56,462 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 423 transitions. Word has length 394 [2018-10-10 16:45:56,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:45:56,463 INFO L481 AbstractCegarLoop]: Abstraction has 423 states and 423 transitions. [2018-10-10 16:45:56,463 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-10 16:45:56,463 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 423 transitions. [2018-10-10 16:45:56,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2018-10-10 16:45:56,466 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:45:56,466 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:45:56,467 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:45:56,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:45:56,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1483306031, now seen corresponding path program 14 times [2018-10-10 16:45:56,468 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:45:56,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:45:58,434 INFO L134 CoverageAnalysis]: Checked inductivity of 2590 backedges. 0 proven. 2590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:45:58,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:45:58,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-10 16:45:58,435 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-10 16:45:58,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-10 16:45:58,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=679, Unknown=0, NotChecked=0, Total=756 [2018-10-10 16:45:58,436 INFO L87 Difference]: Start difference. First operand 423 states and 423 transitions. Second operand 28 states. [2018-10-10 16:46:04,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:46:04,371 INFO L93 Difference]: Finished difference Result 477 states and 477 transitions. [2018-10-10 16:46:04,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-10 16:46:04,371 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 422 [2018-10-10 16:46:04,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:46:04,374 INFO L225 Difference]: With dead ends: 477 [2018-10-10 16:46:04,375 INFO L226 Difference]: Without dead ends: 477 [2018-10-10 16:46:04,376 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=572, Invalid=2620, Unknown=0, NotChecked=0, Total=3192 [2018-10-10 16:46:04,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2018-10-10 16:46:04,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 451. [2018-10-10 16:46:04,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 451 states. [2018-10-10 16:46:04,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 451 transitions. [2018-10-10 16:46:04,383 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 451 transitions. Word has length 422 [2018-10-10 16:46:04,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:46:04,383 INFO L481 AbstractCegarLoop]: Abstraction has 451 states and 451 transitions. [2018-10-10 16:46:04,384 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-10 16:46:04,384 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 451 transitions. [2018-10-10 16:46:04,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 451 [2018-10-10 16:46:04,386 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:46:04,387 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:46:04,387 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:46:04,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:46:04,387 INFO L82 PathProgramCache]: Analyzing trace with hash 863043905, now seen corresponding path program 15 times [2018-10-10 16:46:04,388 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:46:04,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:46:04,936 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-10 16:46:05,692 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-10 16:46:07,221 INFO L134 CoverageAnalysis]: Checked inductivity of 2985 backedges. 0 proven. 2985 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:46:07,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:46:07,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-10 16:46:07,222 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-10 16:46:07,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-10 16:46:07,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=732, Unknown=0, NotChecked=0, Total=812 [2018-10-10 16:46:07,223 INFO L87 Difference]: Start difference. First operand 451 states and 451 transitions. Second operand 29 states. [2018-10-10 16:46:13,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:46:13,734 INFO L93 Difference]: Finished difference Result 505 states and 505 transitions. [2018-10-10 16:46:13,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-10 16:46:13,734 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 450 [2018-10-10 16:46:13,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:46:13,738 INFO L225 Difference]: With dead ends: 505 [2018-10-10 16:46:13,738 INFO L226 Difference]: Without dead ends: 505 [2018-10-10 16:46:13,740 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=596, Invalid=2826, Unknown=0, NotChecked=0, Total=3422 [2018-10-10 16:46:13,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2018-10-10 16:46:13,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 479. [2018-10-10 16:46:13,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2018-10-10 16:46:13,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 479 transitions. [2018-10-10 16:46:13,747 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 479 transitions. Word has length 450 [2018-10-10 16:46:13,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:46:13,748 INFO L481 AbstractCegarLoop]: Abstraction has 479 states and 479 transitions. [2018-10-10 16:46:13,748 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-10 16:46:13,748 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 479 transitions. [2018-10-10 16:46:13,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2018-10-10 16:46:13,751 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:46:13,751 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:46:13,752 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:46:13,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:46:13,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1789783729, now seen corresponding path program 16 times [2018-10-10 16:46:13,753 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:46:13,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:46:14,463 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-10 16:46:16,277 INFO L134 CoverageAnalysis]: Checked inductivity of 3408 backedges. 0 proven. 3408 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:46:16,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:46:16,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-10 16:46:16,278 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-10 16:46:16,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-10 16:46:16,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=787, Unknown=0, NotChecked=0, Total=870 [2018-10-10 16:46:16,278 INFO L87 Difference]: Start difference. First operand 479 states and 479 transitions. Second operand 30 states. [2018-10-10 16:46:16,740 WARN L178 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-10-10 16:46:23,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:46:23,563 INFO L93 Difference]: Finished difference Result 533 states and 533 transitions. [2018-10-10 16:46:23,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-10 16:46:23,563 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 478 [2018-10-10 16:46:23,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:46:23,566 INFO L225 Difference]: With dead ends: 533 [2018-10-10 16:46:23,566 INFO L226 Difference]: Without dead ends: 533 [2018-10-10 16:46:23,567 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 585 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=620, Invalid=3040, Unknown=0, NotChecked=0, Total=3660 [2018-10-10 16:46:23,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2018-10-10 16:46:23,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 507. [2018-10-10 16:46:23,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 507 states. [2018-10-10 16:46:23,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 507 transitions. [2018-10-10 16:46:23,574 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 507 transitions. Word has length 478 [2018-10-10 16:46:23,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:46:23,575 INFO L481 AbstractCegarLoop]: Abstraction has 507 states and 507 transitions. [2018-10-10 16:46:23,575 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-10 16:46:23,575 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 507 transitions. [2018-10-10 16:46:23,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 507 [2018-10-10 16:46:23,578 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:46:23,579 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:46:23,579 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:46:23,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:46:23,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1184279519, now seen corresponding path program 17 times [2018-10-10 16:46:23,580 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:46:23,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:46:26,101 INFO L134 CoverageAnalysis]: Checked inductivity of 3859 backedges. 0 proven. 3859 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:46:26,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:46:26,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-10 16:46:26,102 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-10 16:46:26,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-10 16:46:26,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=844, Unknown=0, NotChecked=0, Total=930 [2018-10-10 16:46:26,102 INFO L87 Difference]: Start difference. First operand 507 states and 507 transitions. Second operand 31 states. [2018-10-10 16:46:26,657 WARN L178 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-10-10 16:46:30,266 WARN L178 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 38 [2018-10-10 16:46:34,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:46:34,265 INFO L93 Difference]: Finished difference Result 561 states and 561 transitions. [2018-10-10 16:46:34,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-10 16:46:34,265 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 506 [2018-10-10 16:46:34,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:46:34,268 INFO L225 Difference]: With dead ends: 561 [2018-10-10 16:46:34,269 INFO L226 Difference]: Without dead ends: 561 [2018-10-10 16:46:34,270 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 623 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=644, Invalid=3262, Unknown=0, NotChecked=0, Total=3906 [2018-10-10 16:46:34,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2018-10-10 16:46:34,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 535. [2018-10-10 16:46:34,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2018-10-10 16:46:34,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 535 transitions. [2018-10-10 16:46:34,277 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 535 transitions. Word has length 506 [2018-10-10 16:46:34,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:46:34,278 INFO L481 AbstractCegarLoop]: Abstraction has 535 states and 535 transitions. [2018-10-10 16:46:34,278 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-10 16:46:34,278 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 535 transitions. [2018-10-10 16:46:34,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 535 [2018-10-10 16:46:34,282 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:46:34,282 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:46:34,282 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:46:34,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:46:34,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1983958639, now seen corresponding path program 18 times [2018-10-10 16:46:34,283 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:46:34,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:46:34,863 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-10 16:46:36,943 INFO L134 CoverageAnalysis]: Checked inductivity of 4338 backedges. 0 proven. 4338 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:46:36,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:46:36,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-10 16:46:36,944 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-10 16:46:36,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-10 16:46:36,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=903, Unknown=0, NotChecked=0, Total=992 [2018-10-10 16:46:36,945 INFO L87 Difference]: Start difference. First operand 535 states and 535 transitions. Second operand 32 states. [2018-10-10 16:46:45,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:46:45,442 INFO L93 Difference]: Finished difference Result 589 states and 589 transitions. [2018-10-10 16:46:45,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-10 16:46:45,443 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 534 [2018-10-10 16:46:45,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:46:45,445 INFO L225 Difference]: With dead ends: 589 [2018-10-10 16:46:45,445 INFO L226 Difference]: Without dead ends: 589 [2018-10-10 16:46:45,447 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 662 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=668, Invalid=3492, Unknown=0, NotChecked=0, Total=4160 [2018-10-10 16:46:45,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2018-10-10 16:46:45,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 563. [2018-10-10 16:46:45,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2018-10-10 16:46:45,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 563 transitions. [2018-10-10 16:46:45,453 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 563 transitions. Word has length 534 [2018-10-10 16:46:45,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:46:45,454 INFO L481 AbstractCegarLoop]: Abstraction has 563 states and 563 transitions. [2018-10-10 16:46:45,454 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-10 16:46:45,454 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 563 transitions. [2018-10-10 16:46:45,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 563 [2018-10-10 16:46:45,458 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:46:45,458 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:46:45,459 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:46:45,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:46:45,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1137411841, now seen corresponding path program 19 times [2018-10-10 16:46:45,460 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:46:45,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:46:47,761 INFO L134 CoverageAnalysis]: Checked inductivity of 4845 backedges. 0 proven. 4845 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:46:47,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:46:47,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-10 16:46:47,762 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-10 16:46:47,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-10 16:46:47,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=964, Unknown=0, NotChecked=0, Total=1056 [2018-10-10 16:46:47,763 INFO L87 Difference]: Start difference. First operand 563 states and 563 transitions. Second operand 33 states. [2018-10-10 16:46:56,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:46:56,909 INFO L93 Difference]: Finished difference Result 617 states and 617 transitions. [2018-10-10 16:46:56,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-10 16:46:56,910 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 562 [2018-10-10 16:46:56,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:46:56,913 INFO L225 Difference]: With dead ends: 617 [2018-10-10 16:46:56,913 INFO L226 Difference]: Without dead ends: 617 [2018-10-10 16:46:56,914 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 702 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=692, Invalid=3730, Unknown=0, NotChecked=0, Total=4422 [2018-10-10 16:46:56,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2018-10-10 16:46:56,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 591. [2018-10-10 16:46:56,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2018-10-10 16:46:56,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 591 transitions. [2018-10-10 16:46:56,922 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 591 transitions. Word has length 562 [2018-10-10 16:46:56,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:46:56,922 INFO L481 AbstractCegarLoop]: Abstraction has 591 states and 591 transitions. [2018-10-10 16:46:56,922 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-10 16:46:56,923 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 591 transitions. [2018-10-10 16:46:56,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 591 [2018-10-10 16:46:56,927 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:46:56,927 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:46:56,927 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:46:56,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:46:56,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1303008369, now seen corresponding path program 20 times [2018-10-10 16:46:56,929 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:46:56,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:47:00,077 INFO L134 CoverageAnalysis]: Checked inductivity of 5380 backedges. 0 proven. 5380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:47:00,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:47:00,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-10 16:47:00,078 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-10 16:47:00,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-10 16:47:00,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1027, Unknown=0, NotChecked=0, Total=1122 [2018-10-10 16:47:00,080 INFO L87 Difference]: Start difference. First operand 591 states and 591 transitions. Second operand 34 states. [2018-10-10 16:47:09,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:47:09,977 INFO L93 Difference]: Finished difference Result 645 states and 645 transitions. [2018-10-10 16:47:09,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-10 16:47:09,977 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 590 [2018-10-10 16:47:09,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:47:09,980 INFO L225 Difference]: With dead ends: 645 [2018-10-10 16:47:09,980 INFO L226 Difference]: Without dead ends: 645 [2018-10-10 16:47:09,982 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 743 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=716, Invalid=3976, Unknown=0, NotChecked=0, Total=4692 [2018-10-10 16:47:09,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2018-10-10 16:47:09,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 619. [2018-10-10 16:47:09,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 619 states. [2018-10-10 16:47:09,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 619 transitions. [2018-10-10 16:47:09,989 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 619 transitions. Word has length 590 [2018-10-10 16:47:09,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:47:09,990 INFO L481 AbstractCegarLoop]: Abstraction has 619 states and 619 transitions. [2018-10-10 16:47:09,990 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-10 16:47:09,990 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 619 transitions. [2018-10-10 16:47:09,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 619 [2018-10-10 16:47:09,995 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:47:09,995 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:47:09,996 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:47:09,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:47:09,996 INFO L82 PathProgramCache]: Analyzing trace with hash 192387553, now seen corresponding path program 21 times [2018-10-10 16:47:09,997 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:47:10,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:47:12,408 INFO L134 CoverageAnalysis]: Checked inductivity of 5943 backedges. 0 proven. 5943 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:47:12,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:47:12,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-10 16:47:12,409 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-10 16:47:12,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-10 16:47:12,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=1092, Unknown=0, NotChecked=0, Total=1190 [2018-10-10 16:47:12,410 INFO L87 Difference]: Start difference. First operand 619 states and 619 transitions. Second operand 35 states. [2018-10-10 16:47:23,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:47:23,114 INFO L93 Difference]: Finished difference Result 673 states and 673 transitions. [2018-10-10 16:47:23,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-10 16:47:23,115 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 618 [2018-10-10 16:47:23,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:47:23,118 INFO L225 Difference]: With dead ends: 673 [2018-10-10 16:47:23,118 INFO L226 Difference]: Without dead ends: 673 [2018-10-10 16:47:23,120 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 785 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=740, Invalid=4230, Unknown=0, NotChecked=0, Total=4970 [2018-10-10 16:47:23,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2018-10-10 16:47:23,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 647. [2018-10-10 16:47:23,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2018-10-10 16:47:23,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 647 transitions. [2018-10-10 16:47:23,127 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 647 transitions. Word has length 618 [2018-10-10 16:47:23,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:47:23,127 INFO L481 AbstractCegarLoop]: Abstraction has 647 states and 647 transitions. [2018-10-10 16:47:23,128 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-10 16:47:23,128 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 647 transitions. [2018-10-10 16:47:23,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 647 [2018-10-10 16:47:23,132 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:47:23,133 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:47:23,133 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:47:23,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:47:23,133 INFO L82 PathProgramCache]: Analyzing trace with hash -548448431, now seen corresponding path program 22 times [2018-10-10 16:47:23,134 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:47:23,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:47:26,009 INFO L134 CoverageAnalysis]: Checked inductivity of 6534 backedges. 0 proven. 6534 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:47:26,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:47:26,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-10 16:47:26,010 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-10 16:47:26,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-10 16:47:26,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1159, Unknown=0, NotChecked=0, Total=1260 [2018-10-10 16:47:26,011 INFO L87 Difference]: Start difference. First operand 647 states and 647 transitions. Second operand 36 states. [2018-10-10 16:47:37,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:47:37,509 INFO L93 Difference]: Finished difference Result 701 states and 701 transitions. [2018-10-10 16:47:37,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-10 16:47:37,510 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 646 [2018-10-10 16:47:37,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:47:37,512 INFO L225 Difference]: With dead ends: 701 [2018-10-10 16:47:37,512 INFO L226 Difference]: Without dead ends: 701 [2018-10-10 16:47:37,513 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 828 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=764, Invalid=4492, Unknown=0, NotChecked=0, Total=5256 [2018-10-10 16:47:37,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2018-10-10 16:47:37,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 675. [2018-10-10 16:47:37,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 675 states. [2018-10-10 16:47:37,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 675 transitions. [2018-10-10 16:47:37,520 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 675 transitions. Word has length 646 [2018-10-10 16:47:37,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:47:37,521 INFO L481 AbstractCegarLoop]: Abstraction has 675 states and 675 transitions. [2018-10-10 16:47:37,521 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-10 16:47:37,521 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 675 transitions. [2018-10-10 16:47:37,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 675 [2018-10-10 16:47:37,526 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:47:37,526 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:47:37,526 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:47:37,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:47:37,527 INFO L82 PathProgramCache]: Analyzing trace with hash 692948161, now seen corresponding path program 23 times [2018-10-10 16:47:37,527 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:47:37,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:47:40,463 INFO L134 CoverageAnalysis]: Checked inductivity of 7153 backedges. 0 proven. 7153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:47:40,464 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:47:40,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-10 16:47:40,465 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-10 16:47:40,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-10 16:47:40,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=1228, Unknown=0, NotChecked=0, Total=1332 [2018-10-10 16:47:40,465 INFO L87 Difference]: Start difference. First operand 675 states and 675 transitions. Second operand 37 states. [2018-10-10 16:47:52,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:47:52,560 INFO L93 Difference]: Finished difference Result 729 states and 729 transitions. [2018-10-10 16:47:52,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-10 16:47:52,560 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 674 [2018-10-10 16:47:52,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:47:52,563 INFO L225 Difference]: With dead ends: 729 [2018-10-10 16:47:52,563 INFO L226 Difference]: Without dead ends: 729 [2018-10-10 16:47:52,563 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 872 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=788, Invalid=4762, Unknown=0, NotChecked=0, Total=5550 [2018-10-10 16:47:52,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2018-10-10 16:47:52,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 703. [2018-10-10 16:47:52,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 703 states. [2018-10-10 16:47:52,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 703 transitions. [2018-10-10 16:47:52,571 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 703 transitions. Word has length 674 [2018-10-10 16:47:52,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:47:52,572 INFO L481 AbstractCegarLoop]: Abstraction has 703 states and 703 transitions. [2018-10-10 16:47:52,572 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-10 16:47:52,572 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 703 transitions. [2018-10-10 16:47:52,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 703 [2018-10-10 16:47:52,577 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:47:52,577 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:47:52,578 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:47:52,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:47:52,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1200503345, now seen corresponding path program 24 times [2018-10-10 16:47:52,579 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:47:52,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:47:55,507 INFO L134 CoverageAnalysis]: Checked inductivity of 7800 backedges. 0 proven. 7800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:47:55,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:47:55,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-10 16:47:55,508 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-10 16:47:55,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-10 16:47:55,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1299, Unknown=0, NotChecked=0, Total=1406 [2018-10-10 16:47:55,509 INFO L87 Difference]: Start difference. First operand 703 states and 703 transitions. Second operand 38 states. [2018-10-10 16:48:08,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:48:08,348 INFO L93 Difference]: Finished difference Result 757 states and 757 transitions. [2018-10-10 16:48:08,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-10 16:48:08,349 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 702 [2018-10-10 16:48:08,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:48:08,351 INFO L225 Difference]: With dead ends: 757 [2018-10-10 16:48:08,351 INFO L226 Difference]: Without dead ends: 757 [2018-10-10 16:48:08,352 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 917 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=812, Invalid=5040, Unknown=0, NotChecked=0, Total=5852 [2018-10-10 16:48:08,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2018-10-10 16:48:08,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 731. [2018-10-10 16:48:08,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2018-10-10 16:48:08,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 731 transitions. [2018-10-10 16:48:08,358 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 731 transitions. Word has length 702 [2018-10-10 16:48:08,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:48:08,359 INFO L481 AbstractCegarLoop]: Abstraction has 731 states and 731 transitions. [2018-10-10 16:48:08,359 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-10 16:48:08,359 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 731 transitions. [2018-10-10 16:48:08,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 731 [2018-10-10 16:48:08,364 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:48:08,364 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:48:08,365 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:48:08,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:48:08,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1775411295, now seen corresponding path program 25 times [2018-10-10 16:48:08,366 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:48:08,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:48:11,565 INFO L134 CoverageAnalysis]: Checked inductivity of 8475 backedges. 0 proven. 8475 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:48:11,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:48:11,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-10 16:48:11,567 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-10 16:48:11,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-10 16:48:11,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=1372, Unknown=0, NotChecked=0, Total=1482 [2018-10-10 16:48:11,567 INFO L87 Difference]: Start difference. First operand 731 states and 731 transitions. Second operand 39 states. [2018-10-10 16:48:26,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:48:26,336 INFO L93 Difference]: Finished difference Result 785 states and 785 transitions. [2018-10-10 16:48:26,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-10 16:48:26,337 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 730 [2018-10-10 16:48:26,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:48:26,340 INFO L225 Difference]: With dead ends: 785 [2018-10-10 16:48:26,340 INFO L226 Difference]: Without dead ends: 785 [2018-10-10 16:48:26,341 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 963 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=836, Invalid=5326, Unknown=0, NotChecked=0, Total=6162 [2018-10-10 16:48:26,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2018-10-10 16:48:26,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 759. [2018-10-10 16:48:26,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2018-10-10 16:48:26,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 759 transitions. [2018-10-10 16:48:26,349 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 759 transitions. Word has length 730 [2018-10-10 16:48:26,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:48:26,350 INFO L481 AbstractCegarLoop]: Abstraction has 759 states and 759 transitions. [2018-10-10 16:48:26,350 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-10 16:48:26,350 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 759 transitions. [2018-10-10 16:48:26,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 759 [2018-10-10 16:48:26,355 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:48:26,356 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:48:26,356 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:48:26,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:48:26,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1866923281, now seen corresponding path program 26 times [2018-10-10 16:48:26,357 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:48:26,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:48:30,190 INFO L134 CoverageAnalysis]: Checked inductivity of 9178 backedges. 0 proven. 9178 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:48:30,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:48:30,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-10 16:48:30,191 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-10 16:48:30,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-10 16:48:30,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1447, Unknown=0, NotChecked=0, Total=1560 [2018-10-10 16:48:30,192 INFO L87 Difference]: Start difference. First operand 759 states and 759 transitions. Second operand 40 states. [2018-10-10 16:48:45,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:48:45,357 INFO L93 Difference]: Finished difference Result 813 states and 813 transitions. [2018-10-10 16:48:45,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-10 16:48:45,357 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 758 [2018-10-10 16:48:45,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:48:45,361 INFO L225 Difference]: With dead ends: 813 [2018-10-10 16:48:45,361 INFO L226 Difference]: Without dead ends: 813 [2018-10-10 16:48:45,362 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1010 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=860, Invalid=5620, Unknown=0, NotChecked=0, Total=6480 [2018-10-10 16:48:45,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 813 states. [2018-10-10 16:48:45,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 813 to 787. [2018-10-10 16:48:45,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2018-10-10 16:48:45,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 787 transitions. [2018-10-10 16:48:45,370 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 787 transitions. Word has length 758 [2018-10-10 16:48:45,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:48:45,370 INFO L481 AbstractCegarLoop]: Abstraction has 787 states and 787 transitions. [2018-10-10 16:48:45,371 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-10 16:48:45,371 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 787 transitions. [2018-10-10 16:48:45,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 787 [2018-10-10 16:48:45,377 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:48:45,377 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:48:45,378 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:48:45,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:48:45,378 INFO L82 PathProgramCache]: Analyzing trace with hash 720835201, now seen corresponding path program 27 times [2018-10-10 16:48:45,379 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:48:45,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:48:46,185 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-10 16:48:49,381 INFO L134 CoverageAnalysis]: Checked inductivity of 9909 backedges. 0 proven. 9909 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:48:49,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:48:49,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-10 16:48:49,382 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-10 16:48:49,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-10 16:48:49,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1524, Unknown=0, NotChecked=0, Total=1640 [2018-10-10 16:48:49,383 INFO L87 Difference]: Start difference. First operand 787 states and 787 transitions. Second operand 41 states. [2018-10-10 16:49:04,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:49:04,930 INFO L93 Difference]: Finished difference Result 841 states and 841 transitions. [2018-10-10 16:49:04,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-10 16:49:04,930 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 786 [2018-10-10 16:49:04,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:49:04,933 INFO L225 Difference]: With dead ends: 841 [2018-10-10 16:49:04,933 INFO L226 Difference]: Without dead ends: 841 [2018-10-10 16:49:04,935 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1058 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=884, Invalid=5922, Unknown=0, NotChecked=0, Total=6806 [2018-10-10 16:49:04,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2018-10-10 16:49:04,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 815. [2018-10-10 16:49:04,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 815 states. [2018-10-10 16:49:04,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 815 transitions. [2018-10-10 16:49:04,943 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 815 transitions. Word has length 786 [2018-10-10 16:49:04,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:49:04,943 INFO L481 AbstractCegarLoop]: Abstraction has 815 states and 815 transitions. [2018-10-10 16:49:04,943 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-10 16:49:04,943 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 815 transitions. [2018-10-10 16:49:04,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 815 [2018-10-10 16:49:04,950 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:49:04,950 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:49:04,950 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:49:04,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:49:04,951 INFO L82 PathProgramCache]: Analyzing trace with hash 525967345, now seen corresponding path program 28 times [2018-10-10 16:49:04,951 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:49:05,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:49:08,585 INFO L134 CoverageAnalysis]: Checked inductivity of 10668 backedges. 0 proven. 10668 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:49:08,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:49:08,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-10 16:49:08,587 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-10 16:49:08,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-10 16:49:08,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1603, Unknown=0, NotChecked=0, Total=1722 [2018-10-10 16:49:08,587 INFO L87 Difference]: Start difference. First operand 815 states and 815 transitions. Second operand 42 states. [2018-10-10 16:49:25,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:49:25,141 INFO L93 Difference]: Finished difference Result 869 states and 869 transitions. [2018-10-10 16:49:25,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-10 16:49:25,141 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 814 [2018-10-10 16:49:25,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:49:25,144 INFO L225 Difference]: With dead ends: 869 [2018-10-10 16:49:25,144 INFO L226 Difference]: Without dead ends: 869 [2018-10-10 16:49:25,144 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1107 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=908, Invalid=6232, Unknown=0, NotChecked=0, Total=7140 [2018-10-10 16:49:25,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2018-10-10 16:49:25,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 843. [2018-10-10 16:49:25,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 843 states. [2018-10-10 16:49:25,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 843 states to 843 states and 843 transitions. [2018-10-10 16:49:25,152 INFO L78 Accepts]: Start accepts. Automaton has 843 states and 843 transitions. Word has length 814 [2018-10-10 16:49:25,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:49:25,152 INFO L481 AbstractCegarLoop]: Abstraction has 843 states and 843 transitions. [2018-10-10 16:49:25,153 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-10 16:49:25,153 INFO L276 IsEmpty]: Start isEmpty. Operand 843 states and 843 transitions. [2018-10-10 16:49:25,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 843 [2018-10-10 16:49:25,162 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:49:25,163 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:49:25,163 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:49:25,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:49:25,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1601526431, now seen corresponding path program 29 times [2018-10-10 16:49:25,164 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:49:25,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:49:28,892 INFO L134 CoverageAnalysis]: Checked inductivity of 11455 backedges. 0 proven. 11455 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:49:28,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:49:28,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-10 16:49:28,894 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-10 16:49:28,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-10 16:49:28,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1684, Unknown=0, NotChecked=0, Total=1806 [2018-10-10 16:49:28,895 INFO L87 Difference]: Start difference. First operand 843 states and 843 transitions. Second operand 43 states. [2018-10-10 16:49:46,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:49:46,224 INFO L93 Difference]: Finished difference Result 897 states and 897 transitions. [2018-10-10 16:49:46,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-10 16:49:46,225 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 842 [2018-10-10 16:49:46,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:49:46,228 INFO L225 Difference]: With dead ends: 897 [2018-10-10 16:49:46,228 INFO L226 Difference]: Without dead ends: 897 [2018-10-10 16:49:46,229 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1157 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=932, Invalid=6550, Unknown=0, NotChecked=0, Total=7482 [2018-10-10 16:49:46,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2018-10-10 16:49:46,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 871. [2018-10-10 16:49:46,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 871 states. [2018-10-10 16:49:46,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 871 transitions. [2018-10-10 16:49:46,236 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 871 transitions. Word has length 842 [2018-10-10 16:49:46,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:49:46,237 INFO L481 AbstractCegarLoop]: Abstraction has 871 states and 871 transitions. [2018-10-10 16:49:46,237 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-10 16:49:46,237 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 871 transitions. [2018-10-10 16:49:46,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 871 [2018-10-10 16:49:46,243 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:49:46,244 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:49:46,244 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:49:46,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:49:46,244 INFO L82 PathProgramCache]: Analyzing trace with hash 10887889, now seen corresponding path program 30 times [2018-10-10 16:49:46,245 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:49:46,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:49:47,137 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-10 16:49:51,268 INFO L134 CoverageAnalysis]: Checked inductivity of 12270 backedges. 0 proven. 12270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:49:51,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:49:51,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-10 16:49:51,269 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-10 16:49:51,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-10 16:49:51,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1767, Unknown=0, NotChecked=0, Total=1892 [2018-10-10 16:49:51,270 INFO L87 Difference]: Start difference. First operand 871 states and 871 transitions. Second operand 44 states. [2018-10-10 16:50:09,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:50:09,561 INFO L93 Difference]: Finished difference Result 925 states and 925 transitions. [2018-10-10 16:50:09,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-10 16:50:09,561 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 870 [2018-10-10 16:50:09,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:50:09,564 INFO L225 Difference]: With dead ends: 925 [2018-10-10 16:50:09,564 INFO L226 Difference]: Without dead ends: 925 [2018-10-10 16:50:09,564 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1208 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=956, Invalid=6876, Unknown=0, NotChecked=0, Total=7832 [2018-10-10 16:50:09,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2018-10-10 16:50:09,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 899. [2018-10-10 16:50:09,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 899 states. [2018-10-10 16:50:09,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 899 transitions. [2018-10-10 16:50:09,572 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 899 transitions. Word has length 870 [2018-10-10 16:50:09,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:50:09,572 INFO L481 AbstractCegarLoop]: Abstraction has 899 states and 899 transitions. [2018-10-10 16:50:09,573 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-10 16:50:09,573 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 899 transitions. [2018-10-10 16:50:09,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 899 [2018-10-10 16:50:09,578 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:50:09,579 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:50:09,579 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:50:09,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:50:09,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1882711999, now seen corresponding path program 31 times [2018-10-10 16:50:09,580 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:50:09,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:50:13,900 INFO L134 CoverageAnalysis]: Checked inductivity of 13113 backedges. 0 proven. 13113 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:50:13,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:50:13,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-10 16:50:13,902 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-10 16:50:13,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-10 16:50:13,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1852, Unknown=0, NotChecked=0, Total=1980 [2018-10-10 16:50:13,902 INFO L87 Difference]: Start difference. First operand 899 states and 899 transitions. Second operand 45 states. [2018-10-10 16:50:33,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:50:33,284 INFO L93 Difference]: Finished difference Result 953 states and 953 transitions. [2018-10-10 16:50:33,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-10 16:50:33,284 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 898 [2018-10-10 16:50:33,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:50:33,287 INFO L225 Difference]: With dead ends: 953 [2018-10-10 16:50:33,287 INFO L226 Difference]: Without dead ends: 953 [2018-10-10 16:50:33,288 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1260 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=980, Invalid=7210, Unknown=0, NotChecked=0, Total=8190 [2018-10-10 16:50:33,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2018-10-10 16:50:33,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 927. [2018-10-10 16:50:33,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2018-10-10 16:50:33,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 927 transitions. [2018-10-10 16:50:33,295 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 927 transitions. Word has length 898 [2018-10-10 16:50:33,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:50:33,295 INFO L481 AbstractCegarLoop]: Abstraction has 927 states and 927 transitions. [2018-10-10 16:50:33,295 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-10 16:50:33,296 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 927 transitions. [2018-10-10 16:50:33,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 927 [2018-10-10 16:50:33,301 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:50:33,301 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:50:33,302 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:50:33,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:50:33,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1676900943, now seen corresponding path program 32 times [2018-10-10 16:50:33,302 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:50:33,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:50:37,934 INFO L134 CoverageAnalysis]: Checked inductivity of 13984 backedges. 0 proven. 13984 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:50:37,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:50:37,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-10 16:50:37,936 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-10 16:50:37,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-10 16:50:37,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1939, Unknown=0, NotChecked=0, Total=2070 [2018-10-10 16:50:37,937 INFO L87 Difference]: Start difference. First operand 927 states and 927 transitions. Second operand 46 states. [2018-10-10 16:50:58,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:50:58,514 INFO L93 Difference]: Finished difference Result 981 states and 981 transitions. [2018-10-10 16:50:58,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-10 16:50:58,515 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 926 [2018-10-10 16:50:58,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:50:58,517 INFO L225 Difference]: With dead ends: 981 [2018-10-10 16:50:58,518 INFO L226 Difference]: Without dead ends: 981 [2018-10-10 16:50:58,518 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1313 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1004, Invalid=7552, Unknown=0, NotChecked=0, Total=8556 [2018-10-10 16:50:58,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2018-10-10 16:50:58,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 955. [2018-10-10 16:50:58,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 955 states. [2018-10-10 16:50:58,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 955 transitions. [2018-10-10 16:50:58,526 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 955 transitions. Word has length 926 [2018-10-10 16:50:58,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:50:58,527 INFO L481 AbstractCegarLoop]: Abstraction has 955 states and 955 transitions. [2018-10-10 16:50:58,527 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-10 16:50:58,527 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 955 transitions. [2018-10-10 16:50:58,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 955 [2018-10-10 16:50:58,533 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:50:58,533 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:50:58,534 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:50:58,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:50:58,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1905224481, now seen corresponding path program 33 times [2018-10-10 16:50:58,535 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:50:58,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:51:03,399 INFO L134 CoverageAnalysis]: Checked inductivity of 14883 backedges. 0 proven. 14883 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:51:03,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:51:03,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-10 16:51:03,400 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-10 16:51:03,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-10 16:51:03,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=2028, Unknown=0, NotChecked=0, Total=2162 [2018-10-10 16:51:03,400 INFO L87 Difference]: Start difference. First operand 955 states and 955 transitions. Second operand 47 states. [2018-10-10 16:51:24,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:51:24,823 INFO L93 Difference]: Finished difference Result 1009 states and 1009 transitions. [2018-10-10 16:51:24,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-10 16:51:24,823 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 954 [2018-10-10 16:51:24,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:51:24,827 INFO L225 Difference]: With dead ends: 1009 [2018-10-10 16:51:24,827 INFO L226 Difference]: Without dead ends: 1009 [2018-10-10 16:51:24,828 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1367 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1028, Invalid=7902, Unknown=0, NotChecked=0, Total=8930 [2018-10-10 16:51:24,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2018-10-10 16:51:24,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 983. [2018-10-10 16:51:24,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 983 states. [2018-10-10 16:51:24,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 983 states to 983 states and 983 transitions. [2018-10-10 16:51:24,836 INFO L78 Accepts]: Start accepts. Automaton has 983 states and 983 transitions. Word has length 954 [2018-10-10 16:51:24,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:51:24,837 INFO L481 AbstractCegarLoop]: Abstraction has 983 states and 983 transitions. [2018-10-10 16:51:24,837 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-10 16:51:24,837 INFO L276 IsEmpty]: Start isEmpty. Operand 983 states and 983 transitions. [2018-10-10 16:51:24,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 983 [2018-10-10 16:51:24,843 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:51:24,844 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:51:24,844 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:51:24,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:51:24,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1517078673, now seen corresponding path program 34 times [2018-10-10 16:51:24,845 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:51:24,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:51:30,034 INFO L134 CoverageAnalysis]: Checked inductivity of 15810 backedges. 0 proven. 15810 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:51:30,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:51:30,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-10 16:51:30,035 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-10 16:51:30,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-10 16:51:30,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=2119, Unknown=0, NotChecked=0, Total=2256 [2018-10-10 16:51:30,036 INFO L87 Difference]: Start difference. First operand 983 states and 983 transitions. Second operand 48 states. [2018-10-10 16:51:52,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:51:52,580 INFO L93 Difference]: Finished difference Result 1037 states and 1037 transitions. [2018-10-10 16:51:52,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-10 16:51:52,580 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 982 [2018-10-10 16:51:52,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:51:52,585 INFO L225 Difference]: With dead ends: 1037 [2018-10-10 16:51:52,585 INFO L226 Difference]: Without dead ends: 1037 [2018-10-10 16:51:52,585 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1422 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1052, Invalid=8260, Unknown=0, NotChecked=0, Total=9312 [2018-10-10 16:51:52,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2018-10-10 16:51:52,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 1011. [2018-10-10 16:51:52,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1011 states. [2018-10-10 16:51:52,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1011 states to 1011 states and 1011 transitions. [2018-10-10 16:51:52,594 INFO L78 Accepts]: Start accepts. Automaton has 1011 states and 1011 transitions. Word has length 982 [2018-10-10 16:51:52,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:51:52,594 INFO L481 AbstractCegarLoop]: Abstraction has 1011 states and 1011 transitions. [2018-10-10 16:51:52,594 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-10 16:51:52,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1011 states and 1011 transitions. [2018-10-10 16:51:52,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1011 [2018-10-10 16:51:52,600 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:51:52,601 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:51:52,601 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:51:52,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:51:52,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1631543807, now seen corresponding path program 35 times [2018-10-10 16:51:52,602 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:51:52,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:51:57,730 INFO L134 CoverageAnalysis]: Checked inductivity of 16765 backedges. 0 proven. 16765 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:51:57,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:51:57,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-10 16:51:57,731 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-10 16:51:57,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-10 16:51:57,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=2212, Unknown=0, NotChecked=0, Total=2352 [2018-10-10 16:51:57,731 INFO L87 Difference]: Start difference. First operand 1011 states and 1011 transitions. Second operand 49 states. [2018-10-10 16:52:21,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:52:21,621 INFO L93 Difference]: Finished difference Result 1065 states and 1065 transitions. [2018-10-10 16:52:21,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-10 16:52:21,621 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 1010 [2018-10-10 16:52:21,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:52:21,625 INFO L225 Difference]: With dead ends: 1065 [2018-10-10 16:52:21,626 INFO L226 Difference]: Without dead ends: 1065 [2018-10-10 16:52:21,626 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1478 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1076, Invalid=8626, Unknown=0, NotChecked=0, Total=9702 [2018-10-10 16:52:21,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2018-10-10 16:52:21,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 1039. [2018-10-10 16:52:21,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1039 states. [2018-10-10 16:52:21,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 1039 states and 1039 transitions. [2018-10-10 16:52:21,633 INFO L78 Accepts]: Start accepts. Automaton has 1039 states and 1039 transitions. Word has length 1010 [2018-10-10 16:52:21,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:52:21,634 INFO L481 AbstractCegarLoop]: Abstraction has 1039 states and 1039 transitions. [2018-10-10 16:52:21,634 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-10 16:52:21,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 1039 transitions. [2018-10-10 16:52:21,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1039 [2018-10-10 16:52:21,640 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:52:21,641 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:52:21,641 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:52:21,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:52:21,641 INFO L82 PathProgramCache]: Analyzing trace with hash -2069435535, now seen corresponding path program 36 times [2018-10-10 16:52:21,642 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:52:21,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:52:22,396 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-10 16:52:27,671 INFO L134 CoverageAnalysis]: Checked inductivity of 17748 backedges. 0 proven. 17748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:52:27,672 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:52:27,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-10 16:52:27,673 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-10 16:52:27,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-10 16:52:27,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=2307, Unknown=0, NotChecked=0, Total=2450 [2018-10-10 16:52:27,673 INFO L87 Difference]: Start difference. First operand 1039 states and 1039 transitions. Second operand 50 states. [2018-10-10 16:52:52,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:52:52,632 INFO L93 Difference]: Finished difference Result 1093 states and 1093 transitions. [2018-10-10 16:52:52,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-10 16:52:52,633 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 1038 [2018-10-10 16:52:52,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:52:52,636 INFO L225 Difference]: With dead ends: 1093 [2018-10-10 16:52:52,636 INFO L226 Difference]: Without dead ends: 1093 [2018-10-10 16:52:52,636 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1535 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=1100, Invalid=9000, Unknown=0, NotChecked=0, Total=10100 [2018-10-10 16:52:52,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1093 states. [2018-10-10 16:52:52,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1093 to 1067. [2018-10-10 16:52:52,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1067 states. [2018-10-10 16:52:52,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 1067 states and 1067 transitions. [2018-10-10 16:52:52,644 INFO L78 Accepts]: Start accepts. Automaton has 1067 states and 1067 transitions. Word has length 1038 [2018-10-10 16:52:52,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:52:52,644 INFO L481 AbstractCegarLoop]: Abstraction has 1067 states and 1067 transitions. [2018-10-10 16:52:52,644 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-10 16:52:52,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1067 transitions. [2018-10-10 16:52:52,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1067 [2018-10-10 16:52:52,652 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:52:52,652 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:52:52,652 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:52:52,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:52:52,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1346089185, now seen corresponding path program 37 times [2018-10-10 16:52:52,653 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:52:52,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:52:58,378 INFO L134 CoverageAnalysis]: Checked inductivity of 18759 backedges. 0 proven. 18759 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:52:58,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:52:58,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-10 16:52:58,379 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-10 16:52:58,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-10 16:52:58,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=2404, Unknown=0, NotChecked=0, Total=2550 [2018-10-10 16:52:58,380 INFO L87 Difference]: Start difference. First operand 1067 states and 1067 transitions. Second operand 51 states. [2018-10-10 16:53:24,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:53:24,483 INFO L93 Difference]: Finished difference Result 1121 states and 1121 transitions. [2018-10-10 16:53:24,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-10 16:53:24,483 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 1066 [2018-10-10 16:53:24,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:53:24,487 INFO L225 Difference]: With dead ends: 1121 [2018-10-10 16:53:24,487 INFO L226 Difference]: Without dead ends: 1121 [2018-10-10 16:53:24,488 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1593 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=1124, Invalid=9382, Unknown=0, NotChecked=0, Total=10506 [2018-10-10 16:53:24,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2018-10-10 16:53:24,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 1095. [2018-10-10 16:53:24,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1095 states. [2018-10-10 16:53:24,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1095 states to 1095 states and 1095 transitions. [2018-10-10 16:53:24,495 INFO L78 Accepts]: Start accepts. Automaton has 1095 states and 1095 transitions. Word has length 1066 [2018-10-10 16:53:24,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:53:24,496 INFO L481 AbstractCegarLoop]: Abstraction has 1095 states and 1095 transitions. [2018-10-10 16:53:24,496 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-10 16:53:24,496 INFO L276 IsEmpty]: Start isEmpty. Operand 1095 states and 1095 transitions. [2018-10-10 16:53:24,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1095 [2018-10-10 16:53:24,503 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:53:24,503 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:53:24,504 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:53:24,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:53:24,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1134227025, now seen corresponding path program 38 times [2018-10-10 16:53:24,504 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:53:24,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat