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/array3_false-valid-deref.i_6.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-b8f97f7-m [2018-10-10 16:30:07,113 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 16:30:07,116 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 16:30:07,128 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 16:30:07,128 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 16:30:07,129 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 16:30:07,131 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 16:30:07,132 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 16:30:07,134 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 16:30:07,135 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 16:30:07,136 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 16:30:07,136 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 16:30:07,137 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 16:30:07,138 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 16:30:07,139 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 16:30:07,140 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 16:30:07,141 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 16:30:07,143 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 16:30:07,145 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 16:30:07,146 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 16:30:07,147 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 16:30:07,148 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 16:30:07,151 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 16:30:07,151 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 16:30:07,152 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 16:30:07,152 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 16:30:07,153 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 16:30:07,154 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 16:30:07,155 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 16:30:07,156 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 16:30:07,157 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 16:30:07,157 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 16:30:07,158 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 16:30:07,158 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 16:30:07,159 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 16:30:07,160 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 16:30:07,160 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:30:07,176 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 16:30:07,177 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 16:30:07,177 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-10 16:30:07,178 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-10 16:30:07,178 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-10 16:30:07,178 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-10 16:30:07,179 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 16:30:07,179 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-10 16:30:07,179 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 16:30:07,179 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-10 16:30:07,179 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-10 16:30:07,180 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-10 16:30:07,180 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-10 16:30:07,181 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-10 16:30:07,181 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-10 16:30:07,255 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 16:30:07,272 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 16:30:07,278 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 16:30:07,280 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-10 16:30:07,280 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-10 16:30:07,281 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/array3_false-valid-deref.i_6.bpl [2018-10-10 16:30:07,281 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/array3_false-valid-deref.i_6.bpl' [2018-10-10 16:30:07,344 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 16:30:07,345 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-10 16:30:07,346 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 16:30:07,346 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 16:30:07,346 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 16:30:07,375 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array3_false-valid-deref.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:30:07" (1/1) ... [2018-10-10 16:30:07,377 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array3_false-valid-deref.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:30:07" (1/1) ... [2018-10-10 16:30:07,391 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array3_false-valid-deref.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:30:07" (1/1) ... [2018-10-10 16:30:07,391 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array3_false-valid-deref.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:30:07" (1/1) ... [2018-10-10 16:30:07,395 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array3_false-valid-deref.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:30:07" (1/1) ... [2018-10-10 16:30:07,397 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array3_false-valid-deref.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:30:07" (1/1) ... [2018-10-10 16:30:07,398 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array3_false-valid-deref.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:30:07" (1/1) ... [2018-10-10 16:30:07,400 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 16:30:07,401 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 16:30:07,401 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 16:30:07,402 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 16:30:07,404 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array3_false-valid-deref.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:30:07" (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:30:07,483 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-10 16:30:07,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 16:30:07,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 16:30:07,975 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 16:30:07,976 INFO L202 PluginConnector]: Adding new model array3_false-valid-deref.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 04:30:07 BoogieIcfgContainer [2018-10-10 16:30:07,976 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 16:30:07,977 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-10 16:30:07,977 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-10 16:30:07,978 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-10 16:30:07,982 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "array3_false-valid-deref.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 04:30:07" (1/1) ... [2018-10-10 16:30:07,990 INFO L137 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-10-10 16:30:07,991 INFO L138 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-10-10 16:30:08,024 INFO L191 apSepIcfgTransformer]: Heap separator: starting loc-array-style preprocessing [2018-10-10 16:30:08,063 INFO L217 apSepIcfgTransformer]: finished MemlocArrayUpdater [2018-10-10 16:30:08,079 INFO L280 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-10-10 16:30:08,147 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=1) [2018-10-10 16:30:10,421 INFO L315 AbstractInterpreter]: Visited 35 different actions 69 times. Merged at 16 different actions 32 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-10-10 16:30:10,423 INFO L304 apSepIcfgTransformer]: finished equality analysis [2018-10-10 16:30:10,428 INFO L316 apSepIcfgTransformer]: Finished detection of select terms ("array reads") [2018-10-10 16:30:10,473 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select |v_#locv_ULTIMATE.start_write~int_old_#memory_int_2_1_1| |v_ULTIMATE.start_write~int_#ptr.base_7|) at (assume #memory_int == write~int_old_#memory_int[write~int_#ptr.base := write~int_old_#memory_int[write~int_#ptr.base][write~int_#ptr.offset := write~int_#value]];) [2018-10-10 16:30:10,476 INFO L232 HeapPartitionManager]: partitioning result: [2018-10-10 16:30:10,477 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-10 16:30:10,477 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-10 16:30:10,478 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-10 16:30:10,478 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-10 16:30:10,478 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-10 16:30:10,478 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 0 [2018-10-10 16:30:10,479 INFO L248 HeapPartitionManager]: # location blocks :0 [2018-10-10 16:30:10,479 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-10 16:30:10,479 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-10 16:30:10,479 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-10 16:30:10,479 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-10 16:30:10,480 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-10 16:30:10,480 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 0 [2018-10-10 16:30:10,481 INFO L248 HeapPartitionManager]: # location blocks :0 [2018-10-10 16:30:10,482 INFO L145 ransitionTransformer]: executing heap partitioning transformation [2018-10-10 16:30:10,499 INFO L202 PluginConnector]: Adding new model array3_false-valid-deref.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.10 04:30:10 BasicIcfg [2018-10-10 16:30:10,500 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-10 16:30:10,501 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 16:30:10,501 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 16:30:10,505 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 16:30:10,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3_false-valid-deref.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 04:30:07" (1/3) ... [2018-10-10 16:30:10,507 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@783c49fe and model type array3_false-valid-deref.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 04:30:10, skipping insertion in model container [2018-10-10 16:30:10,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3_false-valid-deref.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 04:30:07" (2/3) ... [2018-10-10 16:30:10,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@783c49fe and model type array3_false-valid-deref.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 04:30:10, skipping insertion in model container [2018-10-10 16:30:10,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3_false-valid-deref.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.10 04:30:10" (3/3) ... [2018-10-10 16:30:10,510 INFO L112 eAbstractionObserver]: Analyzing ICFG memPartitionedIcfg [2018-10-10 16:30:10,522 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-10 16:30:10,531 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-10 16:30:10,551 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-10 16:30:10,577 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 16:30:10,578 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 16:30:10,578 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 16:30:10,578 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-10 16:30:10,579 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 16:30:10,579 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 16:30:10,580 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 16:30:10,580 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 16:30:10,580 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 16:30:10,599 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2018-10-10 16:30:10,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-10 16:30:10,610 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:30:10,611 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] [2018-10-10 16:30:10,613 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:30:10,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:30:10,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1256127758, now seen corresponding path program 1 times [2018-10-10 16:30:10,685 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:30:10,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:30:11,152 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:30:11,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 16:30:11,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-10 16:30:11,159 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 16:30:11,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 16:30:11,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-10 16:30:11,174 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 9 states. [2018-10-10 16:30:11,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:30:11,778 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-10-10 16:30:11,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-10 16:30:11,779 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-10-10 16:30:11,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:30:11,852 INFO L225 Difference]: With dead ends: 46 [2018-10-10 16:30:11,852 INFO L226 Difference]: Without dead ends: 46 [2018-10-10 16:30:11,854 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2018-10-10 16:30:11,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-10-10 16:30:11,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2018-10-10 16:30:11,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-10 16:30:11,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-10-10 16:30:11,892 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 24 [2018-10-10 16:30:11,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:30:11,892 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-10-10 16:30:11,893 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 16:30:11,893 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-10-10 16:30:11,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-10 16:30:11,894 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:30:11,894 INFO L375 BasicCegarLoop]: trace histogram [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:30:11,895 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:30:11,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:30:11,895 INFO L82 PathProgramCache]: Analyzing trace with hash -919393243, now seen corresponding path program 1 times [2018-10-10 16:30:11,896 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:30:11,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:30:12,360 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:30:12,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:30:12,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-10 16:30:12,362 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 16:30:12,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 16:30:12,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-10-10 16:30:12,363 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 10 states. [2018-10-10 16:30:12,714 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-10 16:30:13,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:30:13,179 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-10-10 16:30:13,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-10 16:30:13,183 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2018-10-10 16:30:13,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:30:13,187 INFO L225 Difference]: With dead ends: 65 [2018-10-10 16:30:13,187 INFO L226 Difference]: Without dead ends: 65 [2018-10-10 16:30:13,188 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2018-10-10 16:30:13,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-10-10 16:30:13,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 53. [2018-10-10 16:30:13,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-10 16:30:13,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-10-10 16:30:13,199 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 38 [2018-10-10 16:30:13,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:30:13,199 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-10-10 16:30:13,199 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 16:30:13,199 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-10-10 16:30:13,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-10 16:30:13,201 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:30:13,201 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:30:13,203 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:30:13,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:30:13,204 INFO L82 PathProgramCache]: Analyzing trace with hash -4217092, now seen corresponding path program 2 times [2018-10-10 16:30:13,204 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:30:13,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:30:13,599 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:30:13,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:30:13,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-10 16:30:13,600 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 16:30:13,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 16:30:13,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-10-10 16:30:13,601 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 12 states. [2018-10-10 16:30:14,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:30:14,418 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-10-10 16:30:14,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-10 16:30:14,420 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 52 [2018-10-10 16:30:14,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:30:14,422 INFO L225 Difference]: With dead ends: 79 [2018-10-10 16:30:14,422 INFO L226 Difference]: Without dead ends: 79 [2018-10-10 16:30:14,423 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2018-10-10 16:30:14,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-10-10 16:30:14,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 67. [2018-10-10 16:30:14,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-10 16:30:14,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-10-10 16:30:14,431 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 52 [2018-10-10 16:30:14,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:30:14,432 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-10-10 16:30:14,432 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 16:30:14,432 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-10-10 16:30:14,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-10 16:30:14,434 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:30:14,434 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:30:14,434 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:30:14,434 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:30:14,435 INFO L82 PathProgramCache]: Analyzing trace with hash -650846829, now seen corresponding path program 3 times [2018-10-10 16:30:14,436 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:30:14,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:30:14,877 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:30:14,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:30:14,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-10 16:30:14,878 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-10 16:30:14,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-10 16:30:14,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2018-10-10 16:30:14,879 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 16 states. [2018-10-10 16:30:16,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:30:16,068 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-10-10 16:30:16,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-10 16:30:16,069 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 66 [2018-10-10 16:30:16,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:30:16,070 INFO L225 Difference]: With dead ends: 93 [2018-10-10 16:30:16,071 INFO L226 Difference]: Without dead ends: 93 [2018-10-10 16:30:16,071 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=270, Invalid=722, Unknown=0, NotChecked=0, Total=992 [2018-10-10 16:30:16,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-10-10 16:30:16,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 81. [2018-10-10 16:30:16,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-10-10 16:30:16,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-10-10 16:30:16,078 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 66 [2018-10-10 16:30:16,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:30:16,079 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-10-10 16:30:16,079 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-10 16:30:16,079 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-10-10 16:30:16,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-10 16:30:16,082 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:30:16,082 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:30:16,082 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:30:16,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:30:16,083 INFO L82 PathProgramCache]: Analyzing trace with hash -893435926, now seen corresponding path program 4 times [2018-10-10 16:30:16,083 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:30:16,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:30:16,429 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:30:16,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:30:16,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-10 16:30:16,431 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-10 16:30:16,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-10 16:30:16,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-10-10 16:30:16,431 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 16 states. [2018-10-10 16:30:17,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:30:17,339 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-10-10 16:30:17,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-10 16:30:17,348 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 80 [2018-10-10 16:30:17,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:30:17,349 INFO L225 Difference]: With dead ends: 107 [2018-10-10 16:30:17,350 INFO L226 Difference]: Without dead ends: 107 [2018-10-10 16:30:17,350 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=205, Invalid=851, Unknown=0, NotChecked=0, Total=1056 [2018-10-10 16:30:17,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-10-10 16:30:17,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 95. [2018-10-10 16:30:17,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-10-10 16:30:17,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-10-10 16:30:17,360 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 80 [2018-10-10 16:30:17,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:30:17,360 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-10-10 16:30:17,361 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-10 16:30:17,364 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-10-10 16:30:17,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-10 16:30:17,365 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:30:17,365 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:30:17,366 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:30:17,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:30:17,366 INFO L82 PathProgramCache]: Analyzing trace with hash -888717823, now seen corresponding path program 5 times [2018-10-10 16:30:17,367 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:30:17,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:30:17,890 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 0 proven. 170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:30:17,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:30:17,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-10 16:30:17,892 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-10 16:30:17,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-10 16:30:17,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2018-10-10 16:30:17,893 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 18 states. [2018-10-10 16:30:19,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:30:19,526 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-10-10 16:30:19,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-10 16:30:19,526 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 94 [2018-10-10 16:30:19,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:30:19,528 INFO L225 Difference]: With dead ends: 121 [2018-10-10 16:30:19,528 INFO L226 Difference]: Without dead ends: 121 [2018-10-10 16:30:19,530 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=242, Invalid=1164, Unknown=0, NotChecked=0, Total=1406 [2018-10-10 16:30:19,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-10-10 16:30:19,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 109. [2018-10-10 16:30:19,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-10-10 16:30:19,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-10-10 16:30:19,538 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 94 [2018-10-10 16:30:19,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:30:19,538 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-10-10 16:30:19,538 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-10 16:30:19,538 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-10-10 16:30:19,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-10 16:30:19,540 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:30:19,540 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:30:19,541 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:30:19,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:30:19,541 INFO L82 PathProgramCache]: Analyzing trace with hash 154224600, now seen corresponding path program 6 times [2018-10-10 16:30:19,542 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:30:19,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:30:20,074 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:30:20,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:30:20,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-10 16:30:20,075 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-10 16:30:20,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-10 16:30:20,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2018-10-10 16:30:20,075 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 20 states. [2018-10-10 16:30:21,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:30:21,713 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-10-10 16:30:21,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-10 16:30:21,714 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 108 [2018-10-10 16:30:21,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:30:21,715 INFO L225 Difference]: With dead ends: 135 [2018-10-10 16:30:21,715 INFO L226 Difference]: Without dead ends: 135 [2018-10-10 16:30:21,716 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=279, Invalid=1527, Unknown=0, NotChecked=0, Total=1806 [2018-10-10 16:30:21,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-10-10 16:30:21,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 123. [2018-10-10 16:30:21,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-10-10 16:30:21,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-10-10 16:30:21,723 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 108 [2018-10-10 16:30:21,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:30:21,723 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-10-10 16:30:21,723 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-10 16:30:21,724 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-10-10 16:30:21,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-10 16:30:21,725 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:30:21,726 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:30:21,726 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:30:21,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:30:21,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1675480431, now seen corresponding path program 7 times [2018-10-10 16:30:21,727 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:30:21,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:30:22,238 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 0 proven. 336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:30:22,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:30:22,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-10 16:30:22,239 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-10 16:30:22,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-10 16:30:22,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2018-10-10 16:30:22,240 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 22 states. [2018-10-10 16:30:23,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:30:23,982 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2018-10-10 16:30:23,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-10 16:30:23,982 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 122 [2018-10-10 16:30:23,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:30:23,984 INFO L225 Difference]: With dead ends: 149 [2018-10-10 16:30:23,985 INFO L226 Difference]: Without dead ends: 149 [2018-10-10 16:30:23,986 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=316, Invalid=1940, Unknown=0, NotChecked=0, Total=2256 [2018-10-10 16:30:23,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-10-10 16:30:23,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 137. [2018-10-10 16:30:23,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-10-10 16:30:23,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-10-10 16:30:23,992 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 122 [2018-10-10 16:30:23,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:30:23,993 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-10-10 16:30:23,993 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-10 16:30:23,993 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-10-10 16:30:23,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-10 16:30:23,995 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:30:23,995 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:30:23,995 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:30:23,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:30:23,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1607909690, now seen corresponding path program 8 times [2018-10-10 16:30:23,997 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:30:24,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:30:26,081 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 0 proven. 440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:30:26,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:30:26,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-10 16:30:26,082 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-10 16:30:26,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-10 16:30:26,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2018-10-10 16:30:26,083 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 24 states. [2018-10-10 16:30:28,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:30:28,394 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-10-10 16:30:28,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-10 16:30:28,397 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 136 [2018-10-10 16:30:28,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:30:28,398 INFO L225 Difference]: With dead ends: 163 [2018-10-10 16:30:28,398 INFO L226 Difference]: Without dead ends: 163 [2018-10-10 16:30:28,399 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=353, Invalid=2403, Unknown=0, NotChecked=0, Total=2756 [2018-10-10 16:30:28,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-10-10 16:30:28,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 151. [2018-10-10 16:30:28,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-10-10 16:30:28,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-10-10 16:30:28,411 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 136 [2018-10-10 16:30:28,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:30:28,411 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-10-10 16:30:28,411 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-10 16:30:28,412 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-10-10 16:30:28,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-10 16:30:28,414 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:30:28,414 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:30:28,414 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:30:28,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:30:28,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1621887965, now seen corresponding path program 9 times [2018-10-10 16:30:28,416 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:30:28,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:30:29,091 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 0 proven. 558 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:30:29,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:30:29,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-10 16:30:29,092 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-10 16:30:29,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-10 16:30:29,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=581, Unknown=0, NotChecked=0, Total=650 [2018-10-10 16:30:29,093 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 26 states. [2018-10-10 16:30:31,329 WARN L178 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-10-10 16:30:32,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:30:32,539 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2018-10-10 16:30:32,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-10 16:30:32,540 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 150 [2018-10-10 16:30:32,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:30:32,541 INFO L225 Difference]: With dead ends: 177 [2018-10-10 16:30:32,542 INFO L226 Difference]: Without dead ends: 177 [2018-10-10 16:30:32,543 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=390, Invalid=2916, Unknown=0, NotChecked=0, Total=3306 [2018-10-10 16:30:32,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-10-10 16:30:32,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 165. [2018-10-10 16:30:32,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-10-10 16:30:32,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-10-10 16:30:32,553 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 150 [2018-10-10 16:30:32,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:30:32,554 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-10-10 16:30:32,554 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-10 16:30:32,554 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-10-10 16:30:32,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-10-10 16:30:32,559 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:30:32,559 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:30:32,560 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:30:32,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:30:32,560 INFO L82 PathProgramCache]: Analyzing trace with hash -595942220, now seen corresponding path program 10 times [2018-10-10 16:30:32,564 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:30:32,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:30:33,486 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 690 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:30:33,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:30:33,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-10 16:30:33,487 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-10 16:30:33,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-10 16:30:33,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=681, Unknown=0, NotChecked=0, Total=756 [2018-10-10 16:30:33,488 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 28 states. [2018-10-10 16:30:36,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:30:36,242 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-10-10 16:30:36,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-10 16:30:36,245 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 164 [2018-10-10 16:30:36,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:30:36,246 INFO L225 Difference]: With dead ends: 191 [2018-10-10 16:30:36,246 INFO L226 Difference]: Without dead ends: 191 [2018-10-10 16:30:36,248 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=427, Invalid=3479, Unknown=0, NotChecked=0, Total=3906 [2018-10-10 16:30:36,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-10-10 16:30:36,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 179. [2018-10-10 16:30:36,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-10-10 16:30:36,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2018-10-10 16:30:36,251 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 179 transitions. Word has length 164 [2018-10-10 16:30:36,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:30:36,252 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 179 transitions. [2018-10-10 16:30:36,252 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-10 16:30:36,252 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 179 transitions. [2018-10-10 16:30:36,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-10 16:30:36,253 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:30:36,254 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:30:36,254 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:30:36,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:30:36,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1445296459, now seen corresponding path program 11 times [2018-10-10 16:30:36,255 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:30:36,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:30:37,538 INFO L134 CoverageAnalysis]: Checked inductivity of 836 backedges. 0 proven. 836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:30:37,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:30:37,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-10 16:30:37,539 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-10 16:30:37,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-10 16:30:37,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=789, Unknown=0, NotChecked=0, Total=870 [2018-10-10 16:30:37,540 INFO L87 Difference]: Start difference. First operand 179 states and 179 transitions. Second operand 30 states. [2018-10-10 16:30:40,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:30:40,900 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2018-10-10 16:30:40,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-10 16:30:40,901 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 178 [2018-10-10 16:30:40,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:30:40,903 INFO L225 Difference]: With dead ends: 205 [2018-10-10 16:30:40,903 INFO L226 Difference]: Without dead ends: 205 [2018-10-10 16:30:40,905 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 690 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=464, Invalid=4092, Unknown=0, NotChecked=0, Total=4556 [2018-10-10 16:30:40,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-10-10 16:30:40,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 193. [2018-10-10 16:30:40,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-10-10 16:30:40,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2018-10-10 16:30:40,909 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 178 [2018-10-10 16:30:40,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:30:40,909 INFO L481 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2018-10-10 16:30:40,910 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-10 16:30:40,910 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2018-10-10 16:30:40,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-10-10 16:30:40,911 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:30:40,911 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:30:40,911 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:30:40,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:30:40,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1387854242, now seen corresponding path program 12 times [2018-10-10 16:30:40,913 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:30:40,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:30:42,074 INFO L134 CoverageAnalysis]: Checked inductivity of 996 backedges. 0 proven. 996 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:30:42,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:30:42,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-10 16:30:42,075 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-10 16:30:42,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-10 16:30:42,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=905, Unknown=0, NotChecked=0, Total=992 [2018-10-10 16:30:42,076 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 32 states. [2018-10-10 16:30:43,045 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-10-10 16:30:46,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:30:46,186 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2018-10-10 16:30:46,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-10 16:30:46,187 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 192 [2018-10-10 16:30:46,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:30:46,189 INFO L225 Difference]: With dead ends: 219 [2018-10-10 16:30:46,189 INFO L226 Difference]: Without dead ends: 219 [2018-10-10 16:30:46,191 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 806 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=501, Invalid=4755, Unknown=0, NotChecked=0, Total=5256 [2018-10-10 16:30:46,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-10-10 16:30:46,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 207. [2018-10-10 16:30:46,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-10-10 16:30:46,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 207 transitions. [2018-10-10 16:30:46,194 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 207 transitions. Word has length 192 [2018-10-10 16:30:46,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:30:46,194 INFO L481 AbstractCegarLoop]: Abstraction has 207 states and 207 transitions. [2018-10-10 16:30:46,195 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-10 16:30:46,195 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 207 transitions. [2018-10-10 16:30:46,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-10-10 16:30:46,196 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:30:46,196 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:30:46,196 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:30:46,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:30:46,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1866623559, now seen corresponding path program 13 times [2018-10-10 16:30:46,197 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:30:46,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:30:47,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1170 backedges. 0 proven. 1170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:30:47,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:30:47,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-10 16:30:47,269 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-10 16:30:47,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-10 16:30:47,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=1029, Unknown=0, NotChecked=0, Total=1122 [2018-10-10 16:30:47,270 INFO L87 Difference]: Start difference. First operand 207 states and 207 transitions. Second operand 34 states. [2018-10-10 16:30:49,489 WARN L178 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-10-10 16:30:51,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:30:51,606 INFO L93 Difference]: Finished difference Result 233 states and 233 transitions. [2018-10-10 16:30:51,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-10 16:30:51,607 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 206 [2018-10-10 16:30:51,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:30:51,608 INFO L225 Difference]: With dead ends: 233 [2018-10-10 16:30:51,609 INFO L226 Difference]: Without dead ends: 233 [2018-10-10 16:30:51,611 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 931 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=538, Invalid=5468, Unknown=0, NotChecked=0, Total=6006 [2018-10-10 16:30:51,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-10-10 16:30:51,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 221. [2018-10-10 16:30:51,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-10-10 16:30:51,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2018-10-10 16:30:51,615 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 206 [2018-10-10 16:30:51,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:30:51,615 INFO L481 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2018-10-10 16:30:51,616 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-10 16:30:51,616 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2018-10-10 16:30:51,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-10-10 16:30:51,617 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:30:51,617 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:30:51,617 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:30:51,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:30:51,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1086866032, now seen corresponding path program 14 times [2018-10-10 16:30:51,618 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:30:51,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:30:53,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1358 backedges. 0 proven. 1358 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:30:53,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:30:53,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-10 16:30:53,014 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-10 16:30:53,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-10 16:30:53,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1161, Unknown=0, NotChecked=0, Total=1260 [2018-10-10 16:30:53,015 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 36 states. [2018-10-10 16:30:57,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:30:57,789 INFO L93 Difference]: Finished difference Result 247 states and 247 transitions. [2018-10-10 16:30:57,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-10 16:30:57,790 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 220 [2018-10-10 16:30:57,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:30:57,792 INFO L225 Difference]: With dead ends: 247 [2018-10-10 16:30:57,792 INFO L226 Difference]: Without dead ends: 247 [2018-10-10 16:30:57,795 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1065 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=575, Invalid=6231, Unknown=0, NotChecked=0, Total=6806 [2018-10-10 16:30:57,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-10-10 16:30:57,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 235. [2018-10-10 16:30:57,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-10-10 16:30:57,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 235 transitions. [2018-10-10 16:30:57,800 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 235 transitions. Word has length 220 [2018-10-10 16:30:57,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:30:57,800 INFO L481 AbstractCegarLoop]: Abstraction has 235 states and 235 transitions. [2018-10-10 16:30:57,801 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-10 16:30:57,801 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 235 transitions. [2018-10-10 16:30:57,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-10-10 16:30:57,801 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:30:57,802 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:30:57,802 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:30:57,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:30:57,802 INFO L82 PathProgramCache]: Analyzing trace with hash -190324441, now seen corresponding path program 15 times [2018-10-10 16:30:57,803 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:30:57,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:31:00,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:31:00,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:31:00,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-10 16:31:00,008 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-10 16:31:00,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-10 16:31:00,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1301, Unknown=0, NotChecked=0, Total=1406 [2018-10-10 16:31:00,009 INFO L87 Difference]: Start difference. First operand 235 states and 235 transitions. Second operand 38 states. [2018-10-10 16:31:05,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:31:05,378 INFO L93 Difference]: Finished difference Result 261 states and 261 transitions. [2018-10-10 16:31:05,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-10 16:31:05,378 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 234 [2018-10-10 16:31:05,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:31:05,380 INFO L225 Difference]: With dead ends: 261 [2018-10-10 16:31:05,381 INFO L226 Difference]: Without dead ends: 261 [2018-10-10 16:31:05,384 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1208 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=612, Invalid=7044, Unknown=0, NotChecked=0, Total=7656 [2018-10-10 16:31:05,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-10-10 16:31:05,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 249. [2018-10-10 16:31:05,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-10-10 16:31:05,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions. [2018-10-10 16:31:05,388 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 234 [2018-10-10 16:31:05,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:31:05,388 INFO L481 AbstractCegarLoop]: Abstraction has 249 states and 249 transitions. [2018-10-10 16:31:05,388 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-10 16:31:05,388 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 249 transitions. [2018-10-10 16:31:05,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-10-10 16:31:05,389 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:31:05,389 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:31:05,389 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:31:05,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:31:05,390 INFO L82 PathProgramCache]: Analyzing trace with hash -435523458, now seen corresponding path program 16 times [2018-10-10 16:31:05,390 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:31:05,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:31:06,939 INFO L134 CoverageAnalysis]: Checked inductivity of 1776 backedges. 0 proven. 1776 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:31:06,939 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:31:06,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-10 16:31:06,940 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-10 16:31:06,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-10 16:31:06,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1449, Unknown=0, NotChecked=0, Total=1560 [2018-10-10 16:31:06,941 INFO L87 Difference]: Start difference. First operand 249 states and 249 transitions. Second operand 40 states. [2018-10-10 16:31:12,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:31:12,781 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2018-10-10 16:31:12,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-10 16:31:12,782 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 248 [2018-10-10 16:31:12,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:31:12,784 INFO L225 Difference]: With dead ends: 275 [2018-10-10 16:31:12,784 INFO L226 Difference]: Without dead ends: 275 [2018-10-10 16:31:12,786 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1360 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=649, Invalid=7907, Unknown=0, NotChecked=0, Total=8556 [2018-10-10 16:31:12,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-10-10 16:31:12,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 263. [2018-10-10 16:31:12,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-10-10 16:31:12,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 263 transitions. [2018-10-10 16:31:12,791 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 263 transitions. Word has length 248 [2018-10-10 16:31:12,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:31:12,791 INFO L481 AbstractCegarLoop]: Abstraction has 263 states and 263 transitions. [2018-10-10 16:31:12,791 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-10 16:31:12,791 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 263 transitions. [2018-10-10 16:31:12,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-10-10 16:31:12,793 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:31:12,793 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:31:12,793 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:31:12,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:31:12,794 INFO L82 PathProgramCache]: Analyzing trace with hash -573056107, now seen corresponding path program 17 times [2018-10-10 16:31:12,794 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:31:12,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:31:14,332 INFO L134 CoverageAnalysis]: Checked inductivity of 2006 backedges. 0 proven. 2006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:31:14,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:31:14,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-10 16:31:14,333 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-10 16:31:14,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-10 16:31:14,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1605, Unknown=0, NotChecked=0, Total=1722 [2018-10-10 16:31:14,334 INFO L87 Difference]: Start difference. First operand 263 states and 263 transitions. Second operand 42 states. [2018-10-10 16:31:20,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:31:20,662 INFO L93 Difference]: Finished difference Result 289 states and 289 transitions. [2018-10-10 16:31:20,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-10 16:31:20,667 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 262 [2018-10-10 16:31:20,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:31:20,669 INFO L225 Difference]: With dead ends: 289 [2018-10-10 16:31:20,669 INFO L226 Difference]: Without dead ends: 289 [2018-10-10 16:31:20,670 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1521 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=686, Invalid=8820, Unknown=0, NotChecked=0, Total=9506 [2018-10-10 16:31:20,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-10-10 16:31:20,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 277. [2018-10-10 16:31:20,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-10-10 16:31:20,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2018-10-10 16:31:20,676 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 262 [2018-10-10 16:31:20,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:31:20,677 INFO L481 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2018-10-10 16:31:20,677 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-10 16:31:20,677 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2018-10-10 16:31:20,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-10-10 16:31:20,679 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:31:20,680 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:31:20,680 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:31:20,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:31:20,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1929679468, now seen corresponding path program 18 times [2018-10-10 16:31:20,681 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:31:20,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:31:23,045 INFO L134 CoverageAnalysis]: Checked inductivity of 2250 backedges. 0 proven. 2250 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:31:23,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:31:23,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-10 16:31:23,046 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-10 16:31:23,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-10 16:31:23,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1769, Unknown=0, NotChecked=0, Total=1892 [2018-10-10 16:31:23,047 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 44 states. [2018-10-10 16:31:30,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:31:30,048 INFO L93 Difference]: Finished difference Result 303 states and 303 transitions. [2018-10-10 16:31:30,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-10 16:31:30,049 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 276 [2018-10-10 16:31:30,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:31:30,051 INFO L225 Difference]: With dead ends: 303 [2018-10-10 16:31:30,051 INFO L226 Difference]: Without dead ends: 303 [2018-10-10 16:31:30,053 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1691 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=723, Invalid=9783, Unknown=0, NotChecked=0, Total=10506 [2018-10-10 16:31:30,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-10-10 16:31:30,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 291. [2018-10-10 16:31:30,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-10-10 16:31:30,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 291 transitions. [2018-10-10 16:31:30,058 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 291 transitions. Word has length 276 [2018-10-10 16:31:30,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:31:30,059 INFO L481 AbstractCegarLoop]: Abstraction has 291 states and 291 transitions. [2018-10-10 16:31:30,059 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-10 16:31:30,059 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 291 transitions. [2018-10-10 16:31:30,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2018-10-10 16:31:30,060 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:31:30,061 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:31:30,061 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:31:30,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:31:30,061 INFO L82 PathProgramCache]: Analyzing trace with hash 66819, now seen corresponding path program 19 times [2018-10-10 16:31:30,062 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:31:30,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:31:31,787 INFO L134 CoverageAnalysis]: Checked inductivity of 2508 backedges. 0 proven. 2508 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:31:31,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:31:31,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-10 16:31:31,788 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-10 16:31:31,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-10 16:31:31,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1941, Unknown=0, NotChecked=0, Total=2070 [2018-10-10 16:31:31,789 INFO L87 Difference]: Start difference. First operand 291 states and 291 transitions. Second operand 46 states. [2018-10-10 16:31:39,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:31:39,820 INFO L93 Difference]: Finished difference Result 317 states and 317 transitions. [2018-10-10 16:31:39,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-10 16:31:39,821 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 290 [2018-10-10 16:31:39,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:31:39,823 INFO L225 Difference]: With dead ends: 317 [2018-10-10 16:31:39,823 INFO L226 Difference]: Without dead ends: 317 [2018-10-10 16:31:39,825 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1870 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=760, Invalid=10796, Unknown=0, NotChecked=0, Total=11556 [2018-10-10 16:31:39,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-10-10 16:31:39,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 305. [2018-10-10 16:31:39,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-10-10 16:31:39,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 305 transitions. [2018-10-10 16:31:39,830 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 305 transitions. Word has length 290 [2018-10-10 16:31:39,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:31:39,831 INFO L481 AbstractCegarLoop]: Abstraction has 305 states and 305 transitions. [2018-10-10 16:31:39,831 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-10 16:31:39,831 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 305 transitions. [2018-10-10 16:31:39,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-10-10 16:31:39,833 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:31:39,833 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:31:39,833 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:31:39,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:31:39,834 INFO L82 PathProgramCache]: Analyzing trace with hash -642145446, now seen corresponding path program 20 times [2018-10-10 16:31:39,834 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:31:39,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:31:42,156 INFO L134 CoverageAnalysis]: Checked inductivity of 2780 backedges. 0 proven. 2780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:31:42,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:31:42,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-10 16:31:42,157 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-10 16:31:42,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-10 16:31:42,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=2121, Unknown=0, NotChecked=0, Total=2256 [2018-10-10 16:31:42,158 INFO L87 Difference]: Start difference. First operand 305 states and 305 transitions. Second operand 48 states. [2018-10-10 16:31:50,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:31:50,488 INFO L93 Difference]: Finished difference Result 331 states and 331 transitions. [2018-10-10 16:31:50,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-10 16:31:50,488 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 304 [2018-10-10 16:31:50,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:31:50,490 INFO L225 Difference]: With dead ends: 331 [2018-10-10 16:31:50,491 INFO L226 Difference]: Without dead ends: 331 [2018-10-10 16:31:50,493 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2058 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=797, Invalid=11859, Unknown=0, NotChecked=0, Total=12656 [2018-10-10 16:31:50,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-10-10 16:31:50,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 319. [2018-10-10 16:31:50,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-10-10 16:31:50,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 319 transitions. [2018-10-10 16:31:50,498 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 319 transitions. Word has length 304 [2018-10-10 16:31:50,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:31:50,498 INFO L481 AbstractCegarLoop]: Abstraction has 319 states and 319 transitions. [2018-10-10 16:31:50,498 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-10 16:31:50,499 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 319 transitions. [2018-10-10 16:31:50,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2018-10-10 16:31:50,500 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:31:50,501 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:31:50,501 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:31:50,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:31:50,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1184292209, now seen corresponding path program 21 times [2018-10-10 16:31:50,502 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:31:50,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:31:53,079 INFO L134 CoverageAnalysis]: Checked inductivity of 3066 backedges. 0 proven. 3066 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:31:53,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:31:53,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-10 16:31:53,080 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-10 16:31:53,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-10 16:31:53,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=2309, Unknown=0, NotChecked=0, Total=2450 [2018-10-10 16:31:53,081 INFO L87 Difference]: Start difference. First operand 319 states and 319 transitions. Second operand 50 states. [2018-10-10 16:32:01,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:32:01,764 INFO L93 Difference]: Finished difference Result 345 states and 345 transitions. [2018-10-10 16:32:01,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-10 16:32:01,767 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 318 [2018-10-10 16:32:01,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:32:01,769 INFO L225 Difference]: With dead ends: 345 [2018-10-10 16:32:01,769 INFO L226 Difference]: Without dead ends: 345 [2018-10-10 16:32:01,771 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2255 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=834, Invalid=12972, Unknown=0, NotChecked=0, Total=13806 [2018-10-10 16:32:01,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2018-10-10 16:32:01,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 333. [2018-10-10 16:32:01,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-10-10 16:32:01,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 333 transitions. [2018-10-10 16:32:01,776 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 333 transitions. Word has length 318 [2018-10-10 16:32:01,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:32:01,776 INFO L481 AbstractCegarLoop]: Abstraction has 333 states and 333 transitions. [2018-10-10 16:32:01,776 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-10 16:32:01,776 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 333 transitions. [2018-10-10 16:32:01,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-10-10 16:32:01,778 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:32:01,778 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 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] [2018-10-10 16:32:01,779 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:32:01,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:32:01,779 INFO L82 PathProgramCache]: Analyzing trace with hash 897393480, now seen corresponding path program 22 times [2018-10-10 16:32:01,780 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:32:01,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:32:05,276 INFO L134 CoverageAnalysis]: Checked inductivity of 3366 backedges. 0 proven. 3366 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:32:05,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:32:05,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-10-10 16:32:05,277 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-10 16:32:05,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-10 16:32:05,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=2505, Unknown=0, NotChecked=0, Total=2652 [2018-10-10 16:32:05,278 INFO L87 Difference]: Start difference. First operand 333 states and 333 transitions. Second operand 52 states. [2018-10-10 16:32:15,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:32:15,405 INFO L93 Difference]: Finished difference Result 359 states and 359 transitions. [2018-10-10 16:32:15,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-10 16:32:15,405 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 332 [2018-10-10 16:32:15,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:32:15,407 INFO L225 Difference]: With dead ends: 359 [2018-10-10 16:32:15,407 INFO L226 Difference]: Without dead ends: 359 [2018-10-10 16:32:15,409 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2461 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=871, Invalid=14135, Unknown=0, NotChecked=0, Total=15006 [2018-10-10 16:32:15,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2018-10-10 16:32:15,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 347. [2018-10-10 16:32:15,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-10-10 16:32:15,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 347 transitions. [2018-10-10 16:32:15,414 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 347 transitions. Word has length 332 [2018-10-10 16:32:15,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:32:15,414 INFO L481 AbstractCegarLoop]: Abstraction has 347 states and 347 transitions. [2018-10-10 16:32:15,414 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-10 16:32:15,415 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 347 transitions. [2018-10-10 16:32:15,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2018-10-10 16:32:15,416 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:32:15,417 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 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] [2018-10-10 16:32:15,417 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:32:15,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:32:15,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1261640481, now seen corresponding path program 23 times [2018-10-10 16:32:15,418 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:32:15,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:32:17,793 INFO L134 CoverageAnalysis]: Checked inductivity of 3680 backedges. 0 proven. 3680 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:32:17,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:32:17,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-10-10 16:32:17,794 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-10 16:32:17,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-10 16:32:17,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=2709, Unknown=0, NotChecked=0, Total=2862 [2018-10-10 16:32:17,795 INFO L87 Difference]: Start difference. First operand 347 states and 347 transitions. Second operand 54 states. [2018-10-10 16:32:28,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:32:28,604 INFO L93 Difference]: Finished difference Result 373 states and 373 transitions. [2018-10-10 16:32:28,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-10 16:32:28,606 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 346 [2018-10-10 16:32:28,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:32:28,608 INFO L225 Difference]: With dead ends: 373 [2018-10-10 16:32:28,608 INFO L226 Difference]: Without dead ends: 373 [2018-10-10 16:32:28,610 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2676 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=908, Invalid=15348, Unknown=0, NotChecked=0, Total=16256 [2018-10-10 16:32:28,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2018-10-10 16:32:28,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 361. [2018-10-10 16:32:28,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-10-10 16:32:28,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 361 transitions. [2018-10-10 16:32:28,615 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 361 transitions. Word has length 346 [2018-10-10 16:32:28,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:32:28,615 INFO L481 AbstractCegarLoop]: Abstraction has 361 states and 361 transitions. [2018-10-10 16:32:28,615 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-10 16:32:28,615 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 361 transitions. [2018-10-10 16:32:28,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2018-10-10 16:32:28,617 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:32:28,618 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 25, 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] [2018-10-10 16:32:28,618 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:32:28,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:32:28,618 INFO L82 PathProgramCache]: Analyzing trace with hash 694325814, now seen corresponding path program 24 times [2018-10-10 16:32:28,619 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:32:28,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:32:31,273 INFO L134 CoverageAnalysis]: Checked inductivity of 4008 backedges. 0 proven. 4008 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:32:31,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:32:31,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-10-10 16:32:31,274 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-10 16:32:31,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-10 16:32:31,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=2921, Unknown=0, NotChecked=0, Total=3080 [2018-10-10 16:32:31,275 INFO L87 Difference]: Start difference. First operand 361 states and 361 transitions. Second operand 56 states. [2018-10-10 16:32:42,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:32:42,487 INFO L93 Difference]: Finished difference Result 387 states and 387 transitions. [2018-10-10 16:32:42,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-10 16:32:42,488 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 360 [2018-10-10 16:32:42,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:32:42,490 INFO L225 Difference]: With dead ends: 387 [2018-10-10 16:32:42,490 INFO L226 Difference]: Without dead ends: 387 [2018-10-10 16:32:42,492 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2900 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=945, Invalid=16611, Unknown=0, NotChecked=0, Total=17556 [2018-10-10 16:32:42,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-10-10 16:32:42,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 375. [2018-10-10 16:32:42,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2018-10-10 16:32:42,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 375 transitions. [2018-10-10 16:32:42,497 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 375 transitions. Word has length 360 [2018-10-10 16:32:42,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:32:42,497 INFO L481 AbstractCegarLoop]: Abstraction has 375 states and 375 transitions. [2018-10-10 16:32:42,497 INFO L482 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-10 16:32:42,497 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 375 transitions. [2018-10-10 16:32:42,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2018-10-10 16:32:42,499 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:32:42,500 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 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] [2018-10-10 16:32:42,500 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:32:42,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:32:42,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1167498061, now seen corresponding path program 25 times [2018-10-10 16:32:42,501 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:32:42,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:32:43,305 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-10 16:32:46,300 INFO L134 CoverageAnalysis]: Checked inductivity of 4350 backedges. 0 proven. 4350 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:32:46,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:32:46,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-10-10 16:32:46,301 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-10 16:32:46,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-10 16:32:46,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=3141, Unknown=0, NotChecked=0, Total=3306 [2018-10-10 16:32:46,302 INFO L87 Difference]: Start difference. First operand 375 states and 375 transitions. Second operand 58 states. [2018-10-10 16:32:58,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:32:58,655 INFO L93 Difference]: Finished difference Result 401 states and 401 transitions. [2018-10-10 16:32:58,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-10 16:32:58,656 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 374 [2018-10-10 16:32:58,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:32:58,658 INFO L225 Difference]: With dead ends: 401 [2018-10-10 16:32:58,658 INFO L226 Difference]: Without dead ends: 401 [2018-10-10 16:32:58,659 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3133 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=982, Invalid=17924, Unknown=0, NotChecked=0, Total=18906 [2018-10-10 16:32:58,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2018-10-10 16:32:58,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 389. [2018-10-10 16:32:58,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2018-10-10 16:32:58,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 389 transitions. [2018-10-10 16:32:58,664 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 389 transitions. Word has length 374 [2018-10-10 16:32:58,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:32:58,665 INFO L481 AbstractCegarLoop]: Abstraction has 389 states and 389 transitions. [2018-10-10 16:32:58,665 INFO L482 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-10 16:32:58,665 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 389 transitions. [2018-10-10 16:32:58,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2018-10-10 16:32:58,667 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:32:58,668 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 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] [2018-10-10 16:32:58,668 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:32:58,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:32:58,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1069715420, now seen corresponding path program 26 times [2018-10-10 16:32:58,669 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:32:58,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:33:01,796 INFO L134 CoverageAnalysis]: Checked inductivity of 4706 backedges. 0 proven. 4706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:33:01,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:33:01,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-10-10 16:33:01,797 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-10 16:33:01,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-10 16:33:01,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=3369, Unknown=0, NotChecked=0, Total=3540 [2018-10-10 16:33:01,798 INFO L87 Difference]: Start difference. First operand 389 states and 389 transitions. Second operand 60 states. [2018-10-10 16:33:14,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:33:14,856 INFO L93 Difference]: Finished difference Result 415 states and 415 transitions. [2018-10-10 16:33:14,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-10 16:33:14,857 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 388 [2018-10-10 16:33:14,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:33:14,859 INFO L225 Difference]: With dead ends: 415 [2018-10-10 16:33:14,859 INFO L226 Difference]: Without dead ends: 415 [2018-10-10 16:33:14,861 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3375 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=1019, Invalid=19287, Unknown=0, NotChecked=0, Total=20306 [2018-10-10 16:33:14,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2018-10-10 16:33:14,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 403. [2018-10-10 16:33:14,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-10-10 16:33:14,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 403 transitions. [2018-10-10 16:33:14,866 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 403 transitions. Word has length 388 [2018-10-10 16:33:14,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:33:14,866 INFO L481 AbstractCegarLoop]: Abstraction has 403 states and 403 transitions. [2018-10-10 16:33:14,866 INFO L482 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-10 16:33:14,866 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 403 transitions. [2018-10-10 16:33:14,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2018-10-10 16:33:14,869 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:33:14,869 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 28, 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] [2018-10-10 16:33:14,869 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:33:14,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:33:14,870 INFO L82 PathProgramCache]: Analyzing trace with hash -878214981, now seen corresponding path program 27 times [2018-10-10 16:33:14,870 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:33:14,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:33:19,430 INFO L134 CoverageAnalysis]: Checked inductivity of 5076 backedges. 0 proven. 5076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:33:19,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:33:19,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-10-10 16:33:19,431 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-10 16:33:19,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-10 16:33:19,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=3605, Unknown=0, NotChecked=0, Total=3782 [2018-10-10 16:33:19,432 INFO L87 Difference]: Start difference. First operand 403 states and 403 transitions. Second operand 62 states. [2018-10-10 16:33:33,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:33:33,439 INFO L93 Difference]: Finished difference Result 429 states and 429 transitions. [2018-10-10 16:33:33,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-10 16:33:33,440 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 402 [2018-10-10 16:33:33,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:33:33,442 INFO L225 Difference]: With dead ends: 429 [2018-10-10 16:33:33,442 INFO L226 Difference]: Without dead ends: 429 [2018-10-10 16:33:33,443 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3626 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=1056, Invalid=20700, Unknown=0, NotChecked=0, Total=21756 [2018-10-10 16:33:33,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2018-10-10 16:33:33,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 417. [2018-10-10 16:33:33,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-10-10 16:33:33,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 417 transitions. [2018-10-10 16:33:33,448 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 417 transitions. Word has length 402 [2018-10-10 16:33:33,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:33:33,449 INFO L481 AbstractCegarLoop]: Abstraction has 417 states and 417 transitions. [2018-10-10 16:33:33,449 INFO L482 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-10 16:33:33,449 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 417 transitions. [2018-10-10 16:33:33,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2018-10-10 16:33:33,451 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:33:33,452 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 29, 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] [2018-10-10 16:33:33,452 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:33:33,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:33:33,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1285635346, now seen corresponding path program 28 times [2018-10-10 16:33:33,453 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:33:33,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:33:37,384 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:33:37,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:33:37,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-10-10 16:33:37,385 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-10 16:33:37,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-10 16:33:37,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=3849, Unknown=0, NotChecked=0, Total=4032 [2018-10-10 16:33:37,386 INFO L87 Difference]: Start difference. First operand 417 states and 417 transitions. Second operand 64 states. [2018-10-10 16:33:43,685 WARN L178 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-10-10 16:33:52,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:33:52,727 INFO L93 Difference]: Finished difference Result 443 states and 443 transitions. [2018-10-10 16:33:52,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-10 16:33:52,728 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 416 [2018-10-10 16:33:52,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:33:52,730 INFO L225 Difference]: With dead ends: 443 [2018-10-10 16:33:52,730 INFO L226 Difference]: Without dead ends: 443 [2018-10-10 16:33:52,731 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3886 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=1093, Invalid=22163, Unknown=0, NotChecked=0, Total=23256 [2018-10-10 16:33:52,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2018-10-10 16:33:52,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 431. [2018-10-10 16:33:52,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2018-10-10 16:33:52,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 431 transitions. [2018-10-10 16:33:52,737 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 431 transitions. Word has length 416 [2018-10-10 16:33:52,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:33:52,737 INFO L481 AbstractCegarLoop]: Abstraction has 431 states and 431 transitions. [2018-10-10 16:33:52,737 INFO L482 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-10 16:33:52,738 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 431 transitions. [2018-10-10 16:33:52,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2018-10-10 16:33:52,740 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:33:52,740 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 30, 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] [2018-10-10 16:33:52,741 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:33:52,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:33:52,741 INFO L82 PathProgramCache]: Analyzing trace with hash -780987095, now seen corresponding path program 29 times [2018-10-10 16:33:52,742 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:33:52,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:33:57,908 INFO L134 CoverageAnalysis]: Checked inductivity of 5858 backedges. 0 proven. 5858 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:33:57,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:33:57,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-10-10 16:33:57,909 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-10 16:33:57,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-10 16:33:57,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=4101, Unknown=0, NotChecked=0, Total=4290 [2018-10-10 16:33:57,910 INFO L87 Difference]: Start difference. First operand 431 states and 431 transitions. Second operand 66 states. [2018-10-10 16:34:13,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:34:13,802 INFO L93 Difference]: Finished difference Result 457 states and 457 transitions. [2018-10-10 16:34:13,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-10 16:34:13,803 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 430 [2018-10-10 16:34:13,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:34:13,804 INFO L225 Difference]: With dead ends: 457 [2018-10-10 16:34:13,804 INFO L226 Difference]: Without dead ends: 457 [2018-10-10 16:34:13,806 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4155 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=1130, Invalid=23676, Unknown=0, NotChecked=0, Total=24806 [2018-10-10 16:34:13,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-10-10 16:34:13,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 445. [2018-10-10 16:34:13,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-10-10 16:34:13,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 445 transitions. [2018-10-10 16:34:13,811 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 445 transitions. Word has length 430 [2018-10-10 16:34:13,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:34:13,812 INFO L481 AbstractCegarLoop]: Abstraction has 445 states and 445 transitions. [2018-10-10 16:34:13,812 INFO L482 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-10 16:34:13,812 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 445 transitions. [2018-10-10 16:34:13,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2018-10-10 16:34:13,814 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:34:13,815 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 31, 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] [2018-10-10 16:34:13,815 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:34:13,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:34:13,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1222736128, now seen corresponding path program 30 times [2018-10-10 16:34:13,816 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:34:13,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:34:18,558 INFO L134 CoverageAnalysis]: Checked inductivity of 6270 backedges. 0 proven. 6270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:34:18,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:34:18,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-10-10 16:34:18,559 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-10 16:34:18,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-10 16:34:18,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=4361, Unknown=0, NotChecked=0, Total=4556 [2018-10-10 16:34:18,560 INFO L87 Difference]: Start difference. First operand 445 states and 445 transitions. Second operand 68 states. [2018-10-10 16:34:35,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:34:35,410 INFO L93 Difference]: Finished difference Result 471 states and 471 transitions. [2018-10-10 16:34:35,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-10-10 16:34:35,411 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 444 [2018-10-10 16:34:35,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:34:35,413 INFO L225 Difference]: With dead ends: 471 [2018-10-10 16:34:35,413 INFO L226 Difference]: Without dead ends: 471 [2018-10-10 16:34:35,414 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4433 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=1167, Invalid=25239, Unknown=0, NotChecked=0, Total=26406 [2018-10-10 16:34:35,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2018-10-10 16:34:35,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 459. [2018-10-10 16:34:35,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2018-10-10 16:34:35,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 459 transitions. [2018-10-10 16:34:35,419 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 459 transitions. Word has length 444 [2018-10-10 16:34:35,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:34:35,419 INFO L481 AbstractCegarLoop]: Abstraction has 459 states and 459 transitions. [2018-10-10 16:34:35,420 INFO L482 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-10 16:34:35,420 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 459 transitions. [2018-10-10 16:34:35,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2018-10-10 16:34:35,423 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:34:35,423 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 32, 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] [2018-10-10 16:34:35,423 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:34:35,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:34:35,424 INFO L82 PathProgramCache]: Analyzing trace with hash 2032982167, now seen corresponding path program 31 times [2018-10-10 16:34:35,424 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:34:35,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:34:39,629 INFO L134 CoverageAnalysis]: Checked inductivity of 6696 backedges. 0 proven. 6696 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:34:39,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:34:39,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-10-10 16:34:39,630 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-10-10 16:34:39,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-10-10 16:34:39,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=4629, Unknown=0, NotChecked=0, Total=4830 [2018-10-10 16:34:39,631 INFO L87 Difference]: Start difference. First operand 459 states and 459 transitions. Second operand 70 states. [2018-10-10 16:34:57,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:34:57,690 INFO L93 Difference]: Finished difference Result 485 states and 485 transitions. [2018-10-10 16:34:57,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-10-10 16:34:57,691 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 458 [2018-10-10 16:34:57,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:34:57,692 INFO L225 Difference]: With dead ends: 485 [2018-10-10 16:34:57,692 INFO L226 Difference]: Without dead ends: 485 [2018-10-10 16:34:57,694 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4720 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=1204, Invalid=26852, Unknown=0, NotChecked=0, Total=28056 [2018-10-10 16:34:57,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2018-10-10 16:34:57,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 473. [2018-10-10 16:34:57,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2018-10-10 16:34:57,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 473 transitions. [2018-10-10 16:34:57,699 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 473 transitions. Word has length 458 [2018-10-10 16:34:57,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:34:57,699 INFO L481 AbstractCegarLoop]: Abstraction has 473 states and 473 transitions. [2018-10-10 16:34:57,699 INFO L482 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-10-10 16:34:57,699 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 473 transitions. [2018-10-10 16:34:57,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2018-10-10 16:34:57,701 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:34:57,702 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 33, 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] [2018-10-10 16:34:57,702 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:34:57,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:34:57,702 INFO L82 PathProgramCache]: Analyzing trace with hash 923902958, now seen corresponding path program 32 times [2018-10-10 16:34:57,703 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:34:57,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:35:01,943 INFO L134 CoverageAnalysis]: Checked inductivity of 7136 backedges. 0 proven. 7136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:35:01,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:35:01,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-10-10 16:35:01,945 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-10 16:35:01,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-10 16:35:01,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=4905, Unknown=0, NotChecked=0, Total=5112 [2018-10-10 16:35:01,946 INFO L87 Difference]: Start difference. First operand 473 states and 473 transitions. Second operand 72 states. [2018-10-10 16:35:21,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:35:21,258 INFO L93 Difference]: Finished difference Result 499 states and 499 transitions. [2018-10-10 16:35:21,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-10-10 16:35:21,259 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 472 [2018-10-10 16:35:21,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:35:21,261 INFO L225 Difference]: With dead ends: 499 [2018-10-10 16:35:21,261 INFO L226 Difference]: Without dead ends: 499 [2018-10-10 16:35:21,262 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5016 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=1241, Invalid=28515, Unknown=0, NotChecked=0, Total=29756 [2018-10-10 16:35:21,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2018-10-10 16:35:21,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 487. [2018-10-10 16:35:21,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2018-10-10 16:35:21,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 487 transitions. [2018-10-10 16:35:21,267 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 487 transitions. Word has length 472 [2018-10-10 16:35:21,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:35:21,267 INFO L481 AbstractCegarLoop]: Abstraction has 487 states and 487 transitions. [2018-10-10 16:35:21,267 INFO L482 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-10 16:35:21,267 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 487 transitions. [2018-10-10 16:35:21,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2018-10-10 16:35:21,270 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:35:21,271 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 34, 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] [2018-10-10 16:35:21,271 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:35:21,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:35:21,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1556630277, now seen corresponding path program 33 times [2018-10-10 16:35:21,272 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:35:21,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:35:25,816 INFO L134 CoverageAnalysis]: Checked inductivity of 7590 backedges. 0 proven. 7590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:35:25,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:35:25,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-10-10 16:35:25,817 INFO L460 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-10-10 16:35:25,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-10-10 16:35:25,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=5189, Unknown=0, NotChecked=0, Total=5402 [2018-10-10 16:35:25,818 INFO L87 Difference]: Start difference. First operand 487 states and 487 transitions. Second operand 74 states. [2018-10-10 16:35:46,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:35:46,702 INFO L93 Difference]: Finished difference Result 513 states and 513 transitions. [2018-10-10 16:35:46,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-10-10 16:35:46,702 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 486 [2018-10-10 16:35:46,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:35:46,704 INFO L225 Difference]: With dead ends: 513 [2018-10-10 16:35:46,704 INFO L226 Difference]: Without dead ends: 513 [2018-10-10 16:35:46,705 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5321 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=1278, Invalid=30228, Unknown=0, NotChecked=0, Total=31506 [2018-10-10 16:35:46,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2018-10-10 16:35:46,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 501. [2018-10-10 16:35:46,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2018-10-10 16:35:46,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 501 transitions. [2018-10-10 16:35:46,711 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 501 transitions. Word has length 486 [2018-10-10 16:35:46,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:35:46,711 INFO L481 AbstractCegarLoop]: Abstraction has 501 states and 501 transitions. [2018-10-10 16:35:46,711 INFO L482 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-10-10 16:35:46,711 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 501 transitions. [2018-10-10 16:35:46,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2018-10-10 16:35:46,715 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:35:46,715 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 35, 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] [2018-10-10 16:35:46,715 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:35:46,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:35:46,716 INFO L82 PathProgramCache]: Analyzing trace with hash -2130362916, now seen corresponding path program 34 times [2018-10-10 16:35:46,716 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:35:46,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:35:51,552 INFO L134 CoverageAnalysis]: Checked inductivity of 8058 backedges. 0 proven. 8058 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:35:51,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:35:51,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-10-10 16:35:51,553 INFO L460 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-10-10 16:35:51,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-10-10 16:35:51,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=5481, Unknown=0, NotChecked=0, Total=5700 [2018-10-10 16:35:51,554 INFO L87 Difference]: Start difference. First operand 501 states and 501 transitions. Second operand 76 states. [2018-10-10 16:36:12,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:36:12,850 INFO L93 Difference]: Finished difference Result 527 states and 527 transitions. [2018-10-10 16:36:12,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-10-10 16:36:12,851 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 500 [2018-10-10 16:36:12,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:36:12,853 INFO L225 Difference]: With dead ends: 527 [2018-10-10 16:36:12,853 INFO L226 Difference]: Without dead ends: 527 [2018-10-10 16:36:12,854 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5635 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=1315, Invalid=31991, Unknown=0, NotChecked=0, Total=33306 [2018-10-10 16:36:12,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2018-10-10 16:36:12,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 515. [2018-10-10 16:36:12,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2018-10-10 16:36:12,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 515 transitions. [2018-10-10 16:36:12,858 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 515 transitions. Word has length 500 [2018-10-10 16:36:12,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:36:12,858 INFO L481 AbstractCegarLoop]: Abstraction has 515 states and 515 transitions. [2018-10-10 16:36:12,858 INFO L482 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-10-10 16:36:12,859 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 515 transitions. [2018-10-10 16:36:12,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2018-10-10 16:36:12,863 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:36:12,863 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 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] [2018-10-10 16:36:12,863 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:36:12,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:36:12,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1845030003, now seen corresponding path program 35 times [2018-10-10 16:36:12,865 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:36:12,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:36:18,061 INFO L134 CoverageAnalysis]: Checked inductivity of 8540 backedges. 0 proven. 8540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:36:18,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:36:18,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-10-10 16:36:18,063 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-10 16:36:18,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-10 16:36:18,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=5781, Unknown=0, NotChecked=0, Total=6006 [2018-10-10 16:36:18,063 INFO L87 Difference]: Start difference. First operand 515 states and 515 transitions. Second operand 78 states. [2018-10-10 16:36:41,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:36:41,196 INFO L93 Difference]: Finished difference Result 541 states and 541 transitions. [2018-10-10 16:36:41,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-10-10 16:36:41,196 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 514 [2018-10-10 16:36:41,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:36:41,198 INFO L225 Difference]: With dead ends: 541 [2018-10-10 16:36:41,198 INFO L226 Difference]: Without dead ends: 541 [2018-10-10 16:36:41,199 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5958 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=1352, Invalid=33804, Unknown=0, NotChecked=0, Total=35156 [2018-10-10 16:36:41,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2018-10-10 16:36:41,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 529. [2018-10-10 16:36:41,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2018-10-10 16:36:41,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 529 transitions. [2018-10-10 16:36:41,204 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 529 transitions. Word has length 514 [2018-10-10 16:36:41,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:36:41,205 INFO L481 AbstractCegarLoop]: Abstraction has 529 states and 529 transitions. [2018-10-10 16:36:41,205 INFO L482 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-10 16:36:41,205 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 529 transitions. [2018-10-10 16:36:41,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2018-10-10 16:36:41,208 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:36:41,208 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 37, 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] [2018-10-10 16:36:41,209 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:36:41,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:36:41,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1481623242, now seen corresponding path program 36 times [2018-10-10 16:36:41,210 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:36:41,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:36:46,491 INFO L134 CoverageAnalysis]: Checked inductivity of 9036 backedges. 0 proven. 9036 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:36:46,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:36:46,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-10-10 16:36:46,493 INFO L460 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-10-10 16:36:46,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-10-10 16:36:46,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=6089, Unknown=0, NotChecked=0, Total=6320 [2018-10-10 16:36:46,493 INFO L87 Difference]: Start difference. First operand 529 states and 529 transitions. Second operand 80 states. [2018-10-10 16:37:11,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:37:11,314 INFO L93 Difference]: Finished difference Result 555 states and 555 transitions. [2018-10-10 16:37:11,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-10-10 16:37:11,314 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 528 [2018-10-10 16:37:11,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:37:11,316 INFO L225 Difference]: With dead ends: 555 [2018-10-10 16:37:11,316 INFO L226 Difference]: Without dead ends: 555 [2018-10-10 16:37:11,318 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6290 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=1389, Invalid=35667, Unknown=0, NotChecked=0, Total=37056 [2018-10-10 16:37:11,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2018-10-10 16:37:11,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 543. [2018-10-10 16:37:11,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2018-10-10 16:37:11,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 543 transitions. [2018-10-10 16:37:11,323 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 543 transitions. Word has length 528 [2018-10-10 16:37:11,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:37:11,324 INFO L481 AbstractCegarLoop]: Abstraction has 543 states and 543 transitions. [2018-10-10 16:37:11,324 INFO L482 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-10-10 16:37:11,324 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 543 transitions. [2018-10-10 16:37:11,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 543 [2018-10-10 16:37:11,327 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:37:11,328 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 38, 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] [2018-10-10 16:37:11,328 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:37:11,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:37:11,328 INFO L82 PathProgramCache]: Analyzing trace with hash -701350687, now seen corresponding path program 37 times [2018-10-10 16:37:11,329 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:37:11,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:37:17,468 INFO L134 CoverageAnalysis]: Checked inductivity of 9546 backedges. 0 proven. 9546 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:37:17,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:37:17,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-10-10 16:37:17,469 INFO L460 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-10-10 16:37:17,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-10-10 16:37:17,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=6405, Unknown=0, NotChecked=0, Total=6642 [2018-10-10 16:37:17,470 INFO L87 Difference]: Start difference. First operand 543 states and 543 transitions. Second operand 82 states. [2018-10-10 16:37:43,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:37:43,313 INFO L93 Difference]: Finished difference Result 569 states and 569 transitions. [2018-10-10 16:37:43,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-10-10 16:37:43,313 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 542 [2018-10-10 16:37:43,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:37:43,315 INFO L225 Difference]: With dead ends: 569 [2018-10-10 16:37:43,316 INFO L226 Difference]: Without dead ends: 569 [2018-10-10 16:37:43,317 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6631 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=1426, Invalid=37580, Unknown=0, NotChecked=0, Total=39006 [2018-10-10 16:37:43,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2018-10-10 16:37:43,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 557. [2018-10-10 16:37:43,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2018-10-10 16:37:43,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 557 transitions. [2018-10-10 16:37:43,321 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 557 transitions. Word has length 542 [2018-10-10 16:37:43,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:37:43,321 INFO L481 AbstractCegarLoop]: Abstraction has 557 states and 557 transitions. [2018-10-10 16:37:43,321 INFO L482 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-10-10 16:37:43,322 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 557 transitions. [2018-10-10 16:37:43,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 557 [2018-10-10 16:37:43,324 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:37:43,324 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 39, 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] [2018-10-10 16:37:43,325 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:37:43,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:37:43,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1773879624, now seen corresponding path program 38 times [2018-10-10 16:37:43,325 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:37:43,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:37:49,209 INFO L134 CoverageAnalysis]: Checked inductivity of 10070 backedges. 0 proven. 10070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:37:49,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:37:49,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-10-10 16:37:49,210 INFO L460 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-10-10 16:37:49,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-10-10 16:37:49,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=6729, Unknown=0, NotChecked=0, Total=6972 [2018-10-10 16:37:49,211 INFO L87 Difference]: Start difference. First operand 557 states and 557 transitions. Second operand 84 states. [2018-10-10 16:38:15,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 16:38:15,941 INFO L93 Difference]: Finished difference Result 583 states and 583 transitions. [2018-10-10 16:38:15,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-10-10 16:38:15,942 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 556 [2018-10-10 16:38:15,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 16:38:15,945 INFO L225 Difference]: With dead ends: 583 [2018-10-10 16:38:15,946 INFO L226 Difference]: Without dead ends: 583 [2018-10-10 16:38:15,947 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6981 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=1463, Invalid=39543, Unknown=0, NotChecked=0, Total=41006 [2018-10-10 16:38:15,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2018-10-10 16:38:15,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 571. [2018-10-10 16:38:15,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2018-10-10 16:38:15,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 571 transitions. [2018-10-10 16:38:15,952 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 571 transitions. Word has length 556 [2018-10-10 16:38:15,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 16:38:15,952 INFO L481 AbstractCegarLoop]: Abstraction has 571 states and 571 transitions. [2018-10-10 16:38:15,952 INFO L482 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-10-10 16:38:15,952 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 571 transitions. [2018-10-10 16:38:15,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 571 [2018-10-10 16:38:15,955 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 16:38:15,955 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 40, 40, 39, 39, 39, 39, 39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 16:38:15,956 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 16:38:15,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 16:38:15,956 INFO L82 PathProgramCache]: Analyzing trace with hash -693650353, now seen corresponding path program 39 times [2018-10-10 16:38:15,957 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 16:38:16,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 16:38:22,124 INFO L134 CoverageAnalysis]: Checked inductivity of 10608 backedges. 0 proven. 10608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 16:38:22,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 16:38:22,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-10-10 16:38:22,125 INFO L460 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-10-10 16:38:22,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-10-10 16:38:22,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=7061, Unknown=0, NotChecked=0, Total=7310 [2018-10-10 16:38:22,125 INFO L87 Difference]: Start difference. First operand 571 states and 571 transitions. Second operand 86 states.