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/AutomizerBpl.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-b8f97f7-m [2018-10-10 15:17:20,505 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 15:17:20,507 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 15:17:20,526 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 15:17:20,526 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 15:17:20,527 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 15:17:20,529 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 15:17:20,531 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 15:17:20,532 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 15:17:20,533 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 15:17:20,534 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 15:17:20,535 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 15:17:20,536 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 15:17:20,537 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 15:17:20,538 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 15:17:20,538 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 15:17:20,539 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 15:17:20,541 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 15:17:20,543 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 15:17:20,545 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 15:17:20,546 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 15:17:20,547 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 15:17:20,549 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 15:17:20,550 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 15:17:20,550 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 15:17:20,551 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 15:17:20,552 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 15:17:20,552 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 15:17:20,553 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 15:17:20,554 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 15:17:20,554 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 15:17:20,555 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 15:17:20,555 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 15:17:20,555 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 15:17:20,556 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 15:17:20,557 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 15:17:20,557 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-10 15:17:20,576 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 15:17:20,576 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 15:17:20,577 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-10 15:17:20,577 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-10 15:17:20,578 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-10 15:17:20,578 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-10 15:17:20,578 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 15:17:20,579 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-10 15:17:20,579 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 15:17:20,580 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-10 15:17:20,580 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-10 15:17:20,580 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-10 15:17:20,580 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-10 15:17:20,581 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-10 15:17:20,581 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-10 15:17:20,645 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 15:17:20,661 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 15:17:20,666 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 15:17:20,668 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-10 15:17:20,668 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-10 15:17:20,669 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl [2018-10-10 15:17:20,670 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl' [2018-10-10 15:17:20,765 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 15:17:20,767 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-10 15:17:20,768 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 15:17:20,768 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 15:17:20,768 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 15:17:20,793 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:17:20" (1/1) ... [2018-10-10 15:17:20,795 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:17:20" (1/1) ... [2018-10-10 15:17:20,808 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:17:20" (1/1) ... [2018-10-10 15:17:20,809 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:17:20" (1/1) ... [2018-10-10 15:17:20,815 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:17:20" (1/1) ... [2018-10-10 15:17:20,817 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:17:20" (1/1) ... [2018-10-10 15:17:20,819 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:17:20" (1/1) ... [2018-10-10 15:17:20,821 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 15:17:20,822 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 15:17:20,823 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 15:17:20,823 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 15:17:20,824 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:17:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-10 15:17:20,890 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-10 15:17:20,891 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 15:17:20,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 15:17:21,596 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 15:17:21,597 INFO L202 PluginConnector]: Adding new model ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 03:17:21 BoogieIcfgContainer [2018-10-10 15:17:21,597 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 15:17:21,599 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 15:17:21,599 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 15:17:21,602 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 15:17:21,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:17:20" (1/2) ... [2018-10-10 15:17:21,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c4fa963 and model type ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 03:17:21, skipping insertion in model container [2018-10-10 15:17:21,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 03:17:21" (2/2) ... [2018-10-10 15:17:21,606 INFO L112 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl [2018-10-10 15:17:21,616 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-10 15:17:21,626 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-10 15:17:21,643 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-10 15:17:21,672 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 15:17:21,673 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 15:17:21,673 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 15:17:21,673 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-10 15:17:21,674 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 15:17:21,674 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 15:17:21,674 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 15:17:21,674 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 15:17:21,674 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 15:17:21,698 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states. [2018-10-10 15:17:21,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-10 15:17:21,710 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:21,711 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:21,712 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:21,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:21,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1350835290, now seen corresponding path program 1 times [2018-10-10 15:17:21,771 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:21,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:21,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:21,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 15:17:21,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-10 15:17:21,882 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-10 15:17:21,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-10 15:17:21,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-10 15:17:21,898 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 3 states. [2018-10-10 15:17:22,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:22,082 INFO L93 Difference]: Finished difference Result 197 states and 201 transitions. [2018-10-10 15:17:22,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-10 15:17:22,083 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-10-10 15:17:22,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:22,097 INFO L225 Difference]: With dead ends: 197 [2018-10-10 15:17:22,098 INFO L226 Difference]: Without dead ends: 197 [2018-10-10 15:17:22,100 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-10 15:17:22,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-10-10 15:17:22,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 112. [2018-10-10 15:17:22,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-10-10 15:17:22,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 114 transitions. [2018-10-10 15:17:22,152 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 114 transitions. Word has length 24 [2018-10-10 15:17:22,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:22,153 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 114 transitions. [2018-10-10 15:17:22,153 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-10 15:17:22,153 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 114 transitions. [2018-10-10 15:17:22,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-10 15:17:22,156 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:22,156 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:22,157 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:22,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:22,157 INFO L82 PathProgramCache]: Analyzing trace with hash -886221148, now seen corresponding path program 1 times [2018-10-10 15:17:22,158 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:22,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:22,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:22,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:22,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-10 15:17:22,409 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 15:17:22,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 15:17:22,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-10 15:17:22,413 INFO L87 Difference]: Start difference. First operand 112 states and 114 transitions. Second operand 5 states. [2018-10-10 15:17:22,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:22,586 INFO L93 Difference]: Finished difference Result 284 states and 290 transitions. [2018-10-10 15:17:22,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 15:17:22,587 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2018-10-10 15:17:22,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:22,591 INFO L225 Difference]: With dead ends: 284 [2018-10-10 15:17:22,591 INFO L226 Difference]: Without dead ends: 284 [2018-10-10 15:17:22,592 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-10 15:17:22,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-10-10 15:17:22,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 199. [2018-10-10 15:17:22,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-10-10 15:17:22,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 203 transitions. [2018-10-10 15:17:22,634 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 203 transitions. Word has length 78 [2018-10-10 15:17:22,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:22,635 INFO L481 AbstractCegarLoop]: Abstraction has 199 states and 203 transitions. [2018-10-10 15:17:22,635 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 15:17:22,635 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 203 transitions. [2018-10-10 15:17:22,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-10 15:17:22,646 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:22,646 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:22,647 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:22,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:22,647 INFO L82 PathProgramCache]: Analyzing trace with hash 667016994, now seen corresponding path program 2 times [2018-10-10 15:17:22,650 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:22,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:22,920 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:22,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:22,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-10 15:17:22,921 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 15:17:22,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 15:17:22,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-10 15:17:22,922 INFO L87 Difference]: Start difference. First operand 199 states and 203 transitions. Second operand 7 states. [2018-10-10 15:17:23,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:23,382 INFO L93 Difference]: Finished difference Result 371 states and 379 transitions. [2018-10-10 15:17:23,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-10 15:17:23,383 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 132 [2018-10-10 15:17:23,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:23,388 INFO L225 Difference]: With dead ends: 371 [2018-10-10 15:17:23,388 INFO L226 Difference]: Without dead ends: 371 [2018-10-10 15:17:23,389 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-10-10 15:17:23,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-10-10 15:17:23,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 286. [2018-10-10 15:17:23,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-10-10 15:17:23,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 292 transitions. [2018-10-10 15:17:23,412 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 292 transitions. Word has length 132 [2018-10-10 15:17:23,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:23,413 INFO L481 AbstractCegarLoop]: Abstraction has 286 states and 292 transitions. [2018-10-10 15:17:23,413 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 15:17:23,418 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 292 transitions. [2018-10-10 15:17:23,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-10-10 15:17:23,424 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:23,425 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:23,425 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:23,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:23,429 INFO L82 PathProgramCache]: Analyzing trace with hash -232628960, now seen corresponding path program 3 times [2018-10-10 15:17:23,430 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:23,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:24,052 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:24,053 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:24,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-10 15:17:24,054 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 15:17:24,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 15:17:24,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-10-10 15:17:24,055 INFO L87 Difference]: Start difference. First operand 286 states and 292 transitions. Second operand 9 states. [2018-10-10 15:17:24,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:24,475 INFO L93 Difference]: Finished difference Result 458 states and 468 transitions. [2018-10-10 15:17:24,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-10 15:17:24,475 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 186 [2018-10-10 15:17:24,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:24,479 INFO L225 Difference]: With dead ends: 458 [2018-10-10 15:17:24,479 INFO L226 Difference]: Without dead ends: 458 [2018-10-10 15:17:24,480 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2018-10-10 15:17:24,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2018-10-10 15:17:24,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 373. [2018-10-10 15:17:24,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-10-10 15:17:24,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 381 transitions. [2018-10-10 15:17:24,503 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 381 transitions. Word has length 186 [2018-10-10 15:17:24,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:24,504 INFO L481 AbstractCegarLoop]: Abstraction has 373 states and 381 transitions. [2018-10-10 15:17:24,504 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 15:17:24,505 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 381 transitions. [2018-10-10 15:17:24,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-10-10 15:17:24,520 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:24,521 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:24,521 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:24,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:24,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1674555550, now seen corresponding path program 4 times [2018-10-10 15:17:24,522 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:24,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:24,958 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 0 proven. 328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:24,958 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:24,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-10 15:17:24,959 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-10 15:17:24,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-10 15:17:24,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-10-10 15:17:24,960 INFO L87 Difference]: Start difference. First operand 373 states and 381 transitions. Second operand 11 states. [2018-10-10 15:17:25,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:25,305 INFO L93 Difference]: Finished difference Result 545 states and 557 transitions. [2018-10-10 15:17:25,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-10 15:17:25,306 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 240 [2018-10-10 15:17:25,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:25,309 INFO L225 Difference]: With dead ends: 545 [2018-10-10 15:17:25,309 INFO L226 Difference]: Without dead ends: 545 [2018-10-10 15:17:25,310 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=219, Unknown=0, NotChecked=0, Total=342 [2018-10-10 15:17:25,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2018-10-10 15:17:25,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 460. [2018-10-10 15:17:25,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-10-10 15:17:25,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 470 transitions. [2018-10-10 15:17:25,322 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 470 transitions. Word has length 240 [2018-10-10 15:17:25,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:25,323 INFO L481 AbstractCegarLoop]: Abstraction has 460 states and 470 transitions. [2018-10-10 15:17:25,323 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-10 15:17:25,323 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 470 transitions. [2018-10-10 15:17:25,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-10-10 15:17:25,328 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:25,329 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:25,329 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:25,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:25,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1625471388, now seen corresponding path program 5 times [2018-10-10 15:17:25,330 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:25,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:25,868 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 0 proven. 545 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:25,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:25,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-10 15:17:25,870 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-10 15:17:25,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-10 15:17:25,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-10-10 15:17:25,871 INFO L87 Difference]: Start difference. First operand 460 states and 470 transitions. Second operand 13 states. [2018-10-10 15:17:26,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:26,331 INFO L93 Difference]: Finished difference Result 632 states and 646 transitions. [2018-10-10 15:17:26,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-10 15:17:26,332 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 294 [2018-10-10 15:17:26,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:26,336 INFO L225 Difference]: With dead ends: 632 [2018-10-10 15:17:26,336 INFO L226 Difference]: Without dead ends: 632 [2018-10-10 15:17:26,337 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=178, Invalid=328, Unknown=0, NotChecked=0, Total=506 [2018-10-10 15:17:26,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2018-10-10 15:17:26,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 547. [2018-10-10 15:17:26,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2018-10-10 15:17:26,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 559 transitions. [2018-10-10 15:17:26,347 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 559 transitions. Word has length 294 [2018-10-10 15:17:26,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:26,347 INFO L481 AbstractCegarLoop]: Abstraction has 547 states and 559 transitions. [2018-10-10 15:17:26,347 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-10 15:17:26,348 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 559 transitions. [2018-10-10 15:17:26,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2018-10-10 15:17:26,352 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:26,353 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:26,353 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:26,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:26,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1777575910, now seen corresponding path program 6 times [2018-10-10 15:17:26,354 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:26,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:26,737 INFO L134 CoverageAnalysis]: Checked inductivity of 816 backedges. 0 proven. 816 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:26,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:26,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-10 15:17:26,738 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-10 15:17:26,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-10 15:17:26,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-10-10 15:17:26,739 INFO L87 Difference]: Start difference. First operand 547 states and 559 transitions. Second operand 15 states. [2018-10-10 15:17:27,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:27,196 INFO L93 Difference]: Finished difference Result 719 states and 735 transitions. [2018-10-10 15:17:27,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-10 15:17:27,196 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 348 [2018-10-10 15:17:27,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:27,200 INFO L225 Difference]: With dead ends: 719 [2018-10-10 15:17:27,200 INFO L226 Difference]: Without dead ends: 719 [2018-10-10 15:17:27,201 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=243, Invalid=459, Unknown=0, NotChecked=0, Total=702 [2018-10-10 15:17:27,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2018-10-10 15:17:27,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 634. [2018-10-10 15:17:27,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2018-10-10 15:17:27,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 648 transitions. [2018-10-10 15:17:27,213 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 648 transitions. Word has length 348 [2018-10-10 15:17:27,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:27,213 INFO L481 AbstractCegarLoop]: Abstraction has 634 states and 648 transitions. [2018-10-10 15:17:27,214 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-10 15:17:27,214 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 648 transitions. [2018-10-10 15:17:27,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2018-10-10 15:17:27,216 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:27,217 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:27,217 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:27,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:27,218 INFO L82 PathProgramCache]: Analyzing trace with hash 378891288, now seen corresponding path program 7 times [2018-10-10 15:17:27,218 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:27,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:28,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1141 backedges. 0 proven. 1141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:28,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:28,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-10 15:17:28,492 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-10 15:17:28,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-10 15:17:28,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2018-10-10 15:17:28,493 INFO L87 Difference]: Start difference. First operand 634 states and 648 transitions. Second operand 17 states. [2018-10-10 15:17:30,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:30,438 INFO L93 Difference]: Finished difference Result 806 states and 824 transitions. [2018-10-10 15:17:30,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-10 15:17:30,439 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 402 [2018-10-10 15:17:30,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:30,443 INFO L225 Difference]: With dead ends: 806 [2018-10-10 15:17:30,443 INFO L226 Difference]: Without dead ends: 806 [2018-10-10 15:17:30,444 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=318, Invalid=612, Unknown=0, NotChecked=0, Total=930 [2018-10-10 15:17:30,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2018-10-10 15:17:30,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 721. [2018-10-10 15:17:30,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2018-10-10 15:17:30,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 737 transitions. [2018-10-10 15:17:30,457 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 737 transitions. Word has length 402 [2018-10-10 15:17:30,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:30,458 INFO L481 AbstractCegarLoop]: Abstraction has 721 states and 737 transitions. [2018-10-10 15:17:30,458 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-10 15:17:30,458 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 737 transitions. [2018-10-10 15:17:30,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2018-10-10 15:17:30,462 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:30,462 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:30,463 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:30,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:30,463 INFO L82 PathProgramCache]: Analyzing trace with hash 2053035414, now seen corresponding path program 8 times [2018-10-10 15:17:30,464 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:30,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:31,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 0 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:31,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:31,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-10 15:17:31,629 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-10 15:17:31,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-10 15:17:31,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2018-10-10 15:17:31,630 INFO L87 Difference]: Start difference. First operand 721 states and 737 transitions. Second operand 19 states. [2018-10-10 15:17:32,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:32,278 INFO L93 Difference]: Finished difference Result 893 states and 913 transitions. [2018-10-10 15:17:32,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-10 15:17:32,279 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 456 [2018-10-10 15:17:32,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:32,284 INFO L225 Difference]: With dead ends: 893 [2018-10-10 15:17:32,284 INFO L226 Difference]: Without dead ends: 893 [2018-10-10 15:17:32,285 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=403, Invalid=787, Unknown=0, NotChecked=0, Total=1190 [2018-10-10 15:17:32,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2018-10-10 15:17:32,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 808. [2018-10-10 15:17:32,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2018-10-10 15:17:32,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 826 transitions. [2018-10-10 15:17:32,298 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 826 transitions. Word has length 456 [2018-10-10 15:17:32,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:32,299 INFO L481 AbstractCegarLoop]: Abstraction has 808 states and 826 transitions. [2018-10-10 15:17:32,299 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-10 15:17:32,299 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 826 transitions. [2018-10-10 15:17:32,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 511 [2018-10-10 15:17:32,303 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:32,303 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:32,304 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:32,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:32,304 INFO L82 PathProgramCache]: Analyzing trace with hash 2078373012, now seen corresponding path program 9 times [2018-10-10 15:17:32,305 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:32,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:34,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:34,196 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:34,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-10 15:17:34,197 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-10 15:17:34,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-10 15:17:34,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2018-10-10 15:17:34,198 INFO L87 Difference]: Start difference. First operand 808 states and 826 transitions. Second operand 21 states. [2018-10-10 15:17:34,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:34,834 INFO L93 Difference]: Finished difference Result 980 states and 1002 transitions. [2018-10-10 15:17:34,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-10 15:17:34,839 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 510 [2018-10-10 15:17:34,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:34,843 INFO L225 Difference]: With dead ends: 980 [2018-10-10 15:17:34,844 INFO L226 Difference]: Without dead ends: 980 [2018-10-10 15:17:34,844 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=498, Invalid=984, Unknown=0, NotChecked=0, Total=1482 [2018-10-10 15:17:34,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states. [2018-10-10 15:17:34,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 895. [2018-10-10 15:17:34,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2018-10-10 15:17:34,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 915 transitions. [2018-10-10 15:17:34,859 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 915 transitions. Word has length 510 [2018-10-10 15:17:34,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:34,860 INFO L481 AbstractCegarLoop]: Abstraction has 895 states and 915 transitions. [2018-10-10 15:17:34,860 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-10 15:17:34,860 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 915 transitions. [2018-10-10 15:17:34,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 565 [2018-10-10 15:17:34,864 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:34,864 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:34,864 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:34,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:34,865 INFO L82 PathProgramCache]: Analyzing trace with hash 372123922, now seen corresponding path program 10 times [2018-10-10 15:17:34,866 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:34,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:36,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2440 backedges. 0 proven. 2440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:36,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:36,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-10 15:17:36,297 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-10 15:17:36,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-10 15:17:36,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2018-10-10 15:17:36,298 INFO L87 Difference]: Start difference. First operand 895 states and 915 transitions. Second operand 23 states. [2018-10-10 15:17:37,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:37,017 INFO L93 Difference]: Finished difference Result 1067 states and 1091 transitions. [2018-10-10 15:17:37,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-10 15:17:37,017 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 564 [2018-10-10 15:17:37,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:37,023 INFO L225 Difference]: With dead ends: 1067 [2018-10-10 15:17:37,023 INFO L226 Difference]: Without dead ends: 1067 [2018-10-10 15:17:37,024 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=603, Invalid=1203, Unknown=0, NotChecked=0, Total=1806 [2018-10-10 15:17:37,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2018-10-10 15:17:37,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 982. [2018-10-10 15:17:37,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 982 states. [2018-10-10 15:17:37,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1004 transitions. [2018-10-10 15:17:37,038 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1004 transitions. Word has length 564 [2018-10-10 15:17:37,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:37,039 INFO L481 AbstractCegarLoop]: Abstraction has 982 states and 1004 transitions. [2018-10-10 15:17:37,039 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-10 15:17:37,039 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1004 transitions. [2018-10-10 15:17:37,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 619 [2018-10-10 15:17:37,043 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:37,044 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:37,044 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:37,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:37,045 INFO L82 PathProgramCache]: Analyzing trace with hash 586011408, now seen corresponding path program 11 times [2018-10-10 15:17:37,045 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:37,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:37,907 INFO L134 CoverageAnalysis]: Checked inductivity of 2981 backedges. 0 proven. 2981 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:37,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:37,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-10 15:17:37,908 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-10 15:17:37,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-10 15:17:37,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2018-10-10 15:17:37,909 INFO L87 Difference]: Start difference. First operand 982 states and 1004 transitions. Second operand 25 states. [2018-10-10 15:17:38,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:38,743 INFO L93 Difference]: Finished difference Result 1154 states and 1180 transitions. [2018-10-10 15:17:38,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-10 15:17:38,743 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 618 [2018-10-10 15:17:38,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:38,749 INFO L225 Difference]: With dead ends: 1154 [2018-10-10 15:17:38,749 INFO L226 Difference]: Without dead ends: 1154 [2018-10-10 15:17:38,750 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=718, Invalid=1444, Unknown=0, NotChecked=0, Total=2162 [2018-10-10 15:17:38,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2018-10-10 15:17:38,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1069. [2018-10-10 15:17:38,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1069 states. [2018-10-10 15:17:38,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 1093 transitions. [2018-10-10 15:17:38,765 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 1093 transitions. Word has length 618 [2018-10-10 15:17:38,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:38,767 INFO L481 AbstractCegarLoop]: Abstraction has 1069 states and 1093 transitions. [2018-10-10 15:17:38,767 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-10 15:17:38,767 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1093 transitions. [2018-10-10 15:17:38,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 673 [2018-10-10 15:17:38,774 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:38,774 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:38,775 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:38,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:38,775 INFO L82 PathProgramCache]: Analyzing trace with hash 2019644046, now seen corresponding path program 12 times [2018-10-10 15:17:38,776 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:38,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:39,852 INFO L134 CoverageAnalysis]: Checked inductivity of 3576 backedges. 0 proven. 3576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:39,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:39,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-10 15:17:39,854 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-10 15:17:39,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-10 15:17:39,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2018-10-10 15:17:39,855 INFO L87 Difference]: Start difference. First operand 1069 states and 1093 transitions. Second operand 27 states. [2018-10-10 15:17:41,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:41,221 INFO L93 Difference]: Finished difference Result 1241 states and 1269 transitions. [2018-10-10 15:17:41,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-10 15:17:41,221 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 672 [2018-10-10 15:17:41,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:41,227 INFO L225 Difference]: With dead ends: 1241 [2018-10-10 15:17:41,227 INFO L226 Difference]: Without dead ends: 1241 [2018-10-10 15:17:41,229 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=843, Invalid=1707, Unknown=0, NotChecked=0, Total=2550 [2018-10-10 15:17:41,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2018-10-10 15:17:41,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 1156. [2018-10-10 15:17:41,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1156 states. [2018-10-10 15:17:41,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1182 transitions. [2018-10-10 15:17:41,244 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1182 transitions. Word has length 672 [2018-10-10 15:17:41,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:41,245 INFO L481 AbstractCegarLoop]: Abstraction has 1156 states and 1182 transitions. [2018-10-10 15:17:41,245 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-10 15:17:41,245 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1182 transitions. [2018-10-10 15:17:41,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 727 [2018-10-10 15:17:41,251 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:41,252 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:41,252 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:41,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:41,253 INFO L82 PathProgramCache]: Analyzing trace with hash -2023651444, now seen corresponding path program 13 times [2018-10-10 15:17:41,253 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:41,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:42,943 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 0 proven. 4225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:42,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:42,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-10 15:17:42,944 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-10 15:17:42,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-10 15:17:42,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=588, Unknown=0, NotChecked=0, Total=812 [2018-10-10 15:17:42,945 INFO L87 Difference]: Start difference. First operand 1156 states and 1182 transitions. Second operand 29 states. [2018-10-10 15:17:44,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:44,538 INFO L93 Difference]: Finished difference Result 1328 states and 1358 transitions. [2018-10-10 15:17:44,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-10 15:17:44,538 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 726 [2018-10-10 15:17:44,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:44,543 INFO L225 Difference]: With dead ends: 1328 [2018-10-10 15:17:44,543 INFO L226 Difference]: Without dead ends: 1328 [2018-10-10 15:17:44,544 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=978, Invalid=1992, Unknown=0, NotChecked=0, Total=2970 [2018-10-10 15:17:44,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1328 states. [2018-10-10 15:17:44,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1328 to 1243. [2018-10-10 15:17:44,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1243 states. [2018-10-10 15:17:44,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1243 states to 1243 states and 1271 transitions. [2018-10-10 15:17:44,560 INFO L78 Accepts]: Start accepts. Automaton has 1243 states and 1271 transitions. Word has length 726 [2018-10-10 15:17:44,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:44,561 INFO L481 AbstractCegarLoop]: Abstraction has 1243 states and 1271 transitions. [2018-10-10 15:17:44,561 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-10 15:17:44,561 INFO L276 IsEmpty]: Start isEmpty. Operand 1243 states and 1271 transitions. [2018-10-10 15:17:44,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 781 [2018-10-10 15:17:44,567 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:44,568 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:44,568 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:44,568 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:44,569 INFO L82 PathProgramCache]: Analyzing trace with hash 2036290058, now seen corresponding path program 14 times [2018-10-10 15:17:44,570 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:44,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:47,992 INFO L134 CoverageAnalysis]: Checked inductivity of 4928 backedges. 0 proven. 4928 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:47,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:47,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-10 15:17:47,993 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-10 15:17:47,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-10 15:17:47,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2018-10-10 15:17:47,994 INFO L87 Difference]: Start difference. First operand 1243 states and 1271 transitions. Second operand 31 states. [2018-10-10 15:17:49,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:49,268 INFO L93 Difference]: Finished difference Result 1415 states and 1447 transitions. [2018-10-10 15:17:49,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-10 15:17:49,268 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 780 [2018-10-10 15:17:49,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:49,275 INFO L225 Difference]: With dead ends: 1415 [2018-10-10 15:17:49,275 INFO L226 Difference]: Without dead ends: 1415 [2018-10-10 15:17:49,276 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1123, Invalid=2299, Unknown=0, NotChecked=0, Total=3422 [2018-10-10 15:17:49,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2018-10-10 15:17:49,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 1330. [2018-10-10 15:17:49,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1330 states. [2018-10-10 15:17:49,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1360 transitions. [2018-10-10 15:17:49,293 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 1360 transitions. Word has length 780 [2018-10-10 15:17:49,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:49,294 INFO L481 AbstractCegarLoop]: Abstraction has 1330 states and 1360 transitions. [2018-10-10 15:17:49,294 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-10 15:17:49,294 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1360 transitions. [2018-10-10 15:17:49,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 835 [2018-10-10 15:17:49,302 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:49,302 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:49,303 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:49,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:49,303 INFO L82 PathProgramCache]: Analyzing trace with hash -832335352, now seen corresponding path program 15 times [2018-10-10 15:17:49,304 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:49,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:51,258 INFO L134 CoverageAnalysis]: Checked inductivity of 5685 backedges. 0 proven. 5685 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:51,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:51,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-10 15:17:51,260 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-10 15:17:51,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-10 15:17:51,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2018-10-10 15:17:51,261 INFO L87 Difference]: Start difference. First operand 1330 states and 1360 transitions. Second operand 33 states. [2018-10-10 15:17:52,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:52,359 INFO L93 Difference]: Finished difference Result 1502 states and 1536 transitions. [2018-10-10 15:17:52,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-10 15:17:52,360 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 834 [2018-10-10 15:17:52,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:52,365 INFO L225 Difference]: With dead ends: 1502 [2018-10-10 15:17:52,365 INFO L226 Difference]: Without dead ends: 1502 [2018-10-10 15:17:52,367 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1278, Invalid=2628, Unknown=0, NotChecked=0, Total=3906 [2018-10-10 15:17:52,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2018-10-10 15:17:52,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1417. [2018-10-10 15:17:52,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1417 states. [2018-10-10 15:17:52,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1417 states to 1417 states and 1449 transitions. [2018-10-10 15:17:52,384 INFO L78 Accepts]: Start accepts. Automaton has 1417 states and 1449 transitions. Word has length 834 [2018-10-10 15:17:52,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:52,384 INFO L481 AbstractCegarLoop]: Abstraction has 1417 states and 1449 transitions. [2018-10-10 15:17:52,384 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-10 15:17:52,385 INFO L276 IsEmpty]: Start isEmpty. Operand 1417 states and 1449 transitions. [2018-10-10 15:17:52,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 889 [2018-10-10 15:17:52,392 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:52,393 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:52,393 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:52,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:52,394 INFO L82 PathProgramCache]: Analyzing trace with hash 2064590726, now seen corresponding path program 16 times [2018-10-10 15:17:52,394 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:52,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:54,757 INFO L134 CoverageAnalysis]: Checked inductivity of 6496 backedges. 0 proven. 6496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:54,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:54,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-10 15:17:54,758 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-10 15:17:54,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-10 15:17:54,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2018-10-10 15:17:54,759 INFO L87 Difference]: Start difference. First operand 1417 states and 1449 transitions. Second operand 35 states. [2018-10-10 15:17:55,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:55,933 INFO L93 Difference]: Finished difference Result 1589 states and 1625 transitions. [2018-10-10 15:17:55,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-10 15:17:55,933 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 888 [2018-10-10 15:17:55,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:55,938 INFO L225 Difference]: With dead ends: 1589 [2018-10-10 15:17:55,938 INFO L226 Difference]: Without dead ends: 1589 [2018-10-10 15:17:55,940 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1443, Invalid=2979, Unknown=0, NotChecked=0, Total=4422 [2018-10-10 15:17:55,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1589 states. [2018-10-10 15:17:55,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1589 to 1504. [2018-10-10 15:17:55,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1504 states. [2018-10-10 15:17:55,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1504 states to 1504 states and 1538 transitions. [2018-10-10 15:17:55,957 INFO L78 Accepts]: Start accepts. Automaton has 1504 states and 1538 transitions. Word has length 888 [2018-10-10 15:17:55,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:55,958 INFO L481 AbstractCegarLoop]: Abstraction has 1504 states and 1538 transitions. [2018-10-10 15:17:55,958 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-10 15:17:55,958 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 1538 transitions. [2018-10-10 15:17:55,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 943 [2018-10-10 15:17:55,967 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:55,967 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:55,968 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:55,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:55,968 INFO L82 PathProgramCache]: Analyzing trace with hash -2036665724, now seen corresponding path program 17 times [2018-10-10 15:17:55,969 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:56,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:57,827 INFO L134 CoverageAnalysis]: Checked inductivity of 7361 backedges. 0 proven. 7361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:57,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:57,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-10 15:17:57,828 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-10 15:17:57,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-10 15:17:57,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2018-10-10 15:17:57,829 INFO L87 Difference]: Start difference. First operand 1504 states and 1538 transitions. Second operand 37 states. [2018-10-10 15:17:59,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:59,459 INFO L93 Difference]: Finished difference Result 1676 states and 1714 transitions. [2018-10-10 15:17:59,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-10 15:17:59,459 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 942 [2018-10-10 15:17:59,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:59,464 INFO L225 Difference]: With dead ends: 1676 [2018-10-10 15:17:59,464 INFO L226 Difference]: Without dead ends: 1676 [2018-10-10 15:17:59,466 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 833 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1618, Invalid=3352, Unknown=0, NotChecked=0, Total=4970 [2018-10-10 15:17:59,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1676 states. [2018-10-10 15:17:59,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1676 to 1591. [2018-10-10 15:17:59,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1591 states. [2018-10-10 15:17:59,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1591 states and 1627 transitions. [2018-10-10 15:17:59,483 INFO L78 Accepts]: Start accepts. Automaton has 1591 states and 1627 transitions. Word has length 942 [2018-10-10 15:17:59,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:59,484 INFO L481 AbstractCegarLoop]: Abstraction has 1591 states and 1627 transitions. [2018-10-10 15:17:59,484 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-10 15:17:59,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1591 states and 1627 transitions. [2018-10-10 15:17:59,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 997 [2018-10-10 15:17:59,494 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:59,494 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:59,495 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:59,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:59,495 INFO L82 PathProgramCache]: Analyzing trace with hash 685232898, now seen corresponding path program 18 times [2018-10-10 15:17:59,496 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:59,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:01,299 INFO L134 CoverageAnalysis]: Checked inductivity of 8280 backedges. 0 proven. 8280 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:18:01,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:01,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-10 15:18:01,301 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-10 15:18:01,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-10 15:18:01,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2018-10-10 15:18:01,302 INFO L87 Difference]: Start difference. First operand 1591 states and 1627 transitions. Second operand 39 states. [2018-10-10 15:18:02,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:02,753 INFO L93 Difference]: Finished difference Result 1763 states and 1803 transitions. [2018-10-10 15:18:02,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-10 15:18:02,753 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 996 [2018-10-10 15:18:02,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:02,761 INFO L225 Difference]: With dead ends: 1763 [2018-10-10 15:18:02,761 INFO L226 Difference]: Without dead ends: 1763 [2018-10-10 15:18:02,762 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1803, Invalid=3747, Unknown=0, NotChecked=0, Total=5550 [2018-10-10 15:18:02,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1763 states. [2018-10-10 15:18:02,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1763 to 1678. [2018-10-10 15:18:02,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1678 states. [2018-10-10 15:18:02,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1678 states to 1678 states and 1716 transitions. [2018-10-10 15:18:02,780 INFO L78 Accepts]: Start accepts. Automaton has 1678 states and 1716 transitions. Word has length 996 [2018-10-10 15:18:02,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:02,780 INFO L481 AbstractCegarLoop]: Abstraction has 1678 states and 1716 transitions. [2018-10-10 15:18:02,781 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-10 15:18:02,781 INFO L276 IsEmpty]: Start isEmpty. Operand 1678 states and 1716 transitions. [2018-10-10 15:18:02,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1051 [2018-10-10 15:18:02,791 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:02,792 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:18:02,792 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:02,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:02,792 INFO L82 PathProgramCache]: Analyzing trace with hash 1747888384, now seen corresponding path program 19 times [2018-10-10 15:18:02,793 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:02,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:04,947 INFO L134 CoverageAnalysis]: Checked inductivity of 9253 backedges. 0 proven. 9253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:18:04,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:04,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-10 15:18:04,948 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-10 15:18:04,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-10 15:18:04,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=1200, Unknown=0, NotChecked=0, Total=1640 [2018-10-10 15:18:04,949 INFO L87 Difference]: Start difference. First operand 1678 states and 1716 transitions. Second operand 41 states. [2018-10-10 15:18:06,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:06,668 INFO L93 Difference]: Finished difference Result 1850 states and 1892 transitions. [2018-10-10 15:18:06,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-10 15:18:06,668 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 1050 [2018-10-10 15:18:06,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:06,675 INFO L225 Difference]: With dead ends: 1850 [2018-10-10 15:18:06,676 INFO L226 Difference]: Without dead ends: 1850 [2018-10-10 15:18:06,677 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1045 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1998, Invalid=4164, Unknown=0, NotChecked=0, Total=6162 [2018-10-10 15:18:06,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1850 states. [2018-10-10 15:18:06,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1850 to 1765. [2018-10-10 15:18:06,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1765 states. [2018-10-10 15:18:06,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1765 states to 1765 states and 1805 transitions. [2018-10-10 15:18:06,700 INFO L78 Accepts]: Start accepts. Automaton has 1765 states and 1805 transitions. Word has length 1050 [2018-10-10 15:18:06,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:06,701 INFO L481 AbstractCegarLoop]: Abstraction has 1765 states and 1805 transitions. [2018-10-10 15:18:06,701 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-10 15:18:06,701 INFO L276 IsEmpty]: Start isEmpty. Operand 1765 states and 1805 transitions. [2018-10-10 15:18:06,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1105 [2018-10-10 15:18:06,735 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:06,736 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:18:06,736 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:06,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:06,737 INFO L82 PathProgramCache]: Analyzing trace with hash 933254270, now seen corresponding path program 20 times [2018-10-10 15:18:06,738 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:06,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:09,013 INFO L134 CoverageAnalysis]: Checked inductivity of 10280 backedges. 0 proven. 10280 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:18:09,013 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:09,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-10 15:18:09,014 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-10 15:18:09,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-10 15:18:09,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2018-10-10 15:18:09,016 INFO L87 Difference]: Start difference. First operand 1765 states and 1805 transitions. Second operand 43 states. [2018-10-10 15:18:10,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:10,721 INFO L93 Difference]: Finished difference Result 1937 states and 1981 transitions. [2018-10-10 15:18:10,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-10 15:18:10,721 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 1104 [2018-10-10 15:18:10,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:10,728 INFO L225 Difference]: With dead ends: 1937 [2018-10-10 15:18:10,728 INFO L226 Difference]: Without dead ends: 1937 [2018-10-10 15:18:10,730 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1160 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2203, Invalid=4603, Unknown=0, NotChecked=0, Total=6806 [2018-10-10 15:18:10,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1937 states. [2018-10-10 15:18:10,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1937 to 1852. [2018-10-10 15:18:10,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1852 states. [2018-10-10 15:18:10,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1852 states to 1852 states and 1894 transitions. [2018-10-10 15:18:10,746 INFO L78 Accepts]: Start accepts. Automaton has 1852 states and 1894 transitions. Word has length 1104 [2018-10-10 15:18:10,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:10,747 INFO L481 AbstractCegarLoop]: Abstraction has 1852 states and 1894 transitions. [2018-10-10 15:18:10,747 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-10 15:18:10,748 INFO L276 IsEmpty]: Start isEmpty. Operand 1852 states and 1894 transitions. [2018-10-10 15:18:10,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1159 [2018-10-10 15:18:10,760 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:10,760 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:18:10,761 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:10,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:10,761 INFO L82 PathProgramCache]: Analyzing trace with hash 348501372, now seen corresponding path program 21 times [2018-10-10 15:18:10,762 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:10,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:13,470 INFO L134 CoverageAnalysis]: Checked inductivity of 11361 backedges. 0 proven. 11361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:18:13,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:13,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-10 15:18:13,471 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-10 15:18:13,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-10 15:18:13,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=1452, Unknown=0, NotChecked=0, Total=1980 [2018-10-10 15:18:13,472 INFO L87 Difference]: Start difference. First operand 1852 states and 1894 transitions. Second operand 45 states. [2018-10-10 15:18:15,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:15,507 INFO L93 Difference]: Finished difference Result 2024 states and 2070 transitions. [2018-10-10 15:18:15,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-10 15:18:15,517 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 1158 [2018-10-10 15:18:15,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:15,525 INFO L225 Difference]: With dead ends: 2024 [2018-10-10 15:18:15,525 INFO L226 Difference]: Without dead ends: 2024 [2018-10-10 15:18:15,526 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1281 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2418, Invalid=5064, Unknown=0, NotChecked=0, Total=7482 [2018-10-10 15:18:15,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2024 states. [2018-10-10 15:18:15,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2024 to 1939. [2018-10-10 15:18:15,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1939 states. [2018-10-10 15:18:15,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1939 states to 1939 states and 1983 transitions. [2018-10-10 15:18:15,546 INFO L78 Accepts]: Start accepts. Automaton has 1939 states and 1983 transitions. Word has length 1158 [2018-10-10 15:18:15,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:15,547 INFO L481 AbstractCegarLoop]: Abstraction has 1939 states and 1983 transitions. [2018-10-10 15:18:15,547 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-10 15:18:15,547 INFO L276 IsEmpty]: Start isEmpty. Operand 1939 states and 1983 transitions. [2018-10-10 15:18:15,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1213 [2018-10-10 15:18:15,562 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:15,563 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:18:15,563 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:15,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:15,563 INFO L82 PathProgramCache]: Analyzing trace with hash 634366970, now seen corresponding path program 22 times [2018-10-10 15:18:15,564 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:15,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:18,062 INFO L134 CoverageAnalysis]: Checked inductivity of 12496 backedges. 0 proven. 12496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:18:18,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:18,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-10 15:18:18,064 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-10 15:18:18,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-10 15:18:18,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=1587, Unknown=0, NotChecked=0, Total=2162 [2018-10-10 15:18:18,065 INFO L87 Difference]: Start difference. First operand 1939 states and 1983 transitions. Second operand 47 states. [2018-10-10 15:18:20,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:20,504 INFO L93 Difference]: Finished difference Result 2111 states and 2159 transitions. [2018-10-10 15:18:20,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-10 15:18:20,504 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 1212 [2018-10-10 15:18:20,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:20,512 INFO L225 Difference]: With dead ends: 2111 [2018-10-10 15:18:20,512 INFO L226 Difference]: Without dead ends: 2111 [2018-10-10 15:18:20,513 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1408 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2643, Invalid=5547, Unknown=0, NotChecked=0, Total=8190 [2018-10-10 15:18:20,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2111 states. [2018-10-10 15:18:20,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2111 to 2026. [2018-10-10 15:18:20,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2026 states. [2018-10-10 15:18:20,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2026 states to 2026 states and 2072 transitions. [2018-10-10 15:18:20,529 INFO L78 Accepts]: Start accepts. Automaton has 2026 states and 2072 transitions. Word has length 1212 [2018-10-10 15:18:20,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:20,530 INFO L481 AbstractCegarLoop]: Abstraction has 2026 states and 2072 transitions. [2018-10-10 15:18:20,530 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-10 15:18:20,530 INFO L276 IsEmpty]: Start isEmpty. Operand 2026 states and 2072 transitions. [2018-10-10 15:18:20,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1267 [2018-10-10 15:18:20,544 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:20,545 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:18:20,545 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:20,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:20,546 INFO L82 PathProgramCache]: Analyzing trace with hash -679012360, now seen corresponding path program 23 times [2018-10-10 15:18:20,546 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:20,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:23,470 INFO L134 CoverageAnalysis]: Checked inductivity of 13685 backedges. 0 proven. 13685 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:18:23,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:23,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-10 15:18:23,472 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-10 15:18:23,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-10 15:18:23,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=624, Invalid=1728, Unknown=0, NotChecked=0, Total=2352 [2018-10-10 15:18:23,473 INFO L87 Difference]: Start difference. First operand 2026 states and 2072 transitions. Second operand 49 states. [2018-10-10 15:18:25,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:25,873 INFO L93 Difference]: Finished difference Result 2198 states and 2248 transitions. [2018-10-10 15:18:25,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-10 15:18:25,873 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 1266 [2018-10-10 15:18:25,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:25,880 INFO L225 Difference]: With dead ends: 2198 [2018-10-10 15:18:25,880 INFO L226 Difference]: Without dead ends: 2198 [2018-10-10 15:18:25,881 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1541 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=2878, Invalid=6052, Unknown=0, NotChecked=0, Total=8930 [2018-10-10 15:18:25,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2198 states. [2018-10-10 15:18:25,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2198 to 2113. [2018-10-10 15:18:25,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2113 states. [2018-10-10 15:18:25,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2113 states to 2113 states and 2161 transitions. [2018-10-10 15:18:25,899 INFO L78 Accepts]: Start accepts. Automaton has 2113 states and 2161 transitions. Word has length 1266 [2018-10-10 15:18:25,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:25,900 INFO L481 AbstractCegarLoop]: Abstraction has 2113 states and 2161 transitions. [2018-10-10 15:18:25,900 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-10 15:18:25,900 INFO L276 IsEmpty]: Start isEmpty. Operand 2113 states and 2161 transitions. [2018-10-10 15:18:25,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1321 [2018-10-10 15:18:25,915 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:25,915 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:18:25,916 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:25,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:25,916 INFO L82 PathProgramCache]: Analyzing trace with hash -78849674, now seen corresponding path program 24 times [2018-10-10 15:18:25,917 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:25,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:29,414 INFO L134 CoverageAnalysis]: Checked inductivity of 14928 backedges. 0 proven. 14928 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:18:29,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:29,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-10 15:18:29,416 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-10 15:18:29,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-10 15:18:29,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2018-10-10 15:18:29,417 INFO L87 Difference]: Start difference. First operand 2113 states and 2161 transitions. Second operand 51 states. [2018-10-10 15:18:32,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:32,053 INFO L93 Difference]: Finished difference Result 2285 states and 2337 transitions. [2018-10-10 15:18:32,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-10 15:18:32,054 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 1320 [2018-10-10 15:18:32,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:32,069 INFO L225 Difference]: With dead ends: 2285 [2018-10-10 15:18:32,070 INFO L226 Difference]: Without dead ends: 2285 [2018-10-10 15:18:32,076 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1680 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=3123, Invalid=6579, Unknown=0, NotChecked=0, Total=9702 [2018-10-10 15:18:32,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2285 states. [2018-10-10 15:18:32,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2285 to 2200. [2018-10-10 15:18:32,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2200 states. [2018-10-10 15:18:32,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2200 states to 2200 states and 2250 transitions. [2018-10-10 15:18:32,105 INFO L78 Accepts]: Start accepts. Automaton has 2200 states and 2250 transitions. Word has length 1320 [2018-10-10 15:18:32,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:32,106 INFO L481 AbstractCegarLoop]: Abstraction has 2200 states and 2250 transitions. [2018-10-10 15:18:32,107 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-10 15:18:32,107 INFO L276 IsEmpty]: Start isEmpty. Operand 2200 states and 2250 transitions. [2018-10-10 15:18:32,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1375 [2018-10-10 15:18:32,127 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:32,128 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:18:32,128 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:32,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:32,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1696190580, now seen corresponding path program 25 times [2018-10-10 15:18:32,130 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:32,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:35,372 INFO L134 CoverageAnalysis]: Checked inductivity of 16225 backedges. 0 proven. 16225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:18:35,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:35,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-10 15:18:35,374 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-10 15:18:35,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-10 15:18:35,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=728, Invalid=2028, Unknown=0, NotChecked=0, Total=2756 [2018-10-10 15:18:35,375 INFO L87 Difference]: Start difference. First operand 2200 states and 2250 transitions. Second operand 53 states. [2018-10-10 15:18:37,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:37,865 INFO L93 Difference]: Finished difference Result 2372 states and 2426 transitions. [2018-10-10 15:18:37,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-10 15:18:37,865 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 1374 [2018-10-10 15:18:37,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:37,871 INFO L225 Difference]: With dead ends: 2372 [2018-10-10 15:18:37,871 INFO L226 Difference]: Without dead ends: 2372 [2018-10-10 15:18:37,873 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1825 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=3378, Invalid=7128, Unknown=0, NotChecked=0, Total=10506 [2018-10-10 15:18:37,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2372 states. [2018-10-10 15:18:37,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2372 to 2287. [2018-10-10 15:18:37,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2287 states. [2018-10-10 15:18:37,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2287 states to 2287 states and 2339 transitions. [2018-10-10 15:18:37,895 INFO L78 Accepts]: Start accepts. Automaton has 2287 states and 2339 transitions. Word has length 1374 [2018-10-10 15:18:37,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:37,896 INFO L481 AbstractCegarLoop]: Abstraction has 2287 states and 2339 transitions. [2018-10-10 15:18:37,896 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-10 15:18:37,896 INFO L276 IsEmpty]: Start isEmpty. Operand 2287 states and 2339 transitions. [2018-10-10 15:18:37,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1429 [2018-10-10 15:18:37,912 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:37,912 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:18:37,913 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:37,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:37,913 INFO L82 PathProgramCache]: Analyzing trace with hash 159309042, now seen corresponding path program 26 times [2018-10-10 15:18:37,914 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:37,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:42,416 INFO L134 CoverageAnalysis]: Checked inductivity of 17576 backedges. 0 proven. 17576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:18:42,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:42,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-10 15:18:42,418 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-10 15:18:42,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-10 15:18:42,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=783, Invalid=2187, Unknown=0, NotChecked=0, Total=2970 [2018-10-10 15:18:42,419 INFO L87 Difference]: Start difference. First operand 2287 states and 2339 transitions. Second operand 55 states. [2018-10-10 15:18:45,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:45,404 INFO L93 Difference]: Finished difference Result 2459 states and 2515 transitions. [2018-10-10 15:18:45,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-10 15:18:45,404 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 1428 [2018-10-10 15:18:45,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:45,409 INFO L225 Difference]: With dead ends: 2459 [2018-10-10 15:18:45,409 INFO L226 Difference]: Without dead ends: 2459 [2018-10-10 15:18:45,411 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1976 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=3643, Invalid=7699, Unknown=0, NotChecked=0, Total=11342 [2018-10-10 15:18:45,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2459 states. [2018-10-10 15:18:45,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2459 to 2374. [2018-10-10 15:18:45,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2374 states. [2018-10-10 15:18:45,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2374 states to 2374 states and 2428 transitions. [2018-10-10 15:18:45,431 INFO L78 Accepts]: Start accepts. Automaton has 2374 states and 2428 transitions. Word has length 1428 [2018-10-10 15:18:45,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:45,432 INFO L481 AbstractCegarLoop]: Abstraction has 2374 states and 2428 transitions. [2018-10-10 15:18:45,432 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-10 15:18:45,432 INFO L276 IsEmpty]: Start isEmpty. Operand 2374 states and 2428 transitions. [2018-10-10 15:18:45,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1483 [2018-10-10 15:18:45,448 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:45,449 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:18:45,450 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:45,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:45,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1683693840, now seen corresponding path program 27 times [2018-10-10 15:18:45,451 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:45,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:48,861 INFO L134 CoverageAnalysis]: Checked inductivity of 18981 backedges. 0 proven. 18981 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:18:48,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:48,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-10 15:18:48,862 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-10 15:18:48,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-10 15:18:48,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=840, Invalid=2352, Unknown=0, NotChecked=0, Total=3192 [2018-10-10 15:18:48,863 INFO L87 Difference]: Start difference. First operand 2374 states and 2428 transitions. Second operand 57 states. [2018-10-10 15:18:52,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:52,108 INFO L93 Difference]: Finished difference Result 2546 states and 2604 transitions. [2018-10-10 15:18:52,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-10 15:18:52,108 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 1482 [2018-10-10 15:18:52,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:52,112 INFO L225 Difference]: With dead ends: 2546 [2018-10-10 15:18:52,112 INFO L226 Difference]: Without dead ends: 2546 [2018-10-10 15:18:52,113 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2133 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=3918, Invalid=8292, Unknown=0, NotChecked=0, Total=12210 [2018-10-10 15:18:52,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2546 states. [2018-10-10 15:18:52,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2546 to 2461. [2018-10-10 15:18:52,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2461 states. [2018-10-10 15:18:52,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2461 states to 2461 states and 2517 transitions. [2018-10-10 15:18:52,128 INFO L78 Accepts]: Start accepts. Automaton has 2461 states and 2517 transitions. Word has length 1482 [2018-10-10 15:18:52,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:52,129 INFO L481 AbstractCegarLoop]: Abstraction has 2461 states and 2517 transitions. [2018-10-10 15:18:52,129 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-10 15:18:52,129 INFO L276 IsEmpty]: Start isEmpty. Operand 2461 states and 2517 transitions. [2018-10-10 15:18:52,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1537 [2018-10-10 15:18:52,143 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:52,143 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:18:52,144 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:52,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:52,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1421035922, now seen corresponding path program 28 times [2018-10-10 15:18:52,145 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:52,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:56,483 INFO L134 CoverageAnalysis]: Checked inductivity of 20440 backedges. 0 proven. 20440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:18:56,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:56,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-10 15:18:56,484 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-10 15:18:56,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-10 15:18:56,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=899, Invalid=2523, Unknown=0, NotChecked=0, Total=3422 [2018-10-10 15:18:56,485 INFO L87 Difference]: Start difference. First operand 2461 states and 2517 transitions. Second operand 59 states. [2018-10-10 15:18:59,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:59,637 INFO L93 Difference]: Finished difference Result 2633 states and 2693 transitions. [2018-10-10 15:18:59,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-10 15:18:59,638 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 1536 [2018-10-10 15:18:59,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:59,643 INFO L225 Difference]: With dead ends: 2633 [2018-10-10 15:18:59,643 INFO L226 Difference]: Without dead ends: 2633 [2018-10-10 15:18:59,644 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2296 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=4203, Invalid=8907, Unknown=0, NotChecked=0, Total=13110 [2018-10-10 15:18:59,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2633 states. [2018-10-10 15:18:59,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2633 to 2548. [2018-10-10 15:18:59,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2548 states. [2018-10-10 15:18:59,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2548 states to 2548 states and 2606 transitions. [2018-10-10 15:18:59,667 INFO L78 Accepts]: Start accepts. Automaton has 2548 states and 2606 transitions. Word has length 1536 [2018-10-10 15:18:59,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:59,668 INFO L481 AbstractCegarLoop]: Abstraction has 2548 states and 2606 transitions. [2018-10-10 15:18:59,669 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-10 15:18:59,669 INFO L276 IsEmpty]: Start isEmpty. Operand 2548 states and 2606 transitions. [2018-10-10 15:18:59,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1591 [2018-10-10 15:18:59,690 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:59,691 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:18:59,691 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:59,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:59,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1120879468, now seen corresponding path program 29 times [2018-10-10 15:18:59,693 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:59,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:03,900 INFO L134 CoverageAnalysis]: Checked inductivity of 21953 backedges. 0 proven. 21953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:19:03,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:03,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-10 15:19:03,902 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-10 15:19:03,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-10 15:19:03,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=960, Invalid=2700, Unknown=0, NotChecked=0, Total=3660 [2018-10-10 15:19:03,903 INFO L87 Difference]: Start difference. First operand 2548 states and 2606 transitions. Second operand 61 states. [2018-10-10 15:19:07,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:07,609 INFO L93 Difference]: Finished difference Result 2720 states and 2782 transitions. [2018-10-10 15:19:07,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-10 15:19:07,609 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 1590 [2018-10-10 15:19:07,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:07,615 INFO L225 Difference]: With dead ends: 2720 [2018-10-10 15:19:07,615 INFO L226 Difference]: Without dead ends: 2720 [2018-10-10 15:19:07,616 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2465 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=4498, Invalid=9544, Unknown=0, NotChecked=0, Total=14042 [2018-10-10 15:19:07,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2720 states. [2018-10-10 15:19:07,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2720 to 2635. [2018-10-10 15:19:07,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2635 states. [2018-10-10 15:19:07,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2635 states to 2635 states and 2695 transitions. [2018-10-10 15:19:07,639 INFO L78 Accepts]: Start accepts. Automaton has 2635 states and 2695 transitions. Word has length 1590 [2018-10-10 15:19:07,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:07,640 INFO L481 AbstractCegarLoop]: Abstraction has 2635 states and 2695 transitions. [2018-10-10 15:19:07,640 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-10 15:19:07,641 INFO L276 IsEmpty]: Start isEmpty. Operand 2635 states and 2695 transitions. [2018-10-10 15:19:07,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1645 [2018-10-10 15:19:07,663 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:07,664 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:19:07,664 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:07,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:07,665 INFO L82 PathProgramCache]: Analyzing trace with hash 85812714, now seen corresponding path program 30 times [2018-10-10 15:19:07,665 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:07,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:12,405 INFO L134 CoverageAnalysis]: Checked inductivity of 23520 backedges. 0 proven. 23520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:19:12,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:12,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-10 15:19:12,407 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-10 15:19:12,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-10 15:19:12,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2018-10-10 15:19:12,408 INFO L87 Difference]: Start difference. First operand 2635 states and 2695 transitions. Second operand 63 states. [2018-10-10 15:19:16,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:16,132 INFO L93 Difference]: Finished difference Result 2807 states and 2871 transitions. [2018-10-10 15:19:16,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-10 15:19:16,132 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 1644 [2018-10-10 15:19:16,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:16,136 INFO L225 Difference]: With dead ends: 2807 [2018-10-10 15:19:16,136 INFO L226 Difference]: Without dead ends: 2807 [2018-10-10 15:19:16,137 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2640 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=4803, Invalid=10203, Unknown=0, NotChecked=0, Total=15006 [2018-10-10 15:19:16,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2807 states. [2018-10-10 15:19:16,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2807 to 2722. [2018-10-10 15:19:16,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2722 states. [2018-10-10 15:19:16,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2722 states to 2722 states and 2784 transitions. [2018-10-10 15:19:16,156 INFO L78 Accepts]: Start accepts. Automaton has 2722 states and 2784 transitions. Word has length 1644 [2018-10-10 15:19:16,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:16,158 INFO L481 AbstractCegarLoop]: Abstraction has 2722 states and 2784 transitions. [2018-10-10 15:19:16,158 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-10 15:19:16,158 INFO L276 IsEmpty]: Start isEmpty. Operand 2722 states and 2784 transitions. [2018-10-10 15:19:16,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1699 [2018-10-10 15:19:16,182 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:16,183 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:19:16,183 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:16,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:16,184 INFO L82 PathProgramCache]: Analyzing trace with hash -876610072, now seen corresponding path program 31 times [2018-10-10 15:19:16,184 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:16,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:20,540 INFO L134 CoverageAnalysis]: Checked inductivity of 25141 backedges. 0 proven. 25141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:19:20,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:20,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-10 15:19:20,541 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-10 15:19:20,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-10 15:19:20,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1088, Invalid=3072, Unknown=0, NotChecked=0, Total=4160 [2018-10-10 15:19:20,542 INFO L87 Difference]: Start difference. First operand 2722 states and 2784 transitions. Second operand 65 states. [2018-10-10 15:19:24,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:24,558 INFO L93 Difference]: Finished difference Result 2894 states and 2960 transitions. [2018-10-10 15:19:24,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-10 15:19:24,559 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 1698 [2018-10-10 15:19:24,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:24,563 INFO L225 Difference]: With dead ends: 2894 [2018-10-10 15:19:24,563 INFO L226 Difference]: Without dead ends: 2894 [2018-10-10 15:19:24,564 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2821 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=5118, Invalid=10884, Unknown=0, NotChecked=0, Total=16002 [2018-10-10 15:19:24,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2894 states. [2018-10-10 15:19:24,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2894 to 2809. [2018-10-10 15:19:24,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2809 states. [2018-10-10 15:19:24,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2809 states to 2809 states and 2873 transitions. [2018-10-10 15:19:24,586 INFO L78 Accepts]: Start accepts. Automaton has 2809 states and 2873 transitions. Word has length 1698 [2018-10-10 15:19:24,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:24,587 INFO L481 AbstractCegarLoop]: Abstraction has 2809 states and 2873 transitions. [2018-10-10 15:19:24,587 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-10 15:19:24,588 INFO L276 IsEmpty]: Start isEmpty. Operand 2809 states and 2873 transitions. [2018-10-10 15:19:24,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1753 [2018-10-10 15:19:24,612 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:24,613 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:19:24,613 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:24,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:24,614 INFO L82 PathProgramCache]: Analyzing trace with hash -992482458, now seen corresponding path program 32 times [2018-10-10 15:19:24,615 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:24,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:29,431 INFO L134 CoverageAnalysis]: Checked inductivity of 26816 backedges. 0 proven. 26816 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:19:29,431 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:29,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-10 15:19:29,433 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-10 15:19:29,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-10 15:19:29,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1155, Invalid=3267, Unknown=0, NotChecked=0, Total=4422 [2018-10-10 15:19:29,434 INFO L87 Difference]: Start difference. First operand 2809 states and 2873 transitions. Second operand 67 states. [2018-10-10 15:19:33,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:33,845 INFO L93 Difference]: Finished difference Result 2981 states and 3049 transitions. [2018-10-10 15:19:33,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-10-10 15:19:33,846 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 1752 [2018-10-10 15:19:33,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:33,849 INFO L225 Difference]: With dead ends: 2981 [2018-10-10 15:19:33,850 INFO L226 Difference]: Without dead ends: 2981 [2018-10-10 15:19:33,851 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3008 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=5443, Invalid=11587, Unknown=0, NotChecked=0, Total=17030 [2018-10-10 15:19:33,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2981 states. [2018-10-10 15:19:33,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2981 to 2896. [2018-10-10 15:19:33,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2896 states. [2018-10-10 15:19:33,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2896 states to 2896 states and 2962 transitions. [2018-10-10 15:19:33,869 INFO L78 Accepts]: Start accepts. Automaton has 2896 states and 2962 transitions. Word has length 1752 [2018-10-10 15:19:33,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:33,870 INFO L481 AbstractCegarLoop]: Abstraction has 2896 states and 2962 transitions. [2018-10-10 15:19:33,870 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-10 15:19:33,871 INFO L276 IsEmpty]: Start isEmpty. Operand 2896 states and 2962 transitions. [2018-10-10 15:19:33,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1807 [2018-10-10 15:19:33,893 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:33,894 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:19:33,894 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:33,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:33,895 INFO L82 PathProgramCache]: Analyzing trace with hash 287182436, now seen corresponding path program 33 times [2018-10-10 15:19:33,896 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:33,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:39,127 INFO L134 CoverageAnalysis]: Checked inductivity of 28545 backedges. 0 proven. 28545 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:19:39,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:39,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-10 15:19:39,129 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-10 15:19:39,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-10 15:19:39,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1224, Invalid=3468, Unknown=0, NotChecked=0, Total=4692 [2018-10-10 15:19:39,130 INFO L87 Difference]: Start difference. First operand 2896 states and 2962 transitions. Second operand 69 states. [2018-10-10 15:19:43,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:43,614 INFO L93 Difference]: Finished difference Result 3068 states and 3138 transitions. [2018-10-10 15:19:43,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-10-10 15:19:43,615 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 1806 [2018-10-10 15:19:43,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:43,618 INFO L225 Difference]: With dead ends: 3068 [2018-10-10 15:19:43,618 INFO L226 Difference]: Without dead ends: 3068 [2018-10-10 15:19:43,619 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3201 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=5778, Invalid=12312, Unknown=0, NotChecked=0, Total=18090 [2018-10-10 15:19:43,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3068 states. [2018-10-10 15:19:43,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3068 to 2983. [2018-10-10 15:19:43,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2983 states. [2018-10-10 15:19:43,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2983 states to 2983 states and 3051 transitions. [2018-10-10 15:19:43,636 INFO L78 Accepts]: Start accepts. Automaton has 2983 states and 3051 transitions. Word has length 1806 [2018-10-10 15:19:43,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:43,637 INFO L481 AbstractCegarLoop]: Abstraction has 2983 states and 3051 transitions. [2018-10-10 15:19:43,637 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-10 15:19:43,637 INFO L276 IsEmpty]: Start isEmpty. Operand 2983 states and 3051 transitions. [2018-10-10 15:19:43,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1861 [2018-10-10 15:19:43,656 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:43,657 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:19:43,657 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:43,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:43,658 INFO L82 PathProgramCache]: Analyzing trace with hash -505198878, now seen corresponding path program 34 times [2018-10-10 15:19:43,659 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:43,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:49,083 INFO L134 CoverageAnalysis]: Checked inductivity of 30328 backedges. 0 proven. 30328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:19:49,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:49,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-10 15:19:49,086 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-10 15:19:49,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-10 15:19:49,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1295, Invalid=3675, Unknown=0, NotChecked=0, Total=4970 [2018-10-10 15:19:49,086 INFO L87 Difference]: Start difference. First operand 2983 states and 3051 transitions. Second operand 71 states. [2018-10-10 15:19:53,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:53,680 INFO L93 Difference]: Finished difference Result 3155 states and 3227 transitions. [2018-10-10 15:19:53,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-10-10 15:19:53,680 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 1860 [2018-10-10 15:19:53,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:53,685 INFO L225 Difference]: With dead ends: 3155 [2018-10-10 15:19:53,685 INFO L226 Difference]: Without dead ends: 3155 [2018-10-10 15:19:53,686 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3400 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=6123, Invalid=13059, Unknown=0, NotChecked=0, Total=19182 [2018-10-10 15:19:53,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3155 states. [2018-10-10 15:19:53,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3155 to 3070. [2018-10-10 15:19:53,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3070 states. [2018-10-10 15:19:53,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3070 states to 3070 states and 3140 transitions. [2018-10-10 15:19:53,706 INFO L78 Accepts]: Start accepts. Automaton has 3070 states and 3140 transitions. Word has length 1860 [2018-10-10 15:19:53,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:53,707 INFO L481 AbstractCegarLoop]: Abstraction has 3070 states and 3140 transitions. [2018-10-10 15:19:53,707 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-10 15:19:53,707 INFO L276 IsEmpty]: Start isEmpty. Operand 3070 states and 3140 transitions. [2018-10-10 15:19:53,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1915 [2018-10-10 15:19:53,728 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:19:53,729 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:19:53,729 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:19:53,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:19:53,729 INFO L82 PathProgramCache]: Analyzing trace with hash 386954464, now seen corresponding path program 35 times [2018-10-10 15:19:53,730 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:19:53,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:19:59,491 INFO L134 CoverageAnalysis]: Checked inductivity of 32165 backedges. 0 proven. 32165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:19:59,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:19:59,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-10 15:19:59,493 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-10 15:19:59,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-10 15:19:59,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1368, Invalid=3888, Unknown=0, NotChecked=0, Total=5256 [2018-10-10 15:19:59,494 INFO L87 Difference]: Start difference. First operand 3070 states and 3140 transitions. Second operand 73 states. [2018-10-10 15:20:04,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:20:04,745 INFO L93 Difference]: Finished difference Result 3242 states and 3316 transitions. [2018-10-10 15:20:04,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-10-10 15:20:04,746 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 1914 [2018-10-10 15:20:04,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:20:04,749 INFO L225 Difference]: With dead ends: 3242 [2018-10-10 15:20:04,749 INFO L226 Difference]: Without dead ends: 3242 [2018-10-10 15:20:04,751 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3605 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=6478, Invalid=13828, Unknown=0, NotChecked=0, Total=20306 [2018-10-10 15:20:04,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3242 states. [2018-10-10 15:20:04,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3242 to 3157. [2018-10-10 15:20:04,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3157 states. [2018-10-10 15:20:04,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3157 states to 3157 states and 3229 transitions. [2018-10-10 15:20:04,769 INFO L78 Accepts]: Start accepts. Automaton has 3157 states and 3229 transitions. Word has length 1914 [2018-10-10 15:20:04,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:20:04,770 INFO L481 AbstractCegarLoop]: Abstraction has 3157 states and 3229 transitions. [2018-10-10 15:20:04,770 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-10 15:20:04,770 INFO L276 IsEmpty]: Start isEmpty. Operand 3157 states and 3229 transitions. [2018-10-10 15:20:04,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1969 [2018-10-10 15:20:04,791 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:20:04,792 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:20:04,792 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:20:04,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:20:04,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1562802270, now seen corresponding path program 36 times [2018-10-10 15:20:04,793 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:20:04,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:20:10,480 INFO L134 CoverageAnalysis]: Checked inductivity of 34056 backedges. 0 proven. 34056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:20:10,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:20:10,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-10 15:20:10,482 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-10 15:20:10,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-10 15:20:10,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1443, Invalid=4107, Unknown=0, NotChecked=0, Total=5550 [2018-10-10 15:20:10,483 INFO L87 Difference]: Start difference. First operand 3157 states and 3229 transitions. Second operand 75 states. [2018-10-10 15:20:15,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:20:15,580 INFO L93 Difference]: Finished difference Result 3329 states and 3405 transitions. [2018-10-10 15:20:15,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-10-10 15:20:15,587 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 1968 [2018-10-10 15:20:15,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:20:15,589 INFO L225 Difference]: With dead ends: 3329 [2018-10-10 15:20:15,589 INFO L226 Difference]: Without dead ends: 3329 [2018-10-10 15:20:15,590 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3816 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=6843, Invalid=14619, Unknown=0, NotChecked=0, Total=21462 [2018-10-10 15:20:15,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3329 states. [2018-10-10 15:20:15,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3329 to 3244. [2018-10-10 15:20:15,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3244 states. [2018-10-10 15:20:15,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3244 states to 3244 states and 3318 transitions. [2018-10-10 15:20:15,608 INFO L78 Accepts]: Start accepts. Automaton has 3244 states and 3318 transitions. Word has length 1968 [2018-10-10 15:20:15,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:20:15,609 INFO L481 AbstractCegarLoop]: Abstraction has 3244 states and 3318 transitions. [2018-10-10 15:20:15,609 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-10 15:20:15,609 INFO L276 IsEmpty]: Start isEmpty. Operand 3244 states and 3318 transitions. [2018-10-10 15:20:15,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2023 [2018-10-10 15:20:15,632 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:20:15,633 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:20:15,633 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:20:15,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:20:15,634 INFO L82 PathProgramCache]: Analyzing trace with hash -885116580, now seen corresponding path program 37 times [2018-10-10 15:20:15,634 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:20:15,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:20:21,822 INFO L134 CoverageAnalysis]: Checked inductivity of 36001 backedges. 0 proven. 36001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:20:21,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:20:21,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-10-10 15:20:21,824 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-10 15:20:21,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-10 15:20:21,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1520, Invalid=4332, Unknown=0, NotChecked=0, Total=5852 [2018-10-10 15:20:21,825 INFO L87 Difference]: Start difference. First operand 3244 states and 3318 transitions. Second operand 77 states. [2018-10-10 15:20:27,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:20:27,270 INFO L93 Difference]: Finished difference Result 3416 states and 3494 transitions. [2018-10-10 15:20:27,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-10-10 15:20:27,270 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 2022 [2018-10-10 15:20:27,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:20:27,274 INFO L225 Difference]: With dead ends: 3416 [2018-10-10 15:20:27,274 INFO L226 Difference]: Without dead ends: 3416 [2018-10-10 15:20:27,276 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4033 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=7218, Invalid=15432, Unknown=0, NotChecked=0, Total=22650 [2018-10-10 15:20:27,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3416 states. [2018-10-10 15:20:27,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3416 to 3331. [2018-10-10 15:20:27,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3331 states. [2018-10-10 15:20:27,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3331 states to 3331 states and 3407 transitions. [2018-10-10 15:20:27,295 INFO L78 Accepts]: Start accepts. Automaton has 3331 states and 3407 transitions. Word has length 2022 [2018-10-10 15:20:27,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:20:27,296 INFO L481 AbstractCegarLoop]: Abstraction has 3331 states and 3407 transitions. [2018-10-10 15:20:27,296 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-10 15:20:27,296 INFO L276 IsEmpty]: Start isEmpty. Operand 3331 states and 3407 transitions. [2018-10-10 15:20:27,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2077 [2018-10-10 15:20:27,319 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:20:27,320 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:20:27,320 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:20:27,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:20:27,321 INFO L82 PathProgramCache]: Analyzing trace with hash 17334234, now seen corresponding path program 38 times [2018-10-10 15:20:27,321 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:20:27,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:20:33,555 INFO L134 CoverageAnalysis]: Checked inductivity of 38000 backedges. 0 proven. 38000 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:20:33,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:20:33,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-10-10 15:20:33,557 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-10 15:20:33,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-10 15:20:33,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1599, Invalid=4563, Unknown=0, NotChecked=0, Total=6162 [2018-10-10 15:20:33,558 INFO L87 Difference]: Start difference. First operand 3331 states and 3407 transitions. Second operand 79 states. [2018-10-10 15:20:39,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:20:39,240 INFO L93 Difference]: Finished difference Result 3503 states and 3583 transitions. [2018-10-10 15:20:39,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-10-10 15:20:39,240 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 2076 [2018-10-10 15:20:39,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:20:39,244 INFO L225 Difference]: With dead ends: 3503 [2018-10-10 15:20:39,244 INFO L226 Difference]: Without dead ends: 3503 [2018-10-10 15:20:39,246 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4256 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=7603, Invalid=16267, Unknown=0, NotChecked=0, Total=23870 [2018-10-10 15:20:39,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3503 states. [2018-10-10 15:20:39,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3503 to 3418. [2018-10-10 15:20:39,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3418 states. [2018-10-10 15:20:39,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3418 states to 3418 states and 3496 transitions. [2018-10-10 15:20:39,266 INFO L78 Accepts]: Start accepts. Automaton has 3418 states and 3496 transitions. Word has length 2076 [2018-10-10 15:20:39,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:20:39,267 INFO L481 AbstractCegarLoop]: Abstraction has 3418 states and 3496 transitions. [2018-10-10 15:20:39,267 INFO L482 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-10 15:20:39,267 INFO L276 IsEmpty]: Start isEmpty. Operand 3418 states and 3496 transitions. [2018-10-10 15:20:39,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2131 [2018-10-10 15:20:39,293 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:20:39,294 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:20:39,294 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:20:39,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:20:39,295 INFO L82 PathProgramCache]: Analyzing trace with hash -993115176, now seen corresponding path program 39 times [2018-10-10 15:20:39,295 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:20:39,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:20:46,184 INFO L134 CoverageAnalysis]: Checked inductivity of 40053 backedges. 0 proven. 40053 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:20:46,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:20:46,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-10 15:20:46,186 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-10 15:20:46,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-10 15:20:46,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1680, Invalid=4800, Unknown=0, NotChecked=0, Total=6480 [2018-10-10 15:20:46,187 INFO L87 Difference]: Start difference. First operand 3418 states and 3496 transitions. Second operand 81 states. [2018-10-10 15:20:52,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:20:52,358 INFO L93 Difference]: Finished difference Result 3590 states and 3672 transitions. [2018-10-10 15:20:52,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-10-10 15:20:52,358 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 2130 [2018-10-10 15:20:52,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:20:52,361 INFO L225 Difference]: With dead ends: 3590 [2018-10-10 15:20:52,361 INFO L226 Difference]: Without dead ends: 3590 [2018-10-10 15:20:52,363 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4485 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=7998, Invalid=17124, Unknown=0, NotChecked=0, Total=25122 [2018-10-10 15:20:52,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3590 states. [2018-10-10 15:20:52,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3590 to 3505. [2018-10-10 15:20:52,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3505 states. [2018-10-10 15:20:52,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3505 states to 3505 states and 3585 transitions. [2018-10-10 15:20:52,379 INFO L78 Accepts]: Start accepts. Automaton has 3505 states and 3585 transitions. Word has length 2130 [2018-10-10 15:20:52,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:20:52,380 INFO L481 AbstractCegarLoop]: Abstraction has 3505 states and 3585 transitions. [2018-10-10 15:20:52,381 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-10 15:20:52,381 INFO L276 IsEmpty]: Start isEmpty. Operand 3505 states and 3585 transitions. [2018-10-10 15:20:52,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2185 [2018-10-10 15:20:52,406 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:20:52,407 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:20:52,407 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:20:52,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:20:52,408 INFO L82 PathProgramCache]: Analyzing trace with hash 561012054, now seen corresponding path program 40 times [2018-10-10 15:20:52,409 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:20:52,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:20:59,608 INFO L134 CoverageAnalysis]: Checked inductivity of 42160 backedges. 0 proven. 42160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:20:59,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:20:59,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-10 15:20:59,610 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-10 15:20:59,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-10 15:20:59,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1763, Invalid=5043, Unknown=0, NotChecked=0, Total=6806 [2018-10-10 15:20:59,611 INFO L87 Difference]: Start difference. First operand 3505 states and 3585 transitions. Second operand 83 states. [2018-10-10 15:21:05,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:21:05,959 INFO L93 Difference]: Finished difference Result 3677 states and 3761 transitions. [2018-10-10 15:21:05,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-10-10 15:21:05,959 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 2184 [2018-10-10 15:21:05,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:21:05,963 INFO L225 Difference]: With dead ends: 3677 [2018-10-10 15:21:05,963 INFO L226 Difference]: Without dead ends: 3677 [2018-10-10 15:21:05,965 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4720 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=8403, Invalid=18003, Unknown=0, NotChecked=0, Total=26406 [2018-10-10 15:21:05,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3677 states. [2018-10-10 15:21:05,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3677 to 3592. [2018-10-10 15:21:05,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3592 states. [2018-10-10 15:21:05,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3592 states to 3592 states and 3674 transitions. [2018-10-10 15:21:05,986 INFO L78 Accepts]: Start accepts. Automaton has 3592 states and 3674 transitions. Word has length 2184 [2018-10-10 15:21:05,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:21:05,988 INFO L481 AbstractCegarLoop]: Abstraction has 3592 states and 3674 transitions. [2018-10-10 15:21:05,988 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-10 15:21:05,988 INFO L276 IsEmpty]: Start isEmpty. Operand 3592 states and 3674 transitions. [2018-10-10 15:21:06,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2239 [2018-10-10 15:21:06,013 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:21:06,014 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:21:06,014 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:21:06,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:21:06,015 INFO L82 PathProgramCache]: Analyzing trace with hash 73903188, now seen corresponding path program 41 times [2018-10-10 15:21:06,016 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:21:06,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:21:13,740 INFO L134 CoverageAnalysis]: Checked inductivity of 44321 backedges. 0 proven. 44321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:21:13,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:21:13,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-10-10 15:21:13,742 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-10 15:21:13,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-10 15:21:13,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1848, Invalid=5292, Unknown=0, NotChecked=0, Total=7140 [2018-10-10 15:21:13,743 INFO L87 Difference]: Start difference. First operand 3592 states and 3674 transitions. Second operand 85 states. [2018-10-10 15:21:20,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:21:20,680 INFO L93 Difference]: Finished difference Result 3764 states and 3850 transitions. [2018-10-10 15:21:20,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-10-10 15:21:20,680 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 2238 [2018-10-10 15:21:20,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:21:20,684 INFO L225 Difference]: With dead ends: 3764 [2018-10-10 15:21:20,684 INFO L226 Difference]: Without dead ends: 3764 [2018-10-10 15:21:20,686 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4961 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=8818, Invalid=18904, Unknown=0, NotChecked=0, Total=27722 [2018-10-10 15:21:20,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3764 states. [2018-10-10 15:21:20,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3764 to 3679. [2018-10-10 15:21:20,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3679 states. [2018-10-10 15:21:20,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3679 states to 3679 states and 3763 transitions. [2018-10-10 15:21:20,705 INFO L78 Accepts]: Start accepts. Automaton has 3679 states and 3763 transitions. Word has length 2238 [2018-10-10 15:21:20,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:21:20,706 INFO L481 AbstractCegarLoop]: Abstraction has 3679 states and 3763 transitions. [2018-10-10 15:21:20,706 INFO L482 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-10 15:21:20,706 INFO L276 IsEmpty]: Start isEmpty. Operand 3679 states and 3763 transitions. [2018-10-10 15:21:20,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2293 [2018-10-10 15:21:20,794 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:21:20,795 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:21:20,795 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:21:20,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:21:20,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1539641554, now seen corresponding path program 42 times [2018-10-10 15:21:20,796 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:21:20,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:21:28,885 INFO L134 CoverageAnalysis]: Checked inductivity of 46536 backedges. 0 proven. 46536 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:21:28,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:21:28,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-10 15:21:28,887 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-10 15:21:28,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-10 15:21:28,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1935, Invalid=5547, Unknown=0, NotChecked=0, Total=7482 [2018-10-10 15:21:28,888 INFO L87 Difference]: Start difference. First operand 3679 states and 3763 transitions. Second operand 87 states. [2018-10-10 15:21:35,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:21:35,952 INFO L93 Difference]: Finished difference Result 3851 states and 3939 transitions. [2018-10-10 15:21:35,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-10-10 15:21:35,952 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 2292 [2018-10-10 15:21:35,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:21:35,956 INFO L225 Difference]: With dead ends: 3851 [2018-10-10 15:21:35,956 INFO L226 Difference]: Without dead ends: 3851 [2018-10-10 15:21:35,959 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5208 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=9243, Invalid=19827, Unknown=0, NotChecked=0, Total=29070 [2018-10-10 15:21:35,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3851 states. [2018-10-10 15:21:35,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3851 to 3766. [2018-10-10 15:21:35,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3766 states. [2018-10-10 15:21:35,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3766 states to 3766 states and 3852 transitions. [2018-10-10 15:21:35,981 INFO L78 Accepts]: Start accepts. Automaton has 3766 states and 3852 transitions. Word has length 2292 [2018-10-10 15:21:35,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:21:35,982 INFO L481 AbstractCegarLoop]: Abstraction has 3766 states and 3852 transitions. [2018-10-10 15:21:35,982 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-10 15:21:35,983 INFO L276 IsEmpty]: Start isEmpty. Operand 3766 states and 3852 transitions. [2018-10-10 15:21:36,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2347 [2018-10-10 15:21:36,012 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:21:36,013 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:21:36,013 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:21:36,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:21:36,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1271829808, now seen corresponding path program 43 times [2018-10-10 15:21:36,015 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:21:36,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:21:44,204 INFO L134 CoverageAnalysis]: Checked inductivity of 48805 backedges. 0 proven. 48805 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:21:44,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:21:44,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-10-10 15:21:44,206 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-10 15:21:44,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-10 15:21:44,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2024, Invalid=5808, Unknown=0, NotChecked=0, Total=7832 [2018-10-10 15:21:44,207 INFO L87 Difference]: Start difference. First operand 3766 states and 3852 transitions. Second operand 89 states. [2018-10-10 15:21:51,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:21:51,458 INFO L93 Difference]: Finished difference Result 3938 states and 4028 transitions. [2018-10-10 15:21:51,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-10-10 15:21:51,459 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 2346 [2018-10-10 15:21:51,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:21:51,463 INFO L225 Difference]: With dead ends: 3938 [2018-10-10 15:21:51,463 INFO L226 Difference]: Without dead ends: 3938 [2018-10-10 15:21:51,465 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5461 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=9678, Invalid=20772, Unknown=0, NotChecked=0, Total=30450 [2018-10-10 15:21:51,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3938 states. [2018-10-10 15:21:51,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3938 to 3853. [2018-10-10 15:21:51,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3853 states. [2018-10-10 15:21:51,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3853 states to 3853 states and 3941 transitions. [2018-10-10 15:21:51,486 INFO L78 Accepts]: Start accepts. Automaton has 3853 states and 3941 transitions. Word has length 2346 [2018-10-10 15:21:51,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:21:51,487 INFO L481 AbstractCegarLoop]: Abstraction has 3853 states and 3941 transitions. [2018-10-10 15:21:51,487 INFO L482 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-10 15:21:51,487 INFO L276 IsEmpty]: Start isEmpty. Operand 3853 states and 3941 transitions. [2018-10-10 15:21:51,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2401 [2018-10-10 15:21:51,516 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:21:51,517 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:21:51,517 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:21:51,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:21:51,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1458412110, now seen corresponding path program 44 times [2018-10-10 15:21:51,519 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:21:51,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:21:59,940 INFO L134 CoverageAnalysis]: Checked inductivity of 51128 backedges. 0 proven. 51128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:21:59,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:21:59,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-10-10 15:21:59,942 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-10 15:21:59,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-10 15:21:59,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2115, Invalid=6075, Unknown=0, NotChecked=0, Total=8190 [2018-10-10 15:21:59,943 INFO L87 Difference]: Start difference. First operand 3853 states and 3941 transitions. Second operand 91 states. [2018-10-10 15:22:07,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:22:07,744 INFO L93 Difference]: Finished difference Result 4025 states and 4117 transitions. [2018-10-10 15:22:07,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-10-10 15:22:07,745 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 2400 [2018-10-10 15:22:07,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:22:07,750 INFO L225 Difference]: With dead ends: 4025 [2018-10-10 15:22:07,750 INFO L226 Difference]: Without dead ends: 4025 [2018-10-10 15:22:07,752 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5720 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=10123, Invalid=21739, Unknown=0, NotChecked=0, Total=31862 [2018-10-10 15:22:07,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4025 states. [2018-10-10 15:22:07,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4025 to 3940. [2018-10-10 15:22:07,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3940 states. [2018-10-10 15:22:07,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3940 states to 3940 states and 4030 transitions. [2018-10-10 15:22:07,773 INFO L78 Accepts]: Start accepts. Automaton has 3940 states and 4030 transitions. Word has length 2400 [2018-10-10 15:22:07,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:22:07,774 INFO L481 AbstractCegarLoop]: Abstraction has 3940 states and 4030 transitions. [2018-10-10 15:22:07,774 INFO L482 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-10 15:22:07,774 INFO L276 IsEmpty]: Start isEmpty. Operand 3940 states and 4030 transitions. [2018-10-10 15:22:07,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2455 [2018-10-10 15:22:07,804 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:22:07,805 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:22:07,805 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:22:07,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:22:07,806 INFO L82 PathProgramCache]: Analyzing trace with hash -405635252, now seen corresponding path program 45 times [2018-10-10 15:22:07,806 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:22:07,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:22:16,820 INFO L134 CoverageAnalysis]: Checked inductivity of 53505 backedges. 0 proven. 53505 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:22:16,821 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:22:16,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-10 15:22:16,822 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-10 15:22:16,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-10 15:22:16,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2208, Invalid=6348, Unknown=0, NotChecked=0, Total=8556 [2018-10-10 15:22:16,823 INFO L87 Difference]: Start difference. First operand 3940 states and 4030 transitions. Second operand 93 states. [2018-10-10 15:22:25,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:22:25,085 INFO L93 Difference]: Finished difference Result 4112 states and 4206 transitions. [2018-10-10 15:22:25,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-10-10 15:22:25,085 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 2454 [2018-10-10 15:22:25,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:22:25,092 INFO L225 Difference]: With dead ends: 4112 [2018-10-10 15:22:25,092 INFO L226 Difference]: Without dead ends: 4112 [2018-10-10 15:22:25,095 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5985 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=10578, Invalid=22728, Unknown=0, NotChecked=0, Total=33306 [2018-10-10 15:22:25,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4112 states. [2018-10-10 15:22:25,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4112 to 4027. [2018-10-10 15:22:25,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4027 states. [2018-10-10 15:22:25,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4027 states to 4027 states and 4119 transitions. [2018-10-10 15:22:25,125 INFO L78 Accepts]: Start accepts. Automaton has 4027 states and 4119 transitions. Word has length 2454 [2018-10-10 15:22:25,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:22:25,126 INFO L481 AbstractCegarLoop]: Abstraction has 4027 states and 4119 transitions. [2018-10-10 15:22:25,126 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-10 15:22:25,127 INFO L276 IsEmpty]: Start isEmpty. Operand 4027 states and 4119 transitions. [2018-10-10 15:22:25,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2509 [2018-10-10 15:22:25,171 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:22:25,172 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:22:25,173 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:22:25,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:22:25,173 INFO L82 PathProgramCache]: Analyzing trace with hash -2091845174, now seen corresponding path program 46 times [2018-10-10 15:22:25,174 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:22:25,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:22:34,674 INFO L134 CoverageAnalysis]: Checked inductivity of 55936 backedges. 0 proven. 55936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:22:34,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:22:34,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-10-10 15:22:34,676 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-10 15:22:34,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-10 15:22:34,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2303, Invalid=6627, Unknown=0, NotChecked=0, Total=8930 [2018-10-10 15:22:34,677 INFO L87 Difference]: Start difference. First operand 4027 states and 4119 transitions. Second operand 95 states. [2018-10-10 15:22:43,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:22:43,191 INFO L93 Difference]: Finished difference Result 4199 states and 4295 transitions. [2018-10-10 15:22:43,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-10-10 15:22:43,191 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 2508 [2018-10-10 15:22:43,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:22:43,196 INFO L225 Difference]: With dead ends: 4199 [2018-10-10 15:22:43,196 INFO L226 Difference]: Without dead ends: 4199 [2018-10-10 15:22:43,198 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6256 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=11043, Invalid=23739, Unknown=0, NotChecked=0, Total=34782 [2018-10-10 15:22:43,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4199 states. [2018-10-10 15:22:43,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4199 to 4114. [2018-10-10 15:22:43,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4114 states. [2018-10-10 15:22:43,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4114 states to 4114 states and 4208 transitions. [2018-10-10 15:22:43,220 INFO L78 Accepts]: Start accepts. Automaton has 4114 states and 4208 transitions. Word has length 2508 [2018-10-10 15:22:43,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:22:43,221 INFO L481 AbstractCegarLoop]: Abstraction has 4114 states and 4208 transitions. [2018-10-10 15:22:43,222 INFO L482 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-10 15:22:43,222 INFO L276 IsEmpty]: Start isEmpty. Operand 4114 states and 4208 transitions. [2018-10-10 15:22:43,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2563 [2018-10-10 15:22:43,255 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:22:43,256 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:22:43,257 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:22:43,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:22:43,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1550969288, now seen corresponding path program 47 times [2018-10-10 15:22:43,258 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:22:43,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:22:52,977 INFO L134 CoverageAnalysis]: Checked inductivity of 58421 backedges. 0 proven. 58421 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:22:52,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:22:52,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-10-10 15:22:52,979 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-10-10 15:22:52,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-10-10 15:22:52,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2400, Invalid=6912, Unknown=0, NotChecked=0, Total=9312 [2018-10-10 15:22:52,980 INFO L87 Difference]: Start difference. First operand 4114 states and 4208 transitions. Second operand 97 states. [2018-10-10 15:23:01,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:23:01,663 INFO L93 Difference]: Finished difference Result 4286 states and 4384 transitions. [2018-10-10 15:23:01,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-10-10 15:23:01,664 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 2562 [2018-10-10 15:23:01,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:23:01,668 INFO L225 Difference]: With dead ends: 4286 [2018-10-10 15:23:01,668 INFO L226 Difference]: Without dead ends: 4286 [2018-10-10 15:23:01,670 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6533 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=11518, Invalid=24772, Unknown=0, NotChecked=0, Total=36290 [2018-10-10 15:23:01,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4286 states. [2018-10-10 15:23:01,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4286 to 4201. [2018-10-10 15:23:01,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4201 states. [2018-10-10 15:23:01,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4201 states to 4201 states and 4297 transitions. [2018-10-10 15:23:01,701 INFO L78 Accepts]: Start accepts. Automaton has 4201 states and 4297 transitions. Word has length 2562 [2018-10-10 15:23:01,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:23:01,703 INFO L481 AbstractCegarLoop]: Abstraction has 4201 states and 4297 transitions. [2018-10-10 15:23:01,703 INFO L482 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-10-10 15:23:01,703 INFO L276 IsEmpty]: Start isEmpty. Operand 4201 states and 4297 transitions. [2018-10-10 15:23:01,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2617 [2018-10-10 15:23:01,750 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:23:01,750 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:23:01,751 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:23:01,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:23:01,751 INFO L82 PathProgramCache]: Analyzing trace with hash -623497402, now seen corresponding path program 48 times [2018-10-10 15:23:01,752 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:23:01,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:23:12,092 INFO L134 CoverageAnalysis]: Checked inductivity of 60960 backedges. 0 proven. 60960 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:23:12,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:23:12,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-10-10 15:23:12,094 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-10-10 15:23:12,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-10-10 15:23:12,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2499, Invalid=7203, Unknown=0, NotChecked=0, Total=9702 [2018-10-10 15:23:12,096 INFO L87 Difference]: Start difference. First operand 4201 states and 4297 transitions. Second operand 99 states. [2018-10-10 15:23:21,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:23:21,591 INFO L93 Difference]: Finished difference Result 4373 states and 4473 transitions. [2018-10-10 15:23:21,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-10-10 15:23:21,591 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 2616 [2018-10-10 15:23:21,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:23:21,595 INFO L225 Difference]: With dead ends: 4373 [2018-10-10 15:23:21,595 INFO L226 Difference]: Without dead ends: 4373 [2018-10-10 15:23:21,597 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6816 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=12003, Invalid=25827, Unknown=0, NotChecked=0, Total=37830 [2018-10-10 15:23:21,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4373 states. [2018-10-10 15:23:21,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4373 to 4288. [2018-10-10 15:23:21,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4288 states. [2018-10-10 15:23:21,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4288 states to 4288 states and 4386 transitions. [2018-10-10 15:23:21,619 INFO L78 Accepts]: Start accepts. Automaton has 4288 states and 4386 transitions. Word has length 2616 [2018-10-10 15:23:21,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:23:21,620 INFO L481 AbstractCegarLoop]: Abstraction has 4288 states and 4386 transitions. [2018-10-10 15:23:21,621 INFO L482 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-10-10 15:23:21,621 INFO L276 IsEmpty]: Start isEmpty. Operand 4288 states and 4386 transitions. [2018-10-10 15:23:21,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2671 [2018-10-10 15:23:21,657 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:23:21,658 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:23:21,658 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:23:21,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:23:21,658 INFO L82 PathProgramCache]: Analyzing trace with hash 951495236, now seen corresponding path program 49 times [2018-10-10 15:23:21,659 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:23:21,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:23:33,170 INFO L134 CoverageAnalysis]: Checked inductivity of 63553 backedges. 0 proven. 63553 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:23:33,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:23:33,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-10-10 15:23:33,172 INFO L460 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-10-10 15:23:33,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-10-10 15:23:33,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2600, Invalid=7500, Unknown=0, NotChecked=0, Total=10100 [2018-10-10 15:23:33,173 INFO L87 Difference]: Start difference. First operand 4288 states and 4386 transitions. Second operand 101 states. [2018-10-10 15:23:42,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:23:42,995 INFO L93 Difference]: Finished difference Result 4460 states and 4562 transitions. [2018-10-10 15:23:42,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-10-10 15:23:42,996 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 2670 [2018-10-10 15:23:42,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:23:42,999 INFO L225 Difference]: With dead ends: 4460 [2018-10-10 15:23:42,999 INFO L226 Difference]: Without dead ends: 4460 [2018-10-10 15:23:43,002 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7105 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=12498, Invalid=26904, Unknown=0, NotChecked=0, Total=39402 [2018-10-10 15:23:43,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4460 states. [2018-10-10 15:23:43,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4460 to 4375. [2018-10-10 15:23:43,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4375 states. [2018-10-10 15:23:43,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4375 states to 4375 states and 4475 transitions. [2018-10-10 15:23:43,031 INFO L78 Accepts]: Start accepts. Automaton has 4375 states and 4475 transitions. Word has length 2670 [2018-10-10 15:23:43,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:23:43,032 INFO L481 AbstractCegarLoop]: Abstraction has 4375 states and 4475 transitions. [2018-10-10 15:23:43,032 INFO L482 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-10-10 15:23:43,032 INFO L276 IsEmpty]: Start isEmpty. Operand 4375 states and 4475 transitions. [2018-10-10 15:23:43,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2725 [2018-10-10 15:23:43,080 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:23:43,080 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:23:43,081 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:23:43,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:23:43,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1595655486, now seen corresponding path program 50 times [2018-10-10 15:23:43,082 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:23:43,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:23:54,359 INFO L134 CoverageAnalysis]: Checked inductivity of 66200 backedges. 0 proven. 66200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:23:54,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:23:54,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-10-10 15:23:54,360 INFO L460 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-10-10 15:23:54,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-10-10 15:23:54,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2703, Invalid=7803, Unknown=0, NotChecked=0, Total=10506 [2018-10-10 15:23:54,362 INFO L87 Difference]: Start difference. First operand 4375 states and 4475 transitions. Second operand 103 states. [2018-10-10 15:24:04,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:24:04,584 INFO L93 Difference]: Finished difference Result 4547 states and 4651 transitions. [2018-10-10 15:24:04,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2018-10-10 15:24:04,584 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 2724 [2018-10-10 15:24:04,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:24:04,590 INFO L225 Difference]: With dead ends: 4547 [2018-10-10 15:24:04,590 INFO L226 Difference]: Without dead ends: 4547 [2018-10-10 15:24:04,593 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7400 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=13003, Invalid=28003, Unknown=0, NotChecked=0, Total=41006 [2018-10-10 15:24:04,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4547 states. [2018-10-10 15:24:04,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4547 to 4462. [2018-10-10 15:24:04,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4462 states. [2018-10-10 15:24:04,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4462 states to 4462 states and 4564 transitions. [2018-10-10 15:24:04,618 INFO L78 Accepts]: Start accepts. Automaton has 4462 states and 4564 transitions. Word has length 2724 [2018-10-10 15:24:04,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:24:04,619 INFO L481 AbstractCegarLoop]: Abstraction has 4462 states and 4564 transitions. [2018-10-10 15:24:04,619 INFO L482 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-10-10 15:24:04,619 INFO L276 IsEmpty]: Start isEmpty. Operand 4462 states and 4564 transitions. [2018-10-10 15:24:04,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2779 [2018-10-10 15:24:04,659 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:24:04,659 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:24:04,659 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:24:04,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:24:04,660 INFO L82 PathProgramCache]: Analyzing trace with hash -859324224, now seen corresponding path program 51 times [2018-10-10 15:24:04,660 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:24:04,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:24:16,158 INFO L134 CoverageAnalysis]: Checked inductivity of 68901 backedges. 0 proven. 68901 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:24:16,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:24:16,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-10-10 15:24:16,160 INFO L460 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-10-10 15:24:16,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-10-10 15:24:16,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2808, Invalid=8112, Unknown=0, NotChecked=0, Total=10920 [2018-10-10 15:24:16,161 INFO L87 Difference]: Start difference. First operand 4462 states and 4564 transitions. Second operand 105 states. [2018-10-10 15:24:27,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:24:27,104 INFO L93 Difference]: Finished difference Result 4634 states and 4740 transitions. [2018-10-10 15:24:27,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2018-10-10 15:24:27,105 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 2778 [2018-10-10 15:24:27,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:24:27,110 INFO L225 Difference]: With dead ends: 4634 [2018-10-10 15:24:27,110 INFO L226 Difference]: Without dead ends: 4634 [2018-10-10 15:24:27,113 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7701 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=13518, Invalid=29124, Unknown=0, NotChecked=0, Total=42642 [2018-10-10 15:24:27,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4634 states. [2018-10-10 15:24:27,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4634 to 4549. [2018-10-10 15:24:27,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4549 states. [2018-10-10 15:24:27,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4549 states to 4549 states and 4653 transitions. [2018-10-10 15:24:27,140 INFO L78 Accepts]: Start accepts. Automaton has 4549 states and 4653 transitions. Word has length 2778 [2018-10-10 15:24:27,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:24:27,141 INFO L481 AbstractCegarLoop]: Abstraction has 4549 states and 4653 transitions. [2018-10-10 15:24:27,142 INFO L482 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-10-10 15:24:27,142 INFO L276 IsEmpty]: Start isEmpty. Operand 4549 states and 4653 transitions. [2018-10-10 15:24:27,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2833 [2018-10-10 15:24:27,192 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:24:27,192 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:24:27,193 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:24:27,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:24:27,193 INFO L82 PathProgramCache]: Analyzing trace with hash 576855102, now seen corresponding path program 52 times [2018-10-10 15:24:27,194 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:24:27,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:24:39,761 INFO L134 CoverageAnalysis]: Checked inductivity of 71656 backedges. 0 proven. 71656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:24:39,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:24:39,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-10-10 15:24:39,763 INFO L460 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-10-10 15:24:39,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-10-10 15:24:39,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2915, Invalid=8427, Unknown=0, NotChecked=0, Total=11342 [2018-10-10 15:24:39,764 INFO L87 Difference]: Start difference. First operand 4549 states and 4653 transitions. Second operand 107 states. [2018-10-10 15:24:50,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:24:50,690 INFO L93 Difference]: Finished difference Result 4721 states and 4829 transitions. [2018-10-10 15:24:50,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2018-10-10 15:24:50,690 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 2832 [2018-10-10 15:24:50,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:24:50,696 INFO L225 Difference]: With dead ends: 4721 [2018-10-10 15:24:50,696 INFO L226 Difference]: Without dead ends: 4721 [2018-10-10 15:24:50,699 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8008 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=14043, Invalid=30267, Unknown=0, NotChecked=0, Total=44310 [2018-10-10 15:24:50,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4721 states. [2018-10-10 15:24:50,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4721 to 4636. [2018-10-10 15:24:50,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4636 states. [2018-10-10 15:24:50,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4636 states to 4636 states and 4742 transitions. [2018-10-10 15:24:50,722 INFO L78 Accepts]: Start accepts. Automaton has 4636 states and 4742 transitions. Word has length 2832 [2018-10-10 15:24:50,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:24:50,723 INFO L481 AbstractCegarLoop]: Abstraction has 4636 states and 4742 transitions. [2018-10-10 15:24:50,723 INFO L482 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-10-10 15:24:50,723 INFO L276 IsEmpty]: Start isEmpty. Operand 4636 states and 4742 transitions. [2018-10-10 15:24:50,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2887 [2018-10-10 15:24:50,770 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:24:50,770 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:24:50,771 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:24:50,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:24:50,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1380724028, now seen corresponding path program 53 times [2018-10-10 15:24:50,772 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:24:50,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:25:03,107 INFO L134 CoverageAnalysis]: Checked inductivity of 74465 backedges. 0 proven. 74465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:25:03,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:25:03,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-10-10 15:25:03,109 INFO L460 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-10-10 15:25:03,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-10-10 15:25:03,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3024, Invalid=8748, Unknown=0, NotChecked=0, Total=11772 [2018-10-10 15:25:03,110 INFO L87 Difference]: Start difference. First operand 4636 states and 4742 transitions. Second operand 109 states. [2018-10-10 15:25:15,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:25:15,123 INFO L93 Difference]: Finished difference Result 4808 states and 4918 transitions. [2018-10-10 15:25:15,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2018-10-10 15:25:15,124 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 2886 [2018-10-10 15:25:15,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:25:15,127 INFO L225 Difference]: With dead ends: 4808 [2018-10-10 15:25:15,127 INFO L226 Difference]: Without dead ends: 4808 [2018-10-10 15:25:15,129 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8321 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=14578, Invalid=31432, Unknown=0, NotChecked=0, Total=46010 [2018-10-10 15:25:15,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4808 states. [2018-10-10 15:25:15,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4808 to 4723. [2018-10-10 15:25:15,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4723 states. [2018-10-10 15:25:15,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4723 states to 4723 states and 4831 transitions. [2018-10-10 15:25:15,152 INFO L78 Accepts]: Start accepts. Automaton has 4723 states and 4831 transitions. Word has length 2886 [2018-10-10 15:25:15,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:25:15,153 INFO L481 AbstractCegarLoop]: Abstraction has 4723 states and 4831 transitions. [2018-10-10 15:25:15,154 INFO L482 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-10-10 15:25:15,154 INFO L276 IsEmpty]: Start isEmpty. Operand 4723 states and 4831 transitions. [2018-10-10 15:25:15,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2941 [2018-10-10 15:25:15,195 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:25:15,196 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:25:15,196 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:25:15,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:25:15,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1974916026, now seen corresponding path program 54 times [2018-10-10 15:25:15,197 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:25:15,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:25:27,982 INFO L134 CoverageAnalysis]: Checked inductivity of 77328 backedges. 0 proven. 77328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:25:27,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:25:27,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-10-10 15:25:27,984 INFO L460 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-10-10 15:25:27,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-10-10 15:25:27,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3135, Invalid=9075, Unknown=0, NotChecked=0, Total=12210 [2018-10-10 15:25:27,985 INFO L87 Difference]: Start difference. First operand 4723 states and 4831 transitions. Second operand 111 states. [2018-10-10 15:25:40,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:25:40,348 INFO L93 Difference]: Finished difference Result 4895 states and 5007 transitions. [2018-10-10 15:25:40,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2018-10-10 15:25:40,349 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 2940 [2018-10-10 15:25:40,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:25:40,353 INFO L225 Difference]: With dead ends: 4895 [2018-10-10 15:25:40,353 INFO L226 Difference]: Without dead ends: 4895 [2018-10-10 15:25:40,355 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8640 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=15123, Invalid=32619, Unknown=0, NotChecked=0, Total=47742 [2018-10-10 15:25:40,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4895 states. [2018-10-10 15:25:40,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4895 to 4810. [2018-10-10 15:25:40,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4810 states. [2018-10-10 15:25:40,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4810 states to 4810 states and 4920 transitions. [2018-10-10 15:25:40,376 INFO L78 Accepts]: Start accepts. Automaton has 4810 states and 4920 transitions. Word has length 2940 [2018-10-10 15:25:40,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:25:40,377 INFO L481 AbstractCegarLoop]: Abstraction has 4810 states and 4920 transitions. [2018-10-10 15:25:40,377 INFO L482 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-10-10 15:25:40,377 INFO L276 IsEmpty]: Start isEmpty. Operand 4810 states and 4920 transitions. [2018-10-10 15:25:40,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2995 [2018-10-10 15:25:40,416 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:25:40,416 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:25:40,416 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:25:40,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:25:40,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1402277960, now seen corresponding path program 55 times [2018-10-10 15:25:40,417 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:25:40,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:25:53,605 INFO L134 CoverageAnalysis]: Checked inductivity of 80245 backedges. 0 proven. 80245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:25:53,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:25:53,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-10-10 15:25:53,606 INFO L460 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-10-10 15:25:53,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-10-10 15:25:53,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3248, Invalid=9408, Unknown=0, NotChecked=0, Total=12656 [2018-10-10 15:25:53,607 INFO L87 Difference]: Start difference. First operand 4810 states and 4920 transitions. Second operand 113 states.