java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplTransformed.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20181015-LoopsPathprograms/count_by_1_true-unreach-call_true-termination.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2d08e6e [2018-10-15 12:55:34,004 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 12:55:34,006 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 12:55:34,019 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 12:55:34,019 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 12:55:34,021 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 12:55:34,022 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 12:55:34,024 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 12:55:34,025 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 12:55:34,026 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 12:55:34,027 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 12:55:34,027 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 12:55:34,028 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 12:55:34,029 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 12:55:34,030 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 12:55:34,031 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 12:55:34,032 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 12:55:34,034 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 12:55:34,036 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 12:55:34,037 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 12:55:34,039 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 12:55:34,041 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 12:55:34,044 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 12:55:34,044 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 12:55:34,044 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 12:55:34,046 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 12:55:34,047 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 12:55:34,048 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 12:55:34,049 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 12:55:34,050 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 12:55:34,050 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 12:55:34,051 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 12:55:34,051 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 12:55:34,051 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 12:55:34,052 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 12:55:34,053 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 12:55:34,053 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-15 12:55:34,065 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 12:55:34,065 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 12:55:34,067 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 12:55:34,067 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 12:55:34,068 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 12:55:34,068 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 12:55:34,068 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 12:55:34,069 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 12:55:34,069 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 12:55:34,070 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 12:55:34,070 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 12:55:34,070 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 12:55:34,070 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 12:55:34,071 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 12:55:34,071 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 12:55:34,137 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 12:55:34,150 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 12:55:34,157 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 12:55:34,159 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 12:55:34,159 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 12:55:34,160 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/count_by_1_true-unreach-call_true-termination.i_3.bpl [2018-10-15 12:55:34,161 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/count_by_1_true-unreach-call_true-termination.i_3.bpl' [2018-10-15 12:55:34,216 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 12:55:34,217 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-15 12:55:34,218 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 12:55:34,218 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 12:55:34,218 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 12:55:34,247 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "count_by_1_true-unreach-call_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:34" (1/1) ... [2018-10-15 12:55:34,249 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "count_by_1_true-unreach-call_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:34" (1/1) ... [2018-10-15 12:55:34,259 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "count_by_1_true-unreach-call_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:34" (1/1) ... [2018-10-15 12:55:34,260 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "count_by_1_true-unreach-call_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:34" (1/1) ... [2018-10-15 12:55:34,264 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "count_by_1_true-unreach-call_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:34" (1/1) ... [2018-10-15 12:55:34,266 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "count_by_1_true-unreach-call_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:34" (1/1) ... [2018-10-15 12:55:34,268 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "count_by_1_true-unreach-call_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:34" (1/1) ... [2018-10-15 12:55:34,269 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 12:55:34,271 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 12:55:34,271 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 12:55:34,272 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 12:55:34,273 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "count_by_1_true-unreach-call_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:34" (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-15 12:55:34,350 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-15 12:55:34,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 12:55:34,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 12:55:34,645 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 12:55:34,646 INFO L202 PluginConnector]: Adding new model count_by_1_true-unreach-call_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:55:34 BoogieIcfgContainer [2018-10-15 12:55:34,646 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 12:55:34,646 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-15 12:55:34,646 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-15 12:55:34,647 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-15 12:55:34,651 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "count_by_1_true-unreach-call_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:55:34" (1/1) ... [2018-10-15 12:55:34,656 WARN L219 ansformationObserver]: HeapSeparator: input icfg has no '#valid' array -- returning unchanged Icfg! [2018-10-15 12:55:34,670 INFO L202 PluginConnector]: Adding new model count_by_1_true-unreach-call_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 12:55:34 BasicIcfg [2018-10-15 12:55:34,670 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-15 12:55:34,671 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 12:55:34,671 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 12:55:34,675 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 12:55:34,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "count_by_1_true-unreach-call_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:34" (1/3) ... [2018-10-15 12:55:34,676 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@323461f6 and model type count_by_1_true-unreach-call_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 12:55:34, skipping insertion in model container [2018-10-15 12:55:34,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "count_by_1_true-unreach-call_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:55:34" (2/3) ... [2018-10-15 12:55:34,677 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@323461f6 and model type count_by_1_true-unreach-call_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 12:55:34, skipping insertion in model container [2018-10-15 12:55:34,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "count_by_1_true-unreach-call_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 12:55:34" (3/3) ... [2018-10-15 12:55:34,678 INFO L112 eAbstractionObserver]: Analyzing ICFG count_by_1_true-unreach-call_true-termination.i_3.bplleft_unchanged_by_heapseparator [2018-10-15 12:55:34,689 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 12:55:34,697 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 12:55:34,715 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 12:55:34,744 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 12:55:34,745 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 12:55:34,745 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 12:55:34,746 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 12:55:34,746 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 12:55:34,746 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 12:55:34,746 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 12:55:34,746 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 12:55:34,747 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 12:55:34,761 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2018-10-15 12:55:34,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-15 12:55:34,769 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:34,770 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:34,772 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:34,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:34,778 INFO L82 PathProgramCache]: Analyzing trace with hash -85388152, now seen corresponding path program 1 times [2018-10-15 12:55:34,833 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:34,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:34,927 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-15 12:55:34,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 12:55:34,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 12:55:34,935 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 12:55:34,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 12:55:34,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 12:55:34,952 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 3 states. [2018-10-15 12:55:35,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:35,098 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-10-15 12:55:35,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 12:55:35,100 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-10-15 12:55:35,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:35,122 INFO L225 Difference]: With dead ends: 17 [2018-10-15 12:55:35,122 INFO L226 Difference]: Without dead ends: 17 [2018-10-15 12:55:35,126 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-15 12:55:35,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-10-15 12:55:35,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2018-10-15 12:55:35,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-10-15 12:55:35,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-10-15 12:55:35,168 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 10 [2018-10-15 12:55:35,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:35,168 INFO L481 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-10-15 12:55:35,168 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 12:55:35,169 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-10-15 12:55:35,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-15 12:55:35,169 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:35,169 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:35,170 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:35,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:35,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1760194868, now seen corresponding path program 1 times [2018-10-15 12:55:35,171 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:35,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:35,297 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-15 12:55:35,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:35,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-15 12:55:35,299 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 12:55:35,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 12:55:35,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-15 12:55:35,300 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 5 states. [2018-10-15 12:55:35,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:35,411 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-10-15 12:55:35,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-15 12:55:35,412 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-10-15 12:55:35,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:35,412 INFO L225 Difference]: With dead ends: 21 [2018-10-15 12:55:35,413 INFO L226 Difference]: Without dead ends: 21 [2018-10-15 12:55:35,414 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-15 12:55:35,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-15 12:55:35,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2018-10-15 12:55:35,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-15 12:55:35,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-10-15 12:55:35,418 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 14 [2018-10-15 12:55:35,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:35,418 INFO L481 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-10-15 12:55:35,419 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 12:55:35,419 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-10-15 12:55:35,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-15 12:55:35,420 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:35,420 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:35,420 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:35,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:35,421 INFO L82 PathProgramCache]: Analyzing trace with hash -130857200, now seen corresponding path program 2 times [2018-10-15 12:55:35,422 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:35,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:35,637 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:35,641 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:35,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-15 12:55:35,641 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-15 12:55:35,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-15 12:55:35,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-15 12:55:35,642 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 7 states. [2018-10-15 12:55:36,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:36,010 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-10-15 12:55:36,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-15 12:55:36,011 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-10-15 12:55:36,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:36,012 INFO L225 Difference]: With dead ends: 25 [2018-10-15 12:55:36,013 INFO L226 Difference]: Without dead ends: 25 [2018-10-15 12:55:36,013 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-15 12:55:36,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-15 12:55:36,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-10-15 12:55:36,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-15 12:55:36,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-10-15 12:55:36,021 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 18 [2018-10-15 12:55:36,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:36,021 INFO L481 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-10-15 12:55:36,022 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-15 12:55:36,023 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-10-15 12:55:36,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-15 12:55:36,024 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:36,024 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:36,025 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:36,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:36,026 INFO L82 PathProgramCache]: Analyzing trace with hash -1485619884, now seen corresponding path program 3 times [2018-10-15 12:55:36,027 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:36,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:36,310 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:36,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:36,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-15 12:55:36,312 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 12:55:36,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 12:55:36,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-10-15 12:55:36,313 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 9 states. [2018-10-15 12:55:36,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:36,487 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-10-15 12:55:36,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-15 12:55:36,488 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-10-15 12:55:36,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:36,490 INFO L225 Difference]: With dead ends: 29 [2018-10-15 12:55:36,490 INFO L226 Difference]: Without dead ends: 29 [2018-10-15 12:55:36,492 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2018-10-15 12:55:36,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-15 12:55:36,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-10-15 12:55:36,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-15 12:55:36,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-10-15 12:55:36,497 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 22 [2018-10-15 12:55:36,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:36,497 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-10-15 12:55:36,497 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 12:55:36,498 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-10-15 12:55:36,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-15 12:55:36,499 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:36,499 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:36,499 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:36,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:36,500 INFO L82 PathProgramCache]: Analyzing trace with hash 763785624, now seen corresponding path program 4 times [2018-10-15 12:55:36,501 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:36,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:36,985 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:36,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:36,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 12:55:36,987 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 12:55:36,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 12:55:36,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-10-15 12:55:36,988 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 11 states. [2018-10-15 12:55:37,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:37,228 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-10-15 12:55:37,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-15 12:55:37,230 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2018-10-15 12:55:37,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:37,231 INFO L225 Difference]: With dead ends: 33 [2018-10-15 12:55:37,231 INFO L226 Difference]: Without dead ends: 33 [2018-10-15 12:55:37,232 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=123, Invalid=219, Unknown=0, NotChecked=0, Total=342 [2018-10-15 12:55:37,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-15 12:55:37,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2018-10-15 12:55:37,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-15 12:55:37,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-10-15 12:55:37,236 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 26 [2018-10-15 12:55:37,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:37,237 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-10-15 12:55:37,237 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 12:55:37,237 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-10-15 12:55:37,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-15 12:55:37,238 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:37,238 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:37,239 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:37,239 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:37,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1386079196, now seen corresponding path program 5 times [2018-10-15 12:55:37,240 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:37,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:37,469 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:37,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:37,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-15 12:55:37,470 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-15 12:55:37,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-15 12:55:37,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-10-15 12:55:37,471 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 13 states. [2018-10-15 12:55:37,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:37,813 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-10-15 12:55:37,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-15 12:55:37,816 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2018-10-15 12:55:37,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:37,818 INFO L225 Difference]: With dead ends: 37 [2018-10-15 12:55:37,818 INFO L226 Difference]: Without dead ends: 37 [2018-10-15 12:55:37,819 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-15 12:55:37,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-15 12:55:37,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2018-10-15 12:55:37,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-15 12:55:37,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-10-15 12:55:37,823 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 30 [2018-10-15 12:55:37,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:37,824 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-10-15 12:55:37,824 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-15 12:55:37,824 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-10-15 12:55:37,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-15 12:55:37,825 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:37,825 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:37,826 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:37,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:37,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1584043040, now seen corresponding path program 6 times [2018-10-15 12:55:37,827 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:37,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:37,991 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:37,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:37,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 12:55:37,992 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 12:55:37,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 12:55:37,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-10-15 12:55:37,993 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 15 states. [2018-10-15 12:55:38,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:38,546 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-10-15 12:55:38,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-15 12:55:38,548 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2018-10-15 12:55:38,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:38,550 INFO L225 Difference]: With dead ends: 41 [2018-10-15 12:55:38,550 INFO L226 Difference]: Without dead ends: 41 [2018-10-15 12:55:38,551 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=243, Invalid=459, Unknown=0, NotChecked=0, Total=702 [2018-10-15 12:55:38,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-15 12:55:38,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2018-10-15 12:55:38,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-15 12:55:38,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-10-15 12:55:38,557 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 34 [2018-10-15 12:55:38,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:38,558 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-10-15 12:55:38,558 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 12:55:38,558 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-10-15 12:55:38,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-15 12:55:38,559 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:38,560 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:38,560 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:38,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:38,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1478328932, now seen corresponding path program 7 times [2018-10-15 12:55:38,561 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:38,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:38,796 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:38,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:38,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-15 12:55:38,797 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-15 12:55:38,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-15 12:55:38,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2018-10-15 12:55:38,798 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 17 states. [2018-10-15 12:55:39,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:39,134 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-10-15 12:55:39,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-15 12:55:39,136 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 38 [2018-10-15 12:55:39,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:39,137 INFO L225 Difference]: With dead ends: 45 [2018-10-15 12:55:39,138 INFO L226 Difference]: Without dead ends: 45 [2018-10-15 12:55:39,139 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=318, Invalid=612, Unknown=0, NotChecked=0, Total=930 [2018-10-15 12:55:39,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-15 12:55:39,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2018-10-15 12:55:39,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-15 12:55:39,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-10-15 12:55:39,143 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 38 [2018-10-15 12:55:39,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:39,144 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-10-15 12:55:39,144 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-15 12:55:39,144 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-10-15 12:55:39,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-15 12:55:39,145 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:39,146 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:39,148 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:39,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:39,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1181200040, now seen corresponding path program 8 times [2018-10-15 12:55:39,150 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:39,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:39,403 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:39,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:39,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-15 12:55:39,405 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-15 12:55:39,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-15 12:55:39,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2018-10-15 12:55:39,406 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 19 states. [2018-10-15 12:55:39,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:39,929 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-10-15 12:55:39,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-15 12:55:39,930 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 42 [2018-10-15 12:55:39,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:39,931 INFO L225 Difference]: With dead ends: 49 [2018-10-15 12:55:39,931 INFO L226 Difference]: Without dead ends: 49 [2018-10-15 12:55:39,933 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=403, Invalid=787, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 12:55:39,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-15 12:55:39,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2018-10-15 12:55:39,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-15 12:55:39,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-10-15 12:55:39,937 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 42 [2018-10-15 12:55:39,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:39,938 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-10-15 12:55:39,938 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-15 12:55:39,938 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-10-15 12:55:39,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-15 12:55:39,939 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:39,939 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:39,939 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:39,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:39,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1870272748, now seen corresponding path program 9 times [2018-10-15 12:55:39,941 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:39,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:40,543 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:40,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:40,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 12:55:40,544 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 12:55:40,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 12:55:40,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2018-10-15 12:55:40,545 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 21 states. [2018-10-15 12:55:40,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:40,947 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-10-15 12:55:40,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-15 12:55:40,948 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 46 [2018-10-15 12:55:40,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:40,950 INFO L225 Difference]: With dead ends: 53 [2018-10-15 12:55:40,950 INFO L226 Difference]: Without dead ends: 53 [2018-10-15 12:55:40,952 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=498, Invalid=984, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 12:55:40,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-15 12:55:40,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2018-10-15 12:55:40,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-15 12:55:40,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-10-15 12:55:40,957 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 46 [2018-10-15 12:55:40,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:40,957 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-10-15 12:55:40,957 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 12:55:40,958 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-10-15 12:55:40,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-15 12:55:40,958 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:40,959 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:40,959 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:40,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:40,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1727676112, now seen corresponding path program 10 times [2018-10-15 12:55:40,960 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:40,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:41,271 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:41,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:41,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-15 12:55:41,272 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-15 12:55:41,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-15 12:55:41,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2018-10-15 12:55:41,273 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 23 states. [2018-10-15 12:55:41,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:41,751 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-10-15 12:55:41,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-15 12:55:41,752 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 50 [2018-10-15 12:55:41,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:41,753 INFO L225 Difference]: With dead ends: 57 [2018-10-15 12:55:41,754 INFO L226 Difference]: Without dead ends: 57 [2018-10-15 12:55:41,755 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=603, Invalid=1203, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 12:55:41,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-15 12:55:41,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2018-10-15 12:55:41,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-15 12:55:41,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-10-15 12:55:41,759 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 50 [2018-10-15 12:55:41,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:41,760 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-10-15 12:55:41,760 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-15 12:55:41,760 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-10-15 12:55:41,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-15 12:55:41,761 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:41,761 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:41,761 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:41,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:41,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1211869044, now seen corresponding path program 11 times [2018-10-15 12:55:41,763 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:41,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:42,309 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:42,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:42,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-15 12:55:42,311 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-15 12:55:42,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-15 12:55:42,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2018-10-15 12:55:42,311 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 25 states. [2018-10-15 12:55:43,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:43,085 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-10-15 12:55:43,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-15 12:55:43,086 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 54 [2018-10-15 12:55:43,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:43,087 INFO L225 Difference]: With dead ends: 61 [2018-10-15 12:55:43,087 INFO L226 Difference]: Without dead ends: 61 [2018-10-15 12:55:43,088 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=718, Invalid=1444, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 12:55:43,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-10-15 12:55:43,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2018-10-15 12:55:43,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-15 12:55:43,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-10-15 12:55:43,093 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 54 [2018-10-15 12:55:43,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:43,094 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-10-15 12:55:43,094 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-15 12:55:43,094 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-10-15 12:55:43,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-15 12:55:43,095 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:43,095 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:43,095 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:43,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:43,096 INFO L82 PathProgramCache]: Analyzing trace with hash 30198712, now seen corresponding path program 12 times [2018-10-15 12:55:43,096 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:43,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:43,412 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:43,413 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:43,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 12:55:43,413 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 12:55:43,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 12:55:43,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2018-10-15 12:55:43,414 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 27 states. [2018-10-15 12:55:43,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:43,909 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-10-15 12:55:43,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-15 12:55:43,909 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 58 [2018-10-15 12:55:43,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:43,911 INFO L225 Difference]: With dead ends: 65 [2018-10-15 12:55:43,911 INFO L226 Difference]: Without dead ends: 65 [2018-10-15 12:55:43,912 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=843, Invalid=1707, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 12:55:43,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-10-15 12:55:43,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2018-10-15 12:55:43,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-15 12:55:43,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-10-15 12:55:43,917 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 58 [2018-10-15 12:55:43,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:43,917 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-10-15 12:55:43,917 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 12:55:43,918 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-10-15 12:55:43,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-15 12:55:43,918 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:43,919 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:43,919 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:43,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:43,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1981141508, now seen corresponding path program 13 times [2018-10-15 12:55:43,920 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:43,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:44,614 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:44,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:44,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 12:55:44,615 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 12:55:44,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 12:55:44,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=588, Unknown=0, NotChecked=0, Total=812 [2018-10-15 12:55:44,616 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 29 states. [2018-10-15 12:55:45,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:45,818 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-10-15 12:55:45,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-15 12:55:45,819 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 62 [2018-10-15 12:55:45,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:45,820 INFO L225 Difference]: With dead ends: 69 [2018-10-15 12:55:45,820 INFO L226 Difference]: Without dead ends: 69 [2018-10-15 12:55:45,822 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=978, Invalid=1992, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 12:55:45,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-15 12:55:45,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-10-15 12:55:45,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-15 12:55:45,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-10-15 12:55:45,828 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 62 [2018-10-15 12:55:45,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:45,829 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-10-15 12:55:45,829 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 12:55:45,829 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-10-15 12:55:45,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-15 12:55:45,830 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:45,831 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:45,831 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:45,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:45,831 INFO L82 PathProgramCache]: Analyzing trace with hash 608489024, now seen corresponding path program 14 times [2018-10-15 12:55:45,832 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:45,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:46,310 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:46,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:46,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 12:55:46,311 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 12:55:46,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 12:55:46,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2018-10-15 12:55:46,312 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 31 states. [2018-10-15 12:55:46,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:46,960 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-10-15 12:55:46,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-15 12:55:46,961 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 66 [2018-10-15 12:55:46,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:46,961 INFO L225 Difference]: With dead ends: 73 [2018-10-15 12:55:46,962 INFO L226 Difference]: Without dead ends: 73 [2018-10-15 12:55:46,964 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1123, Invalid=2299, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 12:55:46,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-10-15 12:55:46,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2018-10-15 12:55:46,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-10-15 12:55:46,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-10-15 12:55:46,968 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 66 [2018-10-15 12:55:46,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:46,968 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-10-15 12:55:46,968 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 12:55:46,969 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-10-15 12:55:46,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-10-15 12:55:46,969 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:46,970 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:46,970 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:46,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:46,970 INFO L82 PathProgramCache]: Analyzing trace with hash -737301372, now seen corresponding path program 15 times [2018-10-15 12:55:46,971 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:46,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:47,598 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:47,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:47,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 12:55:47,600 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 12:55:47,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 12:55:47,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 12:55:47,601 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 33 states. [2018-10-15 12:55:48,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:48,279 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-10-15 12:55:48,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-15 12:55:48,280 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 70 [2018-10-15 12:55:48,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:48,281 INFO L225 Difference]: With dead ends: 77 [2018-10-15 12:55:48,281 INFO L226 Difference]: Without dead ends: 77 [2018-10-15 12:55:48,282 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1278, Invalid=2628, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 12:55:48,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-10-15 12:55:48,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2018-10-15 12:55:48,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-15 12:55:48,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-10-15 12:55:48,287 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 70 [2018-10-15 12:55:48,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:48,287 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-10-15 12:55:48,287 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 12:55:48,287 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-10-15 12:55:48,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-15 12:55:48,288 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:48,288 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:48,288 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:48,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:48,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1678391096, now seen corresponding path program 16 times [2018-10-15 12:55:48,289 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:48,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:48,719 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:48,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:48,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 12:55:48,720 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 12:55:48,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 12:55:48,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 12:55:48,720 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 35 states. [2018-10-15 12:55:49,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:49,475 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-10-15 12:55:49,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-15 12:55:49,476 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 74 [2018-10-15 12:55:49,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:49,477 INFO L225 Difference]: With dead ends: 81 [2018-10-15 12:55:49,477 INFO L226 Difference]: Without dead ends: 81 [2018-10-15 12:55:49,479 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1443, Invalid=2979, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 12:55:49,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-10-15 12:55:49,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2018-10-15 12:55:49,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-10-15 12:55:49,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-10-15 12:55:49,482 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 74 [2018-10-15 12:55:49,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:49,483 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-10-15 12:55:49,483 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 12:55:49,483 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-10-15 12:55:49,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-15 12:55:49,484 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:49,484 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:49,484 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:49,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:49,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1104272628, now seen corresponding path program 17 times [2018-10-15 12:55:49,485 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:49,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:50,062 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:50,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:50,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 12:55:50,063 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 12:55:50,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 12:55:50,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 12:55:50,064 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 37 states. [2018-10-15 12:55:51,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:51,054 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-10-15 12:55:51,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-15 12:55:51,054 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 78 [2018-10-15 12:55:51,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:51,055 INFO L225 Difference]: With dead ends: 85 [2018-10-15 12:55:51,055 INFO L226 Difference]: Without dead ends: 85 [2018-10-15 12:55:51,058 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 833 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1618, Invalid=3352, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 12:55:51,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-15 12:55:51,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2018-10-15 12:55:51,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-10-15 12:55:51,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-10-15 12:55:51,061 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 78 [2018-10-15 12:55:51,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:51,062 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-10-15 12:55:51,062 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 12:55:51,062 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-10-15 12:55:51,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-15 12:55:51,063 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:51,063 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:51,063 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:51,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:51,064 INFO L82 PathProgramCache]: Analyzing trace with hash -60310704, now seen corresponding path program 18 times [2018-10-15 12:55:51,064 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:51,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:51,757 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:51,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:51,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 12:55:51,758 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 12:55:51,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 12:55:51,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 12:55:51,759 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 39 states. [2018-10-15 12:55:52,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:52,980 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-10-15 12:55:52,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-15 12:55:52,981 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 82 [2018-10-15 12:55:52,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:52,982 INFO L225 Difference]: With dead ends: 89 [2018-10-15 12:55:52,982 INFO L226 Difference]: Without dead ends: 89 [2018-10-15 12:55:52,985 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1803, Invalid=3747, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 12:55:52,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-10-15 12:55:52,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2018-10-15 12:55:52,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-10-15 12:55:52,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-10-15 12:55:52,989 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 82 [2018-10-15 12:55:52,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:52,989 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-10-15 12:55:52,989 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 12:55:52,989 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-10-15 12:55:52,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-15 12:55:52,990 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:52,990 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:52,991 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:52,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:52,991 INFO L82 PathProgramCache]: Analyzing trace with hash -674000492, now seen corresponding path program 19 times [2018-10-15 12:55:52,992 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:52,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:54,283 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:54,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:54,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 12:55:54,284 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 12:55:54,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 12:55:54,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=1200, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 12:55:54,285 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 41 states. [2018-10-15 12:55:55,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:55,314 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-10-15 12:55:55,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-15 12:55:55,315 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 86 [2018-10-15 12:55:55,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:55,316 INFO L225 Difference]: With dead ends: 93 [2018-10-15 12:55:55,316 INFO L226 Difference]: Without dead ends: 93 [2018-10-15 12:55:55,319 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1045 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1998, Invalid=4164, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 12:55:55,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-10-15 12:55:55,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2018-10-15 12:55:55,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-10-15 12:55:55,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-10-15 12:55:55,321 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 86 [2018-10-15 12:55:55,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:55,321 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-10-15 12:55:55,322 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 12:55:55,322 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-10-15 12:55:55,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-15 12:55:55,322 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:55,323 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:55,323 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:55,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:55,323 INFO L82 PathProgramCache]: Analyzing trace with hash -786258472, now seen corresponding path program 20 times [2018-10-15 12:55:55,324 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:55,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:56,171 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:56,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:56,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 12:55:56,172 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 12:55:56,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 12:55:56,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 12:55:56,174 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 43 states. [2018-10-15 12:55:57,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:57,747 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-10-15 12:55:57,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-15 12:55:57,748 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 90 [2018-10-15 12:55:57,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:57,749 INFO L225 Difference]: With dead ends: 97 [2018-10-15 12:55:57,749 INFO L226 Difference]: Without dead ends: 97 [2018-10-15 12:55:57,751 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1160 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2203, Invalid=4603, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 12:55:57,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-10-15 12:55:57,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2018-10-15 12:55:57,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-10-15 12:55:57,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-10-15 12:55:57,753 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 90 [2018-10-15 12:55:57,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:57,754 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-10-15 12:55:57,754 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 12:55:57,754 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-10-15 12:55:57,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-15 12:55:57,755 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:57,755 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:57,755 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:57,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:57,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1467615204, now seen corresponding path program 21 times [2018-10-15 12:55:57,756 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:57,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:58,450 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:58,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:58,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 12:55:58,451 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 12:55:58,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 12:55:58,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=1452, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 12:55:58,452 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 45 states. [2018-10-15 12:55:59,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:59,669 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-10-15 12:55:59,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-15 12:55:59,672 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 94 [2018-10-15 12:55:59,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:59,673 INFO L225 Difference]: With dead ends: 101 [2018-10-15 12:55:59,673 INFO L226 Difference]: Without dead ends: 101 [2018-10-15 12:55:59,675 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1281 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2418, Invalid=5064, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 12:55:59,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-10-15 12:55:59,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2018-10-15 12:55:59,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-10-15 12:55:59,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-10-15 12:55:59,678 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 94 [2018-10-15 12:55:59,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:59,678 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-10-15 12:55:59,678 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 12:55:59,679 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-10-15 12:55:59,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-10-15 12:55:59,679 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:59,680 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:59,680 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:59,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:59,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1649506208, now seen corresponding path program 22 times [2018-10-15 12:55:59,681 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:59,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:00,381 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:00,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:00,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 12:56:00,382 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 12:56:00,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 12:56:00,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=1587, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 12:56:00,383 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 47 states. [2018-10-15 12:56:01,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:01,782 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-10-15 12:56:01,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-15 12:56:01,782 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 98 [2018-10-15 12:56:01,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:01,783 INFO L225 Difference]: With dead ends: 105 [2018-10-15 12:56:01,783 INFO L226 Difference]: Without dead ends: 105 [2018-10-15 12:56:01,784 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1408 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2643, Invalid=5547, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 12:56:01,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-10-15 12:56:01,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2018-10-15 12:56:01,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-10-15 12:56:01,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-10-15 12:56:01,787 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 98 [2018-10-15 12:56:01,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:01,788 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-10-15 12:56:01,788 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 12:56:01,788 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-10-15 12:56:01,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-15 12:56:01,789 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:01,789 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:01,789 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:01,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:01,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1345497436, now seen corresponding path program 23 times [2018-10-15 12:56:01,790 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:01,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:02,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:02,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:02,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 12:56:02,828 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 12:56:02,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 12:56:02,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=624, Invalid=1728, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 12:56:02,829 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 49 states. [2018-10-15 12:56:04,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:04,181 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-10-15 12:56:04,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-15 12:56:04,181 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 102 [2018-10-15 12:56:04,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:04,183 INFO L225 Difference]: With dead ends: 109 [2018-10-15 12:56:04,183 INFO L226 Difference]: Without dead ends: 109 [2018-10-15 12:56:04,184 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1541 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2878, Invalid=6052, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 12:56:04,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-10-15 12:56:04,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2018-10-15 12:56:04,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-10-15 12:56:04,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-10-15 12:56:04,187 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 102 [2018-10-15 12:56:04,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:04,187 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-10-15 12:56:04,188 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 12:56:04,188 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-10-15 12:56:04,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-15 12:56:04,188 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:04,188 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:04,189 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:04,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:04,189 INFO L82 PathProgramCache]: Analyzing trace with hash -577543448, now seen corresponding path program 24 times [2018-10-15 12:56:04,190 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:04,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:05,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:05,124 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:05,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 12:56:05,124 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 12:56:05,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 12:56:05,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 12:56:05,125 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 51 states. [2018-10-15 12:56:06,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:06,584 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-10-15 12:56:06,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-15 12:56:06,585 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 106 [2018-10-15 12:56:06,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:06,586 INFO L225 Difference]: With dead ends: 113 [2018-10-15 12:56:06,586 INFO L226 Difference]: Without dead ends: 113 [2018-10-15 12:56:06,587 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1680 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3123, Invalid=6579, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 12:56:06,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-10-15 12:56:06,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2018-10-15 12:56:06,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-10-15 12:56:06,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-10-15 12:56:06,591 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 106 [2018-10-15 12:56:06,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:06,591 INFO L481 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-10-15 12:56:06,591 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 12:56:06,592 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-10-15 12:56:06,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-15 12:56:06,592 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:06,593 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:06,593 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:06,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:06,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1697754412, now seen corresponding path program 25 times [2018-10-15 12:56:06,594 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:06,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:07,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:07,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:07,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 12:56:07,956 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 12:56:07,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 12:56:07,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=728, Invalid=2028, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 12:56:07,957 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 53 states. [2018-10-15 12:56:09,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:09,455 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-10-15 12:56:09,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-15 12:56:09,456 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 110 [2018-10-15 12:56:09,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:09,457 INFO L225 Difference]: With dead ends: 117 [2018-10-15 12:56:09,457 INFO L226 Difference]: Without dead ends: 117 [2018-10-15 12:56:09,458 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1825 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3378, Invalid=7128, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 12:56:09,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-10-15 12:56:09,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2018-10-15 12:56:09,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-10-15 12:56:09,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-10-15 12:56:09,461 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 110 [2018-10-15 12:56:09,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:09,462 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-10-15 12:56:09,462 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 12:56:09,462 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-10-15 12:56:09,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-10-15 12:56:09,462 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:09,462 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:09,463 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:09,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:09,463 INFO L82 PathProgramCache]: Analyzing trace with hash 72955248, now seen corresponding path program 26 times [2018-10-15 12:56:09,463 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:09,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:10,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:10,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:10,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-15 12:56:10,363 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-15 12:56:10,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-15 12:56:10,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=783, Invalid=2187, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 12:56:10,364 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 55 states. [2018-10-15 12:56:12,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:12,551 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-10-15 12:56:12,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-15 12:56:12,553 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 114 [2018-10-15 12:56:12,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:12,555 INFO L225 Difference]: With dead ends: 121 [2018-10-15 12:56:12,555 INFO L226 Difference]: Without dead ends: 121 [2018-10-15 12:56:12,555 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1976 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3643, Invalid=7699, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 12:56:12,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-10-15 12:56:12,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2018-10-15 12:56:12,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-10-15 12:56:12,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2018-10-15 12:56:12,559 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 114 [2018-10-15 12:56:12,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:12,559 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2018-10-15 12:56:12,559 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-15 12:56:12,559 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2018-10-15 12:56:12,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-15 12:56:12,560 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:12,560 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:12,560 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:12,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:12,561 INFO L82 PathProgramCache]: Analyzing trace with hash 943389620, now seen corresponding path program 27 times [2018-10-15 12:56:12,561 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:12,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:13,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:13,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:13,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-15 12:56:13,764 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-15 12:56:13,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-15 12:56:13,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=840, Invalid=2352, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 12:56:13,765 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 57 states. [2018-10-15 12:56:15,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:15,519 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2018-10-15 12:56:15,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-15 12:56:15,519 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 118 [2018-10-15 12:56:15,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:15,521 INFO L225 Difference]: With dead ends: 125 [2018-10-15 12:56:15,521 INFO L226 Difference]: Without dead ends: 125 [2018-10-15 12:56:15,523 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2133 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3918, Invalid=8292, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 12:56:15,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-10-15 12:56:15,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2018-10-15 12:56:15,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-10-15 12:56:15,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-10-15 12:56:15,526 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 118 [2018-10-15 12:56:15,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:15,526 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-10-15 12:56:15,526 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-15 12:56:15,526 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-10-15 12:56:15,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-15 12:56:15,527 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:15,527 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:15,527 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:15,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:15,528 INFO L82 PathProgramCache]: Analyzing trace with hash 2106064888, now seen corresponding path program 28 times [2018-10-15 12:56:15,528 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:15,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:16,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:16,736 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:16,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-15 12:56:16,736 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-15 12:56:16,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-15 12:56:16,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=899, Invalid=2523, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 12:56:16,737 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 59 states. [2018-10-15 12:56:18,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:18,910 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-10-15 12:56:18,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-15 12:56:18,910 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 122 [2018-10-15 12:56:18,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:18,912 INFO L225 Difference]: With dead ends: 129 [2018-10-15 12:56:18,912 INFO L226 Difference]: Without dead ends: 129 [2018-10-15 12:56:18,913 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2296 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4203, Invalid=8907, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 12:56:18,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-10-15 12:56:18,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127. [2018-10-15 12:56:18,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-10-15 12:56:18,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2018-10-15 12:56:18,916 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 122 [2018-10-15 12:56:18,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:18,916 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2018-10-15 12:56:18,916 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-15 12:56:18,917 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2018-10-15 12:56:18,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-10-15 12:56:18,917 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:18,917 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:18,917 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:18,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:18,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1871625668, now seen corresponding path program 29 times [2018-10-15 12:56:18,918 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:18,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:20,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:20,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:20,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-15 12:56:20,027 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-15 12:56:20,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-15 12:56:20,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=960, Invalid=2700, Unknown=0, NotChecked=0, Total=3660 [2018-10-15 12:56:20,028 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 61 states. [2018-10-15 12:56:23,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:23,550 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2018-10-15 12:56:23,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-15 12:56:23,551 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 126 [2018-10-15 12:56:23,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:23,552 INFO L225 Difference]: With dead ends: 133 [2018-10-15 12:56:23,552 INFO L226 Difference]: Without dead ends: 133 [2018-10-15 12:56:23,553 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2465 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=4498, Invalid=9544, Unknown=0, NotChecked=0, Total=14042 [2018-10-15 12:56:23,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-10-15 12:56:23,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2018-10-15 12:56:23,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-10-15 12:56:23,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-10-15 12:56:23,556 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 126 [2018-10-15 12:56:23,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:23,556 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-10-15 12:56:23,556 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-15 12:56:23,557 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-10-15 12:56:23,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-15 12:56:23,557 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:23,557 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:23,557 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:23,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:23,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1398291840, now seen corresponding path program 30 times [2018-10-15 12:56:23,558 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:23,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:24,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:24,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:24,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-15 12:56:24,938 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-15 12:56:24,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-15 12:56:24,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 12:56:24,939 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 63 states. [2018-10-15 12:56:27,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:27,033 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2018-10-15 12:56:27,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-15 12:56:27,034 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 130 [2018-10-15 12:56:27,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:27,035 INFO L225 Difference]: With dead ends: 137 [2018-10-15 12:56:27,035 INFO L226 Difference]: Without dead ends: 137 [2018-10-15 12:56:27,036 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2640 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4803, Invalid=10203, Unknown=0, NotChecked=0, Total=15006 [2018-10-15 12:56:27,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-10-15 12:56:27,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2018-10-15 12:56:27,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-10-15 12:56:27,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2018-10-15 12:56:27,039 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 130 [2018-10-15 12:56:27,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:27,039 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2018-10-15 12:56:27,039 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-15 12:56:27,040 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2018-10-15 12:56:27,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-15 12:56:27,040 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:27,040 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:27,041 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:27,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:27,041 INFO L82 PathProgramCache]: Analyzing trace with hash -849575740, now seen corresponding path program 31 times [2018-10-15 12:56:27,042 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:27,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:28,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:28,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:28,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-15 12:56:28,448 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-15 12:56:28,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-15 12:56:28,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1088, Invalid=3072, Unknown=0, NotChecked=0, Total=4160 [2018-10-15 12:56:28,449 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 65 states. [2018-10-15 12:56:30,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:30,648 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-10-15 12:56:30,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-15 12:56:30,648 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 134 [2018-10-15 12:56:30,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:30,649 INFO L225 Difference]: With dead ends: 141 [2018-10-15 12:56:30,649 INFO L226 Difference]: Without dead ends: 141 [2018-10-15 12:56:30,651 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2821 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=5118, Invalid=10884, Unknown=0, NotChecked=0, Total=16002 [2018-10-15 12:56:30,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-10-15 12:56:30,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2018-10-15 12:56:30,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-10-15 12:56:30,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2018-10-15 12:56:30,654 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 134 [2018-10-15 12:56:30,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:30,655 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2018-10-15 12:56:30,655 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-15 12:56:30,655 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2018-10-15 12:56:30,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-10-15 12:56:30,656 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:30,656 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:30,656 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:30,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:30,656 INFO L82 PathProgramCache]: Analyzing trace with hash -314540792, now seen corresponding path program 32 times [2018-10-15 12:56:30,657 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:30,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:32,018 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:32,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:32,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-15 12:56:32,019 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-15 12:56:32,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-15 12:56:32,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1155, Invalid=3267, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 12:56:32,020 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 67 states. [2018-10-15 12:56:34,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:34,787 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2018-10-15 12:56:34,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-10-15 12:56:34,788 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 138 [2018-10-15 12:56:34,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:34,789 INFO L225 Difference]: With dead ends: 145 [2018-10-15 12:56:34,789 INFO L226 Difference]: Without dead ends: 145 [2018-10-15 12:56:34,791 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3008 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5443, Invalid=11587, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 12:56:34,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-10-15 12:56:34,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2018-10-15 12:56:34,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-10-15 12:56:34,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-10-15 12:56:34,794 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 138 [2018-10-15 12:56:34,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:34,794 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-10-15 12:56:34,794 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-15 12:56:34,794 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-10-15 12:56:34,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-15 12:56:34,795 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:34,795 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:34,795 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:34,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:34,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1183102796, now seen corresponding path program 33 times [2018-10-15 12:56:34,796 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:34,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:36,272 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:36,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:36,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-15 12:56:36,273 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-15 12:56:36,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-15 12:56:36,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1224, Invalid=3468, Unknown=0, NotChecked=0, Total=4692 [2018-10-15 12:56:36,274 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 69 states. [2018-10-15 12:56:39,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:39,080 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2018-10-15 12:56:39,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-10-15 12:56:39,080 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 142 [2018-10-15 12:56:39,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:39,082 INFO L225 Difference]: With dead ends: 149 [2018-10-15 12:56:39,082 INFO L226 Difference]: Without dead ends: 149 [2018-10-15 12:56:39,084 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3201 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5778, Invalid=12312, Unknown=0, NotChecked=0, Total=18090 [2018-10-15 12:56:39,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-10-15 12:56:39,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 147. [2018-10-15 12:56:39,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-10-15 12:56:39,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-10-15 12:56:39,088 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 142 [2018-10-15 12:56:39,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:39,088 INFO L481 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-10-15 12:56:39,088 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-15 12:56:39,088 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-10-15 12:56:39,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-10-15 12:56:39,089 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:39,089 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:39,089 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:39,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:39,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1831194736, now seen corresponding path program 34 times [2018-10-15 12:56:39,090 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:39,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:41,215 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:41,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:41,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-15 12:56:41,215 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-15 12:56:41,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-15 12:56:41,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1295, Invalid=3675, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 12:56:41,217 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 71 states. [2018-10-15 12:56:44,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:44,085 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-10-15 12:56:44,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-10-15 12:56:44,086 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 146 [2018-10-15 12:56:44,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:44,088 INFO L225 Difference]: With dead ends: 153 [2018-10-15 12:56:44,088 INFO L226 Difference]: Without dead ends: 153 [2018-10-15 12:56:44,089 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3400 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6123, Invalid=13059, Unknown=0, NotChecked=0, Total=19182 [2018-10-15 12:56:44,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-10-15 12:56:44,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2018-10-15 12:56:44,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-10-15 12:56:44,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-10-15 12:56:44,092 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 146 [2018-10-15 12:56:44,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:44,093 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-10-15 12:56:44,093 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-15 12:56:44,093 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-10-15 12:56:44,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-15 12:56:44,093 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:44,094 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:44,094 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:44,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:44,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1265755604, now seen corresponding path program 35 times [2018-10-15 12:56:44,095 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:44,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:45,642 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:45,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:45,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-15 12:56:45,643 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-15 12:56:45,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-15 12:56:45,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1368, Invalid=3888, Unknown=0, NotChecked=0, Total=5256 [2018-10-15 12:56:45,644 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 73 states. [2018-10-15 12:56:48,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:48,291 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2018-10-15 12:56:48,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-10-15 12:56:48,291 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 150 [2018-10-15 12:56:48,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:48,293 INFO L225 Difference]: With dead ends: 157 [2018-10-15 12:56:48,293 INFO L226 Difference]: Without dead ends: 157 [2018-10-15 12:56:48,294 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3605 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=6478, Invalid=13828, Unknown=0, NotChecked=0, Total=20306 [2018-10-15 12:56:48,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-10-15 12:56:48,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 155. [2018-10-15 12:56:48,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-10-15 12:56:48,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2018-10-15 12:56:48,298 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 150 [2018-10-15 12:56:48,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:48,299 INFO L481 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2018-10-15 12:56:48,299 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-15 12:56:48,299 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2018-10-15 12:56:48,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-15 12:56:48,300 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:48,300 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:48,300 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:48,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:48,301 INFO L82 PathProgramCache]: Analyzing trace with hash -386082280, now seen corresponding path program 36 times [2018-10-15 12:56:48,301 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:48,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:50,146 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:50,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:50,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-15 12:56:50,147 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-15 12:56:50,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-15 12:56:50,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1443, Invalid=4107, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 12:56:50,148 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 75 states. [2018-10-15 12:56:53,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:53,018 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2018-10-15 12:56:53,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-10-15 12:56:53,018 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 154 [2018-10-15 12:56:53,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:53,019 INFO L225 Difference]: With dead ends: 161 [2018-10-15 12:56:53,019 INFO L226 Difference]: Without dead ends: 161 [2018-10-15 12:56:53,021 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3816 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6843, Invalid=14619, Unknown=0, NotChecked=0, Total=21462 [2018-10-15 12:56:53,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-10-15 12:56:53,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2018-10-15 12:56:53,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-10-15 12:56:53,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2018-10-15 12:56:53,024 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 154 [2018-10-15 12:56:53,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:53,025 INFO L481 AbstractCegarLoop]: Abstraction has 159 states and 159 transitions. [2018-10-15 12:56:53,025 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-15 12:56:53,025 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 159 transitions. [2018-10-15 12:56:53,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-10-15 12:56:53,026 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:53,026 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:53,026 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:53,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:53,027 INFO L82 PathProgramCache]: Analyzing trace with hash 598477916, now seen corresponding path program 37 times [2018-10-15 12:56:53,027 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:53,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:55,157 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:55,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:55,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-10-15 12:56:55,158 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-15 12:56:55,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-15 12:56:55,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1520, Invalid=4332, Unknown=0, NotChecked=0, Total=5852 [2018-10-15 12:56:55,159 INFO L87 Difference]: Start difference. First operand 159 states and 159 transitions. Second operand 77 states. [2018-10-15 12:56:58,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:58,517 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2018-10-15 12:56:58,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-10-15 12:56:58,518 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 158 [2018-10-15 12:56:58,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:58,519 INFO L225 Difference]: With dead ends: 165 [2018-10-15 12:56:58,519 INFO L226 Difference]: Without dead ends: 165 [2018-10-15 12:56:58,521 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4033 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=7218, Invalid=15432, Unknown=0, NotChecked=0, Total=22650 [2018-10-15 12:56:58,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-10-15 12:56:58,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 163. [2018-10-15 12:56:58,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-10-15 12:56:58,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2018-10-15 12:56:58,524 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 158 [2018-10-15 12:56:58,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:58,525 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2018-10-15 12:56:58,525 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-15 12:56:58,525 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2018-10-15 12:56:58,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-10-15 12:56:58,526 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:58,526 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:58,526 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:58,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:58,526 INFO L82 PathProgramCache]: Analyzing trace with hash 858815648, now seen corresponding path program 38 times [2018-10-15 12:56:58,527 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:58,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:00,745 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:00,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:00,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-10-15 12:57:00,746 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-15 12:57:00,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-15 12:57:00,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1599, Invalid=4563, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 12:57:00,747 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 79 states. [2018-10-15 12:57:03,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:03,829 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2018-10-15 12:57:03,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-10-15 12:57:03,830 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 162 [2018-10-15 12:57:03,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:03,831 INFO L225 Difference]: With dead ends: 169 [2018-10-15 12:57:03,831 INFO L226 Difference]: Without dead ends: 169 [2018-10-15 12:57:03,832 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4256 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=7603, Invalid=16267, Unknown=0, NotChecked=0, Total=23870 [2018-10-15 12:57:03,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-10-15 12:57:03,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 167. [2018-10-15 12:57:03,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-10-15 12:57:03,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2018-10-15 12:57:03,836 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 162 [2018-10-15 12:57:03,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:03,836 INFO L481 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2018-10-15 12:57:03,836 INFO L482 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-15 12:57:03,836 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2018-10-15 12:57:03,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-10-15 12:57:03,836 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:03,837 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:03,837 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:03,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:03,837 INFO L82 PathProgramCache]: Analyzing trace with hash 247147236, now seen corresponding path program 39 times [2018-10-15 12:57:03,838 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:03,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:05,952 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:05,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:05,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-15 12:57:05,953 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-15 12:57:05,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-15 12:57:05,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1680, Invalid=4800, Unknown=0, NotChecked=0, Total=6480 [2018-10-15 12:57:05,953 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 81 states. [2018-10-15 12:57:09,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:09,435 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2018-10-15 12:57:09,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-10-15 12:57:09,435 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 166 [2018-10-15 12:57:09,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:09,437 INFO L225 Difference]: With dead ends: 173 [2018-10-15 12:57:09,437 INFO L226 Difference]: Without dead ends: 173 [2018-10-15 12:57:09,438 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4485 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=7998, Invalid=17124, Unknown=0, NotChecked=0, Total=25122 [2018-10-15 12:57:09,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-10-15 12:57:09,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2018-10-15 12:57:09,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-10-15 12:57:09,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-10-15 12:57:09,441 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 166 [2018-10-15 12:57:09,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:09,442 INFO L481 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-10-15 12:57:09,442 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-15 12:57:09,442 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-10-15 12:57:09,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-15 12:57:09,443 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:09,443 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:09,443 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:09,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:09,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1392699608, now seen corresponding path program 40 times [2018-10-15 12:57:09,444 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:09,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:11,691 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:11,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:11,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-15 12:57:11,692 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-15 12:57:11,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-15 12:57:11,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1763, Invalid=5043, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 12:57:11,693 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 83 states. [2018-10-15 12:57:15,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:15,207 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2018-10-15 12:57:15,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-10-15 12:57:15,207 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 170 [2018-10-15 12:57:15,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:15,209 INFO L225 Difference]: With dead ends: 177 [2018-10-15 12:57:15,209 INFO L226 Difference]: Without dead ends: 177 [2018-10-15 12:57:15,211 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4720 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=8403, Invalid=18003, Unknown=0, NotChecked=0, Total=26406 [2018-10-15 12:57:15,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-10-15 12:57:15,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 175. [2018-10-15 12:57:15,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-10-15 12:57:15,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2018-10-15 12:57:15,214 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 170 [2018-10-15 12:57:15,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:15,214 INFO L481 AbstractCegarLoop]: Abstraction has 175 states and 175 transitions. [2018-10-15 12:57:15,214 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-15 12:57:15,214 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 175 transitions. [2018-10-15 12:57:15,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-10-15 12:57:15,215 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:15,215 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:15,215 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:15,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:15,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1143423340, now seen corresponding path program 41 times [2018-10-15 12:57:15,216 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:15,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:17,285 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:17,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:17,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-10-15 12:57:17,286 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-15 12:57:17,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-15 12:57:17,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1848, Invalid=5292, Unknown=0, NotChecked=0, Total=7140 [2018-10-15 12:57:17,287 INFO L87 Difference]: Start difference. First operand 175 states and 175 transitions. Second operand 85 states. [2018-10-15 12:57:21,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:21,109 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2018-10-15 12:57:21,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-10-15 12:57:21,110 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 174 [2018-10-15 12:57:21,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:21,111 INFO L225 Difference]: With dead ends: 181 [2018-10-15 12:57:21,111 INFO L226 Difference]: Without dead ends: 181 [2018-10-15 12:57:21,112 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4961 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=8818, Invalid=18904, Unknown=0, NotChecked=0, Total=27722 [2018-10-15 12:57:21,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-10-15 12:57:21,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 179. [2018-10-15 12:57:21,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-10-15 12:57:21,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2018-10-15 12:57:21,115 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 179 transitions. Word has length 174 [2018-10-15 12:57:21,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:21,115 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 179 transitions. [2018-10-15 12:57:21,115 INFO L482 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-15 12:57:21,116 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 179 transitions. [2018-10-15 12:57:21,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-15 12:57:21,116 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:21,117 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:21,117 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:21,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:21,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1981109840, now seen corresponding path program 42 times [2018-10-15 12:57:21,118 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:21,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:24,080 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:24,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:24,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-15 12:57:24,080 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-15 12:57:24,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-15 12:57:24,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1935, Invalid=5547, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 12:57:24,082 INFO L87 Difference]: Start difference. First operand 179 states and 179 transitions. Second operand 87 states. [2018-10-15 12:57:28,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:28,285 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2018-10-15 12:57:28,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-10-15 12:57:28,286 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 178 [2018-10-15 12:57:28,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:28,287 INFO L225 Difference]: With dead ends: 185 [2018-10-15 12:57:28,287 INFO L226 Difference]: Without dead ends: 185 [2018-10-15 12:57:28,288 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5208 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=9243, Invalid=19827, Unknown=0, NotChecked=0, Total=29070 [2018-10-15 12:57:28,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-10-15 12:57:28,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 183. [2018-10-15 12:57:28,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-10-15 12:57:28,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2018-10-15 12:57:28,291 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 178 [2018-10-15 12:57:28,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:28,291 INFO L481 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2018-10-15 12:57:28,292 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-15 12:57:28,292 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2018-10-15 12:57:28,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-15 12:57:28,293 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:28,293 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:28,293 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:28,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:28,293 INFO L82 PathProgramCache]: Analyzing trace with hash -210219020, now seen corresponding path program 43 times [2018-10-15 12:57:28,294 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:28,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:30,968 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:30,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:30,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-10-15 12:57:30,969 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-15 12:57:30,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-15 12:57:30,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2024, Invalid=5808, Unknown=0, NotChecked=0, Total=7832 [2018-10-15 12:57:30,970 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 89 states. [2018-10-15 12:57:35,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:35,117 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2018-10-15 12:57:35,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-10-15 12:57:35,118 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 182 [2018-10-15 12:57:35,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:35,119 INFO L225 Difference]: With dead ends: 189 [2018-10-15 12:57:35,119 INFO L226 Difference]: Without dead ends: 189 [2018-10-15 12:57:35,120 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5461 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=9678, Invalid=20772, Unknown=0, NotChecked=0, Total=30450 [2018-10-15 12:57:35,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-10-15 12:57:35,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 187. [2018-10-15 12:57:35,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-10-15 12:57:35,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2018-10-15 12:57:35,124 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 182 [2018-10-15 12:57:35,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:35,124 INFO L481 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2018-10-15 12:57:35,124 INFO L482 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-15 12:57:35,124 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2018-10-15 12:57:35,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-10-15 12:57:35,125 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:35,125 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:35,125 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:35,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:35,126 INFO L82 PathProgramCache]: Analyzing trace with hash -176081864, now seen corresponding path program 44 times [2018-10-15 12:57:35,126 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:35,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:37,642 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:37,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:37,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-10-15 12:57:37,643 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-15 12:57:37,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-15 12:57:37,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2115, Invalid=6075, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 12:57:37,644 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 91 states. [2018-10-15 12:57:41,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:41,916 INFO L93 Difference]: Finished difference Result 193 states and 193 transitions. [2018-10-15 12:57:41,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-10-15 12:57:41,916 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 186 [2018-10-15 12:57:41,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:41,918 INFO L225 Difference]: With dead ends: 193 [2018-10-15 12:57:41,918 INFO L226 Difference]: Without dead ends: 193 [2018-10-15 12:57:41,920 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5720 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=10123, Invalid=21739, Unknown=0, NotChecked=0, Total=31862 [2018-10-15 12:57:41,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-10-15 12:57:41,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 191. [2018-10-15 12:57:41,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-10-15 12:57:41,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2018-10-15 12:57:41,922 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 186 [2018-10-15 12:57:41,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:41,923 INFO L481 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2018-10-15 12:57:41,923 INFO L482 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-15 12:57:41,923 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2018-10-15 12:57:41,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-15 12:57:41,923 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:41,924 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:41,924 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:41,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:41,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1144411772, now seen corresponding path program 45 times [2018-10-15 12:57:41,925 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:41,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:44,393 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:44,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:44,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-15 12:57:44,394 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-15 12:57:44,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-15 12:57:44,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2208, Invalid=6348, Unknown=0, NotChecked=0, Total=8556 [2018-10-15 12:57:44,395 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 93 states. [2018-10-15 12:57:48,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:48,831 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2018-10-15 12:57:48,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-10-15 12:57:48,832 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 190 [2018-10-15 12:57:48,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:48,833 INFO L225 Difference]: With dead ends: 197 [2018-10-15 12:57:48,833 INFO L226 Difference]: Without dead ends: 197 [2018-10-15 12:57:48,834 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5985 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=10578, Invalid=22728, Unknown=0, NotChecked=0, Total=33306 [2018-10-15 12:57:48,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-10-15 12:57:48,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2018-10-15 12:57:48,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-10-15 12:57:48,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 195 transitions. [2018-10-15 12:57:48,836 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 195 transitions. Word has length 190 [2018-10-15 12:57:48,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:48,837 INFO L481 AbstractCegarLoop]: Abstraction has 195 states and 195 transitions. [2018-10-15 12:57:48,837 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-15 12:57:48,837 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 195 transitions. [2018-10-15 12:57:48,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-10-15 12:57:48,838 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:48,838 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:48,838 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:48,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:48,838 INFO L82 PathProgramCache]: Analyzing trace with hash 323532480, now seen corresponding path program 46 times [2018-10-15 12:57:48,839 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:48,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:51,653 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:51,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:51,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-10-15 12:57:51,654 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-15 12:57:51,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-15 12:57:51,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2303, Invalid=6627, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 12:57:51,655 INFO L87 Difference]: Start difference. First operand 195 states and 195 transitions. Second operand 95 states. [2018-10-15 12:57:56,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:56,533 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2018-10-15 12:57:56,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-10-15 12:57:56,533 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 194 [2018-10-15 12:57:56,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:56,534 INFO L225 Difference]: With dead ends: 201 [2018-10-15 12:57:56,535 INFO L226 Difference]: Without dead ends: 201 [2018-10-15 12:57:56,536 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6256 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=11043, Invalid=23739, Unknown=0, NotChecked=0, Total=34782 [2018-10-15 12:57:56,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-10-15 12:57:56,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2018-10-15 12:57:56,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-10-15 12:57:56,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 199 transitions. [2018-10-15 12:57:56,539 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 199 transitions. Word has length 194 [2018-10-15 12:57:56,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:56,539 INFO L481 AbstractCegarLoop]: Abstraction has 199 states and 199 transitions. [2018-10-15 12:57:56,539 INFO L482 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-15 12:57:56,539 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 199 transitions. [2018-10-15 12:57:56,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-10-15 12:57:56,540 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:56,540 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:56,541 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:56,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:56,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1441355012, now seen corresponding path program 47 times [2018-10-15 12:57:56,541 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:56,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:59,364 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:59,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:59,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-10-15 12:57:59,365 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-10-15 12:57:59,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-10-15 12:57:59,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2400, Invalid=6912, Unknown=0, NotChecked=0, Total=9312 [2018-10-15 12:57:59,365 INFO L87 Difference]: Start difference. First operand 199 states and 199 transitions. Second operand 97 states. [2018-10-15 12:58:04,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:04,567 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2018-10-15 12:58:04,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-10-15 12:58:04,567 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 198 [2018-10-15 12:58:04,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:04,569 INFO L225 Difference]: With dead ends: 205 [2018-10-15 12:58:04,569 INFO L226 Difference]: Without dead ends: 205 [2018-10-15 12:58:04,570 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6533 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=11518, Invalid=24772, Unknown=0, NotChecked=0, Total=36290 [2018-10-15 12:58:04,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-10-15 12:58:04,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 203. [2018-10-15 12:58:04,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-10-15 12:58:04,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 203 transitions. [2018-10-15 12:58:04,572 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 203 transitions. Word has length 198 [2018-10-15 12:58:04,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:04,573 INFO L481 AbstractCegarLoop]: Abstraction has 203 states and 203 transitions. [2018-10-15 12:58:04,573 INFO L482 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-10-15 12:58:04,573 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 203 transitions. [2018-10-15 12:58:04,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-10-15 12:58:04,574 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:04,574 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:58:04,574 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:04,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:04,574 INFO L82 PathProgramCache]: Analyzing trace with hash -20369080, now seen corresponding path program 48 times [2018-10-15 12:58:04,575 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:04,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:07,567 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:58:07,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:07,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-10-15 12:58:07,568 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-10-15 12:58:07,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-10-15 12:58:07,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2499, Invalid=7203, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 12:58:07,569 INFO L87 Difference]: Start difference. First operand 203 states and 203 transitions. Second operand 99 states. [2018-10-15 12:58:12,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:12,582 INFO L93 Difference]: Finished difference Result 209 states and 209 transitions. [2018-10-15 12:58:12,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-10-15 12:58:12,582 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 202 [2018-10-15 12:58:12,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:12,583 INFO L225 Difference]: With dead ends: 209 [2018-10-15 12:58:12,584 INFO L226 Difference]: Without dead ends: 209 [2018-10-15 12:58:12,586 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6816 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=12003, Invalid=25827, Unknown=0, NotChecked=0, Total=37830 [2018-10-15 12:58:12,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-10-15 12:58:12,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2018-10-15 12:58:12,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-10-15 12:58:12,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 207 transitions. [2018-10-15 12:58:12,589 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 207 transitions. Word has length 202 [2018-10-15 12:58:12,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:12,589 INFO L481 AbstractCegarLoop]: Abstraction has 207 states and 207 transitions. [2018-10-15 12:58:12,589 INFO L482 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-10-15 12:58:12,589 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 207 transitions. [2018-10-15 12:58:12,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-10-15 12:58:12,590 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:12,591 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:58:12,591 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:12,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:12,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1075399564, now seen corresponding path program 49 times [2018-10-15 12:58:12,592 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:12,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:15,460 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:58:15,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:15,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-10-15 12:58:15,460 INFO L460 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-10-15 12:58:15,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-10-15 12:58:15,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2600, Invalid=7500, Unknown=0, NotChecked=0, Total=10100 [2018-10-15 12:58:15,462 INFO L87 Difference]: Start difference. First operand 207 states and 207 transitions. Second operand 101 states. [2018-10-15 12:58:20,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:20,891 INFO L93 Difference]: Finished difference Result 213 states and 213 transitions. [2018-10-15 12:58:20,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-10-15 12:58:20,892 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 206 [2018-10-15 12:58:20,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:20,893 INFO L225 Difference]: With dead ends: 213 [2018-10-15 12:58:20,893 INFO L226 Difference]: Without dead ends: 213 [2018-10-15 12:58:20,895 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7105 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=12498, Invalid=26904, Unknown=0, NotChecked=0, Total=39402 [2018-10-15 12:58:20,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-10-15 12:58:20,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211. [2018-10-15 12:58:20,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-10-15 12:58:20,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2018-10-15 12:58:20,899 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 206 [2018-10-15 12:58:20,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:20,899 INFO L481 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2018-10-15 12:58:20,899 INFO L482 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-10-15 12:58:20,899 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2018-10-15 12:58:20,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-10-15 12:58:20,900 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:20,900 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:58:20,901 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:20,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:20,901 INFO L82 PathProgramCache]: Analyzing trace with hash -880106544, now seen corresponding path program 50 times [2018-10-15 12:58:20,902 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:20,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:23,851 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:58:23,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:23,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-10-15 12:58:23,852 INFO L460 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-10-15 12:58:23,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-10-15 12:58:23,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2703, Invalid=7803, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 12:58:23,853 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 103 states. [2018-10-15 12:58:29,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:29,300 INFO L93 Difference]: Finished difference Result 217 states and 217 transitions. [2018-10-15 12:58:29,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2018-10-15 12:58:29,300 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 210 [2018-10-15 12:58:29,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:29,302 INFO L225 Difference]: With dead ends: 217 [2018-10-15 12:58:29,302 INFO L226 Difference]: Without dead ends: 217 [2018-10-15 12:58:29,304 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7400 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=13003, Invalid=28003, Unknown=0, NotChecked=0, Total=41006 [2018-10-15 12:58:29,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-10-15 12:58:29,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 215. [2018-10-15 12:58:29,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-10-15 12:58:29,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 215 transitions. [2018-10-15 12:58:29,307 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 215 transitions. Word has length 210 [2018-10-15 12:58:29,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:29,307 INFO L481 AbstractCegarLoop]: Abstraction has 215 states and 215 transitions. [2018-10-15 12:58:29,307 INFO L482 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-10-15 12:58:29,307 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 215 transitions. [2018-10-15 12:58:29,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-10-15 12:58:29,308 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:29,308 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:58:29,309 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:29,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:29,309 INFO L82 PathProgramCache]: Analyzing trace with hash 307116564, now seen corresponding path program 51 times [2018-10-15 12:58:29,310 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:29,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:32,862 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:58:32,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:32,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-10-15 12:58:32,863 INFO L460 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-10-15 12:58:32,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-10-15 12:58:32,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2808, Invalid=8112, Unknown=0, NotChecked=0, Total=10920 [2018-10-15 12:58:32,864 INFO L87 Difference]: Start difference. First operand 215 states and 215 transitions. Second operand 105 states. [2018-10-15 12:58:38,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:38,468 INFO L93 Difference]: Finished difference Result 221 states and 221 transitions. [2018-10-15 12:58:38,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2018-10-15 12:58:38,469 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 214 [2018-10-15 12:58:38,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:38,470 INFO L225 Difference]: With dead ends: 221 [2018-10-15 12:58:38,470 INFO L226 Difference]: Without dead ends: 221 [2018-10-15 12:58:38,471 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7701 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=13518, Invalid=29124, Unknown=0, NotChecked=0, Total=42642 [2018-10-15 12:58:38,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-10-15 12:58:38,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 219. [2018-10-15 12:58:38,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-10-15 12:58:38,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 219 transitions. [2018-10-15 12:58:38,474 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 219 transitions. Word has length 214 [2018-10-15 12:58:38,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:38,474 INFO L481 AbstractCegarLoop]: Abstraction has 219 states and 219 transitions. [2018-10-15 12:58:38,474 INFO L482 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-10-15 12:58:38,474 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 219 transitions. [2018-10-15 12:58:38,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-10-15 12:58:38,475 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:38,475 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:58:38,476 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:38,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:38,476 INFO L82 PathProgramCache]: Analyzing trace with hash -2062217640, now seen corresponding path program 52 times [2018-10-15 12:58:38,476 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:38,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:42,007 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:58:42,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:42,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-10-15 12:58:42,008 INFO L460 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-10-15 12:58:42,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-10-15 12:58:42,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2915, Invalid=8427, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 12:58:42,009 INFO L87 Difference]: Start difference. First operand 219 states and 219 transitions. Second operand 107 states. [2018-10-15 12:58:47,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:47,977 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2018-10-15 12:58:47,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2018-10-15 12:58:47,977 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 218 [2018-10-15 12:58:47,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:47,978 INFO L225 Difference]: With dead ends: 225 [2018-10-15 12:58:47,979 INFO L226 Difference]: Without dead ends: 225 [2018-10-15 12:58:47,981 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8008 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=14043, Invalid=30267, Unknown=0, NotChecked=0, Total=44310 [2018-10-15 12:58:47,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-10-15 12:58:47,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 223. [2018-10-15 12:58:47,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-10-15 12:58:47,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 223 transitions. [2018-10-15 12:58:47,984 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 223 transitions. Word has length 218 [2018-10-15 12:58:47,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:47,984 INFO L481 AbstractCegarLoop]: Abstraction has 223 states and 223 transitions. [2018-10-15 12:58:47,984 INFO L482 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-10-15 12:58:47,984 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 223 transitions. [2018-10-15 12:58:47,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-10-15 12:58:47,987 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:47,987 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:58:47,987 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:47,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:47,988 INFO L82 PathProgramCache]: Analyzing trace with hash -737140580, now seen corresponding path program 53 times [2018-10-15 12:58:47,988 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:48,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:51,236 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:58:51,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:51,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-10-15 12:58:51,237 INFO L460 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-10-15 12:58:51,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-10-15 12:58:51,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3024, Invalid=8748, Unknown=0, NotChecked=0, Total=11772 [2018-10-15 12:58:51,238 INFO L87 Difference]: Start difference. First operand 223 states and 223 transitions. Second operand 109 states. [2018-10-15 12:58:57,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:57,289 INFO L93 Difference]: Finished difference Result 229 states and 229 transitions. [2018-10-15 12:58:57,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2018-10-15 12:58:57,290 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 222 [2018-10-15 12:58:57,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:57,291 INFO L225 Difference]: With dead ends: 229 [2018-10-15 12:58:57,291 INFO L226 Difference]: Without dead ends: 229 [2018-10-15 12:58:57,293 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8321 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=14578, Invalid=31432, Unknown=0, NotChecked=0, Total=46010 [2018-10-15 12:58:57,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-10-15 12:58:57,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 227. [2018-10-15 12:58:57,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-10-15 12:58:57,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2018-10-15 12:58:57,296 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 222 [2018-10-15 12:58:57,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:57,296 INFO L481 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2018-10-15 12:58:57,296 INFO L482 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-10-15 12:58:57,296 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2018-10-15 12:58:57,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-10-15 12:58:57,297 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:57,297 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:58:57,297 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:57,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:57,298 INFO L82 PathProgramCache]: Analyzing trace with hash 787509472, now seen corresponding path program 54 times [2018-10-15 12:58:57,298 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:57,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:59:00,594 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:59:00,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:59:00,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-10-15 12:59:00,595 INFO L460 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-10-15 12:59:00,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-10-15 12:59:00,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3135, Invalid=9075, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 12:59:00,597 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 111 states. [2018-10-15 12:59:07,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:59:07,005 INFO L93 Difference]: Finished difference Result 233 states and 233 transitions. [2018-10-15 12:59:07,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2018-10-15 12:59:07,006 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 226 [2018-10-15 12:59:07,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:59:07,007 INFO L225 Difference]: With dead ends: 233 [2018-10-15 12:59:07,007 INFO L226 Difference]: Without dead ends: 233 [2018-10-15 12:59:07,008 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8640 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=15123, Invalid=32619, Unknown=0, NotChecked=0, Total=47742 [2018-10-15 12:59:07,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-10-15 12:59:07,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 231. [2018-10-15 12:59:07,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-10-15 12:59:07,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 231 transitions. [2018-10-15 12:59:07,011 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 231 transitions. Word has length 226 [2018-10-15 12:59:07,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:59:07,011 INFO L481 AbstractCegarLoop]: Abstraction has 231 states and 231 transitions. [2018-10-15 12:59:07,011 INFO L482 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-10-15 12:59:07,012 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 231 transitions. [2018-10-15 12:59:07,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-10-15 12:59:07,013 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:59:07,013 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:59:07,013 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:59:07,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:59:07,013 INFO L82 PathProgramCache]: Analyzing trace with hash -2065236188, now seen corresponding path program 55 times [2018-10-15 12:59:07,014 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:59:07,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:59:10,526 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:59:10,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:59:10,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-10-15 12:59:10,527 INFO L460 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-10-15 12:59:10,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-10-15 12:59:10,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3248, Invalid=9408, Unknown=0, NotChecked=0, Total=12656 [2018-10-15 12:59:10,528 INFO L87 Difference]: Start difference. First operand 231 states and 231 transitions. Second operand 113 states. [2018-10-15 12:59:16,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:59:16,916 INFO L93 Difference]: Finished difference Result 237 states and 237 transitions. [2018-10-15 12:59:16,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2018-10-15 12:59:16,916 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 230 [2018-10-15 12:59:16,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:59:16,918 INFO L225 Difference]: With dead ends: 237 [2018-10-15 12:59:16,918 INFO L226 Difference]: Without dead ends: 237 [2018-10-15 12:59:16,920 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8965 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=15678, Invalid=33828, Unknown=0, NotChecked=0, Total=49506 [2018-10-15 12:59:16,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-10-15 12:59:16,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 235. [2018-10-15 12:59:16,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-10-15 12:59:16,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 235 transitions. [2018-10-15 12:59:16,922 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 235 transitions. Word has length 230 [2018-10-15 12:59:16,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:59:16,922 INFO L481 AbstractCegarLoop]: Abstraction has 235 states and 235 transitions. [2018-10-15 12:59:16,922 INFO L482 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-10-15 12:59:16,922 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 235 transitions. [2018-10-15 12:59:16,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-10-15 12:59:16,923 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:59:16,923 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:59:16,923 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:59:16,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:59:16,924 INFO L82 PathProgramCache]: Analyzing trace with hash -995832984, now seen corresponding path program 56 times [2018-10-15 12:59:16,924 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:59:16,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:59:20,731 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:59:20,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:59:20,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-10-15 12:59:20,732 INFO L460 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-10-15 12:59:20,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-10-15 12:59:20,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3363, Invalid=9747, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 12:59:20,733 INFO L87 Difference]: Start difference. First operand 235 states and 235 transitions. Second operand 115 states. [2018-10-15 12:59:27,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:59:27,668 INFO L93 Difference]: Finished difference Result 241 states and 241 transitions. [2018-10-15 12:59:27,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2018-10-15 12:59:27,669 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 234 [2018-10-15 12:59:27,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:59:27,670 INFO L225 Difference]: With dead ends: 241 [2018-10-15 12:59:27,670 INFO L226 Difference]: Without dead ends: 241 [2018-10-15 12:59:27,672 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9296 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=16243, Invalid=35059, Unknown=0, NotChecked=0, Total=51302 [2018-10-15 12:59:27,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-10-15 12:59:27,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 239. [2018-10-15 12:59:27,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-10-15 12:59:27,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 239 transitions. [2018-10-15 12:59:27,674 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 239 transitions. Word has length 234 [2018-10-15 12:59:27,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:59:27,674 INFO L481 AbstractCegarLoop]: Abstraction has 239 states and 239 transitions. [2018-10-15 12:59:27,674 INFO L482 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-10-15 12:59:27,674 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 239 transitions. [2018-10-15 12:59:27,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-10-15 12:59:27,675 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:59:27,675 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:59:27,675 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:59:27,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:59:27,676 INFO L82 PathProgramCache]: Analyzing trace with hash 475714988, now seen corresponding path program 57 times [2018-10-15 12:59:27,676 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:59:27,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:59:31,925 INFO L134 CoverageAnalysis]: Checked inductivity of 6441 backedges. 0 proven. 6441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:59:31,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:59:31,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-10-15 12:59:31,926 INFO L460 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-10-15 12:59:31,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-10-15 12:59:31,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3480, Invalid=10092, Unknown=0, NotChecked=0, Total=13572 [2018-10-15 12:59:31,927 INFO L87 Difference]: Start difference. First operand 239 states and 239 transitions. Second operand 117 states. [2018-10-15 12:59:38,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:59:38,998 INFO L93 Difference]: Finished difference Result 245 states and 245 transitions. [2018-10-15 12:59:38,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2018-10-15 12:59:38,998 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 238 [2018-10-15 12:59:38,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:59:38,999 INFO L225 Difference]: With dead ends: 245 [2018-10-15 12:59:38,999 INFO L226 Difference]: Without dead ends: 245 [2018-10-15 12:59:39,002 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9633 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=16818, Invalid=36312, Unknown=0, NotChecked=0, Total=53130 [2018-10-15 12:59:39,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-10-15 12:59:39,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 243. [2018-10-15 12:59:39,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-10-15 12:59:39,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 243 transitions. [2018-10-15 12:59:39,004 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 243 transitions. Word has length 238 [2018-10-15 12:59:39,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:59:39,004 INFO L481 AbstractCegarLoop]: Abstraction has 243 states and 243 transitions. [2018-10-15 12:59:39,004 INFO L482 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-10-15 12:59:39,004 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 243 transitions. [2018-10-15 12:59:39,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-10-15 12:59:39,005 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:59:39,005 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:59:39,005 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:59:39,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:59:39,006 INFO L82 PathProgramCache]: Analyzing trace with hash 968498672, now seen corresponding path program 58 times [2018-10-15 12:59:39,006 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:59:39,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:59:43,064 INFO L134 CoverageAnalysis]: Checked inductivity of 6670 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:59:43,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:59:43,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-10-15 12:59:43,065 INFO L460 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-10-15 12:59:43,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-10-15 12:59:43,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3599, Invalid=10443, Unknown=0, NotChecked=0, Total=14042 [2018-10-15 12:59:43,066 INFO L87 Difference]: Start difference. First operand 243 states and 243 transitions. Second operand 119 states. [2018-10-15 12:59:50,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:59:50,200 INFO L93 Difference]: Finished difference Result 249 states and 249 transitions. [2018-10-15 12:59:50,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2018-10-15 12:59:50,200 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 242 [2018-10-15 12:59:50,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:59:50,201 INFO L225 Difference]: With dead ends: 249 [2018-10-15 12:59:50,201 INFO L226 Difference]: Without dead ends: 249 [2018-10-15 12:59:50,203 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9976 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=17403, Invalid=37587, Unknown=0, NotChecked=0, Total=54990 [2018-10-15 12:59:50,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-10-15 12:59:50,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 247. [2018-10-15 12:59:50,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-10-15 12:59:50,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 247 transitions. [2018-10-15 12:59:50,206 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 247 transitions. Word has length 242 [2018-10-15 12:59:50,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:59:50,206 INFO L481 AbstractCegarLoop]: Abstraction has 247 states and 247 transitions. [2018-10-15 12:59:50,206 INFO L482 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-10-15 12:59:50,207 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 247 transitions. [2018-10-15 12:59:50,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-10-15 12:59:50,208 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:59:50,208 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:59:50,208 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:59:50,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:59:50,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1980521420, now seen corresponding path program 59 times [2018-10-15 12:59:50,209 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:59:50,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:59:54,508 INFO L134 CoverageAnalysis]: Checked inductivity of 6903 backedges. 0 proven. 6903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:59:54,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:59:54,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-10-15 12:59:54,509 INFO L460 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-10-15 12:59:54,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-10-15 12:59:54,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3720, Invalid=10800, Unknown=0, NotChecked=0, Total=14520 [2018-10-15 12:59:54,510 INFO L87 Difference]: Start difference. First operand 247 states and 247 transitions. Second operand 121 states. [2018-10-15 13:00:01,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:00:01,765 INFO L93 Difference]: Finished difference Result 253 states and 253 transitions. [2018-10-15 13:00:01,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2018-10-15 13:00:01,765 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 246 [2018-10-15 13:00:01,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:00:01,767 INFO L225 Difference]: With dead ends: 253 [2018-10-15 13:00:01,767 INFO L226 Difference]: Without dead ends: 253 [2018-10-15 13:00:01,769 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10325 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=17998, Invalid=38884, Unknown=0, NotChecked=0, Total=56882 [2018-10-15 13:00:01,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-10-15 13:00:01,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 251. [2018-10-15 13:00:01,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-10-15 13:00:01,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 251 transitions. [2018-10-15 13:00:01,771 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 251 transitions. Word has length 246 [2018-10-15 13:00:01,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:00:01,771 INFO L481 AbstractCegarLoop]: Abstraction has 251 states and 251 transitions. [2018-10-15 13:00:01,772 INFO L482 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-10-15 13:00:01,772 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 251 transitions. [2018-10-15 13:00:01,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-10-15 13:00:01,772 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:00:01,773 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:00:01,773 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:00:01,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:00:01,773 INFO L82 PathProgramCache]: Analyzing trace with hash 2042128504, now seen corresponding path program 60 times [2018-10-15 13:00:01,774 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:00:01,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:00:06,246 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:00:06,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:00:06,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-10-15 13:00:06,247 INFO L460 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-10-15 13:00:06,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-10-15 13:00:06,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3843, Invalid=11163, Unknown=0, NotChecked=0, Total=15006 [2018-10-15 13:00:06,249 INFO L87 Difference]: Start difference. First operand 251 states and 251 transitions. Second operand 123 states. [2018-10-15 13:00:14,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:00:14,070 INFO L93 Difference]: Finished difference Result 257 states and 257 transitions. [2018-10-15 13:00:14,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2018-10-15 13:00:14,071 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 250 [2018-10-15 13:00:14,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:00:14,072 INFO L225 Difference]: With dead ends: 257 [2018-10-15 13:00:14,072 INFO L226 Difference]: Without dead ends: 257 [2018-10-15 13:00:14,073 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10680 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=18603, Invalid=40203, Unknown=0, NotChecked=0, Total=58806 [2018-10-15 13:00:14,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-10-15 13:00:14,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 255. [2018-10-15 13:00:14,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-10-15 13:00:14,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 255 transitions. [2018-10-15 13:00:14,075 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 255 transitions. Word has length 250 [2018-10-15 13:00:14,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:00:14,076 INFO L481 AbstractCegarLoop]: Abstraction has 255 states and 255 transitions. [2018-10-15 13:00:14,076 INFO L482 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-10-15 13:00:14,076 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 255 transitions. [2018-10-15 13:00:14,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-10-15 13:00:14,077 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:00:14,077 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:00:14,077 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:00:14,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:00:14,077 INFO L82 PathProgramCache]: Analyzing trace with hash -1254528324, now seen corresponding path program 61 times [2018-10-15 13:00:14,078 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:00:14,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:00:18,306 INFO L134 CoverageAnalysis]: Checked inductivity of 7381 backedges. 0 proven. 7381 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:00:18,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:00:18,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-10-15 13:00:18,307 INFO L460 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-10-15 13:00:18,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-10-15 13:00:18,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3968, Invalid=11532, Unknown=0, NotChecked=0, Total=15500 [2018-10-15 13:00:18,308 INFO L87 Difference]: Start difference. First operand 255 states and 255 transitions. Second operand 125 states. [2018-10-15 13:00:26,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:00:26,312 INFO L93 Difference]: Finished difference Result 261 states and 261 transitions. [2018-10-15 13:00:26,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 186 states. [2018-10-15 13:00:26,312 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 254 [2018-10-15 13:00:26,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:00:26,313 INFO L225 Difference]: With dead ends: 261 [2018-10-15 13:00:26,313 INFO L226 Difference]: Without dead ends: 261 [2018-10-15 13:00:26,314 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11041 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=19218, Invalid=41544, Unknown=0, NotChecked=0, Total=60762 [2018-10-15 13:00:26,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-10-15 13:00:26,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 259. [2018-10-15 13:00:26,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-10-15 13:00:26,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 259 transitions. [2018-10-15 13:00:26,317 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 259 transitions. Word has length 254 [2018-10-15 13:00:26,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:00:26,317 INFO L481 AbstractCegarLoop]: Abstraction has 259 states and 259 transitions. [2018-10-15 13:00:26,317 INFO L482 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-10-15 13:00:26,317 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 259 transitions. [2018-10-15 13:00:26,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-10-15 13:00:26,318 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:00:26,318 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:00:26,318 INFO L424 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:00:26,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:00:26,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1747430144, now seen corresponding path program 62 times [2018-10-15 13:00:26,319 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:00:26,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:00:30,988 INFO L134 CoverageAnalysis]: Checked inductivity of 7626 backedges. 0 proven. 7626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:00:30,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:00:30,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-10-15 13:00:30,989 INFO L460 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-10-15 13:00:30,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-10-15 13:00:30,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=11907, Unknown=0, NotChecked=0, Total=16002 [2018-10-15 13:00:30,991 INFO L87 Difference]: Start difference. First operand 259 states and 259 transitions. Second operand 127 states. [2018-10-15 13:00:39,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:00:39,264 INFO L93 Difference]: Finished difference Result 265 states and 265 transitions. [2018-10-15 13:00:39,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 189 states. [2018-10-15 13:00:39,264 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 258 [2018-10-15 13:00:39,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:00:39,265 INFO L225 Difference]: With dead ends: 265 [2018-10-15 13:00:39,265 INFO L226 Difference]: Without dead ends: 265 [2018-10-15 13:00:39,267 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11408 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=19843, Invalid=42907, Unknown=0, NotChecked=0, Total=62750 [2018-10-15 13:00:39,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-10-15 13:00:39,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 263. [2018-10-15 13:00:39,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-10-15 13:00:39,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 263 transitions. [2018-10-15 13:00:39,270 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 263 transitions. Word has length 258 [2018-10-15 13:00:39,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:00:39,270 INFO L481 AbstractCegarLoop]: Abstraction has 263 states and 263 transitions. [2018-10-15 13:00:39,270 INFO L482 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-10-15 13:00:39,270 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 263 transitions. [2018-10-15 13:00:39,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-10-15 13:00:39,272 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:00:39,272 INFO L375 BasicCegarLoop]: trace histogram [63, 63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:00:39,272 INFO L424 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:00:39,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:00:39,272 INFO L82 PathProgramCache]: Analyzing trace with hash 2108959044, now seen corresponding path program 63 times [2018-10-15 13:00:39,273 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:00:39,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:00:43,802 INFO L134 CoverageAnalysis]: Checked inductivity of 7875 backedges. 0 proven. 7875 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:00:43,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:00:43,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-10-15 13:00:43,803 INFO L460 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-10-15 13:00:43,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-10-15 13:00:43,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4224, Invalid=12288, Unknown=0, NotChecked=0, Total=16512 [2018-10-15 13:00:43,805 INFO L87 Difference]: Start difference. First operand 263 states and 263 transitions. Second operand 129 states. [2018-10-15 13:00:52,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:00:52,373 INFO L93 Difference]: Finished difference Result 269 states and 269 transitions. [2018-10-15 13:00:52,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2018-10-15 13:00:52,373 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 262 [2018-10-15 13:00:52,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:00:52,374 INFO L225 Difference]: With dead ends: 269 [2018-10-15 13:00:52,374 INFO L226 Difference]: Without dead ends: 269 [2018-10-15 13:00:52,376 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11781 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=20478, Invalid=44292, Unknown=0, NotChecked=0, Total=64770 [2018-10-15 13:00:52,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-10-15 13:00:52,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 267. [2018-10-15 13:00:52,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-10-15 13:00:52,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 267 transitions. [2018-10-15 13:00:52,379 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 267 transitions. Word has length 262 [2018-10-15 13:00:52,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:00:52,379 INFO L481 AbstractCegarLoop]: Abstraction has 267 states and 267 transitions. [2018-10-15 13:00:52,379 INFO L482 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-10-15 13:00:52,380 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 267 transitions. [2018-10-15 13:00:52,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-10-15 13:00:52,381 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:00:52,381 INFO L375 BasicCegarLoop]: trace histogram [64, 64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:00:52,381 INFO L424 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:00:52,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:00:52,382 INFO L82 PathProgramCache]: Analyzing trace with hash -527440504, now seen corresponding path program 64 times [2018-10-15 13:00:52,382 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:00:52,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:00:57,298 INFO L134 CoverageAnalysis]: Checked inductivity of 8128 backedges. 0 proven. 8128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:00:57,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:00:57,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-10-15 13:00:57,299 INFO L460 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-10-15 13:00:57,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-10-15 13:00:57,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4355, Invalid=12675, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 13:00:57,300 INFO L87 Difference]: Start difference. First operand 267 states and 267 transitions. Second operand 131 states. [2018-10-15 13:01:06,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:01:06,201 INFO L93 Difference]: Finished difference Result 273 states and 273 transitions. [2018-10-15 13:01:06,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2018-10-15 13:01:06,201 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 266 [2018-10-15 13:01:06,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:01:06,202 INFO L225 Difference]: With dead ends: 273 [2018-10-15 13:01:06,202 INFO L226 Difference]: Without dead ends: 273 [2018-10-15 13:01:06,204 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 257 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12160 ImplicationChecksByTransitivity, 12.8s TimeCoverageRelationStatistics Valid=21123, Invalid=45699, Unknown=0, NotChecked=0, Total=66822 [2018-10-15 13:01:06,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-10-15 13:01:06,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 271. [2018-10-15 13:01:06,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-10-15 13:01:06,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 271 transitions. [2018-10-15 13:01:06,207 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 271 transitions. Word has length 266 [2018-10-15 13:01:06,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:01:06,208 INFO L481 AbstractCegarLoop]: Abstraction has 271 states and 271 transitions. [2018-10-15 13:01:06,208 INFO L482 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-10-15 13:01:06,208 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 271 transitions. [2018-10-15 13:01:06,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-10-15 13:01:06,209 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:01:06,209 INFO L375 BasicCegarLoop]: trace histogram [65, 65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:01:06,210 INFO L424 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:01:06,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:01:06,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1158946868, now seen corresponding path program 65 times [2018-10-15 13:01:06,210 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:01:06,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:01:11,244 INFO L134 CoverageAnalysis]: Checked inductivity of 8385 backedges. 0 proven. 8385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:01:11,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:01:11,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-10-15 13:01:11,245 INFO L460 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-10-15 13:01:11,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-10-15 13:01:11,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4488, Invalid=13068, Unknown=0, NotChecked=0, Total=17556 [2018-10-15 13:01:11,247 INFO L87 Difference]: Start difference. First operand 271 states and 271 transitions. Second operand 133 states. [2018-10-15 13:01:20,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:01:20,184 INFO L93 Difference]: Finished difference Result 277 states and 277 transitions. [2018-10-15 13:01:20,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 198 states. [2018-10-15 13:01:20,184 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 270 [2018-10-15 13:01:20,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:01:20,185 INFO L225 Difference]: With dead ends: 277 [2018-10-15 13:01:20,185 INFO L226 Difference]: Without dead ends: 277 [2018-10-15 13:01:20,187 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12545 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=21778, Invalid=47128, Unknown=0, NotChecked=0, Total=68906 [2018-10-15 13:01:20,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-10-15 13:01:20,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 275. [2018-10-15 13:01:20,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-10-15 13:01:20,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 275 transitions. [2018-10-15 13:01:20,189 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 275 transitions. Word has length 270 [2018-10-15 13:01:20,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:01:20,190 INFO L481 AbstractCegarLoop]: Abstraction has 275 states and 275 transitions. [2018-10-15 13:01:20,190 INFO L482 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-10-15 13:01:20,190 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 275 transitions. [2018-10-15 13:01:20,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-10-15 13:01:20,191 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:01:20,191 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:01:20,191 INFO L424 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:01:20,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:01:20,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1233577968, now seen corresponding path program 66 times [2018-10-15 13:01:20,192 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:01:20,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:01:25,459 INFO L134 CoverageAnalysis]: Checked inductivity of 8646 backedges. 0 proven. 8646 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:01:25,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:01:25,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-10-15 13:01:25,460 INFO L460 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-10-15 13:01:25,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-10-15 13:01:25,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4623, Invalid=13467, Unknown=0, NotChecked=0, Total=18090 [2018-10-15 13:01:25,462 INFO L87 Difference]: Start difference. First operand 275 states and 275 transitions. Second operand 135 states. [2018-10-15 13:01:34,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:01:34,576 INFO L93 Difference]: Finished difference Result 281 states and 281 transitions. [2018-10-15 13:01:34,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2018-10-15 13:01:34,577 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 274 [2018-10-15 13:01:34,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:01:34,578 INFO L225 Difference]: With dead ends: 281 [2018-10-15 13:01:34,578 INFO L226 Difference]: Without dead ends: 281 [2018-10-15 13:01:34,581 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12936 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=22443, Invalid=48579, Unknown=0, NotChecked=0, Total=71022 [2018-10-15 13:01:34,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-10-15 13:01:34,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 279. [2018-10-15 13:01:34,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-10-15 13:01:34,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 279 transitions. [2018-10-15 13:01:34,584 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 279 transitions. Word has length 274 [2018-10-15 13:01:34,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:01:34,584 INFO L481 AbstractCegarLoop]: Abstraction has 279 states and 279 transitions. [2018-10-15 13:01:34,585 INFO L482 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-10-15 13:01:34,585 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 279 transitions. [2018-10-15 13:01:34,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-10-15 13:01:34,586 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:01:34,586 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:01:34,587 INFO L424 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:01:34,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:01:34,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1013485140, now seen corresponding path program 67 times [2018-10-15 13:01:34,588 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:01:34,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:01:39,946 INFO L134 CoverageAnalysis]: Checked inductivity of 8911 backedges. 0 proven. 8911 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:01:39,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:01:39,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2018-10-15 13:01:39,947 INFO L460 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-10-15 13:01:39,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-10-15 13:01:39,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4760, Invalid=13872, Unknown=0, NotChecked=0, Total=18632 [2018-10-15 13:01:39,949 INFO L87 Difference]: Start difference. First operand 279 states and 279 transitions. Second operand 137 states. [2018-10-15 13:01:49,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:01:49,484 INFO L93 Difference]: Finished difference Result 285 states and 285 transitions. [2018-10-15 13:01:49,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 204 states. [2018-10-15 13:01:49,485 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 278 [2018-10-15 13:01:49,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:01:49,486 INFO L225 Difference]: With dead ends: 285 [2018-10-15 13:01:49,486 INFO L226 Difference]: Without dead ends: 285 [2018-10-15 13:01:49,487 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13333 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=23118, Invalid=50052, Unknown=0, NotChecked=0, Total=73170 [2018-10-15 13:01:49,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-10-15 13:01:49,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 283. [2018-10-15 13:01:49,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-10-15 13:01:49,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 283 transitions. [2018-10-15 13:01:49,490 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 283 transitions. Word has length 278 [2018-10-15 13:01:49,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:01:49,490 INFO L481 AbstractCegarLoop]: Abstraction has 283 states and 283 transitions. [2018-10-15 13:01:49,490 INFO L482 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-10-15 13:01:49,490 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 283 transitions. [2018-10-15 13:01:49,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-10-15 13:01:49,491 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:01:49,491 INFO L375 BasicCegarLoop]: trace histogram [68, 68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:01:49,491 INFO L424 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:01:49,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:01:49,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1251261800, now seen corresponding path program 68 times [2018-10-15 13:01:49,492 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:01:49,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:01:54,887 INFO L134 CoverageAnalysis]: Checked inductivity of 9180 backedges. 0 proven. 9180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:01:54,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:01:54,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2018-10-15 13:01:54,888 INFO L460 AbstractCegarLoop]: Interpolant automaton has 139 states [2018-10-15 13:01:54,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2018-10-15 13:01:54,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4899, Invalid=14283, Unknown=0, NotChecked=0, Total=19182 [2018-10-15 13:01:54,890 INFO L87 Difference]: Start difference. First operand 283 states and 283 transitions. Second operand 139 states. [2018-10-15 13:02:04,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:02:04,580 INFO L93 Difference]: Finished difference Result 289 states and 289 transitions. [2018-10-15 13:02:04,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 207 states. [2018-10-15 13:02:04,581 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 282 [2018-10-15 13:02:04,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:02:04,582 INFO L225 Difference]: With dead ends: 289 [2018-10-15 13:02:04,582 INFO L226 Difference]: Without dead ends: 289 [2018-10-15 13:02:04,584 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13736 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=23803, Invalid=51547, Unknown=0, NotChecked=0, Total=75350 [2018-10-15 13:02:04,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-10-15 13:02:04,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 287. [2018-10-15 13:02:04,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-10-15 13:02:04,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 287 transitions. [2018-10-15 13:02:04,586 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 287 transitions. Word has length 282 [2018-10-15 13:02:04,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:02:04,587 INFO L481 AbstractCegarLoop]: Abstraction has 287 states and 287 transitions. [2018-10-15 13:02:04,587 INFO L482 AbstractCegarLoop]: Interpolant automaton has 139 states. [2018-10-15 13:02:04,587 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 287 transitions. [2018-10-15 13:02:04,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-10-15 13:02:04,588 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:02:04,588 INFO L375 BasicCegarLoop]: trace histogram [69, 69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:02:04,588 INFO L424 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:02:04,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:02:04,588 INFO L82 PathProgramCache]: Analyzing trace with hash -911067940, now seen corresponding path program 69 times [2018-10-15 13:02:04,589 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:02:04,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:02:10,162 INFO L134 CoverageAnalysis]: Checked inductivity of 9453 backedges. 0 proven. 9453 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:02:10,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:02:10,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141] total 141 [2018-10-15 13:02:10,163 INFO L460 AbstractCegarLoop]: Interpolant automaton has 141 states [2018-10-15 13:02:10,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2018-10-15 13:02:10,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5040, Invalid=14700, Unknown=0, NotChecked=0, Total=19740 [2018-10-15 13:02:10,164 INFO L87 Difference]: Start difference. First operand 287 states and 287 transitions. Second operand 141 states. [2018-10-15 13:02:20,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:02:20,100 INFO L93 Difference]: Finished difference Result 293 states and 293 transitions. [2018-10-15 13:02:20,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 210 states. [2018-10-15 13:02:20,101 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 286 [2018-10-15 13:02:20,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:02:20,102 INFO L225 Difference]: With dead ends: 293 [2018-10-15 13:02:20,102 INFO L226 Difference]: Without dead ends: 293 [2018-10-15 13:02:20,103 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 277 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14145 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=24498, Invalid=53064, Unknown=0, NotChecked=0, Total=77562 [2018-10-15 13:02:20,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-10-15 13:02:20,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 291. [2018-10-15 13:02:20,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-10-15 13:02:20,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 291 transitions. [2018-10-15 13:02:20,106 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 291 transitions. Word has length 286 [2018-10-15 13:02:20,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:02:20,106 INFO L481 AbstractCegarLoop]: Abstraction has 291 states and 291 transitions. [2018-10-15 13:02:20,106 INFO L482 AbstractCegarLoop]: Interpolant automaton has 141 states. [2018-10-15 13:02:20,107 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 291 transitions. [2018-10-15 13:02:20,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2018-10-15 13:02:20,108 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:02:20,108 INFO L375 BasicCegarLoop]: trace histogram [70, 70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:02:20,108 INFO L424 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:02:20,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:02:20,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1594989280, now seen corresponding path program 70 times [2018-10-15 13:02:20,109 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:02:20,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:02:25,943 INFO L134 CoverageAnalysis]: Checked inductivity of 9730 backedges. 0 proven. 9730 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:02:25,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:02:25,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143] total 143 [2018-10-15 13:02:25,944 INFO L460 AbstractCegarLoop]: Interpolant automaton has 143 states [2018-10-15 13:02:25,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2018-10-15 13:02:25,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5183, Invalid=15123, Unknown=0, NotChecked=0, Total=20306 [2018-10-15 13:02:25,945 INFO L87 Difference]: Start difference. First operand 291 states and 291 transitions. Second operand 143 states. [2018-10-15 13:02:36,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:02:36,122 INFO L93 Difference]: Finished difference Result 297 states and 297 transitions. [2018-10-15 13:02:36,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 213 states. [2018-10-15 13:02:36,123 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 290 [2018-10-15 13:02:36,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:02:36,124 INFO L225 Difference]: With dead ends: 297 [2018-10-15 13:02:36,124 INFO L226 Difference]: Without dead ends: 297 [2018-10-15 13:02:36,126 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 281 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14560 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=25203, Invalid=54603, Unknown=0, NotChecked=0, Total=79806 [2018-10-15 13:02:36,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-10-15 13:02:36,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 295. [2018-10-15 13:02:36,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-10-15 13:02:36,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 295 transitions. [2018-10-15 13:02:36,129 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 295 transitions. Word has length 290 [2018-10-15 13:02:36,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:02:36,129 INFO L481 AbstractCegarLoop]: Abstraction has 295 states and 295 transitions. [2018-10-15 13:02:36,129 INFO L482 AbstractCegarLoop]: Interpolant automaton has 143 states. [2018-10-15 13:02:36,129 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 295 transitions. [2018-10-15 13:02:36,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-10-15 13:02:36,131 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:02:36,131 INFO L375 BasicCegarLoop]: trace histogram [71, 71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:02:36,131 INFO L424 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:02:36,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:02:36,132 INFO L82 PathProgramCache]: Analyzing trace with hash 575722340, now seen corresponding path program 71 times [2018-10-15 13:02:36,132 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:02:36,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:02:42,252 INFO L134 CoverageAnalysis]: Checked inductivity of 10011 backedges. 0 proven. 10011 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:02:42,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:02:42,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145] total 145 [2018-10-15 13:02:42,252 INFO L460 AbstractCegarLoop]: Interpolant automaton has 145 states [2018-10-15 13:02:42,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2018-10-15 13:02:42,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5328, Invalid=15552, Unknown=0, NotChecked=0, Total=20880 [2018-10-15 13:02:42,254 INFO L87 Difference]: Start difference. First operand 295 states and 295 transitions. Second operand 145 states. [2018-10-15 13:02:52,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:02:52,609 INFO L93 Difference]: Finished difference Result 301 states and 301 transitions. [2018-10-15 13:02:52,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 216 states. [2018-10-15 13:02:52,610 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 294 [2018-10-15 13:02:52,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:02:52,611 INFO L225 Difference]: With dead ends: 301 [2018-10-15 13:02:52,611 INFO L226 Difference]: Without dead ends: 301 [2018-10-15 13:02:52,613 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 285 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14981 ImplicationChecksByTransitivity, 15.5s TimeCoverageRelationStatistics Valid=25918, Invalid=56164, Unknown=0, NotChecked=0, Total=82082 [2018-10-15 13:02:52,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-10-15 13:02:52,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 299. [2018-10-15 13:02:52,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-10-15 13:02:52,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 299 transitions. [2018-10-15 13:02:52,616 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 299 transitions. Word has length 294 [2018-10-15 13:02:52,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:02:52,616 INFO L481 AbstractCegarLoop]: Abstraction has 299 states and 299 transitions. [2018-10-15 13:02:52,616 INFO L482 AbstractCegarLoop]: Interpolant automaton has 145 states. [2018-10-15 13:02:52,616 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 299 transitions. [2018-10-15 13:02:52,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-10-15 13:02:52,617 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:02:52,617 INFO L375 BasicCegarLoop]: trace histogram [72, 72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:02:52,617 INFO L424 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:02:52,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:02:52,618 INFO L82 PathProgramCache]: Analyzing trace with hash 881491880, now seen corresponding path program 72 times [2018-10-15 13:02:52,618 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:02:52,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:02:58,683 INFO L134 CoverageAnalysis]: Checked inductivity of 10296 backedges. 0 proven. 10296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:02:58,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:02:58,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147] total 147 [2018-10-15 13:02:58,684 INFO L460 AbstractCegarLoop]: Interpolant automaton has 147 states [2018-10-15 13:02:58,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2018-10-15 13:02:58,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5475, Invalid=15987, Unknown=0, NotChecked=0, Total=21462 [2018-10-15 13:02:58,685 INFO L87 Difference]: Start difference. First operand 299 states and 299 transitions. Second operand 147 states. [2018-10-15 13:03:09,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:09,328 INFO L93 Difference]: Finished difference Result 305 states and 305 transitions. [2018-10-15 13:03:09,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 219 states. [2018-10-15 13:03:09,328 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 298 [2018-10-15 13:03:09,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:09,329 INFO L225 Difference]: With dead ends: 305 [2018-10-15 13:03:09,329 INFO L226 Difference]: Without dead ends: 305 [2018-10-15 13:03:09,331 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 289 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15408 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=26643, Invalid=57747, Unknown=0, NotChecked=0, Total=84390 [2018-10-15 13:03:09,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-10-15 13:03:09,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 303. [2018-10-15 13:03:09,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-10-15 13:03:09,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 303 transitions. [2018-10-15 13:03:09,333 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 303 transitions. Word has length 298 [2018-10-15 13:03:09,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:09,334 INFO L481 AbstractCegarLoop]: Abstraction has 303 states and 303 transitions. [2018-10-15 13:03:09,334 INFO L482 AbstractCegarLoop]: Interpolant automaton has 147 states. [2018-10-15 13:03:09,334 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 303 transitions. [2018-10-15 13:03:09,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-10-15 13:03:09,335 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:09,335 INFO L375 BasicCegarLoop]: trace histogram [73, 73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:03:09,335 INFO L424 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:09,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:09,335 INFO L82 PathProgramCache]: Analyzing trace with hash -36935188, now seen corresponding path program 73 times [2018-10-15 13:03:09,336 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:09,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:15,611 INFO L134 CoverageAnalysis]: Checked inductivity of 10585 backedges. 0 proven. 10585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:15,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:15,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [149] total 149 [2018-10-15 13:03:15,612 INFO L460 AbstractCegarLoop]: Interpolant automaton has 149 states [2018-10-15 13:03:15,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2018-10-15 13:03:15,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5624, Invalid=16428, Unknown=0, NotChecked=0, Total=22052 [2018-10-15 13:03:15,613 INFO L87 Difference]: Start difference. First operand 303 states and 303 transitions. Second operand 149 states. [2018-10-15 13:03:26,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:26,616 INFO L93 Difference]: Finished difference Result 309 states and 309 transitions. [2018-10-15 13:03:26,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 222 states. [2018-10-15 13:03:26,617 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 302 [2018-10-15 13:03:26,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:26,618 INFO L225 Difference]: With dead ends: 309 [2018-10-15 13:03:26,618 INFO L226 Difference]: Without dead ends: 309 [2018-10-15 13:03:26,620 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 293 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15841 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=27378, Invalid=59352, Unknown=0, NotChecked=0, Total=86730 [2018-10-15 13:03:26,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-10-15 13:03:26,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 307. [2018-10-15 13:03:26,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-10-15 13:03:26,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 307 transitions. [2018-10-15 13:03:26,622 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 307 transitions. Word has length 302 [2018-10-15 13:03:26,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:26,622 INFO L481 AbstractCegarLoop]: Abstraction has 307 states and 307 transitions. [2018-10-15 13:03:26,623 INFO L482 AbstractCegarLoop]: Interpolant automaton has 149 states. [2018-10-15 13:03:26,623 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 307 transitions. [2018-10-15 13:03:26,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-10-15 13:03:26,624 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:26,624 INFO L375 BasicCegarLoop]: trace histogram [74, 74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:03:26,624 INFO L424 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:26,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:26,625 INFO L82 PathProgramCache]: Analyzing trace with hash 600281648, now seen corresponding path program 74 times [2018-10-15 13:03:26,625 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:26,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:32,944 INFO L134 CoverageAnalysis]: Checked inductivity of 10878 backedges. 0 proven. 10878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:32,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:32,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [151] total 151 [2018-10-15 13:03:32,945 INFO L460 AbstractCegarLoop]: Interpolant automaton has 151 states [2018-10-15 13:03:32,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 151 interpolants. [2018-10-15 13:03:32,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5775, Invalid=16875, Unknown=0, NotChecked=0, Total=22650 [2018-10-15 13:03:32,946 INFO L87 Difference]: Start difference. First operand 307 states and 307 transitions. Second operand 151 states. [2018-10-15 13:03:44,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:44,468 INFO L93 Difference]: Finished difference Result 313 states and 313 transitions. [2018-10-15 13:03:44,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 225 states. [2018-10-15 13:03:44,468 INFO L78 Accepts]: Start accepts. Automaton has 151 states. Word has length 306 [2018-10-15 13:03:44,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:44,469 INFO L225 Difference]: With dead ends: 313 [2018-10-15 13:03:44,469 INFO L226 Difference]: Without dead ends: 313 [2018-10-15 13:03:44,471 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 297 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16280 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=28123, Invalid=60979, Unknown=0, NotChecked=0, Total=89102 [2018-10-15 13:03:44,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-10-15 13:03:44,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 311. [2018-10-15 13:03:44,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-10-15 13:03:44,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 311 transitions. [2018-10-15 13:03:44,474 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 311 transitions. Word has length 306 [2018-10-15 13:03:44,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:44,474 INFO L481 AbstractCegarLoop]: Abstraction has 311 states and 311 transitions. [2018-10-15 13:03:44,474 INFO L482 AbstractCegarLoop]: Interpolant automaton has 151 states. [2018-10-15 13:03:44,474 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 311 transitions. [2018-10-15 13:03:44,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-10-15 13:03:44,475 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:44,475 INFO L375 BasicCegarLoop]: trace histogram [75, 75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:03:44,475 INFO L424 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:44,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:44,476 INFO L82 PathProgramCache]: Analyzing trace with hash 195885172, now seen corresponding path program 75 times [2018-10-15 13:03:44,476 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:44,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:51,002 INFO L134 CoverageAnalysis]: Checked inductivity of 11175 backedges. 0 proven. 11175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:51,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:51,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [153] total 153 [2018-10-15 13:03:51,003 INFO L460 AbstractCegarLoop]: Interpolant automaton has 153 states [2018-10-15 13:03:51,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 153 interpolants. [2018-10-15 13:03:51,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5928, Invalid=17328, Unknown=0, NotChecked=0, Total=23256 [2018-10-15 13:03:51,005 INFO L87 Difference]: Start difference. First operand 311 states and 311 transitions. Second operand 153 states.