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/ArraysOfVariableLength_true-valid-memsafety.c_12.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-502d2f4 [2018-10-12 22:34:35,317 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-12 22:34:35,320 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-12 22:34:35,339 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-12 22:34:35,340 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-12 22:34:35,341 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-12 22:34:35,342 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-12 22:34:35,345 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-12 22:34:35,348 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-12 22:34:35,350 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-12 22:34:35,351 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-12 22:34:35,358 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-12 22:34:35,359 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-12 22:34:35,360 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-12 22:34:35,364 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-12 22:34:35,365 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-12 22:34:35,368 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-12 22:34:35,370 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-12 22:34:35,374 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-12 22:34:35,376 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-12 22:34:35,377 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-12 22:34:35,378 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-12 22:34:35,380 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-12 22:34:35,380 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-12 22:34:35,380 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-12 22:34:35,381 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-12 22:34:35,382 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-12 22:34:35,383 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-12 22:34:35,384 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-12 22:34:35,385 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-12 22:34:35,385 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-12 22:34:35,385 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-12 22:34:35,386 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-12 22:34:35,386 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-12 22:34:35,387 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-12 22:34:35,387 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-12 22:34:35,388 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-12 22:34:35,405 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-12 22:34:35,406 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-12 22:34:35,407 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-12 22:34:35,407 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-12 22:34:35,407 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-12 22:34:35,407 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-12 22:34:35,409 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-12 22:34:35,409 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-12 22:34:35,409 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-12 22:34:35,410 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-12 22:34:35,410 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-12 22:34:35,410 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-12 22:34:35,410 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-12 22:34:35,412 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-12 22:34:35,412 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-12 22:34:35,458 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-12 22:34:35,472 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-12 22:34:35,475 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-12 22:34:35,477 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-12 22:34:35,478 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-12 22:34:35,479 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysOfVariableLength_true-valid-memsafety.c_12.bpl [2018-10-12 22:34:35,479 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysOfVariableLength_true-valid-memsafety.c_12.bpl' [2018-10-12 22:34:35,542 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-12 22:34:35,544 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-12 22:34:35,544 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-12 22:34:35,544 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-12 22:34:35,545 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-12 22:34:35,574 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 10:34:35" (1/1) ... [2018-10-12 22:34:35,576 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 10:34:35" (1/1) ... [2018-10-12 22:34:35,592 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 10:34:35" (1/1) ... [2018-10-12 22:34:35,592 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 10:34:35" (1/1) ... [2018-10-12 22:34:35,597 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 10:34:35" (1/1) ... [2018-10-12 22:34:35,600 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 10:34:35" (1/1) ... [2018-10-12 22:34:35,601 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArraysOfVariableLength_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 10:34:35" (1/1) ... [2018-10-12 22:34:35,604 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-12 22:34:35,605 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-12 22:34:35,605 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-12 22:34:35,605 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-12 22:34:35,606 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArraysOfVariableLength_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 10:34:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-12 22:34:35,689 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-12 22:34:35,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-12 22:34:35,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-12 22:34:36,240 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-12 22:34:36,241 INFO L202 PluginConnector]: Adding new model ArraysOfVariableLength_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 10:34:36 BoogieIcfgContainer [2018-10-12 22:34:36,241 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-12 22:34:36,241 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-12 22:34:36,241 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-12 22:34:36,242 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-12 22:34:36,245 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "ArraysOfVariableLength_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 10:34:36" (1/1) ... [2018-10-12 22:34:36,253 INFO L137 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-10-12 22:34:36,253 INFO L138 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-10-12 22:34:36,292 INFO L191 apSepIcfgTransformer]: Heap separator: starting loc-array-style preprocessing [2018-10-12 22:34:36,353 INFO L219 apSepIcfgTransformer]: finished MemlocArrayUpdater [2018-10-12 22:34:36,369 INFO L282 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-10-12 22:34:36,440 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=1) [2018-10-12 22:34:42,384 INFO L315 AbstractInterpreter]: Visited 62 different actions 256 times. Merged at 43 different actions 185 times. Widened at 3 different actions 5 times. Found 8 fixpoints after 4 different actions. Largest state had 0 variables. [2018-10-12 22:34:42,388 INFO L306 apSepIcfgTransformer]: finished equality analysis [2018-10-12 22:34:42,394 INFO L318 apSepIcfgTransformer]: Finished detection of select terms ("array reads") [2018-10-12 22:34:42,451 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select |v_#locv_ULTIMATE.start_write~int_old_#memory_int_2_1_1| |v_ULTIMATE.start_write~int_#ptr.base_7|) at (assume #memory_int == write~int_old_#memory_int[write~int_#ptr.base := write~int_old_#memory_int[write~int_#ptr.base][write~int_#ptr.offset := write~int_#value]];) [2018-10-12 22:34:42,455 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select |#loc_#memory_int_(Array-Int-#locsort1)| |v_ULTIMATE.start_read~int_#ptr.base_6|) at (assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value;) [2018-10-12 22:34:42,455 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select (select |#loc_#memory_int_(Array-Int-(Array-Int-#locsort2))| |v_ULTIMATE.start_read~int_#ptr.base_6|) |v_ULTIMATE.start_read~int_#ptr.offset_4|) at (assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value;) [2018-10-12 22:34:42,457 INFO L232 HeapPartitionManager]: partitioning result: [2018-10-12 22:34:42,457 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-12 22:34:42,457 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-12 22:34:42,458 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-12 22:34:42,462 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-12 22:34:42,462 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-12 22:34:42,462 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-12 22:34:42,462 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-12 22:34:42,463 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-12 22:34:42,463 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-12 22:34:42,463 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-12 22:34:42,463 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-12 22:34:42,463 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-12 22:34:42,464 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 1 [2018-10-12 22:34:42,465 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-12 22:34:42,467 INFO L145 ransitionTransformer]: executing heap partitioning transformation [2018-10-12 22:34:42,501 INFO L202 PluginConnector]: Adding new model ArraysOfVariableLength_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 12.10 10:34:42 BasicIcfg [2018-10-12 22:34:42,501 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-12 22:34:42,502 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-12 22:34:42,502 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-12 22:34:42,507 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-12 22:34:42,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 10:34:35" (1/3) ... [2018-10-12 22:34:42,509 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@669a171f and model type ArraysOfVariableLength_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 10:34:42, skipping insertion in model container [2018-10-12 22:34:42,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 10:34:36" (2/3) ... [2018-10-12 22:34:42,509 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@669a171f and model type ArraysOfVariableLength_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 10:34:42, skipping insertion in model container [2018-10-12 22:34:42,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength_true-valid-memsafety.c_12.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 12.10 10:34:42" (3/3) ... [2018-10-12 22:34:42,511 INFO L112 eAbstractionObserver]: Analyzing ICFG memPartitionedIcfg [2018-10-12 22:34:42,522 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-12 22:34:42,531 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-12 22:34:42,550 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-12 22:34:42,581 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-12 22:34:42,582 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-12 22:34:42,582 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-12 22:34:42,582 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-12 22:34:42,583 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-12 22:34:42,583 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-12 22:34:42,583 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-12 22:34:42,583 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-12 22:34:42,583 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-12 22:34:42,599 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states. [2018-10-12 22:34:42,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-12 22:34:42,611 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:34:42,613 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:34:42,614 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:34:42,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:34:42,621 INFO L82 PathProgramCache]: Analyzing trace with hash 2033921432, now seen corresponding path program 1 times [2018-10-12 22:34:42,687 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:34:42,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:34:43,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:34:43,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-12 22:34:43,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-12 22:34:43,131 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-12 22:34:43,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-12 22:34:43,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-10-12 22:34:43,148 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 8 states. [2018-10-12 22:34:43,555 WARN L178 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-12 22:34:44,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:34:44,061 INFO L93 Difference]: Finished difference Result 129 states and 132 transitions. [2018-10-12 22:34:44,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-12 22:34:44,063 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2018-10-12 22:34:44,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:34:44,074 INFO L225 Difference]: With dead ends: 129 [2018-10-12 22:34:44,075 INFO L226 Difference]: Without dead ends: 129 [2018-10-12 22:34:44,076 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2018-10-12 22:34:44,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-10-12 22:34:44,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 91. [2018-10-12 22:34:44,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-10-12 22:34:44,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 93 transitions. [2018-10-12 22:34:44,128 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 93 transitions. Word has length 36 [2018-10-12 22:34:44,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:34:44,129 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 93 transitions. [2018-10-12 22:34:44,129 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-12 22:34:44,129 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 93 transitions. [2018-10-12 22:34:44,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-12 22:34:44,131 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:34:44,132 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:34:44,132 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:34:44,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:34:44,133 INFO L82 PathProgramCache]: Analyzing trace with hash -465539871, now seen corresponding path program 1 times [2018-10-12 22:34:44,134 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:34:44,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:34:44,407 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:34:44,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:34:44,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-12 22:34:44,410 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-12 22:34:44,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-12 22:34:44,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-12 22:34:44,411 INFO L87 Difference]: Start difference. First operand 91 states and 93 transitions. Second operand 8 states. [2018-10-12 22:34:45,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:34:45,156 INFO L93 Difference]: Finished difference Result 159 states and 162 transitions. [2018-10-12 22:34:45,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-12 22:34:45,158 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 62 [2018-10-12 22:34:45,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:34:45,160 INFO L225 Difference]: With dead ends: 159 [2018-10-12 22:34:45,160 INFO L226 Difference]: Without dead ends: 159 [2018-10-12 22:34:45,161 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-10-12 22:34:45,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-10-12 22:34:45,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 110. [2018-10-12 22:34:45,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-10-12 22:34:45,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 112 transitions. [2018-10-12 22:34:45,173 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 112 transitions. Word has length 62 [2018-10-12 22:34:45,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:34:45,174 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 112 transitions. [2018-10-12 22:34:45,174 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-12 22:34:45,174 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 112 transitions. [2018-10-12 22:34:45,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-12 22:34:45,176 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:34:45,176 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:34:45,177 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:34:45,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:34:45,177 INFO L82 PathProgramCache]: Analyzing trace with hash -283832255, now seen corresponding path program 1 times [2018-10-12 22:34:45,178 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:34:45,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:34:45,538 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-12 22:34:45,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:34:45,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-12 22:34:45,539 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-12 22:34:45,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-12 22:34:45,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-10-12 22:34:45,540 INFO L87 Difference]: Start difference. First operand 110 states and 112 transitions. Second operand 10 states. [2018-10-12 22:34:45,972 WARN L178 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-10-12 22:34:46,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:34:46,360 INFO L93 Difference]: Finished difference Result 170 states and 174 transitions. [2018-10-12 22:34:46,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-12 22:34:46,366 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 77 [2018-10-12 22:34:46,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:34:46,369 INFO L225 Difference]: With dead ends: 170 [2018-10-12 22:34:46,369 INFO L226 Difference]: Without dead ends: 170 [2018-10-12 22:34:46,370 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-12 22:34:46,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-10-12 22:34:46,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 132. [2018-10-12 22:34:46,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-10-12 22:34:46,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 135 transitions. [2018-10-12 22:34:46,385 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 135 transitions. Word has length 77 [2018-10-12 22:34:46,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:34:46,386 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 135 transitions. [2018-10-12 22:34:46,386 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-12 22:34:46,387 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 135 transitions. [2018-10-12 22:34:46,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-12 22:34:46,390 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:34:46,390 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:34:46,391 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:34:46,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:34:46,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1272455606, now seen corresponding path program 2 times [2018-10-12 22:34:46,395 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:34:46,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:34:46,649 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 17 proven. 47 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-12 22:34:46,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:34:46,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-12 22:34:46,650 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-12 22:34:46,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-12 22:34:46,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-10-12 22:34:46,651 INFO L87 Difference]: Start difference. First operand 132 states and 135 transitions. Second operand 10 states. [2018-10-12 22:34:47,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:34:47,067 INFO L93 Difference]: Finished difference Result 158 states and 161 transitions. [2018-10-12 22:34:47,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-12 22:34:47,071 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 103 [2018-10-12 22:34:47,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:34:47,073 INFO L225 Difference]: With dead ends: 158 [2018-10-12 22:34:47,073 INFO L226 Difference]: Without dead ends: 158 [2018-10-12 22:34:47,075 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2018-10-12 22:34:47,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-10-12 22:34:47,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 133. [2018-10-12 22:34:47,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-10-12 22:34:47,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 136 transitions. [2018-10-12 22:34:47,098 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 136 transitions. Word has length 103 [2018-10-12 22:34:47,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:34:47,099 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 136 transitions. [2018-10-12 22:34:47,099 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-12 22:34:47,099 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 136 transitions. [2018-10-12 22:34:47,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-12 22:34:47,105 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:34:47,106 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:34:47,106 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:34:47,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:34:47,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1544650680, now seen corresponding path program 3 times [2018-10-12 22:34:47,107 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:34:47,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:34:47,683 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 17 proven. 65 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-12 22:34:47,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:34:47,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-12 22:34:47,685 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-12 22:34:47,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-12 22:34:47,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-10-12 22:34:47,685 INFO L87 Difference]: Start difference. First operand 133 states and 136 transitions. Second operand 12 states. [2018-10-12 22:34:48,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:34:48,383 INFO L93 Difference]: Finished difference Result 160 states and 163 transitions. [2018-10-12 22:34:48,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-12 22:34:48,384 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 118 [2018-10-12 22:34:48,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:34:48,386 INFO L225 Difference]: With dead ends: 160 [2018-10-12 22:34:48,387 INFO L226 Difference]: Without dead ends: 160 [2018-10-12 22:34:48,388 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=123, Invalid=477, Unknown=0, NotChecked=0, Total=600 [2018-10-12 22:34:48,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-10-12 22:34:48,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 148. [2018-10-12 22:34:48,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-10-12 22:34:48,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 151 transitions. [2018-10-12 22:34:48,396 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 151 transitions. Word has length 118 [2018-10-12 22:34:48,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:34:48,396 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 151 transitions. [2018-10-12 22:34:48,396 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-12 22:34:48,396 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 151 transitions. [2018-10-12 22:34:48,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-10-12 22:34:48,399 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:34:48,399 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:34:48,399 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:34:48,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:34:48,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1849627786, now seen corresponding path program 4 times [2018-10-12 22:34:48,401 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:34:48,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:34:48,791 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-12 22:34:48,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:34:48,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-12 22:34:48,792 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-12 22:34:48,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-12 22:34:48,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-10-12 22:34:48,793 INFO L87 Difference]: Start difference. First operand 148 states and 151 transitions. Second operand 12 states. [2018-10-12 22:34:49,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:34:49,535 INFO L93 Difference]: Finished difference Result 258 states and 263 transitions. [2018-10-12 22:34:49,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-12 22:34:49,536 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 133 [2018-10-12 22:34:49,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:34:49,538 INFO L225 Difference]: With dead ends: 258 [2018-10-12 22:34:49,538 INFO L226 Difference]: Without dead ends: 258 [2018-10-12 22:34:49,538 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2018-10-12 22:34:49,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-10-12 22:34:49,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 204. [2018-10-12 22:34:49,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-10-12 22:34:49,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 208 transitions. [2018-10-12 22:34:49,546 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 208 transitions. Word has length 133 [2018-10-12 22:34:49,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:34:49,546 INFO L481 AbstractCegarLoop]: Abstraction has 204 states and 208 transitions. [2018-10-12 22:34:49,546 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-12 22:34:49,547 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 208 transitions. [2018-10-12 22:34:49,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-10-12 22:34:49,550 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:34:49,550 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:34:49,550 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:34:49,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:34:49,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1858316755, now seen corresponding path program 5 times [2018-10-12 22:34:49,552 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:34:49,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:34:49,863 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 86 proven. 198 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-10-12 22:34:49,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:34:49,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-12 22:34:49,864 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-12 22:34:49,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-12 22:34:49,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-10-12 22:34:49,865 INFO L87 Difference]: Start difference. First operand 204 states and 208 transitions. Second operand 16 states. [2018-10-12 22:34:50,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:34:50,784 INFO L93 Difference]: Finished difference Result 231 states and 235 transitions. [2018-10-12 22:34:50,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-12 22:34:50,787 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 189 [2018-10-12 22:34:50,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:34:50,789 INFO L225 Difference]: With dead ends: 231 [2018-10-12 22:34:50,789 INFO L226 Difference]: Without dead ends: 231 [2018-10-12 22:34:50,790 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=232, Invalid=958, Unknown=0, NotChecked=0, Total=1190 [2018-10-12 22:34:50,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-10-12 22:34:50,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 219. [2018-10-12 22:34:50,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-10-12 22:34:50,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 223 transitions. [2018-10-12 22:34:50,796 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 223 transitions. Word has length 189 [2018-10-12 22:34:50,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:34:50,797 INFO L481 AbstractCegarLoop]: Abstraction has 219 states and 223 transitions. [2018-10-12 22:34:50,797 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-12 22:34:50,797 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 223 transitions. [2018-10-12 22:34:50,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-10-12 22:34:50,801 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:34:50,801 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:34:50,801 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:34:50,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:34:50,802 INFO L82 PathProgramCache]: Analyzing trace with hash 437653775, now seen corresponding path program 6 times [2018-10-12 22:34:50,803 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:34:50,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:34:52,000 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 349 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-10-12 22:34:52,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:34:52,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-12 22:34:52,001 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-12 22:34:52,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-12 22:34:52,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2018-10-12 22:34:52,002 INFO L87 Difference]: Start difference. First operand 219 states and 223 transitions. Second operand 20 states. [2018-10-12 22:34:55,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:34:55,720 INFO L93 Difference]: Finished difference Result 461 states and 468 transitions. [2018-10-12 22:34:55,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-12 22:34:55,725 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 204 [2018-10-12 22:34:55,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:34:55,727 INFO L225 Difference]: With dead ends: 461 [2018-10-12 22:34:55,727 INFO L226 Difference]: Without dead ends: 460 [2018-10-12 22:34:55,730 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1311 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1079, Invalid=4033, Unknown=0, NotChecked=0, Total=5112 [2018-10-12 22:34:55,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2018-10-12 22:34:55,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 276. [2018-10-12 22:34:55,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-10-12 22:34:55,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 280 transitions. [2018-10-12 22:34:55,737 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 280 transitions. Word has length 204 [2018-10-12 22:34:55,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:34:55,738 INFO L481 AbstractCegarLoop]: Abstraction has 276 states and 280 transitions. [2018-10-12 22:34:55,738 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-12 22:34:55,738 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 280 transitions. [2018-10-12 22:34:55,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-10-12 22:34:55,742 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:34:55,743 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:34:55,743 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:34:55,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:34:55,743 INFO L82 PathProgramCache]: Analyzing trace with hash 2086374634, now seen corresponding path program 7 times [2018-10-12 22:34:55,744 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:34:55,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:34:56,829 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 0 proven. 733 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2018-10-12 22:34:56,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:34:56,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-12 22:34:56,830 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-12 22:34:56,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-12 22:34:56,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2018-10-12 22:34:56,831 INFO L87 Difference]: Start difference. First operand 276 states and 280 transitions. Second operand 22 states. [2018-10-12 22:35:01,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:35:01,410 INFO L93 Difference]: Finished difference Result 531 states and 539 transitions. [2018-10-12 22:35:01,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-12 22:35:01,410 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 275 [2018-10-12 22:35:01,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:35:01,415 INFO L225 Difference]: With dead ends: 531 [2018-10-12 22:35:01,415 INFO L226 Difference]: Without dead ends: 531 [2018-10-12 22:35:01,418 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1988 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=1421, Invalid=5719, Unknown=0, NotChecked=0, Total=7140 [2018-10-12 22:35:01,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2018-10-12 22:35:01,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 347. [2018-10-12 22:35:01,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-10-12 22:35:01,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 352 transitions. [2018-10-12 22:35:01,427 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 352 transitions. Word has length 275 [2018-10-12 22:35:01,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:35:01,428 INFO L481 AbstractCegarLoop]: Abstraction has 347 states and 352 transitions. [2018-10-12 22:35:01,428 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-12 22:35:01,428 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 352 transitions. [2018-10-12 22:35:01,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2018-10-12 22:35:01,432 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:35:01,433 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:35:01,433 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:35:01,433 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:35:01,434 INFO L82 PathProgramCache]: Analyzing trace with hash -179934033, now seen corresponding path program 8 times [2018-10-12 22:35:01,435 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:35:01,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:35:02,248 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-12 22:35:03,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1412 backedges. 0 proven. 1284 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-10-12 22:35:03,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:35:03,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-12 22:35:03,125 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-12 22:35:03,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-12 22:35:03,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2018-10-12 22:35:03,126 INFO L87 Difference]: Start difference. First operand 347 states and 352 transitions. Second operand 24 states. [2018-10-12 22:35:03,406 WARN L178 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 20 [2018-10-12 22:35:07,280 WARN L178 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2018-10-12 22:35:08,905 WARN L178 SmtUtils]: Spent 276.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2018-10-12 22:35:09,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:35:09,493 INFO L93 Difference]: Finished difference Result 602 states and 611 transitions. [2018-10-12 22:35:09,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-12 22:35:09,494 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 346 [2018-10-12 22:35:09,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:35:09,497 INFO L225 Difference]: With dead ends: 602 [2018-10-12 22:35:09,497 INFO L226 Difference]: Without dead ends: 602 [2018-10-12 22:35:09,499 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2815 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=1820, Invalid=7686, Unknown=0, NotChecked=0, Total=9506 [2018-10-12 22:35:09,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2018-10-12 22:35:09,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 418. [2018-10-12 22:35:09,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2018-10-12 22:35:09,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 424 transitions. [2018-10-12 22:35:09,508 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 424 transitions. Word has length 346 [2018-10-12 22:35:09,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:35:09,509 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 424 transitions. [2018-10-12 22:35:09,509 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-12 22:35:09,509 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 424 transitions. [2018-10-12 22:35:09,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2018-10-12 22:35:09,512 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:35:09,512 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:35:09,512 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:35:09,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:35:09,513 INFO L82 PathProgramCache]: Analyzing trace with hash 673701194, now seen corresponding path program 9 times [2018-10-12 22:35:09,514 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:35:09,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:35:10,560 INFO L134 CoverageAnalysis]: Checked inductivity of 2178 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2018-10-12 22:35:10,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:35:10,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-12 22:35:10,561 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-12 22:35:10,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-12 22:35:10,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=554, Unknown=0, NotChecked=0, Total=650 [2018-10-12 22:35:10,562 INFO L87 Difference]: Start difference. First operand 418 states and 424 transitions. Second operand 26 states. [2018-10-12 22:35:18,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:35:18,006 INFO L93 Difference]: Finished difference Result 673 states and 683 transitions. [2018-10-12 22:35:18,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-10-12 22:35:18,006 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 417 [2018-10-12 22:35:18,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:35:18,010 INFO L225 Difference]: With dead ends: 673 [2018-10-12 22:35:18,011 INFO L226 Difference]: Without dead ends: 673 [2018-10-12 22:35:18,016 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3792 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=2276, Invalid=9934, Unknown=0, NotChecked=0, Total=12210 [2018-10-12 22:35:18,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2018-10-12 22:35:18,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 489. [2018-10-12 22:35:18,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2018-10-12 22:35:18,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 496 transitions. [2018-10-12 22:35:18,027 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 496 transitions. Word has length 417 [2018-10-12 22:35:18,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:35:18,028 INFO L481 AbstractCegarLoop]: Abstraction has 489 states and 496 transitions. [2018-10-12 22:35:18,028 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-12 22:35:18,028 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 496 transitions. [2018-10-12 22:35:18,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2018-10-12 22:35:18,034 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:35:18,034 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:35:18,034 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:35:18,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:35:18,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1082388559, now seen corresponding path program 10 times [2018-10-12 22:35:18,036 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:35:18,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:35:19,606 INFO L134 CoverageAnalysis]: Checked inductivity of 3111 backedges. 0 proven. 2887 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2018-10-12 22:35:19,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:35:19,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-12 22:35:19,607 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-12 22:35:19,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-12 22:35:19,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=643, Unknown=0, NotChecked=0, Total=756 [2018-10-12 22:35:19,609 INFO L87 Difference]: Start difference. First operand 489 states and 496 transitions. Second operand 28 states. [2018-10-12 22:35:27,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:35:27,743 INFO L93 Difference]: Finished difference Result 744 states and 755 transitions. [2018-10-12 22:35:27,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-10-12 22:35:27,746 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 488 [2018-10-12 22:35:27,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:35:27,749 INFO L225 Difference]: With dead ends: 744 [2018-10-12 22:35:27,750 INFO L226 Difference]: Without dead ends: 744 [2018-10-12 22:35:27,754 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4919 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=2789, Invalid=12463, Unknown=0, NotChecked=0, Total=15252 [2018-10-12 22:35:27,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2018-10-12 22:35:27,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 560. [2018-10-12 22:35:27,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2018-10-12 22:35:27,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 568 transitions. [2018-10-12 22:35:27,764 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 568 transitions. Word has length 488 [2018-10-12 22:35:27,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:35:27,765 INFO L481 AbstractCegarLoop]: Abstraction has 560 states and 568 transitions. [2018-10-12 22:35:27,765 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-12 22:35:27,766 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 568 transitions. [2018-10-12 22:35:27,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 560 [2018-10-12 22:35:27,769 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:35:27,769 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:35:27,770 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:35:27,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:35:27,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1066010026, now seen corresponding path program 11 times [2018-10-12 22:35:27,771 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:35:27,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:35:29,778 INFO L134 CoverageAnalysis]: Checked inductivity of 4211 backedges. 0 proven. 3939 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2018-10-12 22:35:29,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:35:29,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-12 22:35:29,779 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-12 22:35:29,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-12 22:35:29,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=738, Unknown=0, NotChecked=0, Total=870 [2018-10-12 22:35:29,780 INFO L87 Difference]: Start difference. First operand 560 states and 568 transitions. Second operand 30 states. [2018-10-12 22:35:30,325 WARN L178 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 22 [2018-10-12 22:35:38,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:35:38,693 INFO L93 Difference]: Finished difference Result 815 states and 827 transitions. [2018-10-12 22:35:38,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-10-12 22:35:38,694 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 559 [2018-10-12 22:35:38,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:35:38,698 INFO L225 Difference]: With dead ends: 815 [2018-10-12 22:35:38,698 INFO L226 Difference]: Without dead ends: 815 [2018-10-12 22:35:38,703 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6196 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=3359, Invalid=15273, Unknown=0, NotChecked=0, Total=18632 [2018-10-12 22:35:38,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2018-10-12 22:35:38,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 631. [2018-10-12 22:35:38,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2018-10-12 22:35:38,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 640 transitions. [2018-10-12 22:35:38,713 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 640 transitions. Word has length 559 [2018-10-12 22:35:38,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:35:38,715 INFO L481 AbstractCegarLoop]: Abstraction has 631 states and 640 transitions. [2018-10-12 22:35:38,715 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-12 22:35:38,715 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 640 transitions. [2018-10-12 22:35:38,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 631 [2018-10-12 22:35:38,720 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:35:38,720 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:35:38,720 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:35:38,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:35:38,721 INFO L82 PathProgramCache]: Analyzing trace with hash 254319599, now seen corresponding path program 12 times [2018-10-12 22:35:38,722 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:35:38,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:35:40,833 INFO L134 CoverageAnalysis]: Checked inductivity of 5478 backedges. 0 proven. 5158 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2018-10-12 22:35:40,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:35:40,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-12 22:35:40,835 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-12 22:35:40,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-12 22:35:40,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=839, Unknown=0, NotChecked=0, Total=992 [2018-10-12 22:35:40,836 INFO L87 Difference]: Start difference. First operand 631 states and 640 transitions. Second operand 32 states. [2018-10-12 22:35:50,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:35:50,218 INFO L93 Difference]: Finished difference Result 886 states and 899 transitions. [2018-10-12 22:35:50,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-10-12 22:35:50,219 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 630 [2018-10-12 22:35:50,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:35:50,225 INFO L225 Difference]: With dead ends: 886 [2018-10-12 22:35:50,225 INFO L226 Difference]: Without dead ends: 886 [2018-10-12 22:35:50,229 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7623 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=3986, Invalid=18364, Unknown=0, NotChecked=0, Total=22350 [2018-10-12 22:35:50,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2018-10-12 22:35:50,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 702. [2018-10-12 22:35:50,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 702 states. [2018-10-12 22:35:50,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 712 transitions. [2018-10-12 22:35:50,241 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 712 transitions. Word has length 630 [2018-10-12 22:35:50,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:35:50,242 INFO L481 AbstractCegarLoop]: Abstraction has 702 states and 712 transitions. [2018-10-12 22:35:50,242 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-12 22:35:50,242 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 712 transitions. [2018-10-12 22:35:50,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 702 [2018-10-12 22:35:50,247 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:35:50,248 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:35:50,248 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:35:50,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:35:50,249 INFO L82 PathProgramCache]: Analyzing trace with hash -437778934, now seen corresponding path program 13 times [2018-10-12 22:35:50,250 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:35:50,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:35:52,622 INFO L134 CoverageAnalysis]: Checked inductivity of 6912 backedges. 0 proven. 6544 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2018-10-12 22:35:52,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:35:52,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-12 22:35:52,623 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-12 22:35:52,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-12 22:35:52,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=946, Unknown=0, NotChecked=0, Total=1122 [2018-10-12 22:35:52,624 INFO L87 Difference]: Start difference. First operand 702 states and 712 transitions. Second operand 34 states. [2018-10-12 22:36:03,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:36:03,285 INFO L93 Difference]: Finished difference Result 957 states and 971 transitions. [2018-10-12 22:36:03,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-10-12 22:36:03,286 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 701 [2018-10-12 22:36:03,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:36:03,290 INFO L225 Difference]: With dead ends: 957 [2018-10-12 22:36:03,290 INFO L226 Difference]: Without dead ends: 957 [2018-10-12 22:36:03,294 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9200 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=4670, Invalid=21736, Unknown=0, NotChecked=0, Total=26406 [2018-10-12 22:36:03,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2018-10-12 22:36:03,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 773. [2018-10-12 22:36:03,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2018-10-12 22:36:03,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 784 transitions. [2018-10-12 22:36:03,306 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 784 transitions. Word has length 701 [2018-10-12 22:36:03,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:36:03,306 INFO L481 AbstractCegarLoop]: Abstraction has 773 states and 784 transitions. [2018-10-12 22:36:03,307 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-12 22:36:03,307 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 784 transitions. [2018-10-12 22:36:03,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 773 [2018-10-12 22:36:03,313 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:36:03,313 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:36:03,313 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:36:03,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:36:03,314 INFO L82 PathProgramCache]: Analyzing trace with hash -284266609, now seen corresponding path program 14 times [2018-10-12 22:36:03,315 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:36:03,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:36:06,643 INFO L134 CoverageAnalysis]: Checked inductivity of 8513 backedges. 0 proven. 8097 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2018-10-12 22:36:06,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:36:06,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-12 22:36:06,645 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-12 22:36:06,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-12 22:36:06,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=1059, Unknown=0, NotChecked=0, Total=1260 [2018-10-12 22:36:06,645 INFO L87 Difference]: Start difference. First operand 773 states and 784 transitions. Second operand 36 states. [2018-10-12 22:36:18,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:36:18,448 INFO L93 Difference]: Finished difference Result 1028 states and 1043 transitions. [2018-10-12 22:36:18,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-10-12 22:36:18,450 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 772 [2018-10-12 22:36:18,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:36:18,455 INFO L225 Difference]: With dead ends: 1028 [2018-10-12 22:36:18,455 INFO L226 Difference]: Without dead ends: 1028 [2018-10-12 22:36:18,459 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10927 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=5411, Invalid=25389, Unknown=0, NotChecked=0, Total=30800 [2018-10-12 22:36:18,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2018-10-12 22:36:18,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 844. [2018-10-12 22:36:18,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 844 states. [2018-10-12 22:36:18,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 844 states to 844 states and 856 transitions. [2018-10-12 22:36:18,472 INFO L78 Accepts]: Start accepts. Automaton has 844 states and 856 transitions. Word has length 772 [2018-10-12 22:36:18,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:36:18,472 INFO L481 AbstractCegarLoop]: Abstraction has 844 states and 856 transitions. [2018-10-12 22:36:18,473 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-12 22:36:18,473 INFO L276 IsEmpty]: Start isEmpty. Operand 844 states and 856 transitions. [2018-10-12 22:36:18,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 844 [2018-10-12 22:36:18,480 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:36:18,481 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:36:18,481 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:36:18,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:36:18,482 INFO L82 PathProgramCache]: Analyzing trace with hash -198713750, now seen corresponding path program 15 times [2018-10-12 22:36:18,482 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:36:18,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:36:21,478 INFO L134 CoverageAnalysis]: Checked inductivity of 10281 backedges. 0 proven. 9817 refuted. 0 times theorem prover too weak. 464 trivial. 0 not checked. [2018-10-12 22:36:21,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:36:21,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-12 22:36:21,479 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-12 22:36:21,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-12 22:36:21,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=1178, Unknown=0, NotChecked=0, Total=1406 [2018-10-12 22:36:21,480 INFO L87 Difference]: Start difference. First operand 844 states and 856 transitions. Second operand 38 states. [2018-10-12 22:36:34,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:36:34,056 INFO L93 Difference]: Finished difference Result 1099 states and 1115 transitions. [2018-10-12 22:36:34,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2018-10-12 22:36:34,057 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 843 [2018-10-12 22:36:34,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:36:34,061 INFO L225 Difference]: With dead ends: 1099 [2018-10-12 22:36:34,062 INFO L226 Difference]: Without dead ends: 1099 [2018-10-12 22:36:34,065 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12804 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=6209, Invalid=29323, Unknown=0, NotChecked=0, Total=35532 [2018-10-12 22:36:34,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2018-10-12 22:36:34,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 915. [2018-10-12 22:36:34,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 915 states. [2018-10-12 22:36:34,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 928 transitions. [2018-10-12 22:36:34,079 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 928 transitions. Word has length 843 [2018-10-12 22:36:34,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:36:34,079 INFO L481 AbstractCegarLoop]: Abstraction has 915 states and 928 transitions. [2018-10-12 22:36:34,080 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-12 22:36:34,080 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 928 transitions. [2018-10-12 22:36:34,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 915 [2018-10-12 22:36:34,112 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:36:34,113 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:36:34,113 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:36:34,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:36:34,114 INFO L82 PathProgramCache]: Analyzing trace with hash -2003866833, now seen corresponding path program 16 times [2018-10-12 22:36:34,115 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:36:34,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:36:37,717 INFO L134 CoverageAnalysis]: Checked inductivity of 12216 backedges. 0 proven. 11704 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2018-10-12 22:36:37,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:36:37,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-12 22:36:37,718 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-12 22:36:37,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-12 22:36:37,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=1303, Unknown=0, NotChecked=0, Total=1560 [2018-10-12 22:36:37,719 INFO L87 Difference]: Start difference. First operand 915 states and 928 transitions. Second operand 40 states. [2018-10-12 22:36:48,145 WARN L178 SmtUtils]: Spent 568.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 42 [2018-10-12 22:36:52,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:36:52,441 INFO L93 Difference]: Finished difference Result 1170 states and 1187 transitions. [2018-10-12 22:36:52,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2018-10-12 22:36:52,441 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 914 [2018-10-12 22:36:52,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:36:52,446 INFO L225 Difference]: With dead ends: 1170 [2018-10-12 22:36:52,446 INFO L226 Difference]: Without dead ends: 1170 [2018-10-12 22:36:52,448 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14831 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=7064, Invalid=33538, Unknown=0, NotChecked=0, Total=40602 [2018-10-12 22:36:52,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2018-10-12 22:36:52,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 986. [2018-10-12 22:36:52,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 986 states. [2018-10-12 22:36:52,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 1000 transitions. [2018-10-12 22:36:52,461 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 1000 transitions. Word has length 914 [2018-10-12 22:36:52,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:36:52,462 INFO L481 AbstractCegarLoop]: Abstraction has 986 states and 1000 transitions. [2018-10-12 22:36:52,462 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-12 22:36:52,462 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1000 transitions. [2018-10-12 22:36:52,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 986 [2018-10-12 22:36:52,472 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:36:52,472 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:36:52,473 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:36:52,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:36:52,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1487900362, now seen corresponding path program 17 times [2018-10-12 22:36:52,474 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:36:52,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:36:56,654 INFO L134 CoverageAnalysis]: Checked inductivity of 14318 backedges. 0 proven. 13758 refuted. 0 times theorem prover too weak. 560 trivial. 0 not checked. [2018-10-12 22:36:56,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:36:56,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-12 22:36:56,656 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-12 22:36:56,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-12 22:36:56,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=1434, Unknown=0, NotChecked=0, Total=1722 [2018-10-12 22:36:56,657 INFO L87 Difference]: Start difference. First operand 986 states and 1000 transitions. Second operand 42 states. [2018-10-12 22:37:12,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:37:12,017 INFO L93 Difference]: Finished difference Result 1241 states and 1259 transitions. [2018-10-12 22:37:12,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2018-10-12 22:37:12,017 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 985 [2018-10-12 22:37:12,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:37:12,021 INFO L225 Difference]: With dead ends: 1241 [2018-10-12 22:37:12,021 INFO L226 Difference]: Without dead ends: 1241 [2018-10-12 22:37:12,024 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17008 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=7976, Invalid=38034, Unknown=0, NotChecked=0, Total=46010 [2018-10-12 22:37:12,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2018-10-12 22:37:12,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 1057. [2018-10-12 22:37:12,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1057 states. [2018-10-12 22:37:12,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 1072 transitions. [2018-10-12 22:37:12,037 INFO L78 Accepts]: Start accepts. Automaton has 1057 states and 1072 transitions. Word has length 985 [2018-10-12 22:37:12,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:37:12,038 INFO L481 AbstractCegarLoop]: Abstraction has 1057 states and 1072 transitions. [2018-10-12 22:37:12,038 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-12 22:37:12,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 1072 transitions. [2018-10-12 22:37:12,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1057 [2018-10-12 22:37:12,048 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:37:12,049 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:37:12,049 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:37:12,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:37:12,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1048940239, now seen corresponding path program 18 times [2018-10-12 22:37:12,050 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:37:12,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:37:17,320 INFO L134 CoverageAnalysis]: Checked inductivity of 16587 backedges. 0 proven. 15979 refuted. 0 times theorem prover too weak. 608 trivial. 0 not checked. [2018-10-12 22:37:17,321 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:37:17,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-12 22:37:17,322 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-12 22:37:17,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-12 22:37:17,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=1571, Unknown=0, NotChecked=0, Total=1892 [2018-10-12 22:37:17,322 INFO L87 Difference]: Start difference. First operand 1057 states and 1072 transitions. Second operand 44 states. [2018-10-12 22:37:34,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:37:34,105 INFO L93 Difference]: Finished difference Result 1312 states and 1331 transitions. [2018-10-12 22:37:34,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 188 states. [2018-10-12 22:37:34,105 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 1056 [2018-10-12 22:37:34,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:37:34,109 INFO L225 Difference]: With dead ends: 1312 [2018-10-12 22:37:34,109 INFO L226 Difference]: Without dead ends: 1312 [2018-10-12 22:37:34,112 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19335 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=8945, Invalid=42811, Unknown=0, NotChecked=0, Total=51756 [2018-10-12 22:37:34,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2018-10-12 22:37:34,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1128. [2018-10-12 22:37:34,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1128 states. [2018-10-12 22:37:34,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 1144 transitions. [2018-10-12 22:37:34,125 INFO L78 Accepts]: Start accepts. Automaton has 1128 states and 1144 transitions. Word has length 1056 [2018-10-12 22:37:34,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:37:34,126 INFO L481 AbstractCegarLoop]: Abstraction has 1128 states and 1144 transitions. [2018-10-12 22:37:34,126 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-12 22:37:34,126 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 1144 transitions. [2018-10-12 22:37:34,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1128 [2018-10-12 22:37:34,137 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:37:34,138 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:37:34,138 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:37:34,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:37:34,139 INFO L82 PathProgramCache]: Analyzing trace with hash 2003113770, now seen corresponding path program 19 times [2018-10-12 22:37:34,139 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:37:34,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:37:35,215 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-12 22:37:39,646 INFO L134 CoverageAnalysis]: Checked inductivity of 19023 backedges. 0 proven. 18367 refuted. 0 times theorem prover too weak. 656 trivial. 0 not checked. [2018-10-12 22:37:39,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:37:39,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-12 22:37:39,648 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-12 22:37:39,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-12 22:37:39,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=1714, Unknown=0, NotChecked=0, Total=2070 [2018-10-12 22:37:39,649 INFO L87 Difference]: Start difference. First operand 1128 states and 1144 transitions. Second operand 46 states. [2018-10-12 22:37:58,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:37:58,157 INFO L93 Difference]: Finished difference Result 1383 states and 1403 transitions. [2018-10-12 22:37:58,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 199 states. [2018-10-12 22:37:58,158 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 1127 [2018-10-12 22:37:58,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:37:58,162 INFO L225 Difference]: With dead ends: 1383 [2018-10-12 22:37:58,162 INFO L226 Difference]: Without dead ends: 1383 [2018-10-12 22:37:58,165 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 239 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21812 ImplicationChecksByTransitivity, 17.6s TimeCoverageRelationStatistics Valid=9971, Invalid=47869, Unknown=0, NotChecked=0, Total=57840 [2018-10-12 22:37:58,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2018-10-12 22:37:58,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1199. [2018-10-12 22:37:58,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1199 states. [2018-10-12 22:37:58,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 1199 states and 1216 transitions. [2018-10-12 22:37:58,177 INFO L78 Accepts]: Start accepts. Automaton has 1199 states and 1216 transitions. Word has length 1127 [2018-10-12 22:37:58,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:37:58,179 INFO L481 AbstractCegarLoop]: Abstraction has 1199 states and 1216 transitions. [2018-10-12 22:37:58,179 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-12 22:37:58,179 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 1216 transitions. [2018-10-12 22:37:58,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1199 [2018-10-12 22:37:58,192 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:37:58,192 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:37:58,192 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:37:58,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:37:58,193 INFO L82 PathProgramCache]: Analyzing trace with hash -833955217, now seen corresponding path program 20 times [2018-10-12 22:37:58,194 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:37:58,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:38:03,441 INFO L134 CoverageAnalysis]: Checked inductivity of 21626 backedges. 0 proven. 20922 refuted. 0 times theorem prover too weak. 704 trivial. 0 not checked. [2018-10-12 22:38:03,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:38:03,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-12 22:38:03,442 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-12 22:38:03,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-12 22:38:03,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=393, Invalid=1863, Unknown=0, NotChecked=0, Total=2256 [2018-10-12 22:38:03,443 INFO L87 Difference]: Start difference. First operand 1199 states and 1216 transitions. Second operand 48 states. [2018-10-12 22:38:22,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:38:22,724 INFO L93 Difference]: Finished difference Result 1454 states and 1475 transitions. [2018-10-12 22:38:22,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 210 states. [2018-10-12 22:38:22,727 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 1198 [2018-10-12 22:38:22,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:38:22,731 INFO L225 Difference]: With dead ends: 1454 [2018-10-12 22:38:22,731 INFO L226 Difference]: Without dead ends: 1454 [2018-10-12 22:38:22,734 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24439 ImplicationChecksByTransitivity, 18.2s TimeCoverageRelationStatistics Valid=11054, Invalid=53208, Unknown=0, NotChecked=0, Total=64262 [2018-10-12 22:38:22,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1454 states. [2018-10-12 22:38:22,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1454 to 1270. [2018-10-12 22:38:22,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1270 states. [2018-10-12 22:38:22,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 1288 transitions. [2018-10-12 22:38:22,747 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 1288 transitions. Word has length 1198 [2018-10-12 22:38:22,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:38:22,748 INFO L481 AbstractCegarLoop]: Abstraction has 1270 states and 1288 transitions. [2018-10-12 22:38:22,748 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-12 22:38:22,748 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1288 transitions. [2018-10-12 22:38:22,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1270 [2018-10-12 22:38:22,762 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:38:22,762 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:38:22,762 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:38:22,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:38:22,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1985054838, now seen corresponding path program 21 times [2018-10-12 22:38:22,764 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:38:22,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:38:28,914 INFO L134 CoverageAnalysis]: Checked inductivity of 24396 backedges. 0 proven. 23644 refuted. 0 times theorem prover too weak. 752 trivial. 0 not checked. [2018-10-12 22:38:28,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:38:28,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-12 22:38:28,916 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-12 22:38:28,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-12 22:38:28,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=432, Invalid=2018, Unknown=0, NotChecked=0, Total=2450 [2018-10-12 22:38:28,916 INFO L87 Difference]: Start difference. First operand 1270 states and 1288 transitions. Second operand 50 states. [2018-10-12 22:38:50,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:38:50,298 INFO L93 Difference]: Finished difference Result 1525 states and 1547 transitions. [2018-10-12 22:38:50,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 221 states. [2018-10-12 22:38:50,298 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 1269 [2018-10-12 22:38:50,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:38:50,303 INFO L225 Difference]: With dead ends: 1525 [2018-10-12 22:38:50,303 INFO L226 Difference]: Without dead ends: 1525 [2018-10-12 22:38:50,306 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27216 ImplicationChecksByTransitivity, 20.0s TimeCoverageRelationStatistics Valid=12194, Invalid=58828, Unknown=0, NotChecked=0, Total=71022 [2018-10-12 22:38:50,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1525 states. [2018-10-12 22:38:50,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1525 to 1341. [2018-10-12 22:38:50,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1341 states. [2018-10-12 22:38:50,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 1360 transitions. [2018-10-12 22:38:50,320 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 1360 transitions. Word has length 1269 [2018-10-12 22:38:50,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:38:50,321 INFO L481 AbstractCegarLoop]: Abstraction has 1341 states and 1360 transitions. [2018-10-12 22:38:50,321 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-12 22:38:50,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 1360 transitions. [2018-10-12 22:38:50,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1341 [2018-10-12 22:38:50,336 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:38:50,337 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:38:50,337 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:38:50,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:38:50,338 INFO L82 PathProgramCache]: Analyzing trace with hash -273068529, now seen corresponding path program 22 times [2018-10-12 22:38:50,338 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:38:50,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:38:51,667 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-12 22:38:57,966 INFO L134 CoverageAnalysis]: Checked inductivity of 27333 backedges. 0 proven. 26533 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2018-10-12 22:38:57,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:38:57,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-10-12 22:38:57,967 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-12 22:38:57,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-12 22:38:57,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=473, Invalid=2179, Unknown=0, NotChecked=0, Total=2652 [2018-10-12 22:38:57,968 INFO L87 Difference]: Start difference. First operand 1341 states and 1360 transitions. Second operand 52 states. [2018-10-12 22:39:21,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:39:21,146 INFO L93 Difference]: Finished difference Result 1596 states and 1619 transitions. [2018-10-12 22:39:21,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 232 states. [2018-10-12 22:39:21,147 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 1340 [2018-10-12 22:39:21,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:39:21,153 INFO L225 Difference]: With dead ends: 1596 [2018-10-12 22:39:21,153 INFO L226 Difference]: Without dead ends: 1596 [2018-10-12 22:39:21,158 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 278 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30143 ImplicationChecksByTransitivity, 22.8s TimeCoverageRelationStatistics Valid=13391, Invalid=64729, Unknown=0, NotChecked=0, Total=78120 [2018-10-12 22:39:21,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1596 states. [2018-10-12 22:39:21,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1596 to 1412. [2018-10-12 22:39:21,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1412 states. [2018-10-12 22:39:21,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 1432 transitions. [2018-10-12 22:39:21,172 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 1432 transitions. Word has length 1340 [2018-10-12 22:39:21,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:39:21,174 INFO L481 AbstractCegarLoop]: Abstraction has 1412 states and 1432 transitions. [2018-10-12 22:39:21,174 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-12 22:39:21,174 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 1432 transitions. [2018-10-12 22:39:21,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1412 [2018-10-12 22:39:21,191 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:39:21,191 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:39:21,192 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:39:21,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:39:21,192 INFO L82 PathProgramCache]: Analyzing trace with hash -26103830, now seen corresponding path program 23 times [2018-10-12 22:39:21,193 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:39:21,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:39:28,512 INFO L134 CoverageAnalysis]: Checked inductivity of 30437 backedges. 0 proven. 29589 refuted. 0 times theorem prover too weak. 848 trivial. 0 not checked. [2018-10-12 22:39:28,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:39:28,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-10-12 22:39:28,513 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-12 22:39:28,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-12 22:39:28,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=516, Invalid=2346, Unknown=0, NotChecked=0, Total=2862 [2018-10-12 22:39:28,513 INFO L87 Difference]: Start difference. First operand 1412 states and 1432 transitions. Second operand 54 states. [2018-10-12 22:39:52,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:39:52,904 INFO L93 Difference]: Finished difference Result 1667 states and 1691 transitions. [2018-10-12 22:39:52,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 243 states. [2018-10-12 22:39:52,904 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 1411 [2018-10-12 22:39:52,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:39:52,909 INFO L225 Difference]: With dead ends: 1667 [2018-10-12 22:39:52,910 INFO L226 Difference]: Without dead ends: 1667 [2018-10-12 22:39:52,914 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 291 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33220 ImplicationChecksByTransitivity, 23.7s TimeCoverageRelationStatistics Valid=14645, Invalid=70911, Unknown=0, NotChecked=0, Total=85556 [2018-10-12 22:39:52,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2018-10-12 22:39:52,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1483. [2018-10-12 22:39:52,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1483 states. [2018-10-12 22:39:52,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1483 states to 1483 states and 1504 transitions. [2018-10-12 22:39:52,927 INFO L78 Accepts]: Start accepts. Automaton has 1483 states and 1504 transitions. Word has length 1411 [2018-10-12 22:39:52,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:39:52,928 INFO L481 AbstractCegarLoop]: Abstraction has 1483 states and 1504 transitions. [2018-10-12 22:39:52,928 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-12 22:39:52,928 INFO L276 IsEmpty]: Start isEmpty. Operand 1483 states and 1504 transitions. [2018-10-12 22:39:52,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1483 [2018-10-12 22:39:52,948 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:39:52,948 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:39:52,949 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:39:52,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:39:52,949 INFO L82 PathProgramCache]: Analyzing trace with hash -181737041, now seen corresponding path program 24 times [2018-10-12 22:39:52,950 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:39:53,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:40:01,082 INFO L134 CoverageAnalysis]: Checked inductivity of 33708 backedges. 0 proven. 32812 refuted. 0 times theorem prover too weak. 896 trivial. 0 not checked. [2018-10-12 22:40:01,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:40:01,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-10-12 22:40:01,084 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-12 22:40:01,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-12 22:40:01,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=2519, Unknown=0, NotChecked=0, Total=3080 [2018-10-12 22:40:01,085 INFO L87 Difference]: Start difference. First operand 1483 states and 1504 transitions. Second operand 56 states. [2018-10-12 22:40:27,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:40:27,332 INFO L93 Difference]: Finished difference Result 1738 states and 1763 transitions. [2018-10-12 22:40:27,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 254 states. [2018-10-12 22:40:27,332 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 1482 [2018-10-12 22:40:27,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:40:27,337 INFO L225 Difference]: With dead ends: 1738 [2018-10-12 22:40:27,338 INFO L226 Difference]: Without dead ends: 1738 [2018-10-12 22:40:27,342 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 304 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36447 ImplicationChecksByTransitivity, 24.7s TimeCoverageRelationStatistics Valid=15956, Invalid=77374, Unknown=0, NotChecked=0, Total=93330 [2018-10-12 22:40:27,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2018-10-12 22:40:27,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1554. [2018-10-12 22:40:27,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1554 states. [2018-10-12 22:40:27,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1554 states to 1554 states and 1576 transitions. [2018-10-12 22:40:27,355 INFO L78 Accepts]: Start accepts. Automaton has 1554 states and 1576 transitions. Word has length 1482 [2018-10-12 22:40:27,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:40:27,356 INFO L481 AbstractCegarLoop]: Abstraction has 1554 states and 1576 transitions. [2018-10-12 22:40:27,356 INFO L482 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-12 22:40:27,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1554 states and 1576 transitions. [2018-10-12 22:40:27,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1554 [2018-10-12 22:40:27,377 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:40:27,377 INFO L375 BasicCegarLoop]: trace histogram [63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 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-12 22:40:27,378 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:40:27,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:40:27,378 INFO L82 PathProgramCache]: Analyzing trace with hash -636174262, now seen corresponding path program 25 times [2018-10-12 22:40:27,379 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:40:27,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:40:36,035 INFO L134 CoverageAnalysis]: Checked inductivity of 37146 backedges. 0 proven. 36202 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2018-10-12 22:40:36,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:40:36,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-10-12 22:40:36,037 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-12 22:40:36,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-12 22:40:36,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=608, Invalid=2698, Unknown=0, NotChecked=0, Total=3306 [2018-10-12 22:40:36,037 INFO L87 Difference]: Start difference. First operand 1554 states and 1576 transitions. Second operand 58 states. [2018-10-12 22:41:04,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:41:04,233 INFO L93 Difference]: Finished difference Result 1809 states and 1835 transitions. [2018-10-12 22:41:04,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 265 states. [2018-10-12 22:41:04,233 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 1553 [2018-10-12 22:41:04,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:41:04,240 INFO L225 Difference]: With dead ends: 1809 [2018-10-12 22:41:04,240 INFO L226 Difference]: Without dead ends: 1809 [2018-10-12 22:41:04,246 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 317 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39824 ImplicationChecksByTransitivity, 26.6s TimeCoverageRelationStatistics Valid=17324, Invalid=84118, Unknown=0, NotChecked=0, Total=101442 [2018-10-12 22:41:04,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2018-10-12 22:41:04,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1625. [2018-10-12 22:41:04,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1625 states. [2018-10-12 22:41:04,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1625 states to 1625 states and 1648 transitions. [2018-10-12 22:41:04,258 INFO L78 Accepts]: Start accepts. Automaton has 1625 states and 1648 transitions. Word has length 1553 [2018-10-12 22:41:04,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:41:04,259 INFO L481 AbstractCegarLoop]: Abstraction has 1625 states and 1648 transitions. [2018-10-12 22:41:04,259 INFO L482 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-12 22:41:04,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1625 states and 1648 transitions. [2018-10-12 22:41:04,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1625 [2018-10-12 22:41:04,278 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:41:04,279 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 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-12 22:41:04,279 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:41:04,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:41:04,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1803136335, now seen corresponding path program 26 times [2018-10-12 22:41:04,280 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:41:04,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:41:13,287 INFO L134 CoverageAnalysis]: Checked inductivity of 40751 backedges. 0 proven. 39759 refuted. 0 times theorem prover too weak. 992 trivial. 0 not checked. [2018-10-12 22:41:13,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:41:13,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-10-12 22:41:13,289 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-12 22:41:13,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-12 22:41:13,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=657, Invalid=2883, Unknown=0, NotChecked=0, Total=3540 [2018-10-12 22:41:13,290 INFO L87 Difference]: Start difference. First operand 1625 states and 1648 transitions. Second operand 60 states. [2018-10-12 22:41:25,945 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 37 [2018-10-12 22:41:43,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:41:43,270 INFO L93 Difference]: Finished difference Result 1880 states and 1907 transitions. [2018-10-12 22:41:43,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 276 states. [2018-10-12 22:41:43,270 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 1624 [2018-10-12 22:41:43,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:41:43,276 INFO L225 Difference]: With dead ends: 1880 [2018-10-12 22:41:43,276 INFO L226 Difference]: Without dead ends: 1880 [2018-10-12 22:41:43,278 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 330 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43351 ImplicationChecksByTransitivity, 28.0s TimeCoverageRelationStatistics Valid=18749, Invalid=91143, Unknown=0, NotChecked=0, Total=109892 [2018-10-12 22:41:43,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1880 states. [2018-10-12 22:41:43,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1880 to 1696. [2018-10-12 22:41:43,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1696 states. [2018-10-12 22:41:43,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1696 states to 1696 states and 1720 transitions. [2018-10-12 22:41:43,290 INFO L78 Accepts]: Start accepts. Automaton has 1696 states and 1720 transitions. Word has length 1624 [2018-10-12 22:41:43,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:41:43,290 INFO L481 AbstractCegarLoop]: Abstraction has 1696 states and 1720 transitions. [2018-10-12 22:41:43,290 INFO L482 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-12 22:41:43,291 INFO L276 IsEmpty]: Start isEmpty. Operand 1696 states and 1720 transitions. [2018-10-12 22:41:43,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1696 [2018-10-12 22:41:43,308 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:41:43,308 INFO L375 BasicCegarLoop]: trace histogram [69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 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-12 22:41:43,309 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:41:43,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:41:43,309 INFO L82 PathProgramCache]: Analyzing trace with hash 377333930, now seen corresponding path program 27 times [2018-10-12 22:41:43,310 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:41:43,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:41:52,837 INFO L134 CoverageAnalysis]: Checked inductivity of 44523 backedges. 0 proven. 43483 refuted. 0 times theorem prover too weak. 1040 trivial. 0 not checked. [2018-10-12 22:41:52,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:41:52,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-10-12 22:41:52,839 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-12 22:41:52,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-12 22:41:52,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=708, Invalid=3074, Unknown=0, NotChecked=0, Total=3782 [2018-10-12 22:41:52,840 INFO L87 Difference]: Start difference. First operand 1696 states and 1720 transitions. Second operand 62 states. [2018-10-12 22:42:23,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:42:23,348 INFO L93 Difference]: Finished difference Result 1951 states and 1979 transitions. [2018-10-12 22:42:23,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 287 states. [2018-10-12 22:42:23,349 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 1695 [2018-10-12 22:42:23,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:42:23,355 INFO L225 Difference]: With dead ends: 1951 [2018-10-12 22:42:23,355 INFO L226 Difference]: Without dead ends: 1951 [2018-10-12 22:42:23,361 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 343 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47028 ImplicationChecksByTransitivity, 29.6s TimeCoverageRelationStatistics Valid=20231, Invalid=98449, Unknown=0, NotChecked=0, Total=118680 [2018-10-12 22:42:23,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1951 states. [2018-10-12 22:42:23,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1951 to 1767. [2018-10-12 22:42:23,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1767 states. [2018-10-12 22:42:23,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1767 states to 1767 states and 1792 transitions. [2018-10-12 22:42:23,374 INFO L78 Accepts]: Start accepts. Automaton has 1767 states and 1792 transitions. Word has length 1695 [2018-10-12 22:42:23,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:42:23,375 INFO L481 AbstractCegarLoop]: Abstraction has 1767 states and 1792 transitions. [2018-10-12 22:42:23,375 INFO L482 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-12 22:42:23,375 INFO L276 IsEmpty]: Start isEmpty. Operand 1767 states and 1792 transitions. [2018-10-12 22:42:23,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1767 [2018-10-12 22:42:23,399 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:42:23,400 INFO L375 BasicCegarLoop]: trace histogram [72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 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-12 22:42:23,400 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:42:23,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:42:23,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1174431505, now seen corresponding path program 28 times [2018-10-12 22:42:23,401 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:42:23,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:42:33,902 INFO L134 CoverageAnalysis]: Checked inductivity of 48462 backedges. 0 proven. 47374 refuted. 0 times theorem prover too weak. 1088 trivial. 0 not checked. [2018-10-12 22:42:33,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:42:33,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-10-12 22:42:33,904 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-12 22:42:33,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-12 22:42:33,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=761, Invalid=3271, Unknown=0, NotChecked=0, Total=4032 [2018-10-12 22:42:33,905 INFO L87 Difference]: Start difference. First operand 1767 states and 1792 transitions. Second operand 64 states. [2018-10-12 22:43:06,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:43:06,053 INFO L93 Difference]: Finished difference Result 2022 states and 2051 transitions. [2018-10-12 22:43:06,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 298 states. [2018-10-12 22:43:06,053 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 1766 [2018-10-12 22:43:06,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:43:06,059 INFO L225 Difference]: With dead ends: 2022 [2018-10-12 22:43:06,059 INFO L226 Difference]: Without dead ends: 2022 [2018-10-12 22:43:06,062 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 356 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50855 ImplicationChecksByTransitivity, 31.6s TimeCoverageRelationStatistics Valid=21770, Invalid=106036, Unknown=0, NotChecked=0, Total=127806 [2018-10-12 22:43:06,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2022 states. [2018-10-12 22:43:06,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2022 to 1838. [2018-10-12 22:43:06,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2018-10-12 22:43:06,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 1864 transitions. [2018-10-12 22:43:06,075 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 1864 transitions. Word has length 1766 [2018-10-12 22:43:06,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:43:06,076 INFO L481 AbstractCegarLoop]: Abstraction has 1838 states and 1864 transitions. [2018-10-12 22:43:06,076 INFO L482 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-12 22:43:06,076 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 1864 transitions. [2018-10-12 22:43:06,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1838 [2018-10-12 22:43:06,095 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:43:06,096 INFO L375 BasicCegarLoop]: trace histogram [75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 75, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 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-12 22:43:06,096 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:43:06,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:43:06,096 INFO L82 PathProgramCache]: Analyzing trace with hash 51538186, now seen corresponding path program 29 times [2018-10-12 22:43:06,097 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:43:06,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat