java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20181015-LoopsPathprograms/array_true-unreach-call3_true-termination.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2d08e6e [2018-10-15 12:26:23,747 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 12:26:23,750 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 12:26:23,762 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 12:26:23,763 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 12:26:23,764 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 12:26:23,765 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 12:26:23,767 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 12:26:23,769 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 12:26:23,770 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 12:26:23,771 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 12:26:23,771 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 12:26:23,772 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 12:26:23,773 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 12:26:23,774 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 12:26:23,775 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 12:26:23,776 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 12:26:23,778 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 12:26:23,780 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 12:26:23,782 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 12:26:23,784 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 12:26:23,785 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 12:26:23,787 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 12:26:23,788 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 12:26:23,788 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 12:26:23,789 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 12:26:23,790 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 12:26:23,791 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 12:26:23,795 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 12:26:23,797 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 12:26:23,797 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 12:26:23,798 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 12:26:23,799 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 12:26:23,799 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 12:26:23,803 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 12:26:23,804 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 12:26:23,804 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:26:23,825 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 12:26:23,825 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 12:26:23,826 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 12:26:23,826 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 12:26:23,830 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 12:26:23,830 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 12:26:23,831 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 12:26:23,832 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 12:26:23,832 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 12:26:23,832 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 12:26:23,832 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 12:26:23,832 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 12:26:23,833 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 12:26:23,833 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 12:26:23,834 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 12:26:23,899 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 12:26:23,912 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 12:26:23,916 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 12:26:23,918 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 12:26:23,918 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 12:26:23,919 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/array_true-unreach-call3_true-termination.i_3.bpl [2018-10-15 12:26:23,920 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/array_true-unreach-call3_true-termination.i_3.bpl' [2018-10-15 12:26:23,980 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 12:26:23,982 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-15 12:26:23,985 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 12:26:23,985 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 12:26:23,986 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 12:26:24,017 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array_true-unreach-call3_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:26:23" (1/1) ... [2018-10-15 12:26:24,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array_true-unreach-call3_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:26:23" (1/1) ... [2018-10-15 12:26:24,035 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array_true-unreach-call3_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:26:23" (1/1) ... [2018-10-15 12:26:24,036 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array_true-unreach-call3_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:26:23" (1/1) ... [2018-10-15 12:26:24,042 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array_true-unreach-call3_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:26:23" (1/1) ... [2018-10-15 12:26:24,045 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array_true-unreach-call3_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:26:23" (1/1) ... [2018-10-15 12:26:24,046 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array_true-unreach-call3_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:26:23" (1/1) ... [2018-10-15 12:26:24,048 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 12:26:24,056 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 12:26:24,057 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 12:26:24,058 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 12:26:24,059 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array_true-unreach-call3_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:26:23" (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:26:24,139 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-15 12:26:24,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 12:26:24,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 12:26:24,627 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 12:26:24,628 INFO L202 PluginConnector]: Adding new model array_true-unreach-call3_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:26:24 BoogieIcfgContainer [2018-10-15 12:26:24,628 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 12:26:24,629 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 12:26:24,629 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 12:26:24,633 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 12:26:24,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array_true-unreach-call3_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:26:23" (1/2) ... [2018-10-15 12:26:24,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@96a810c and model type array_true-unreach-call3_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 12:26:24, skipping insertion in model container [2018-10-15 12:26:24,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array_true-unreach-call3_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:26:24" (2/2) ... [2018-10-15 12:26:24,636 INFO L112 eAbstractionObserver]: Analyzing ICFG array_true-unreach-call3_true-termination.i_3.bpl [2018-10-15 12:26:24,647 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 12:26:24,655 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 12:26:24,673 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 12:26:24,704 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 12:26:24,705 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 12:26:24,705 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 12:26:24,706 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 12:26:24,706 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 12:26:24,706 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 12:26:24,706 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 12:26:24,706 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 12:26:24,706 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 12:26:24,730 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2018-10-15 12:26:24,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-15 12:26:24,744 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:24,747 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:24,749 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:24,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:24,755 INFO L82 PathProgramCache]: Analyzing trace with hash -728957315, now seen corresponding path program 1 times [2018-10-15 12:26:24,804 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:24,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:24,923 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:26:24,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 12:26:24,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 12:26:24,931 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 12:26:24,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 12:26:24,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 12:26:24,947 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 3 states. [2018-10-15 12:26:25,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:25,027 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-10-15 12:26:25,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 12:26:25,029 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-10-15 12:26:25,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:25,040 INFO L225 Difference]: With dead ends: 48 [2018-10-15 12:26:25,041 INFO L226 Difference]: Without dead ends: 48 [2018-10-15 12:26:25,043 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:26:25,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-10-15 12:26:25,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 40. [2018-10-15 12:26:25,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-10-15 12:26:25,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-10-15 12:26:25,086 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 29 [2018-10-15 12:26:25,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:25,087 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-10-15 12:26:25,087 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 12:26:25,088 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-10-15 12:26:25,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-15 12:26:25,090 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:25,090 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:25,091 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:25,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:25,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1488319800, now seen corresponding path program 1 times [2018-10-15 12:26:25,093 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:25,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:25,221 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:26:25,222 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:25,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-15 12:26:25,224 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 12:26:25,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 12:26:25,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-15 12:26:25,225 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 5 states. [2018-10-15 12:26:25,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:25,442 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-10-15 12:26:25,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-15 12:26:25,443 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-10-15 12:26:25,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:25,446 INFO L225 Difference]: With dead ends: 58 [2018-10-15 12:26:25,446 INFO L226 Difference]: Without dead ends: 58 [2018-10-15 12:26:25,447 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-15 12:26:25,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-10-15 12:26:25,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2018-10-15 12:26:25,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-10-15 12:26:25,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-10-15 12:26:25,455 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 39 [2018-10-15 12:26:25,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:25,455 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-10-15 12:26:25,455 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 12:26:25,456 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-10-15 12:26:25,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-15 12:26:25,457 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:25,457 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:25,458 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:25,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:25,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1370619443, now seen corresponding path program 2 times [2018-10-15 12:26:25,459 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:25,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:25,756 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:25,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:25,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-15 12:26:25,758 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-15 12:26:25,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-15 12:26:25,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-15 12:26:25,759 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 7 states. [2018-10-15 12:26:26,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:26,126 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-10-15 12:26:26,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-15 12:26:26,126 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2018-10-15 12:26:26,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:26,128 INFO L225 Difference]: With dead ends: 68 [2018-10-15 12:26:26,128 INFO L226 Difference]: Without dead ends: 68 [2018-10-15 12:26:26,129 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:26:26,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-10-15 12:26:26,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 60. [2018-10-15 12:26:26,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-15 12:26:26,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-10-15 12:26:26,138 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 49 [2018-10-15 12:26:26,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:26,138 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-10-15 12:26:26,139 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-15 12:26:26,139 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-10-15 12:26:26,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-10-15 12:26:26,141 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:26,141 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:26,141 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:26,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:26,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1635731822, now seen corresponding path program 3 times [2018-10-15 12:26:26,143 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:26,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:26,363 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:26,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:26,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-15 12:26:26,365 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 12:26:26,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 12:26:26,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-10-15 12:26:26,366 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 9 states. [2018-10-15 12:26:26,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:26,895 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-10-15 12:26:26,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-15 12:26:26,897 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 59 [2018-10-15 12:26:26,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:26,899 INFO L225 Difference]: With dead ends: 78 [2018-10-15 12:26:26,899 INFO L226 Difference]: Without dead ends: 78 [2018-10-15 12:26:26,900 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2018-10-15 12:26:26,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-10-15 12:26:26,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 70. [2018-10-15 12:26:26,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-10-15 12:26:26,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-10-15 12:26:26,909 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 59 [2018-10-15 12:26:26,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:26,910 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-10-15 12:26:26,910 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 12:26:26,910 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-10-15 12:26:26,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-10-15 12:26:26,912 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:26,912 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:26,912 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:26,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:26,913 INFO L82 PathProgramCache]: Analyzing trace with hash 639633129, now seen corresponding path program 4 times [2018-10-15 12:26:26,914 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:26,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:27,193 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:27,193 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:27,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 12:26:27,194 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 12:26:27,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 12:26:27,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-10-15 12:26:27,195 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 11 states. [2018-10-15 12:26:27,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:27,583 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-10-15 12:26:27,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-15 12:26:27,584 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 69 [2018-10-15 12:26:27,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:27,588 INFO L225 Difference]: With dead ends: 88 [2018-10-15 12:26:27,588 INFO L226 Difference]: Without dead ends: 88 [2018-10-15 12:26:27,589 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=219, Unknown=0, NotChecked=0, Total=342 [2018-10-15 12:26:27,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-10-15 12:26:27,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 80. [2018-10-15 12:26:27,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-10-15 12:26:27,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-10-15 12:26:27,605 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 69 [2018-10-15 12:26:27,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:27,605 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-10-15 12:26:27,607 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 12:26:27,607 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-10-15 12:26:27,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-15 12:26:27,608 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:27,610 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:27,610 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:27,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:27,611 INFO L82 PathProgramCache]: Analyzing trace with hash 77227684, now seen corresponding path program 5 times [2018-10-15 12:26:27,613 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:27,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:27,998 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:27,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:27,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-15 12:26:27,999 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-15 12:26:27,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-15 12:26:27,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-10-15 12:26:28,000 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 13 states. [2018-10-15 12:26:28,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:28,335 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-10-15 12:26:28,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-15 12:26:28,336 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 79 [2018-10-15 12:26:28,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:28,338 INFO L225 Difference]: With dead ends: 98 [2018-10-15 12:26:28,338 INFO L226 Difference]: Without dead ends: 98 [2018-10-15 12:26:28,339 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:26:28,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-10-15 12:26:28,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 90. [2018-10-15 12:26:28,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-10-15 12:26:28,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-10-15 12:26:28,346 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 79 [2018-10-15 12:26:28,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:28,346 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-10-15 12:26:28,347 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-15 12:26:28,347 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-10-15 12:26:28,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-10-15 12:26:28,348 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:28,349 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:28,349 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:28,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:28,349 INFO L82 PathProgramCache]: Analyzing trace with hash 871930015, now seen corresponding path program 6 times [2018-10-15 12:26:28,350 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:28,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:28,610 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:28,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:28,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 12:26:28,612 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 12:26:28,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 12:26:28,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-10-15 12:26:28,613 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 15 states. [2018-10-15 12:26:28,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:28,908 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-10-15 12:26:28,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-15 12:26:28,908 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 89 [2018-10-15 12:26:28,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:28,910 INFO L225 Difference]: With dead ends: 108 [2018-10-15 12:26:28,910 INFO L226 Difference]: Without dead ends: 108 [2018-10-15 12:26:28,911 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=243, Invalid=459, Unknown=0, NotChecked=0, Total=702 [2018-10-15 12:26:28,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-10-15 12:26:28,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 100. [2018-10-15 12:26:28,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-10-15 12:26:28,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-10-15 12:26:28,919 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 89 [2018-10-15 12:26:28,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:28,920 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-10-15 12:26:28,920 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 12:26:28,920 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-10-15 12:26:28,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-15 12:26:28,922 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:28,922 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:28,922 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:28,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:28,923 INFO L82 PathProgramCache]: Analyzing trace with hash 138988762, now seen corresponding path program 7 times [2018-10-15 12:26:28,923 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:28,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:29,323 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 217 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:29,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:29,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-15 12:26:29,324 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-15 12:26:29,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-15 12:26:29,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2018-10-15 12:26:29,325 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 17 states. [2018-10-15 12:26:29,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:29,795 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2018-10-15 12:26:29,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-15 12:26:29,796 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 99 [2018-10-15 12:26:29,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:29,798 INFO L225 Difference]: With dead ends: 118 [2018-10-15 12:26:29,799 INFO L226 Difference]: Without dead ends: 118 [2018-10-15 12:26:29,800 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=318, Invalid=612, Unknown=0, NotChecked=0, Total=930 [2018-10-15 12:26:29,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-10-15 12:26:29,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 110. [2018-10-15 12:26:29,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-10-15 12:26:29,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-10-15 12:26:29,807 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 99 [2018-10-15 12:26:29,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:29,807 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-10-15 12:26:29,808 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-15 12:26:29,808 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-10-15 12:26:29,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-15 12:26:29,809 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:29,810 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:29,810 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:29,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:29,810 INFO L82 PathProgramCache]: Analyzing trace with hash 2107454293, now seen corresponding path program 8 times [2018-10-15 12:26:29,811 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:29,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:30,115 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:30,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:30,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-15 12:26:30,116 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-15 12:26:30,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-15 12:26:30,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2018-10-15 12:26:30,117 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 19 states. [2018-10-15 12:26:30,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:30,807 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2018-10-15 12:26:30,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-15 12:26:30,808 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 109 [2018-10-15 12:26:30,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:30,810 INFO L225 Difference]: With dead ends: 128 [2018-10-15 12:26:30,810 INFO L226 Difference]: Without dead ends: 128 [2018-10-15 12:26:30,811 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=403, Invalid=787, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 12:26:30,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-10-15 12:26:30,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 120. [2018-10-15 12:26:30,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-10-15 12:26:30,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2018-10-15 12:26:30,821 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 109 [2018-10-15 12:26:30,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:30,821 INFO L481 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2018-10-15 12:26:30,822 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-15 12:26:30,822 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2018-10-15 12:26:30,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-10-15 12:26:30,823 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:30,824 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:30,824 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:30,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:30,825 INFO L82 PathProgramCache]: Analyzing trace with hash 51117072, now seen corresponding path program 9 times [2018-10-15 12:26:30,825 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:30,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:31,309 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 0 proven. 369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:31,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:31,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 12:26:31,310 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 12:26:31,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 12:26:31,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2018-10-15 12:26:31,311 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 21 states. [2018-10-15 12:26:31,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:31,724 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2018-10-15 12:26:31,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-15 12:26:31,725 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 119 [2018-10-15 12:26:31,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:31,726 INFO L225 Difference]: With dead ends: 138 [2018-10-15 12:26:31,726 INFO L226 Difference]: Without dead ends: 138 [2018-10-15 12:26:31,727 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=498, Invalid=984, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 12:26:31,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-10-15 12:26:31,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 130. [2018-10-15 12:26:31,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-10-15 12:26:31,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2018-10-15 12:26:31,737 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 119 [2018-10-15 12:26:31,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:31,738 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2018-10-15 12:26:31,738 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 12:26:31,738 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2018-10-15 12:26:31,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-10-15 12:26:31,746 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:31,746 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:31,746 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:31,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:31,747 INFO L82 PathProgramCache]: Analyzing trace with hash -2052106485, now seen corresponding path program 10 times [2018-10-15 12:26:31,748 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:31,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:32,186 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 0 proven. 460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:32,186 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:32,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-15 12:26:32,187 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-15 12:26:32,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-15 12:26:32,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2018-10-15 12:26:32,188 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 23 states. [2018-10-15 12:26:32,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:32,591 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2018-10-15 12:26:32,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-15 12:26:32,591 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 129 [2018-10-15 12:26:32,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:32,593 INFO L225 Difference]: With dead ends: 148 [2018-10-15 12:26:32,593 INFO L226 Difference]: Without dead ends: 148 [2018-10-15 12:26:32,594 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:26:32,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-10-15 12:26:32,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 140. [2018-10-15 12:26:32,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-10-15 12:26:32,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 140 transitions. [2018-10-15 12:26:32,600 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 140 transitions. Word has length 129 [2018-10-15 12:26:32,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:32,600 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 140 transitions. [2018-10-15 12:26:32,600 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-15 12:26:32,600 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 140 transitions. [2018-10-15 12:26:32,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-15 12:26:32,602 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:32,602 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:32,602 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:32,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:32,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1146784698, now seen corresponding path program 11 times [2018-10-15 12:26:32,603 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:32,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:33,871 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:26:33,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:33,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-15 12:26:33,872 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-15 12:26:33,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-15 12:26:33,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2018-10-15 12:26:33,873 INFO L87 Difference]: Start difference. First operand 140 states and 140 transitions. Second operand 25 states. [2018-10-15 12:26:34,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:34,437 INFO L93 Difference]: Finished difference Result 158 states and 158 transitions. [2018-10-15 12:26:34,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-15 12:26:34,437 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 139 [2018-10-15 12:26:34,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:34,439 INFO L225 Difference]: With dead ends: 158 [2018-10-15 12:26:34,439 INFO L226 Difference]: Without dead ends: 158 [2018-10-15 12:26:34,442 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=718, Invalid=1444, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 12:26:34,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-10-15 12:26:34,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 150. [2018-10-15 12:26:34,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-10-15 12:26:34,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 150 transitions. [2018-10-15 12:26:34,453 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 150 transitions. Word has length 139 [2018-10-15 12:26:34,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:34,454 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 150 transitions. [2018-10-15 12:26:34,454 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-15 12:26:34,454 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 150 transitions. [2018-10-15 12:26:34,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-10-15 12:26:34,455 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:34,456 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:34,456 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:34,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:34,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1357872191, now seen corresponding path program 12 times [2018-10-15 12:26:34,457 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:34,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:34,824 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 0 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:34,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:34,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 12:26:34,824 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 12:26:34,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 12:26:34,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2018-10-15 12:26:34,825 INFO L87 Difference]: Start difference. First operand 150 states and 150 transitions. Second operand 27 states. [2018-10-15 12:26:35,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:35,568 INFO L93 Difference]: Finished difference Result 168 states and 168 transitions. [2018-10-15 12:26:35,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-15 12:26:35,568 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 149 [2018-10-15 12:26:35,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:35,570 INFO L225 Difference]: With dead ends: 168 [2018-10-15 12:26:35,570 INFO L226 Difference]: Without dead ends: 168 [2018-10-15 12:26:35,572 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=843, Invalid=1707, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 12:26:35,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-10-15 12:26:35,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 160. [2018-10-15 12:26:35,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-10-15 12:26:35,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 160 transitions. [2018-10-15 12:26:35,576 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 160 transitions. Word has length 149 [2018-10-15 12:26:35,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:35,576 INFO L481 AbstractCegarLoop]: Abstraction has 160 states and 160 transitions. [2018-10-15 12:26:35,577 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 12:26:35,577 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 160 transitions. [2018-10-15 12:26:35,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-10-15 12:26:35,578 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:35,578 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:35,579 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:35,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:35,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1995000452, now seen corresponding path program 13 times [2018-10-15 12:26:35,580 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:35,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:36,410 INFO L134 CoverageAnalysis]: Checked inductivity of 793 backedges. 0 proven. 793 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:36,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:36,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 12:26:36,411 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 12:26:36,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 12:26:36,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=588, Unknown=0, NotChecked=0, Total=812 [2018-10-15 12:26:36,412 INFO L87 Difference]: Start difference. First operand 160 states and 160 transitions. Second operand 29 states. [2018-10-15 12:26:37,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:37,622 INFO L93 Difference]: Finished difference Result 178 states and 178 transitions. [2018-10-15 12:26:37,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-15 12:26:37,623 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 159 [2018-10-15 12:26:37,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:37,624 INFO L225 Difference]: With dead ends: 178 [2018-10-15 12:26:37,624 INFO L226 Difference]: Without dead ends: 178 [2018-10-15 12:26:37,626 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:26:37,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-10-15 12:26:37,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 170. [2018-10-15 12:26:37,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-10-15 12:26:37,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 170 transitions. [2018-10-15 12:26:37,629 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 170 transitions. Word has length 159 [2018-10-15 12:26:37,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:37,630 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 170 transitions. [2018-10-15 12:26:37,630 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 12:26:37,630 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 170 transitions. [2018-10-15 12:26:37,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-10-15 12:26:37,631 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:37,631 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:37,632 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:37,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:37,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1662895753, now seen corresponding path program 14 times [2018-10-15 12:26:37,633 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:37,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:38,168 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:38,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:38,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 12:26:38,169 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 12:26:38,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 12:26:38,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2018-10-15 12:26:38,170 INFO L87 Difference]: Start difference. First operand 170 states and 170 transitions. Second operand 31 states. [2018-10-15 12:26:38,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:38,781 INFO L93 Difference]: Finished difference Result 188 states and 188 transitions. [2018-10-15 12:26:38,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-15 12:26:38,782 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 169 [2018-10-15 12:26:38,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:38,784 INFO L225 Difference]: With dead ends: 188 [2018-10-15 12:26:38,785 INFO L226 Difference]: Without dead ends: 188 [2018-10-15 12:26:38,787 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:26:38,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-10-15 12:26:38,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 180. [2018-10-15 12:26:38,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-10-15 12:26:38,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 180 transitions. [2018-10-15 12:26:38,790 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 180 transitions. Word has length 169 [2018-10-15 12:26:38,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:38,791 INFO L481 AbstractCegarLoop]: Abstraction has 180 states and 180 transitions. [2018-10-15 12:26:38,791 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 12:26:38,791 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 180 transitions. [2018-10-15 12:26:38,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-15 12:26:38,792 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:38,792 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:38,792 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:38,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:38,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1298055246, now seen corresponding path program 15 times [2018-10-15 12:26:38,793 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:38,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:39,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1065 backedges. 0 proven. 1065 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:39,260 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:39,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 12:26:39,261 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 12:26:39,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 12:26:39,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 12:26:39,262 INFO L87 Difference]: Start difference. First operand 180 states and 180 transitions. Second operand 33 states. [2018-10-15 12:26:39,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:39,991 INFO L93 Difference]: Finished difference Result 198 states and 198 transitions. [2018-10-15 12:26:39,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-15 12:26:39,993 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 179 [2018-10-15 12:26:39,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:39,994 INFO L225 Difference]: With dead ends: 198 [2018-10-15 12:26:39,994 INFO L226 Difference]: Without dead ends: 198 [2018-10-15 12:26:39,997 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1278, Invalid=2628, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 12:26:39,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-10-15 12:26:40,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 190. [2018-10-15 12:26:40,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-10-15 12:26:40,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 190 transitions. [2018-10-15 12:26:40,001 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 190 transitions. Word has length 179 [2018-10-15 12:26:40,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:40,001 INFO L481 AbstractCegarLoop]: Abstraction has 190 states and 190 transitions. [2018-10-15 12:26:40,002 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 12:26:40,002 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 190 transitions. [2018-10-15 12:26:40,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-10-15 12:26:40,003 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:40,003 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:40,004 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:40,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:40,004 INFO L82 PathProgramCache]: Analyzing trace with hash -1836713939, now seen corresponding path program 16 times [2018-10-15 12:26:40,005 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:40,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:41,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 0 proven. 1216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:41,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:41,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 12:26:41,376 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 12:26:41,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 12:26:41,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 12:26:41,377 INFO L87 Difference]: Start difference. First operand 190 states and 190 transitions. Second operand 35 states. [2018-10-15 12:26:42,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:42,361 INFO L93 Difference]: Finished difference Result 208 states and 208 transitions. [2018-10-15 12:26:42,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-15 12:26:42,369 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 189 [2018-10-15 12:26:42,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:42,370 INFO L225 Difference]: With dead ends: 208 [2018-10-15 12:26:42,371 INFO L226 Difference]: Without dead ends: 208 [2018-10-15 12:26:42,373 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1443, Invalid=2979, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 12:26:42,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-10-15 12:26:42,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 200. [2018-10-15 12:26:42,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-10-15 12:26:42,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 200 transitions. [2018-10-15 12:26:42,377 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 200 transitions. Word has length 189 [2018-10-15 12:26:42,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:42,377 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 200 transitions. [2018-10-15 12:26:42,377 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 12:26:42,377 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 200 transitions. [2018-10-15 12:26:42,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-15 12:26:42,382 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:42,383 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:42,383 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:42,383 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:42,383 INFO L82 PathProgramCache]: Analyzing trace with hash -809069848, now seen corresponding path program 17 times [2018-10-15 12:26:42,384 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:42,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:43,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1377 backedges. 0 proven. 1377 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:43,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:43,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 12:26:43,082 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 12:26:43,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 12:26:43,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 12:26:43,083 INFO L87 Difference]: Start difference. First operand 200 states and 200 transitions. Second operand 37 states. [2018-10-15 12:26:44,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:44,048 INFO L93 Difference]: Finished difference Result 218 states and 218 transitions. [2018-10-15 12:26:44,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-15 12:26:44,048 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 199 [2018-10-15 12:26:44,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:44,051 INFO L225 Difference]: With dead ends: 218 [2018-10-15 12:26:44,051 INFO L226 Difference]: Without dead ends: 218 [2018-10-15 12:26:44,053 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 833 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1618, Invalid=3352, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 12:26:44,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-10-15 12:26:44,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 210. [2018-10-15 12:26:44,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-10-15 12:26:44,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 210 transitions. [2018-10-15 12:26:44,057 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 210 transitions. Word has length 199 [2018-10-15 12:26:44,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:44,058 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 210 transitions. [2018-10-15 12:26:44,058 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 12:26:44,058 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 210 transitions. [2018-10-15 12:26:44,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-10-15 12:26:44,059 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:44,059 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:44,059 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:44,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:44,060 INFO L82 PathProgramCache]: Analyzing trace with hash -744669213, now seen corresponding path program 18 times [2018-10-15 12:26:44,061 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:44,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:44,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1548 backedges. 0 proven. 1548 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:44,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:44,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 12:26:44,869 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 12:26:44,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 12:26:44,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 12:26:44,871 INFO L87 Difference]: Start difference. First operand 210 states and 210 transitions. Second operand 39 states. [2018-10-15 12:26:45,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:45,848 INFO L93 Difference]: Finished difference Result 228 states and 228 transitions. [2018-10-15 12:26:45,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-15 12:26:45,849 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 209 [2018-10-15 12:26:45,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:45,851 INFO L225 Difference]: With dead ends: 228 [2018-10-15 12:26:45,851 INFO L226 Difference]: Without dead ends: 228 [2018-10-15 12:26:45,853 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1803, Invalid=3747, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 12:26:45,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-10-15 12:26:45,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 220. [2018-10-15 12:26:45,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-10-15 12:26:45,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 220 transitions. [2018-10-15 12:26:45,858 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 220 transitions. Word has length 209 [2018-10-15 12:26:45,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:45,858 INFO L481 AbstractCegarLoop]: Abstraction has 220 states and 220 transitions. [2018-10-15 12:26:45,858 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 12:26:45,858 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 220 transitions. [2018-10-15 12:26:45,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-10-15 12:26:45,859 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:45,860 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:45,860 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:45,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:45,860 INFO L82 PathProgramCache]: Analyzing trace with hash 675819294, now seen corresponding path program 19 times [2018-10-15 12:26:45,861 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:45,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:46,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1729 backedges. 0 proven. 1729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:46,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:46,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 12:26:46,970 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 12:26:46,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 12:26:46,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=1200, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 12:26:46,971 INFO L87 Difference]: Start difference. First operand 220 states and 220 transitions. Second operand 41 states. [2018-10-15 12:26:48,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:48,002 INFO L93 Difference]: Finished difference Result 238 states and 238 transitions. [2018-10-15 12:26:48,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-15 12:26:48,002 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 219 [2018-10-15 12:26:48,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:48,004 INFO L225 Difference]: With dead ends: 238 [2018-10-15 12:26:48,004 INFO L226 Difference]: Without dead ends: 238 [2018-10-15 12:26:48,006 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1045 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1998, Invalid=4164, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 12:26:48,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-10-15 12:26:48,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 230. [2018-10-15 12:26:48,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-10-15 12:26:48,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 230 transitions. [2018-10-15 12:26:48,011 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 230 transitions. Word has length 219 [2018-10-15 12:26:48,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:48,011 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 230 transitions. [2018-10-15 12:26:48,011 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 12:26:48,011 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 230 transitions. [2018-10-15 12:26:48,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-10-15 12:26:48,012 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:48,013 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:48,013 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:48,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:48,013 INFO L82 PathProgramCache]: Analyzing trace with hash 67735705, now seen corresponding path program 20 times [2018-10-15 12:26:48,014 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:48,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:49,098 INFO L134 CoverageAnalysis]: Checked inductivity of 1920 backedges. 0 proven. 1920 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:49,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:49,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 12:26:49,099 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 12:26:49,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 12:26:49,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 12:26:49,100 INFO L87 Difference]: Start difference. First operand 230 states and 230 transitions. Second operand 43 states. [2018-10-15 12:26:50,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:50,265 INFO L93 Difference]: Finished difference Result 248 states and 248 transitions. [2018-10-15 12:26:50,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-15 12:26:50,266 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 229 [2018-10-15 12:26:50,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:50,268 INFO L225 Difference]: With dead ends: 248 [2018-10-15 12:26:50,268 INFO L226 Difference]: Without dead ends: 248 [2018-10-15 12:26:50,271 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1160 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2203, Invalid=4603, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 12:26:50,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-10-15 12:26:50,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 240. [2018-10-15 12:26:50,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-10-15 12:26:50,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 240 transitions. [2018-10-15 12:26:50,275 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 240 transitions. Word has length 229 [2018-10-15 12:26:50,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:50,276 INFO L481 AbstractCegarLoop]: Abstraction has 240 states and 240 transitions. [2018-10-15 12:26:50,276 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 12:26:50,276 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 240 transitions. [2018-10-15 12:26:50,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-10-15 12:26:50,277 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:50,277 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:50,278 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:50,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:50,278 INFO L82 PathProgramCache]: Analyzing trace with hash 338138196, now seen corresponding path program 21 times [2018-10-15 12:26:50,279 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:50,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:52,423 INFO L134 CoverageAnalysis]: Checked inductivity of 2121 backedges. 0 proven. 2121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:52,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:52,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 12:26:52,424 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 12:26:52,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 12:26:52,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=1452, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 12:26:52,425 INFO L87 Difference]: Start difference. First operand 240 states and 240 transitions. Second operand 45 states. [2018-10-15 12:26:53,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:53,706 INFO L93 Difference]: Finished difference Result 258 states and 258 transitions. [2018-10-15 12:26:53,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-15 12:26:53,714 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 239 [2018-10-15 12:26:53,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:53,715 INFO L225 Difference]: With dead ends: 258 [2018-10-15 12:26:53,716 INFO L226 Difference]: Without dead ends: 258 [2018-10-15 12:26:53,717 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1281 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2418, Invalid=5064, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 12:26:53,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-10-15 12:26:53,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 250. [2018-10-15 12:26:53,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-10-15 12:26:53,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 250 transitions. [2018-10-15 12:26:53,721 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 250 transitions. Word has length 239 [2018-10-15 12:26:53,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:53,722 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 250 transitions. [2018-10-15 12:26:53,722 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 12:26:53,722 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 250 transitions. [2018-10-15 12:26:53,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-10-15 12:26:53,723 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:53,723 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:53,723 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:53,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:53,724 INFO L82 PathProgramCache]: Analyzing trace with hash -2014549425, now seen corresponding path program 22 times [2018-10-15 12:26:53,725 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:53,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:55,160 INFO L134 CoverageAnalysis]: Checked inductivity of 2332 backedges. 0 proven. 2332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:55,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:55,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 12:26:55,161 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 12:26:55,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 12:26:55,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=1587, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 12:26:55,162 INFO L87 Difference]: Start difference. First operand 250 states and 250 transitions. Second operand 47 states. [2018-10-15 12:26:56,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:56,975 INFO L93 Difference]: Finished difference Result 268 states and 268 transitions. [2018-10-15 12:26:56,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-15 12:26:56,975 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 249 [2018-10-15 12:26:56,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:56,978 INFO L225 Difference]: With dead ends: 268 [2018-10-15 12:26:56,978 INFO L226 Difference]: Without dead ends: 268 [2018-10-15 12:26:56,979 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1408 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2643, Invalid=5547, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 12:26:56,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-10-15 12:26:56,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 260. [2018-10-15 12:26:56,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-10-15 12:26:56,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 260 transitions. [2018-10-15 12:26:56,983 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 260 transitions. Word has length 249 [2018-10-15 12:26:56,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:56,984 INFO L481 AbstractCegarLoop]: Abstraction has 260 states and 260 transitions. [2018-10-15 12:26:56,984 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 12:26:56,984 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 260 transitions. [2018-10-15 12:26:56,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-10-15 12:26:56,986 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:56,986 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:56,986 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:56,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:56,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1537622666, now seen corresponding path program 23 times [2018-10-15 12:26:56,987 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:57,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:26:57,823 INFO L134 CoverageAnalysis]: Checked inductivity of 2553 backedges. 0 proven. 2553 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:26:57,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:26:57,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 12:26:57,824 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 12:26:57,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 12:26:57,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=624, Invalid=1728, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 12:26:57,825 INFO L87 Difference]: Start difference. First operand 260 states and 260 transitions. Second operand 49 states. [2018-10-15 12:26:59,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:26:59,241 INFO L93 Difference]: Finished difference Result 278 states and 278 transitions. [2018-10-15 12:26:59,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-15 12:26:59,241 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 259 [2018-10-15 12:26:59,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:26:59,243 INFO L225 Difference]: With dead ends: 278 [2018-10-15 12:26:59,243 INFO L226 Difference]: Without dead ends: 278 [2018-10-15 12:26:59,245 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1541 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2878, Invalid=6052, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 12:26:59,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-10-15 12:26:59,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 270. [2018-10-15 12:26:59,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-10-15 12:26:59,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 270 transitions. [2018-10-15 12:26:59,249 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 270 transitions. Word has length 259 [2018-10-15 12:26:59,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:26:59,250 INFO L481 AbstractCegarLoop]: Abstraction has 270 states and 270 transitions. [2018-10-15 12:26:59,250 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 12:26:59,250 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 270 transitions. [2018-10-15 12:26:59,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-10-15 12:26:59,251 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:26:59,252 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:26:59,252 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:26:59,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:26:59,252 INFO L82 PathProgramCache]: Analyzing trace with hash -475575035, now seen corresponding path program 24 times [2018-10-15 12:26:59,253 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:26:59,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:27:00,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2784 backedges. 0 proven. 2784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:27:00,247 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:27:00,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 12:27:00,248 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 12:27:00,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 12:27:00,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 12:27:00,249 INFO L87 Difference]: Start difference. First operand 270 states and 270 transitions. Second operand 51 states. [2018-10-15 12:27:02,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:27:02,038 INFO L93 Difference]: Finished difference Result 288 states and 288 transitions. [2018-10-15 12:27:02,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-15 12:27:02,039 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 269 [2018-10-15 12:27:02,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:27:02,040 INFO L225 Difference]: With dead ends: 288 [2018-10-15 12:27:02,041 INFO L226 Difference]: Without dead ends: 288 [2018-10-15 12:27:02,042 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1680 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3123, Invalid=6579, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 12:27:02,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-10-15 12:27:02,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 280. [2018-10-15 12:27:02,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-10-15 12:27:02,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 280 transitions. [2018-10-15 12:27:02,047 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 280 transitions. Word has length 269 [2018-10-15 12:27:02,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:27:02,048 INFO L481 AbstractCegarLoop]: Abstraction has 280 states and 280 transitions. [2018-10-15 12:27:02,048 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 12:27:02,048 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 280 transitions. [2018-10-15 12:27:02,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-10-15 12:27:02,049 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:27:02,050 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:27:02,050 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:27:02,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:27:02,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1757038144, now seen corresponding path program 25 times [2018-10-15 12:27:02,051 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:27:02,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:27:03,547 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:27:03,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:27:03,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 12:27:03,548 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 12:27:03,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 12:27:03,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=728, Invalid=2028, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 12:27:03,549 INFO L87 Difference]: Start difference. First operand 280 states and 280 transitions. Second operand 53 states. [2018-10-15 12:27:05,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:27:05,300 INFO L93 Difference]: Finished difference Result 298 states and 298 transitions. [2018-10-15 12:27:05,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-15 12:27:05,301 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 279 [2018-10-15 12:27:05,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:27:05,303 INFO L225 Difference]: With dead ends: 298 [2018-10-15 12:27:05,303 INFO L226 Difference]: Without dead ends: 298 [2018-10-15 12:27:05,305 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1825 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3378, Invalid=7128, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 12:27:05,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-10-15 12:27:05,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 290. [2018-10-15 12:27:05,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-10-15 12:27:05,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 290 transitions. [2018-10-15 12:27:05,310 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 290 transitions. Word has length 279 [2018-10-15 12:27:05,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:27:05,310 INFO L481 AbstractCegarLoop]: Abstraction has 290 states and 290 transitions. [2018-10-15 12:27:05,311 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 12:27:05,311 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 290 transitions. [2018-10-15 12:27:05,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-10-15 12:27:05,312 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:27:05,312 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:27:05,313 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:27:05,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:27:05,313 INFO L82 PathProgramCache]: Analyzing trace with hash 467384507, now seen corresponding path program 26 times [2018-10-15 12:27:05,314 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:27:05,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:27:06,475 INFO L134 CoverageAnalysis]: Checked inductivity of 3276 backedges. 0 proven. 3276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:27:06,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:27:06,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-15 12:27:06,476 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-15 12:27:06,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-15 12:27:06,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=783, Invalid=2187, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 12:27:06,477 INFO L87 Difference]: Start difference. First operand 290 states and 290 transitions. Second operand 55 states. [2018-10-15 12:27:08,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:27:08,480 INFO L93 Difference]: Finished difference Result 308 states and 308 transitions. [2018-10-15 12:27:08,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-15 12:27:08,482 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 289 [2018-10-15 12:27:08,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:27:08,484 INFO L225 Difference]: With dead ends: 308 [2018-10-15 12:27:08,484 INFO L226 Difference]: Without dead ends: 308 [2018-10-15 12:27:08,485 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:27:08,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-10-15 12:27:08,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 300. [2018-10-15 12:27:08,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-10-15 12:27:08,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 300 transitions. [2018-10-15 12:27:08,490 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 300 transitions. Word has length 289 [2018-10-15 12:27:08,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:27:08,490 INFO L481 AbstractCegarLoop]: Abstraction has 300 states and 300 transitions. [2018-10-15 12:27:08,490 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-15 12:27:08,491 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 300 transitions. [2018-10-15 12:27:08,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2018-10-15 12:27:08,492 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:27:08,492 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:27:08,493 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:27:08,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:27:08,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1882752522, now seen corresponding path program 27 times [2018-10-15 12:27:08,494 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:27:08,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:27:09,664 INFO L134 CoverageAnalysis]: Checked inductivity of 3537 backedges. 0 proven. 3537 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:27:09,664 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:27:09,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-15 12:27:09,665 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-15 12:27:09,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-15 12:27:09,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=840, Invalid=2352, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 12:27:09,666 INFO L87 Difference]: Start difference. First operand 300 states and 300 transitions. Second operand 57 states. [2018-10-15 12:27:12,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:27:12,783 INFO L93 Difference]: Finished difference Result 318 states and 318 transitions. [2018-10-15 12:27:12,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-15 12:27:12,784 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 299 [2018-10-15 12:27:12,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:27:12,786 INFO L225 Difference]: With dead ends: 318 [2018-10-15 12:27:12,786 INFO L226 Difference]: Without dead ends: 318 [2018-10-15 12:27:12,787 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2133 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3918, Invalid=8292, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 12:27:12,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-10-15 12:27:12,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 310. [2018-10-15 12:27:12,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-10-15 12:27:12,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 310 transitions. [2018-10-15 12:27:12,791 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 310 transitions. Word has length 299 [2018-10-15 12:27:12,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:27:12,792 INFO L481 AbstractCegarLoop]: Abstraction has 310 states and 310 transitions. [2018-10-15 12:27:12,792 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-15 12:27:12,792 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 310 transitions. [2018-10-15 12:27:12,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2018-10-15 12:27:12,793 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:27:12,794 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:27:12,794 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:27:12,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:27:12,794 INFO L82 PathProgramCache]: Analyzing trace with hash 359345521, now seen corresponding path program 28 times [2018-10-15 12:27:12,795 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:27:12,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:27:15,038 INFO L134 CoverageAnalysis]: Checked inductivity of 3808 backedges. 0 proven. 3808 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:27:15,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:27:15,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-15 12:27:15,039 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-15 12:27:15,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-15 12:27:15,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=899, Invalid=2523, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 12:27:15,040 INFO L87 Difference]: Start difference. First operand 310 states and 310 transitions. Second operand 59 states. [2018-10-15 12:27:17,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:27:17,348 INFO L93 Difference]: Finished difference Result 328 states and 328 transitions. [2018-10-15 12:27:17,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-15 12:27:17,349 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 309 [2018-10-15 12:27:17,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:27:17,350 INFO L225 Difference]: With dead ends: 328 [2018-10-15 12:27:17,350 INFO L226 Difference]: Without dead ends: 328 [2018-10-15 12:27:17,351 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2296 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=4203, Invalid=8907, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 12:27:17,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-10-15 12:27:17,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 320. [2018-10-15 12:27:17,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-10-15 12:27:17,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 320 transitions. [2018-10-15 12:27:17,356 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 320 transitions. Word has length 309 [2018-10-15 12:27:17,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:27:17,356 INFO L481 AbstractCegarLoop]: Abstraction has 320 states and 320 transitions. [2018-10-15 12:27:17,356 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-15 12:27:17,356 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 320 transitions. [2018-10-15 12:27:17,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2018-10-15 12:27:17,358 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:27:17,358 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:27:17,358 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:27:17,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:27:17,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1641217236, now seen corresponding path program 29 times [2018-10-15 12:27:17,359 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:27:17,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:27:19,060 INFO L134 CoverageAnalysis]: Checked inductivity of 4089 backedges. 0 proven. 4089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:27:19,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:27:19,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-15 12:27:19,061 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-15 12:27:19,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-15 12:27:19,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=960, Invalid=2700, Unknown=0, NotChecked=0, Total=3660 [2018-10-15 12:27:19,062 INFO L87 Difference]: Start difference. First operand 320 states and 320 transitions. Second operand 61 states. [2018-10-15 12:27:21,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:27:21,216 INFO L93 Difference]: Finished difference Result 338 states and 338 transitions. [2018-10-15 12:27:21,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-15 12:27:21,217 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 319 [2018-10-15 12:27:21,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:27:21,220 INFO L225 Difference]: With dead ends: 338 [2018-10-15 12:27:21,220 INFO L226 Difference]: Without dead ends: 338 [2018-10-15 12:27:21,221 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2465 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4498, Invalid=9544, Unknown=0, NotChecked=0, Total=14042 [2018-10-15 12:27:21,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-10-15 12:27:21,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 330. [2018-10-15 12:27:21,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-10-15 12:27:21,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 330 transitions. [2018-10-15 12:27:21,226 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 330 transitions. Word has length 319 [2018-10-15 12:27:21,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:27:21,226 INFO L481 AbstractCegarLoop]: Abstraction has 330 states and 330 transitions. [2018-10-15 12:27:21,226 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-15 12:27:21,226 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 330 transitions. [2018-10-15 12:27:21,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2018-10-15 12:27:21,228 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:27:21,228 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:27:21,228 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:27:21,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:27:21,229 INFO L82 PathProgramCache]: Analyzing trace with hash -176739545, now seen corresponding path program 30 times [2018-10-15 12:27:21,229 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:27:21,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:27:23,019 INFO L134 CoverageAnalysis]: Checked inductivity of 4380 backedges. 0 proven. 4380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:27:23,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:27:23,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-15 12:27:23,020 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-15 12:27:23,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-15 12:27:23,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 12:27:23,021 INFO L87 Difference]: Start difference. First operand 330 states and 330 transitions. Second operand 63 states. [2018-10-15 12:27:25,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:27:25,265 INFO L93 Difference]: Finished difference Result 348 states and 348 transitions. [2018-10-15 12:27:25,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-15 12:27:25,265 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 329 [2018-10-15 12:27:25,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:27:25,267 INFO L225 Difference]: With dead ends: 348 [2018-10-15 12:27:25,267 INFO L226 Difference]: Without dead ends: 348 [2018-10-15 12:27:25,268 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2640 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4803, Invalid=10203, Unknown=0, NotChecked=0, Total=15006 [2018-10-15 12:27:25,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2018-10-15 12:27:25,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 340. [2018-10-15 12:27:25,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-10-15 12:27:25,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 340 transitions. [2018-10-15 12:27:25,272 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 340 transitions. Word has length 329 [2018-10-15 12:27:25,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:27:25,273 INFO L481 AbstractCegarLoop]: Abstraction has 340 states and 340 transitions. [2018-10-15 12:27:25,273 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-15 12:27:25,273 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 340 transitions. [2018-10-15 12:27:25,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2018-10-15 12:27:25,275 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:27:25,275 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:27:25,275 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:27:25,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:27:25,276 INFO L82 PathProgramCache]: Analyzing trace with hash 196597090, now seen corresponding path program 31 times [2018-10-15 12:27:25,276 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:27:25,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:27:26,626 INFO L134 CoverageAnalysis]: Checked inductivity of 4681 backedges. 0 proven. 4681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:27:26,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:27:26,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-15 12:27:26,627 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-15 12:27:26,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-15 12:27:26,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1088, Invalid=3072, Unknown=0, NotChecked=0, Total=4160 [2018-10-15 12:27:26,628 INFO L87 Difference]: Start difference. First operand 340 states and 340 transitions. Second operand 65 states. [2018-10-15 12:27:29,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:27:29,211 INFO L93 Difference]: Finished difference Result 358 states and 358 transitions. [2018-10-15 12:27:29,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-15 12:27:29,211 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 339 [2018-10-15 12:27:29,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:27:29,213 INFO L225 Difference]: With dead ends: 358 [2018-10-15 12:27:29,213 INFO L226 Difference]: Without dead ends: 358 [2018-10-15 12:27:29,213 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2821 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5118, Invalid=10884, Unknown=0, NotChecked=0, Total=16002 [2018-10-15 12:27:29,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-10-15 12:27:29,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 350. [2018-10-15 12:27:29,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-10-15 12:27:29,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 350 transitions. [2018-10-15 12:27:29,218 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 350 transitions. Word has length 339 [2018-10-15 12:27:29,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:27:29,219 INFO L481 AbstractCegarLoop]: Abstraction has 350 states and 350 transitions. [2018-10-15 12:27:29,219 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-15 12:27:29,219 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 350 transitions. [2018-10-15 12:27:29,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2018-10-15 12:27:29,221 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:27:29,221 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:27:29,221 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:27:29,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:27:29,222 INFO L82 PathProgramCache]: Analyzing trace with hash -2124336675, now seen corresponding path program 32 times [2018-10-15 12:27:29,222 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:27:29,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:27:30,665 INFO L134 CoverageAnalysis]: Checked inductivity of 4992 backedges. 0 proven. 4992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:27:30,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:27:30,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-15 12:27:30,666 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-15 12:27:30,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-15 12:27:30,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1155, Invalid=3267, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 12:27:30,667 INFO L87 Difference]: Start difference. First operand 350 states and 350 transitions. Second operand 67 states. [2018-10-15 12:27:33,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:27:33,486 INFO L93 Difference]: Finished difference Result 368 states and 368 transitions. [2018-10-15 12:27:33,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-10-15 12:27:33,487 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 349 [2018-10-15 12:27:33,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:27:33,489 INFO L225 Difference]: With dead ends: 368 [2018-10-15 12:27:33,490 INFO L226 Difference]: Without dead ends: 368 [2018-10-15 12:27:33,491 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:27:33,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-10-15 12:27:33,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 360. [2018-10-15 12:27:33,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2018-10-15 12:27:33,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 360 transitions. [2018-10-15 12:27:33,496 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 360 transitions. Word has length 349 [2018-10-15 12:27:33,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:27:33,497 INFO L481 AbstractCegarLoop]: Abstraction has 360 states and 360 transitions. [2018-10-15 12:27:33,497 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-15 12:27:33,497 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 360 transitions. [2018-10-15 12:27:33,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2018-10-15 12:27:33,499 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:27:33,499 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:27:33,499 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:27:33,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:27:33,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1911124120, now seen corresponding path program 33 times [2018-10-15 12:27:33,500 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:27:33,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:27:35,267 INFO L134 CoverageAnalysis]: Checked inductivity of 5313 backedges. 0 proven. 5313 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:27:35,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:27:35,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-15 12:27:35,268 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-15 12:27:35,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-15 12:27:35,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1224, Invalid=3468, Unknown=0, NotChecked=0, Total=4692 [2018-10-15 12:27:35,269 INFO L87 Difference]: Start difference. First operand 360 states and 360 transitions. Second operand 69 states. [2018-10-15 12:27:37,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:27:37,971 INFO L93 Difference]: Finished difference Result 378 states and 378 transitions. [2018-10-15 12:27:37,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-10-15 12:27:37,971 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 359 [2018-10-15 12:27:37,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:27:37,973 INFO L225 Difference]: With dead ends: 378 [2018-10-15 12:27:37,974 INFO L226 Difference]: Without dead ends: 378 [2018-10-15 12:27:37,975 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3201 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5778, Invalid=12312, Unknown=0, NotChecked=0, Total=18090 [2018-10-15 12:27:37,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2018-10-15 12:27:37,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 370. [2018-10-15 12:27:37,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2018-10-15 12:27:37,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 370 transitions. [2018-10-15 12:27:37,980 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 370 transitions. Word has length 359 [2018-10-15 12:27:37,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:27:37,980 INFO L481 AbstractCegarLoop]: Abstraction has 370 states and 370 transitions. [2018-10-15 12:27:37,980 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-15 12:27:37,980 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 370 transitions. [2018-10-15 12:27:37,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2018-10-15 12:27:37,982 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:27:37,982 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:27:37,983 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:27:37,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:27:37,983 INFO L82 PathProgramCache]: Analyzing trace with hash 2127217043, now seen corresponding path program 34 times [2018-10-15 12:27:37,984 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:27:38,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:27:39,689 INFO L134 CoverageAnalysis]: Checked inductivity of 5644 backedges. 0 proven. 5644 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:27:39,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:27:39,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-15 12:27:39,690 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-15 12:27:39,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-15 12:27:39,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1295, Invalid=3675, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 12:27:39,691 INFO L87 Difference]: Start difference. First operand 370 states and 370 transitions. Second operand 71 states. [2018-10-15 12:27:42,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:27:42,230 INFO L93 Difference]: Finished difference Result 388 states and 388 transitions. [2018-10-15 12:27:42,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-10-15 12:27:42,231 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 369 [2018-10-15 12:27:42,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:27:42,233 INFO L225 Difference]: With dead ends: 388 [2018-10-15 12:27:42,233 INFO L226 Difference]: Without dead ends: 388 [2018-10-15 12:27:42,235 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3400 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=6123, Invalid=13059, Unknown=0, NotChecked=0, Total=19182 [2018-10-15 12:27:42,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-10-15 12:27:42,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 380. [2018-10-15 12:27:42,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-10-15 12:27:42,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 380 transitions. [2018-10-15 12:27:42,238 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 380 transitions. Word has length 369 [2018-10-15 12:27:42,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:27:42,238 INFO L481 AbstractCegarLoop]: Abstraction has 380 states and 380 transitions. [2018-10-15 12:27:42,239 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-15 12:27:42,239 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 380 transitions. [2018-10-15 12:27:42,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2018-10-15 12:27:42,240 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:27:42,240 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:27:42,240 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:27:42,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:27:42,241 INFO L82 PathProgramCache]: Analyzing trace with hash 444814542, now seen corresponding path program 35 times [2018-10-15 12:27:42,241 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:27:42,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:27:44,076 INFO L134 CoverageAnalysis]: Checked inductivity of 5985 backedges. 0 proven. 5985 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:27:44,076 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:27:44,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-15 12:27:44,077 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-15 12:27:44,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-15 12:27:44,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1368, Invalid=3888, Unknown=0, NotChecked=0, Total=5256 [2018-10-15 12:27:44,077 INFO L87 Difference]: Start difference. First operand 380 states and 380 transitions. Second operand 73 states. [2018-10-15 12:27:46,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:27:46,942 INFO L93 Difference]: Finished difference Result 398 states and 398 transitions. [2018-10-15 12:27:46,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-10-15 12:27:46,943 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 379 [2018-10-15 12:27:46,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:27:46,945 INFO L225 Difference]: With dead ends: 398 [2018-10-15 12:27:46,945 INFO L226 Difference]: Without dead ends: 398 [2018-10-15 12:27:46,946 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3605 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=6478, Invalid=13828, Unknown=0, NotChecked=0, Total=20306 [2018-10-15 12:27:46,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-10-15 12:27:46,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 390. [2018-10-15 12:27:46,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2018-10-15 12:27:46,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 390 transitions. [2018-10-15 12:27:46,951 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 390 transitions. Word has length 379 [2018-10-15 12:27:46,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:27:46,951 INFO L481 AbstractCegarLoop]: Abstraction has 390 states and 390 transitions. [2018-10-15 12:27:46,951 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-15 12:27:46,951 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 390 transitions. [2018-10-15 12:27:46,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2018-10-15 12:27:46,953 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:27:46,953 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:27:46,954 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:27:46,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:27:46,954 INFO L82 PathProgramCache]: Analyzing trace with hash 328555081, now seen corresponding path program 36 times [2018-10-15 12:27:46,955 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:27:46,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:27:49,423 INFO L134 CoverageAnalysis]: Checked inductivity of 6336 backedges. 0 proven. 6336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:27:49,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:27:49,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-15 12:27:49,424 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-15 12:27:49,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-15 12:27:49,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1443, Invalid=4107, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 12:27:49,425 INFO L87 Difference]: Start difference. First operand 390 states and 390 transitions. Second operand 75 states. [2018-10-15 12:27:52,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:27:52,489 INFO L93 Difference]: Finished difference Result 408 states and 408 transitions. [2018-10-15 12:27:52,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-10-15 12:27:52,490 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 389 [2018-10-15 12:27:52,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:27:52,492 INFO L225 Difference]: With dead ends: 408 [2018-10-15 12:27:52,492 INFO L226 Difference]: Without dead ends: 408 [2018-10-15 12:27:52,494 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3816 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6843, Invalid=14619, Unknown=0, NotChecked=0, Total=21462 [2018-10-15 12:27:52,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2018-10-15 12:27:52,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 400. [2018-10-15 12:27:52,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2018-10-15 12:27:52,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 400 transitions. [2018-10-15 12:27:52,499 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 400 transitions. Word has length 389 [2018-10-15 12:27:52,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:27:52,500 INFO L481 AbstractCegarLoop]: Abstraction has 400 states and 400 transitions. [2018-10-15 12:27:52,500 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-15 12:27:52,500 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 400 transitions. [2018-10-15 12:27:52,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2018-10-15 12:27:52,502 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:27:52,502 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:27:52,503 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:27:52,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:27:52,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1602683396, now seen corresponding path program 37 times [2018-10-15 12:27:52,504 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:27:52,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:27:54,400 INFO L134 CoverageAnalysis]: Checked inductivity of 6697 backedges. 0 proven. 6697 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:27:54,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:27:54,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-10-15 12:27:54,401 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-15 12:27:54,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-15 12:27:54,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1520, Invalid=4332, Unknown=0, NotChecked=0, Total=5852 [2018-10-15 12:27:54,402 INFO L87 Difference]: Start difference. First operand 400 states and 400 transitions. Second operand 77 states. [2018-10-15 12:27:57,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:27:57,612 INFO L93 Difference]: Finished difference Result 418 states and 418 transitions. [2018-10-15 12:27:57,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-10-15 12:27:57,613 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 399 [2018-10-15 12:27:57,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:27:57,615 INFO L225 Difference]: With dead ends: 418 [2018-10-15 12:27:57,615 INFO L226 Difference]: Without dead ends: 418 [2018-10-15 12:27:57,616 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4033 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=7218, Invalid=15432, Unknown=0, NotChecked=0, Total=22650 [2018-10-15 12:27:57,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2018-10-15 12:27:57,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 410. [2018-10-15 12:27:57,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-10-15 12:27:57,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 410 transitions. [2018-10-15 12:27:57,620 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 410 transitions. Word has length 399 [2018-10-15 12:27:57,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:27:57,621 INFO L481 AbstractCegarLoop]: Abstraction has 410 states and 410 transitions. [2018-10-15 12:27:57,621 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-15 12:27:57,621 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 410 transitions. [2018-10-15 12:27:57,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2018-10-15 12:27:57,623 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:27:57,624 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:27:57,624 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:27:57,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:27:57,624 INFO L82 PathProgramCache]: Analyzing trace with hash 635599871, now seen corresponding path program 38 times [2018-10-15 12:27:57,625 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:27:57,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:27:59,885 INFO L134 CoverageAnalysis]: Checked inductivity of 7068 backedges. 0 proven. 7068 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:27:59,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:27:59,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-10-15 12:27:59,886 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-15 12:27:59,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-15 12:27:59,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1599, Invalid=4563, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 12:27:59,887 INFO L87 Difference]: Start difference. First operand 410 states and 410 transitions. Second operand 79 states. [2018-10-15 12:28:03,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:28:03,574 INFO L93 Difference]: Finished difference Result 428 states and 428 transitions. [2018-10-15 12:28:03,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-10-15 12:28:03,575 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 409 [2018-10-15 12:28:03,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:28:03,577 INFO L225 Difference]: With dead ends: 428 [2018-10-15 12:28:03,578 INFO L226 Difference]: Without dead ends: 428 [2018-10-15 12:28:03,579 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4256 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7603, Invalid=16267, Unknown=0, NotChecked=0, Total=23870 [2018-10-15 12:28:03,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2018-10-15 12:28:03,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 420. [2018-10-15 12:28:03,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2018-10-15 12:28:03,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 420 transitions. [2018-10-15 12:28:03,585 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 420 transitions. Word has length 409 [2018-10-15 12:28:03,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:28:03,585 INFO L481 AbstractCegarLoop]: Abstraction has 420 states and 420 transitions. [2018-10-15 12:28:03,585 INFO L482 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-15 12:28:03,585 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 420 transitions. [2018-10-15 12:28:03,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2018-10-15 12:28:03,587 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:28:03,588 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:28:03,588 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:28:03,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:28:03,588 INFO L82 PathProgramCache]: Analyzing trace with hash 188086330, now seen corresponding path program 39 times [2018-10-15 12:28:03,589 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:28:03,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:28:05,604 INFO L134 CoverageAnalysis]: Checked inductivity of 7449 backedges. 0 proven. 7449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:28:05,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:28:05,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-15 12:28:05,605 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-15 12:28:05,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-15 12:28:05,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1680, Invalid=4800, Unknown=0, NotChecked=0, Total=6480 [2018-10-15 12:28:05,606 INFO L87 Difference]: Start difference. First operand 420 states and 420 transitions. Second operand 81 states. [2018-10-15 12:28:09,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:28:09,229 INFO L93 Difference]: Finished difference Result 438 states and 438 transitions. [2018-10-15 12:28:09,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-10-15 12:28:09,230 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 419 [2018-10-15 12:28:09,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:28:09,232 INFO L225 Difference]: With dead ends: 438 [2018-10-15 12:28:09,232 INFO L226 Difference]: Without dead ends: 438 [2018-10-15 12:28:09,233 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4485 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=7998, Invalid=17124, Unknown=0, NotChecked=0, Total=25122 [2018-10-15 12:28:09,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2018-10-15 12:28:09,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 430. [2018-10-15 12:28:09,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2018-10-15 12:28:09,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 430 transitions. [2018-10-15 12:28:09,237 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 430 transitions. Word has length 419 [2018-10-15 12:28:09,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:28:09,238 INFO L481 AbstractCegarLoop]: Abstraction has 430 states and 430 transitions. [2018-10-15 12:28:09,238 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-15 12:28:09,238 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 430 transitions. [2018-10-15 12:28:09,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2018-10-15 12:28:09,240 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:28:09,240 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:28:09,240 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:28:09,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:28:09,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1139562827, now seen corresponding path program 40 times [2018-10-15 12:28:09,241 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:28:09,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:28:11,317 INFO L134 CoverageAnalysis]: Checked inductivity of 7840 backedges. 0 proven. 7840 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:28:11,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:28:11,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-15 12:28:11,318 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-15 12:28:11,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-15 12:28:11,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1763, Invalid=5043, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 12:28:11,318 INFO L87 Difference]: Start difference. First operand 430 states and 430 transitions. Second operand 83 states. [2018-10-15 12:28:15,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:28:15,224 INFO L93 Difference]: Finished difference Result 448 states and 448 transitions. [2018-10-15 12:28:15,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-10-15 12:28:15,224 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 429 [2018-10-15 12:28:15,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:28:15,226 INFO L225 Difference]: With dead ends: 448 [2018-10-15 12:28:15,226 INFO L226 Difference]: Without dead ends: 448 [2018-10-15 12:28:15,228 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4720 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=8403, Invalid=18003, Unknown=0, NotChecked=0, Total=26406 [2018-10-15 12:28:15,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2018-10-15 12:28:15,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 440. [2018-10-15 12:28:15,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2018-10-15 12:28:15,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 440 transitions. [2018-10-15 12:28:15,233 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 440 transitions. Word has length 429 [2018-10-15 12:28:15,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:28:15,233 INFO L481 AbstractCegarLoop]: Abstraction has 440 states and 440 transitions. [2018-10-15 12:28:15,233 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-15 12:28:15,233 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 440 transitions. [2018-10-15 12:28:15,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2018-10-15 12:28:15,236 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:28:15,236 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:28:15,236 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:28:15,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:28:15,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1206798480, now seen corresponding path program 41 times [2018-10-15 12:28:15,237 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:28:15,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:28:17,469 INFO L134 CoverageAnalysis]: Checked inductivity of 8241 backedges. 0 proven. 8241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:28:17,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:28:17,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-10-15 12:28:17,470 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-15 12:28:17,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-15 12:28:17,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1848, Invalid=5292, Unknown=0, NotChecked=0, Total=7140 [2018-10-15 12:28:17,471 INFO L87 Difference]: Start difference. First operand 440 states and 440 transitions. Second operand 85 states. [2018-10-15 12:28:21,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:28:21,529 INFO L93 Difference]: Finished difference Result 458 states and 458 transitions. [2018-10-15 12:28:21,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-10-15 12:28:21,530 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 439 [2018-10-15 12:28:21,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:28:21,532 INFO L225 Difference]: With dead ends: 458 [2018-10-15 12:28:21,533 INFO L226 Difference]: Without dead ends: 458 [2018-10-15 12:28:21,534 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4961 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=8818, Invalid=18904, Unknown=0, NotChecked=0, Total=27722 [2018-10-15 12:28:21,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2018-10-15 12:28:21,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 450. [2018-10-15 12:28:21,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2018-10-15 12:28:21,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 450 transitions. [2018-10-15 12:28:21,538 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 450 transitions. Word has length 439 [2018-10-15 12:28:21,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:28:21,538 INFO L481 AbstractCegarLoop]: Abstraction has 450 states and 450 transitions. [2018-10-15 12:28:21,538 INFO L482 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-15 12:28:21,538 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 450 transitions. [2018-10-15 12:28:21,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 450 [2018-10-15 12:28:21,540 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:28:21,540 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:28:21,540 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:28:21,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:28:21,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1556765291, now seen corresponding path program 42 times [2018-10-15 12:28:21,541 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:28:21,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:28:24,232 INFO L134 CoverageAnalysis]: Checked inductivity of 8652 backedges. 0 proven. 8652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:28:24,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:28:24,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-15 12:28:24,233 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-15 12:28:24,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-15 12:28:24,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1935, Invalid=5547, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 12:28:24,234 INFO L87 Difference]: Start difference. First operand 450 states and 450 transitions. Second operand 87 states. [2018-10-15 12:28:28,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:28:28,347 INFO L93 Difference]: Finished difference Result 468 states and 468 transitions. [2018-10-15 12:28:28,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-10-15 12:28:28,347 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 449 [2018-10-15 12:28:28,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:28:28,349 INFO L225 Difference]: With dead ends: 468 [2018-10-15 12:28:28,349 INFO L226 Difference]: Without dead ends: 468 [2018-10-15 12:28:28,351 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5208 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=9243, Invalid=19827, Unknown=0, NotChecked=0, Total=29070 [2018-10-15 12:28:28,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2018-10-15 12:28:28,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 460. [2018-10-15 12:28:28,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-10-15 12:28:28,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 460 transitions. [2018-10-15 12:28:28,355 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 460 transitions. Word has length 449 [2018-10-15 12:28:28,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:28:28,356 INFO L481 AbstractCegarLoop]: Abstraction has 460 states and 460 transitions. [2018-10-15 12:28:28,356 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-15 12:28:28,356 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 460 transitions. [2018-10-15 12:28:28,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2018-10-15 12:28:28,358 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:28:28,359 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:28:28,359 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:28:28,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:28:28,359 INFO L82 PathProgramCache]: Analyzing trace with hash 819707814, now seen corresponding path program 43 times [2018-10-15 12:28:28,360 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:28:28,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:28:31,127 INFO L134 CoverageAnalysis]: Checked inductivity of 9073 backedges. 0 proven. 9073 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:28:31,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:28:31,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-10-15 12:28:31,128 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-15 12:28:31,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-15 12:28:31,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2024, Invalid=5808, Unknown=0, NotChecked=0, Total=7832 [2018-10-15 12:28:31,129 INFO L87 Difference]: Start difference. First operand 460 states and 460 transitions. Second operand 89 states. [2018-10-15 12:28:35,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:28:35,332 INFO L93 Difference]: Finished difference Result 478 states and 478 transitions. [2018-10-15 12:28:35,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-10-15 12:28:35,333 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 459 [2018-10-15 12:28:35,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:28:35,334 INFO L225 Difference]: With dead ends: 478 [2018-10-15 12:28:35,334 INFO L226 Difference]: Without dead ends: 478 [2018-10-15 12:28:35,335 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5461 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=9678, Invalid=20772, Unknown=0, NotChecked=0, Total=30450 [2018-10-15 12:28:35,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2018-10-15 12:28:35,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 470. [2018-10-15 12:28:35,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2018-10-15 12:28:35,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 470 transitions. [2018-10-15 12:28:35,340 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 470 transitions. Word has length 459 [2018-10-15 12:28:35,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:28:35,341 INFO L481 AbstractCegarLoop]: Abstraction has 470 states and 470 transitions. [2018-10-15 12:28:35,341 INFO L482 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-15 12:28:35,341 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 470 transitions. [2018-10-15 12:28:35,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2018-10-15 12:28:35,344 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:28:35,344 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:28:35,344 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:28:35,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:28:35,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1860704033, now seen corresponding path program 44 times [2018-10-15 12:28:35,345 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:28:35,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:28:38,002 INFO L134 CoverageAnalysis]: Checked inductivity of 9504 backedges. 0 proven. 9504 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:28:38,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:28:38,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-10-15 12:28:38,003 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-15 12:28:38,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-15 12:28:38,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2115, Invalid=6075, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 12:28:38,004 INFO L87 Difference]: Start difference. First operand 470 states and 470 transitions. Second operand 91 states. [2018-10-15 12:28:42,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:28:42,534 INFO L93 Difference]: Finished difference Result 488 states and 488 transitions. [2018-10-15 12:28:42,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-10-15 12:28:42,534 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 469 [2018-10-15 12:28:42,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:28:42,536 INFO L225 Difference]: With dead ends: 488 [2018-10-15 12:28:42,536 INFO L226 Difference]: Without dead ends: 488 [2018-10-15 12:28:42,537 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:28:42,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2018-10-15 12:28:42,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 480. [2018-10-15 12:28:42,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 480 states. [2018-10-15 12:28:42,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 480 transitions. [2018-10-15 12:28:42,541 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 480 transitions. Word has length 469 [2018-10-15 12:28:42,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:28:42,541 INFO L481 AbstractCegarLoop]: Abstraction has 480 states and 480 transitions. [2018-10-15 12:28:42,541 INFO L482 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-15 12:28:42,541 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 480 transitions. [2018-10-15 12:28:42,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2018-10-15 12:28:42,544 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:28:42,544 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:28:42,544 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:28:42,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:28:42,544 INFO L82 PathProgramCache]: Analyzing trace with hash -795504420, now seen corresponding path program 45 times [2018-10-15 12:28:42,545 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:28:42,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:28:45,327 INFO L134 CoverageAnalysis]: Checked inductivity of 9945 backedges. 0 proven. 9945 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:28:45,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:28:45,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-15 12:28:45,328 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-15 12:28:45,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-15 12:28:45,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2208, Invalid=6348, Unknown=0, NotChecked=0, Total=8556 [2018-10-15 12:28:45,328 INFO L87 Difference]: Start difference. First operand 480 states and 480 transitions. Second operand 93 states. [2018-10-15 12:28:50,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:28:50,052 INFO L93 Difference]: Finished difference Result 498 states and 498 transitions. [2018-10-15 12:28:50,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-10-15 12:28:50,052 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 479 [2018-10-15 12:28:50,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:28:50,054 INFO L225 Difference]: With dead ends: 498 [2018-10-15 12:28:50,054 INFO L226 Difference]: Without dead ends: 498 [2018-10-15 12:28:50,055 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5985 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=10578, Invalid=22728, Unknown=0, NotChecked=0, Total=33306 [2018-10-15 12:28:50,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2018-10-15 12:28:50,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 490. [2018-10-15 12:28:50,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 490 states. [2018-10-15 12:28:50,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 490 transitions. [2018-10-15 12:28:50,058 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 490 transitions. Word has length 479 [2018-10-15 12:28:50,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:28:50,059 INFO L481 AbstractCegarLoop]: Abstraction has 490 states and 490 transitions. [2018-10-15 12:28:50,059 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-15 12:28:50,059 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 490 transitions. [2018-10-15 12:28:50,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 490 [2018-10-15 12:28:50,061 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:28:50,062 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:28:50,062 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:28:50,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:28:50,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1718723369, now seen corresponding path program 46 times [2018-10-15 12:28:50,063 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:28:50,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:28:52,936 INFO L134 CoverageAnalysis]: Checked inductivity of 10396 backedges. 0 proven. 10396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:28:52,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:28:52,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-10-15 12:28:52,937 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-15 12:28:52,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-15 12:28:52,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2303, Invalid=6627, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 12:28:52,938 INFO L87 Difference]: Start difference. First operand 490 states and 490 transitions. Second operand 95 states. [2018-10-15 12:28:57,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:28:57,736 INFO L93 Difference]: Finished difference Result 508 states and 508 transitions. [2018-10-15 12:28:57,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-10-15 12:28:57,736 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 489 [2018-10-15 12:28:57,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:28:57,739 INFO L225 Difference]: With dead ends: 508 [2018-10-15 12:28:57,739 INFO L226 Difference]: Without dead ends: 508 [2018-10-15 12:28:57,741 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6256 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=11043, Invalid=23739, Unknown=0, NotChecked=0, Total=34782 [2018-10-15 12:28:57,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 508 states. [2018-10-15 12:28:57,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 508 to 500. [2018-10-15 12:28:57,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2018-10-15 12:28:57,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 500 transitions. [2018-10-15 12:28:57,745 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 500 transitions. Word has length 489 [2018-10-15 12:28:57,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:28:57,745 INFO L481 AbstractCegarLoop]: Abstraction has 500 states and 500 transitions. [2018-10-15 12:28:57,745 INFO L482 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-15 12:28:57,745 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 500 transitions. [2018-10-15 12:28:57,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 500 [2018-10-15 12:28:57,747 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:28:57,747 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:28:57,747 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:28:57,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:28:57,748 INFO L82 PathProgramCache]: Analyzing trace with hash -494884078, now seen corresponding path program 47 times [2018-10-15 12:28:57,748 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:28:57,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:29:00,924 INFO L134 CoverageAnalysis]: Checked inductivity of 10857 backedges. 0 proven. 10857 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:29:00,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:29:00,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-10-15 12:29:00,925 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-10-15 12:29:00,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-10-15 12:29:00,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2400, Invalid=6912, Unknown=0, NotChecked=0, Total=9312 [2018-10-15 12:29:00,926 INFO L87 Difference]: Start difference. First operand 500 states and 500 transitions. Second operand 97 states. [2018-10-15 12:29:06,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:29:06,362 INFO L93 Difference]: Finished difference Result 518 states and 518 transitions. [2018-10-15 12:29:06,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-10-15 12:29:06,362 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 499 [2018-10-15 12:29:06,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:29:06,365 INFO L225 Difference]: With dead ends: 518 [2018-10-15 12:29:06,365 INFO L226 Difference]: Without dead ends: 518 [2018-10-15 12:29:06,367 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6533 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=11518, Invalid=24772, Unknown=0, NotChecked=0, Total=36290 [2018-10-15 12:29:06,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2018-10-15 12:29:06,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 510. [2018-10-15 12:29:06,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2018-10-15 12:29:06,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 510 transitions. [2018-10-15 12:29:06,371 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 510 transitions. Word has length 499 [2018-10-15 12:29:06,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:29:06,372 INFO L481 AbstractCegarLoop]: Abstraction has 510 states and 510 transitions. [2018-10-15 12:29:06,372 INFO L482 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-10-15 12:29:06,372 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 510 transitions. [2018-10-15 12:29:06,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2018-10-15 12:29:06,374 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:29:06,374 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:29:06,375 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:29:06,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:29:06,375 INFO L82 PathProgramCache]: Analyzing trace with hash 605989773, now seen corresponding path program 48 times [2018-10-15 12:29:06,376 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:29:06,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:29:09,581 INFO L134 CoverageAnalysis]: Checked inductivity of 11328 backedges. 0 proven. 11328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:29:09,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:29:09,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-10-15 12:29:09,582 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-10-15 12:29:09,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-10-15 12:29:09,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2499, Invalid=7203, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 12:29:09,583 INFO L87 Difference]: Start difference. First operand 510 states and 510 transitions. Second operand 99 states. [2018-10-15 12:29:14,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:29:14,828 INFO L93 Difference]: Finished difference Result 528 states and 528 transitions. [2018-10-15 12:29:14,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-10-15 12:29:14,828 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 509 [2018-10-15 12:29:14,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:29:14,830 INFO L225 Difference]: With dead ends: 528 [2018-10-15 12:29:14,830 INFO L226 Difference]: Without dead ends: 528 [2018-10-15 12:29:14,831 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6816 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=12003, Invalid=25827, Unknown=0, NotChecked=0, Total=37830 [2018-10-15 12:29:14,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2018-10-15 12:29:14,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 520. [2018-10-15 12:29:14,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-10-15 12:29:14,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 520 transitions. [2018-10-15 12:29:14,835 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 520 transitions. Word has length 509 [2018-10-15 12:29:14,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:29:14,835 INFO L481 AbstractCegarLoop]: Abstraction has 520 states and 520 transitions. [2018-10-15 12:29:14,835 INFO L482 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-10-15 12:29:14,836 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 520 transitions. [2018-10-15 12:29:14,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2018-10-15 12:29:14,837 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:29:14,838 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:29:14,838 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:29:14,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:29:14,838 INFO L82 PathProgramCache]: Analyzing trace with hash 35556936, now seen corresponding path program 49 times [2018-10-15 12:29:14,839 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:29:14,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:29:17,886 INFO L134 CoverageAnalysis]: Checked inductivity of 11809 backedges. 0 proven. 11809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:29:17,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:29:17,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-10-15 12:29:17,887 INFO L460 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-10-15 12:29:17,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-10-15 12:29:17,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2600, Invalid=7500, Unknown=0, NotChecked=0, Total=10100 [2018-10-15 12:29:17,888 INFO L87 Difference]: Start difference. First operand 520 states and 520 transitions. Second operand 101 states. [2018-10-15 12:29:23,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:29:23,516 INFO L93 Difference]: Finished difference Result 538 states and 538 transitions. [2018-10-15 12:29:23,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-10-15 12:29:23,517 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 519 [2018-10-15 12:29:23,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:29:23,520 INFO L225 Difference]: With dead ends: 538 [2018-10-15 12:29:23,521 INFO L226 Difference]: Without dead ends: 538 [2018-10-15 12:29:23,522 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7105 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=12498, Invalid=26904, Unknown=0, NotChecked=0, Total=39402 [2018-10-15 12:29:23,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2018-10-15 12:29:23,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 530. [2018-10-15 12:29:23,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2018-10-15 12:29:23,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 530 transitions. [2018-10-15 12:29:23,528 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 530 transitions. Word has length 519 [2018-10-15 12:29:23,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:29:23,528 INFO L481 AbstractCegarLoop]: Abstraction has 530 states and 530 transitions. [2018-10-15 12:29:23,529 INFO L482 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-10-15 12:29:23,529 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 530 transitions. [2018-10-15 12:29:23,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2018-10-15 12:29:23,531 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:29:23,532 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:29:23,532 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:29:23,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:29:23,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1446675267, now seen corresponding path program 50 times [2018-10-15 12:29:23,533 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:29:23,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:29:27,297 INFO L134 CoverageAnalysis]: Checked inductivity of 12300 backedges. 0 proven. 12300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:29:27,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:29:27,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-10-15 12:29:27,298 INFO L460 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-10-15 12:29:27,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-10-15 12:29:27,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2703, Invalid=7803, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 12:29:27,299 INFO L87 Difference]: Start difference. First operand 530 states and 530 transitions. Second operand 103 states. [2018-10-15 12:29:33,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:29:33,151 INFO L93 Difference]: Finished difference Result 548 states and 548 transitions. [2018-10-15 12:29:33,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2018-10-15 12:29:33,152 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 529 [2018-10-15 12:29:33,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:29:33,154 INFO L225 Difference]: With dead ends: 548 [2018-10-15 12:29:33,154 INFO L226 Difference]: Without dead ends: 548 [2018-10-15 12:29:33,156 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7400 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=13003, Invalid=28003, Unknown=0, NotChecked=0, Total=41006 [2018-10-15 12:29:33,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2018-10-15 12:29:33,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 540. [2018-10-15 12:29:33,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2018-10-15 12:29:33,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 540 transitions. [2018-10-15 12:29:33,160 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 540 transitions. Word has length 529 [2018-10-15 12:29:33,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:29:33,161 INFO L481 AbstractCegarLoop]: Abstraction has 540 states and 540 transitions. [2018-10-15 12:29:33,161 INFO L482 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-10-15 12:29:33,161 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 540 transitions. [2018-10-15 12:29:33,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 540 [2018-10-15 12:29:33,164 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:29:33,164 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:29:33,164 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:29:33,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:29:33,165 INFO L82 PathProgramCache]: Analyzing trace with hash 2066791038, now seen corresponding path program 51 times [2018-10-15 12:29:33,165 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:29:33,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:29:36,899 INFO L134 CoverageAnalysis]: Checked inductivity of 12801 backedges. 0 proven. 12801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:29:36,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:29:36,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-10-15 12:29:36,900 INFO L460 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-10-15 12:29:36,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-10-15 12:29:36,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2808, Invalid=8112, Unknown=0, NotChecked=0, Total=10920 [2018-10-15 12:29:36,901 INFO L87 Difference]: Start difference. First operand 540 states and 540 transitions. Second operand 105 states. [2018-10-15 12:29:42,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:29:42,710 INFO L93 Difference]: Finished difference Result 558 states and 558 transitions. [2018-10-15 12:29:42,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2018-10-15 12:29:42,710 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 539 [2018-10-15 12:29:42,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:29:42,712 INFO L225 Difference]: With dead ends: 558 [2018-10-15 12:29:42,712 INFO L226 Difference]: Without dead ends: 558 [2018-10-15 12:29:42,714 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:29:42,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2018-10-15 12:29:42,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 550. [2018-10-15 12:29:42,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2018-10-15 12:29:42,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 550 transitions. [2018-10-15 12:29:42,718 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 550 transitions. Word has length 539 [2018-10-15 12:29:42,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:29:42,719 INFO L481 AbstractCegarLoop]: Abstraction has 550 states and 550 transitions. [2018-10-15 12:29:42,719 INFO L482 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-10-15 12:29:42,719 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 550 transitions. [2018-10-15 12:29:42,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 550 [2018-10-15 12:29:42,721 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:29:42,721 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:29:42,721 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:29:42,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:29:42,722 INFO L82 PathProgramCache]: Analyzing trace with hash -675060743, now seen corresponding path program 52 times [2018-10-15 12:29:42,722 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:29:42,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:29:46,383 INFO L134 CoverageAnalysis]: Checked inductivity of 13312 backedges. 0 proven. 13312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:29:46,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:29:46,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-10-15 12:29:46,384 INFO L460 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-10-15 12:29:46,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-10-15 12:29:46,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2915, Invalid=8427, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 12:29:46,385 INFO L87 Difference]: Start difference. First operand 550 states and 550 transitions. Second operand 107 states. [2018-10-15 12:29:52,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:29:52,601 INFO L93 Difference]: Finished difference Result 568 states and 568 transitions. [2018-10-15 12:29:52,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2018-10-15 12:29:52,602 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 549 [2018-10-15 12:29:52,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:29:52,604 INFO L225 Difference]: With dead ends: 568 [2018-10-15 12:29:52,604 INFO L226 Difference]: Without dead ends: 568 [2018-10-15 12:29:52,606 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8008 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=14043, Invalid=30267, Unknown=0, NotChecked=0, Total=44310 [2018-10-15 12:29:52,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2018-10-15 12:29:52,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 560. [2018-10-15 12:29:52,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2018-10-15 12:29:52,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 560 transitions. [2018-10-15 12:29:52,610 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 560 transitions. Word has length 549 [2018-10-15 12:29:52,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:29:52,610 INFO L481 AbstractCegarLoop]: Abstraction has 560 states and 560 transitions. [2018-10-15 12:29:52,610 INFO L482 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-10-15 12:29:52,610 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 560 transitions. [2018-10-15 12:29:52,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 560 [2018-10-15 12:29:52,613 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:29:52,613 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:29:52,613 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:29:52,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:29:52,614 INFO L82 PathProgramCache]: Analyzing trace with hash -1447514188, now seen corresponding path program 53 times [2018-10-15 12:29:52,614 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:29:52,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:29:56,293 INFO L134 CoverageAnalysis]: Checked inductivity of 13833 backedges. 0 proven. 13833 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:29:56,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:29:56,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-10-15 12:29:56,294 INFO L460 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-10-15 12:29:56,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-10-15 12:29:56,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3024, Invalid=8748, Unknown=0, NotChecked=0, Total=11772 [2018-10-15 12:29:56,295 INFO L87 Difference]: Start difference. First operand 560 states and 560 transitions. Second operand 109 states. [2018-10-15 12:30:02,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:30:02,706 INFO L93 Difference]: Finished difference Result 578 states and 578 transitions. [2018-10-15 12:30:02,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2018-10-15 12:30:02,706 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 559 [2018-10-15 12:30:02,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:30:02,709 INFO L225 Difference]: With dead ends: 578 [2018-10-15 12:30:02,709 INFO L226 Difference]: Without dead ends: 578 [2018-10-15 12:30:02,711 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8321 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=14578, Invalid=31432, Unknown=0, NotChecked=0, Total=46010 [2018-10-15 12:30:02,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2018-10-15 12:30:02,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 570. [2018-10-15 12:30:02,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-10-15 12:30:02,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 570 transitions. [2018-10-15 12:30:02,715 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 570 transitions. Word has length 559 [2018-10-15 12:30:02,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:30:02,716 INFO L481 AbstractCegarLoop]: Abstraction has 570 states and 570 transitions. [2018-10-15 12:30:02,716 INFO L482 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-10-15 12:30:02,716 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 570 transitions. [2018-10-15 12:30:02,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2018-10-15 12:30:02,718 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:30:02,719 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:30:02,719 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:30:02,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:30:02,719 INFO L82 PathProgramCache]: Analyzing trace with hash 282774959, now seen corresponding path program 54 times [2018-10-15 12:30:02,720 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:30:02,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:30:06,511 INFO L134 CoverageAnalysis]: Checked inductivity of 14364 backedges. 0 proven. 14364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:30:06,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:30:06,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-10-15 12:30:06,512 INFO L460 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-10-15 12:30:06,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-10-15 12:30:06,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3135, Invalid=9075, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 12:30:06,512 INFO L87 Difference]: Start difference. First operand 570 states and 570 transitions. Second operand 111 states. [2018-10-15 12:30:12,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:30:12,952 INFO L93 Difference]: Finished difference Result 588 states and 588 transitions. [2018-10-15 12:30:12,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2018-10-15 12:30:12,953 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 569 [2018-10-15 12:30:12,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:30:12,955 INFO L225 Difference]: With dead ends: 588 [2018-10-15 12:30:12,955 INFO L226 Difference]: Without dead ends: 588 [2018-10-15 12:30:12,956 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8640 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=15123, Invalid=32619, Unknown=0, NotChecked=0, Total=47742 [2018-10-15 12:30:12,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2018-10-15 12:30:12,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 580. [2018-10-15 12:30:12,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 580 states. [2018-10-15 12:30:12,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 580 states to 580 states and 580 transitions. [2018-10-15 12:30:12,961 INFO L78 Accepts]: Start accepts. Automaton has 580 states and 580 transitions. Word has length 569 [2018-10-15 12:30:12,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:30:12,961 INFO L481 AbstractCegarLoop]: Abstraction has 580 states and 580 transitions. [2018-10-15 12:30:12,961 INFO L482 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-10-15 12:30:12,961 INFO L276 IsEmpty]: Start isEmpty. Operand 580 states and 580 transitions. [2018-10-15 12:30:12,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 580 [2018-10-15 12:30:12,964 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:30:12,964 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:30:12,964 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:30:12,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:30:12,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1509420522, now seen corresponding path program 55 times [2018-10-15 12:30:12,965 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:30:13,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:30:16,882 INFO L134 CoverageAnalysis]: Checked inductivity of 14905 backedges. 0 proven. 14905 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:30:16,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:30:16,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-10-15 12:30:16,883 INFO L460 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-10-15 12:30:16,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-10-15 12:30:16,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3248, Invalid=9408, Unknown=0, NotChecked=0, Total=12656 [2018-10-15 12:30:16,884 INFO L87 Difference]: Start difference. First operand 580 states and 580 transitions. Second operand 113 states. [2018-10-15 12:30:23,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:30:23,622 INFO L93 Difference]: Finished difference Result 598 states and 598 transitions. [2018-10-15 12:30:23,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2018-10-15 12:30:23,622 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 579 [2018-10-15 12:30:23,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:30:23,624 INFO L225 Difference]: With dead ends: 598 [2018-10-15 12:30:23,624 INFO L226 Difference]: Without dead ends: 598 [2018-10-15 12:30:23,627 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8965 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=15678, Invalid=33828, Unknown=0, NotChecked=0, Total=49506 [2018-10-15 12:30:23,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2018-10-15 12:30:23,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 590. [2018-10-15 12:30:23,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2018-10-15 12:30:23,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 590 transitions. [2018-10-15 12:30:23,631 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 590 transitions. Word has length 579 [2018-10-15 12:30:23,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:30:23,631 INFO L481 AbstractCegarLoop]: Abstraction has 590 states and 590 transitions. [2018-10-15 12:30:23,631 INFO L482 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-10-15 12:30:23,631 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 590 transitions. [2018-10-15 12:30:23,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 590 [2018-10-15 12:30:23,634 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:30:23,634 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 56, 56, 56, 56, 56, 56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:30:23,634 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:30:23,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:30:23,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1981661083, now seen corresponding path program 56 times [2018-10-15 12:30:23,635 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:30:23,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:30:27,739 INFO L134 CoverageAnalysis]: Checked inductivity of 15456 backedges. 0 proven. 15456 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:30:27,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:30:27,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-10-15 12:30:27,740 INFO L460 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-10-15 12:30:27,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-10-15 12:30:27,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3363, Invalid=9747, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 12:30:27,741 INFO L87 Difference]: Start difference. First operand 590 states and 590 transitions. Second operand 115 states. [2018-10-15 12:30:34,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:30:34,768 INFO L93 Difference]: Finished difference Result 608 states and 608 transitions. [2018-10-15 12:30:34,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2018-10-15 12:30:34,768 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 589 [2018-10-15 12:30:34,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:30:34,770 INFO L225 Difference]: With dead ends: 608 [2018-10-15 12:30:34,770 INFO L226 Difference]: Without dead ends: 608 [2018-10-15 12:30:34,773 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9296 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=16243, Invalid=35059, Unknown=0, NotChecked=0, Total=51302 [2018-10-15 12:30:34,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2018-10-15 12:30:34,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 600. [2018-10-15 12:30:34,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2018-10-15 12:30:34,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 600 transitions. [2018-10-15 12:30:34,777 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 600 transitions. Word has length 589 [2018-10-15 12:30:34,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:30:34,777 INFO L481 AbstractCegarLoop]: Abstraction has 600 states and 600 transitions. [2018-10-15 12:30:34,777 INFO L482 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-10-15 12:30:34,777 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 600 transitions. [2018-10-15 12:30:34,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2018-10-15 12:30:34,780 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:30:34,780 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:30:34,780 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:30:34,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:30:34,781 INFO L82 PathProgramCache]: Analyzing trace with hash 678425888, now seen corresponding path program 57 times [2018-10-15 12:30:34,781 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:30:34,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:30:39,061 INFO L134 CoverageAnalysis]: Checked inductivity of 16017 backedges. 0 proven. 16017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:30:39,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:30:39,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-10-15 12:30:39,062 INFO L460 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-10-15 12:30:39,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-10-15 12:30:39,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3480, Invalid=10092, Unknown=0, NotChecked=0, Total=13572 [2018-10-15 12:30:39,063 INFO L87 Difference]: Start difference. First operand 600 states and 600 transitions. Second operand 117 states. [2018-10-15 12:30:46,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:30:46,321 INFO L93 Difference]: Finished difference Result 618 states and 618 transitions. [2018-10-15 12:30:46,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2018-10-15 12:30:46,321 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 599 [2018-10-15 12:30:46,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:30:46,323 INFO L225 Difference]: With dead ends: 618 [2018-10-15 12:30:46,323 INFO L226 Difference]: Without dead ends: 618 [2018-10-15 12:30:46,325 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9633 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=16818, Invalid=36312, Unknown=0, NotChecked=0, Total=53130 [2018-10-15 12:30:46,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2018-10-15 12:30:46,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 610. [2018-10-15 12:30:46,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2018-10-15 12:30:46,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 610 transitions. [2018-10-15 12:30:46,330 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 610 transitions. Word has length 599 [2018-10-15 12:30:46,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:30:46,330 INFO L481 AbstractCegarLoop]: Abstraction has 610 states and 610 transitions. [2018-10-15 12:30:46,330 INFO L482 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-10-15 12:30:46,330 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 610 transitions. [2018-10-15 12:30:46,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 610 [2018-10-15 12:30:46,333 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:30:46,333 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 58, 58, 58, 58, 58, 58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:30:46,334 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:30:46,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:30:46,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1266367515, now seen corresponding path program 58 times [2018-10-15 12:30:46,334 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:30:46,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:30:50,865 INFO L134 CoverageAnalysis]: Checked inductivity of 16588 backedges. 0 proven. 16588 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:30:50,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:30:50,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-10-15 12:30:50,866 INFO L460 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-10-15 12:30:50,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-10-15 12:30:50,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3599, Invalid=10443, Unknown=0, NotChecked=0, Total=14042 [2018-10-15 12:30:50,867 INFO L87 Difference]: Start difference. First operand 610 states and 610 transitions. Second operand 119 states. [2018-10-15 12:30:58,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:30:58,381 INFO L93 Difference]: Finished difference Result 628 states and 628 transitions. [2018-10-15 12:30:58,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2018-10-15 12:30:58,382 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 609 [2018-10-15 12:30:58,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:30:58,385 INFO L225 Difference]: With dead ends: 628 [2018-10-15 12:30:58,385 INFO L226 Difference]: Without dead ends: 628 [2018-10-15 12:30:58,386 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9976 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=17403, Invalid=37587, Unknown=0, NotChecked=0, Total=54990 [2018-10-15 12:30:58,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2018-10-15 12:30:58,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 620. [2018-10-15 12:30:58,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2018-10-15 12:30:58,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 620 transitions. [2018-10-15 12:30:58,391 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 620 transitions. Word has length 609 [2018-10-15 12:30:58,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:30:58,391 INFO L481 AbstractCegarLoop]: Abstraction has 620 states and 620 transitions. [2018-10-15 12:30:58,391 INFO L482 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-10-15 12:30:58,391 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 620 transitions. [2018-10-15 12:30:58,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 620 [2018-10-15 12:30:58,394 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:30:58,394 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:30:58,394 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:30:58,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:30:58,395 INFO L82 PathProgramCache]: Analyzing trace with hash -505264810, now seen corresponding path program 59 times [2018-10-15 12:30:58,395 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:30:58,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:31:02,972 INFO L134 CoverageAnalysis]: Checked inductivity of 17169 backedges. 0 proven. 17169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:31:02,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:31:02,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-10-15 12:31:02,972 INFO L460 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-10-15 12:31:02,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-10-15 12:31:02,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3720, Invalid=10800, Unknown=0, NotChecked=0, Total=14520 [2018-10-15 12:31:02,973 INFO L87 Difference]: Start difference. First operand 620 states and 620 transitions. Second operand 121 states. [2018-10-15 12:31:10,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:31:10,615 INFO L93 Difference]: Finished difference Result 638 states and 638 transitions. [2018-10-15 12:31:10,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2018-10-15 12:31:10,615 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 619 [2018-10-15 12:31:10,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:31:10,617 INFO L225 Difference]: With dead ends: 638 [2018-10-15 12:31:10,618 INFO L226 Difference]: Without dead ends: 638 [2018-10-15 12:31:10,619 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10325 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=17998, Invalid=38884, Unknown=0, NotChecked=0, Total=56882 [2018-10-15 12:31:10,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2018-10-15 12:31:10,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 630. [2018-10-15 12:31:10,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2018-10-15 12:31:10,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 630 transitions. [2018-10-15 12:31:10,624 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 630 transitions. Word has length 619 [2018-10-15 12:31:10,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:31:10,624 INFO L481 AbstractCegarLoop]: Abstraction has 630 states and 630 transitions. [2018-10-15 12:31:10,624 INFO L482 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-10-15 12:31:10,624 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 630 transitions. [2018-10-15 12:31:10,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 630 [2018-10-15 12:31:10,627 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:31:10,627 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:31:10,627 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:31:10,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:31:10,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1049051345, now seen corresponding path program 60 times [2018-10-15 12:31:10,628 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:31:10,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:31:15,342 INFO L134 CoverageAnalysis]: Checked inductivity of 17760 backedges. 0 proven. 17760 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:31:15,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:31:15,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-10-15 12:31:15,343 INFO L460 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-10-15 12:31:15,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-10-15 12:31:15,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3843, Invalid=11163, Unknown=0, NotChecked=0, Total=15006 [2018-10-15 12:31:15,344 INFO L87 Difference]: Start difference. First operand 630 states and 630 transitions. Second operand 123 states. [2018-10-15 12:31:23,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:31:23,536 INFO L93 Difference]: Finished difference Result 648 states and 648 transitions. [2018-10-15 12:31:23,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2018-10-15 12:31:23,536 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 629 [2018-10-15 12:31:23,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:31:23,538 INFO L225 Difference]: With dead ends: 648 [2018-10-15 12:31:23,538 INFO L226 Difference]: Without dead ends: 648 [2018-10-15 12:31:23,540 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 12:31:23,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2018-10-15 12:31:23,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 640. [2018-10-15 12:31:23,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 640 states. [2018-10-15 12:31:23,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 640 transitions. [2018-10-15 12:31:23,545 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 640 transitions. Word has length 629 [2018-10-15 12:31:23,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:31:23,545 INFO L481 AbstractCegarLoop]: Abstraction has 640 states and 640 transitions. [2018-10-15 12:31:23,545 INFO L482 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-10-15 12:31:23,545 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 640 transitions. [2018-10-15 12:31:23,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 640 [2018-10-15 12:31:23,548 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:31:23,548 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:31:23,549 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:31:23,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:31:23,549 INFO L82 PathProgramCache]: Analyzing trace with hash -481272180, now seen corresponding path program 61 times [2018-10-15 12:31:23,549 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:31:23,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:31:28,083 INFO L134 CoverageAnalysis]: Checked inductivity of 18361 backedges. 0 proven. 18361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:31:28,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:31:28,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-10-15 12:31:28,084 INFO L460 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-10-15 12:31:28,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-10-15 12:31:28,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3968, Invalid=11532, Unknown=0, NotChecked=0, Total=15500 [2018-10-15 12:31:28,085 INFO L87 Difference]: Start difference. First operand 640 states and 640 transitions. Second operand 125 states. [2018-10-15 12:31:36,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:31:36,138 INFO L93 Difference]: Finished difference Result 658 states and 658 transitions. [2018-10-15 12:31:36,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 186 states. [2018-10-15 12:31:36,139 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 639 [2018-10-15 12:31:36,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:31:36,141 INFO L225 Difference]: With dead ends: 658 [2018-10-15 12:31:36,141 INFO L226 Difference]: Without dead ends: 658 [2018-10-15 12:31:36,143 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11041 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=19218, Invalid=41544, Unknown=0, NotChecked=0, Total=60762 [2018-10-15 12:31:36,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2018-10-15 12:31:36,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 650. [2018-10-15 12:31:36,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2018-10-15 12:31:36,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 650 transitions. [2018-10-15 12:31:36,147 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 650 transitions. Word has length 639 [2018-10-15 12:31:36,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:31:36,148 INFO L481 AbstractCegarLoop]: Abstraction has 650 states and 650 transitions. [2018-10-15 12:31:36,148 INFO L482 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-10-15 12:31:36,148 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 650 transitions. [2018-10-15 12:31:36,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 650 [2018-10-15 12:31:36,151 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:31:36,151 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 62, 62, 62, 62, 62, 62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:31:36,151 INFO L424 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:31:36,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:31:36,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1943548281, now seen corresponding path program 62 times [2018-10-15 12:31:36,152 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:31:36,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:31:41,097 INFO L134 CoverageAnalysis]: Checked inductivity of 18972 backedges. 0 proven. 18972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:31:41,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:31:41,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-10-15 12:31:41,098 INFO L460 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-10-15 12:31:41,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-10-15 12:31:41,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=11907, Unknown=0, NotChecked=0, Total=16002 [2018-10-15 12:31:41,099 INFO L87 Difference]: Start difference. First operand 650 states and 650 transitions. Second operand 127 states. [2018-10-15 12:31:49,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:31:49,673 INFO L93 Difference]: Finished difference Result 668 states and 668 transitions. [2018-10-15 12:31:49,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 189 states. [2018-10-15 12:31:49,674 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 649 [2018-10-15 12:31:49,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:31:49,676 INFO L225 Difference]: With dead ends: 668 [2018-10-15 12:31:49,676 INFO L226 Difference]: Without dead ends: 668 [2018-10-15 12:31:49,677 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 12:31:49,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2018-10-15 12:31:49,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 660. [2018-10-15 12:31:49,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2018-10-15 12:31:49,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 660 transitions. [2018-10-15 12:31:49,682 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 660 transitions. Word has length 649 [2018-10-15 12:31:49,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:31:49,682 INFO L481 AbstractCegarLoop]: Abstraction has 660 states and 660 transitions. [2018-10-15 12:31:49,682 INFO L482 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-10-15 12:31:49,682 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 660 transitions. [2018-10-15 12:31:49,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 660 [2018-10-15 12:31:49,685 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:31:49,685 INFO L375 BasicCegarLoop]: trace histogram [63, 63, 63, 63, 63, 63, 63, 63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:31:49,686 INFO L424 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:31:49,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:31:49,686 INFO L82 PathProgramCache]: Analyzing trace with hash 2046542018, now seen corresponding path program 63 times [2018-10-15 12:31:49,687 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:31:49,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:31:54,792 INFO L134 CoverageAnalysis]: Checked inductivity of 19593 backedges. 0 proven. 19593 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:31:54,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:31:54,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-10-15 12:31:54,794 INFO L460 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-10-15 12:31:54,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-10-15 12:31:54,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4224, Invalid=12288, Unknown=0, NotChecked=0, Total=16512 [2018-10-15 12:31:54,795 INFO L87 Difference]: Start difference. First operand 660 states and 660 transitions. Second operand 129 states. [2018-10-15 12:32:03,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:32:03,669 INFO L93 Difference]: Finished difference Result 678 states and 678 transitions. [2018-10-15 12:32:03,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2018-10-15 12:32:03,670 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 659 [2018-10-15 12:32:03,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:32:03,672 INFO L225 Difference]: With dead ends: 678 [2018-10-15 12:32:03,672 INFO L226 Difference]: Without dead ends: 678 [2018-10-15 12:32:03,674 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11781 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=20478, Invalid=44292, Unknown=0, NotChecked=0, Total=64770 [2018-10-15 12:32:03,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2018-10-15 12:32:03,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 670. [2018-10-15 12:32:03,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2018-10-15 12:32:03,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 670 transitions. [2018-10-15 12:32:03,679 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 670 transitions. Word has length 659 [2018-10-15 12:32:03,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:32:03,680 INFO L481 AbstractCegarLoop]: Abstraction has 670 states and 670 transitions. [2018-10-15 12:32:03,680 INFO L482 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-10-15 12:32:03,680 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 670 transitions. [2018-10-15 12:32:03,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 670 [2018-10-15 12:32:03,683 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:32:03,683 INFO L375 BasicCegarLoop]: trace histogram [64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:32:03,683 INFO L424 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:32:03,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:32:03,684 INFO L82 PathProgramCache]: Analyzing trace with hash -37853891, now seen corresponding path program 64 times [2018-10-15 12:32:03,684 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:32:03,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:32:08,758 INFO L134 CoverageAnalysis]: Checked inductivity of 20224 backedges. 0 proven. 20224 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:32:08,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:32:08,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-10-15 12:32:08,760 INFO L460 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-10-15 12:32:08,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-10-15 12:32:08,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4355, Invalid=12675, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 12:32:08,761 INFO L87 Difference]: Start difference. First operand 670 states and 670 transitions. Second operand 131 states. [2018-10-15 12:32:17,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:32:17,632 INFO L93 Difference]: Finished difference Result 688 states and 688 transitions. [2018-10-15 12:32:17,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2018-10-15 12:32:17,633 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 669 [2018-10-15 12:32:17,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:32:17,635 INFO L225 Difference]: With dead ends: 688 [2018-10-15 12:32:17,635 INFO L226 Difference]: Without dead ends: 688 [2018-10-15 12:32:17,637 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 257 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12160 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=21123, Invalid=45699, Unknown=0, NotChecked=0, Total=66822 [2018-10-15 12:32:17,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2018-10-15 12:32:17,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 680. [2018-10-15 12:32:17,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2018-10-15 12:32:17,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 680 transitions. [2018-10-15 12:32:17,642 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 680 transitions. Word has length 669 [2018-10-15 12:32:17,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:32:17,642 INFO L481 AbstractCegarLoop]: Abstraction has 680 states and 680 transitions. [2018-10-15 12:32:17,642 INFO L482 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-10-15 12:32:17,643 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 680 transitions. [2018-10-15 12:32:17,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 680 [2018-10-15 12:32:17,646 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:32:17,646 INFO L375 BasicCegarLoop]: trace histogram [65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:32:17,646 INFO L424 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:32:17,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:32:17,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1130753016, now seen corresponding path program 65 times [2018-10-15 12:32:17,647 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:32:17,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:32:23,205 INFO L134 CoverageAnalysis]: Checked inductivity of 20865 backedges. 0 proven. 20865 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:32:23,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:32:23,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-10-15 12:32:23,206 INFO L460 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-10-15 12:32:23,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-10-15 12:32:23,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4488, Invalid=13068, Unknown=0, NotChecked=0, Total=17556 [2018-10-15 12:32:23,207 INFO L87 Difference]: Start difference. First operand 680 states and 680 transitions. Second operand 133 states. [2018-10-15 12:32:32,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:32:32,418 INFO L93 Difference]: Finished difference Result 698 states and 698 transitions. [2018-10-15 12:32:32,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 198 states. [2018-10-15 12:32:32,418 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 679 [2018-10-15 12:32:32,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:32:32,421 INFO L225 Difference]: With dead ends: 698 [2018-10-15 12:32:32,421 INFO L226 Difference]: Without dead ends: 698 [2018-10-15 12:32:32,425 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12545 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=21778, Invalid=47128, Unknown=0, NotChecked=0, Total=68906 [2018-10-15 12:32:32,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2018-10-15 12:32:32,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 690. [2018-10-15 12:32:32,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 690 states. [2018-10-15 12:32:32,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 690 transitions. [2018-10-15 12:32:32,431 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 690 transitions. Word has length 679 [2018-10-15 12:32:32,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:32:32,432 INFO L481 AbstractCegarLoop]: Abstraction has 690 states and 690 transitions. [2018-10-15 12:32:32,432 INFO L482 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-10-15 12:32:32,432 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 690 transitions. [2018-10-15 12:32:32,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 690 [2018-10-15 12:32:32,436 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:32:32,437 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:32:32,437 INFO L424 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:32:32,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:32:32,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1559004403, now seen corresponding path program 66 times [2018-10-15 12:32:32,438 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:32:32,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:32:38,303 INFO L134 CoverageAnalysis]: Checked inductivity of 21516 backedges. 0 proven. 21516 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:32:38,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:32:38,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-10-15 12:32:38,304 INFO L460 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-10-15 12:32:38,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-10-15 12:32:38,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4623, Invalid=13467, Unknown=0, NotChecked=0, Total=18090 [2018-10-15 12:32:38,305 INFO L87 Difference]: Start difference. First operand 690 states and 690 transitions. Second operand 135 states. [2018-10-15 12:32:47,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:32:47,936 INFO L93 Difference]: Finished difference Result 708 states and 708 transitions. [2018-10-15 12:32:47,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2018-10-15 12:32:47,936 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 689 [2018-10-15 12:32:47,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:32:47,938 INFO L225 Difference]: With dead ends: 708 [2018-10-15 12:32:47,938 INFO L226 Difference]: Without dead ends: 708 [2018-10-15 12:32:47,940 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12936 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=22443, Invalid=48579, Unknown=0, NotChecked=0, Total=71022 [2018-10-15 12:32:47,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2018-10-15 12:32:47,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 700. [2018-10-15 12:32:47,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2018-10-15 12:32:47,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 700 transitions. [2018-10-15 12:32:47,945 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 700 transitions. Word has length 689 [2018-10-15 12:32:47,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:32:47,946 INFO L481 AbstractCegarLoop]: Abstraction has 700 states and 700 transitions. [2018-10-15 12:32:47,946 INFO L482 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-10-15 12:32:47,946 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 700 transitions. [2018-10-15 12:32:47,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 700 [2018-10-15 12:32:47,949 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:32:47,949 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 67, 67, 67, 67, 67, 67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:32:47,949 INFO L424 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:32:47,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:32:47,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1924112338, now seen corresponding path program 67 times [2018-10-15 12:32:47,950 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:32:48,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:32:53,641 INFO L134 CoverageAnalysis]: Checked inductivity of 22177 backedges. 0 proven. 22177 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:32:53,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:32:53,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2018-10-15 12:32:53,642 INFO L460 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-10-15 12:32:53,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-10-15 12:32:53,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4760, Invalid=13872, Unknown=0, NotChecked=0, Total=18632 [2018-10-15 12:32:53,644 INFO L87 Difference]: Start difference. First operand 700 states and 700 transitions. Second operand 137 states. [2018-10-15 12:33:03,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:33:03,412 INFO L93 Difference]: Finished difference Result 718 states and 718 transitions. [2018-10-15 12:33:03,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 204 states. [2018-10-15 12:33:03,413 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 699 [2018-10-15 12:33:03,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:33:03,415 INFO L225 Difference]: With dead ends: 718 [2018-10-15 12:33:03,415 INFO L226 Difference]: Without dead ends: 718 [2018-10-15 12:33:03,417 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13333 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=23118, Invalid=50052, Unknown=0, NotChecked=0, Total=73170 [2018-10-15 12:33:03,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2018-10-15 12:33:03,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 710. [2018-10-15 12:33:03,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 710 states. [2018-10-15 12:33:03,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 710 transitions. [2018-10-15 12:33:03,422 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 710 transitions. Word has length 699 [2018-10-15 12:33:03,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:33:03,422 INFO L481 AbstractCegarLoop]: Abstraction has 710 states and 710 transitions. [2018-10-15 12:33:03,422 INFO L482 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-10-15 12:33:03,422 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 710 transitions. [2018-10-15 12:33:03,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 710 [2018-10-15 12:33:03,425 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:33:03,426 INFO L375 BasicCegarLoop]: trace histogram [68, 68, 68, 68, 68, 68, 68, 68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:33:03,426 INFO L424 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:33:03,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:33:03,426 INFO L82 PathProgramCache]: Analyzing trace with hash -745296471, now seen corresponding path program 68 times [2018-10-15 12:33:03,427 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:33:03,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:33:09,370 INFO L134 CoverageAnalysis]: Checked inductivity of 22848 backedges. 0 proven. 22848 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:33:09,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:33:09,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2018-10-15 12:33:09,371 INFO L460 AbstractCegarLoop]: Interpolant automaton has 139 states [2018-10-15 12:33:09,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2018-10-15 12:33:09,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4899, Invalid=14283, Unknown=0, NotChecked=0, Total=19182 [2018-10-15 12:33:09,372 INFO L87 Difference]: Start difference. First operand 710 states and 710 transitions. Second operand 139 states. [2018-10-15 12:33:19,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:33:19,548 INFO L93 Difference]: Finished difference Result 728 states and 728 transitions. [2018-10-15 12:33:19,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 207 states. [2018-10-15 12:33:19,548 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 709 [2018-10-15 12:33:19,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:33:19,551 INFO L225 Difference]: With dead ends: 728 [2018-10-15 12:33:19,551 INFO L226 Difference]: Without dead ends: 728 [2018-10-15 12:33:19,553 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13736 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=23803, Invalid=51547, Unknown=0, NotChecked=0, Total=75350 [2018-10-15 12:33:19,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2018-10-15 12:33:19,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 720. [2018-10-15 12:33:19,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2018-10-15 12:33:19,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 720 transitions. [2018-10-15 12:33:19,558 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 720 transitions. Word has length 709 [2018-10-15 12:33:19,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:33:19,558 INFO L481 AbstractCegarLoop]: Abstraction has 720 states and 720 transitions. [2018-10-15 12:33:19,558 INFO L482 AbstractCegarLoop]: Interpolant automaton has 139 states. [2018-10-15 12:33:19,558 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 720 transitions. [2018-10-15 12:33:19,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 720 [2018-10-15 12:33:19,561 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:33:19,562 INFO L375 BasicCegarLoop]: trace histogram [69, 69, 69, 69, 69, 69, 69, 69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:33:19,562 INFO L424 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:33:19,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:33:19,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1245930140, now seen corresponding path program 69 times [2018-10-15 12:33:19,563 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:33:19,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:33:25,584 INFO L134 CoverageAnalysis]: Checked inductivity of 23529 backedges. 0 proven. 23529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:33:25,584 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:33:25,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141] total 141 [2018-10-15 12:33:25,585 INFO L460 AbstractCegarLoop]: Interpolant automaton has 141 states [2018-10-15 12:33:25,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2018-10-15 12:33:25,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5040, Invalid=14700, Unknown=0, NotChecked=0, Total=19740 [2018-10-15 12:33:25,586 INFO L87 Difference]: Start difference. First operand 720 states and 720 transitions. Second operand 141 states. [2018-10-15 12:33:36,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:33:36,441 INFO L93 Difference]: Finished difference Result 738 states and 738 transitions. [2018-10-15 12:33:36,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 210 states. [2018-10-15 12:33:36,441 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 719 [2018-10-15 12:33:36,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:33:36,443 INFO L225 Difference]: With dead ends: 738 [2018-10-15 12:33:36,443 INFO L226 Difference]: Without dead ends: 738 [2018-10-15 12:33:36,445 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 277 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14145 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=24498, Invalid=53064, Unknown=0, NotChecked=0, Total=77562 [2018-10-15 12:33:36,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2018-10-15 12:33:36,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 730. [2018-10-15 12:33:36,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 730 states. [2018-10-15 12:33:36,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 730 states to 730 states and 730 transitions. [2018-10-15 12:33:36,450 INFO L78 Accepts]: Start accepts. Automaton has 730 states and 730 transitions. Word has length 719 [2018-10-15 12:33:36,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:33:36,450 INFO L481 AbstractCegarLoop]: Abstraction has 730 states and 730 transitions. [2018-10-15 12:33:36,450 INFO L482 AbstractCegarLoop]: Interpolant automaton has 141 states. [2018-10-15 12:33:36,451 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states and 730 transitions. [2018-10-15 12:33:36,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 730 [2018-10-15 12:33:36,454 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:33:36,454 INFO L375 BasicCegarLoop]: trace histogram [70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:33:36,454 INFO L424 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:33:36,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:33:36,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1272274783, now seen corresponding path program 70 times [2018-10-15 12:33:36,455 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:33:36,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:33:42,590 INFO L134 CoverageAnalysis]: Checked inductivity of 24220 backedges. 0 proven. 24220 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:33:42,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:33:42,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143] total 143 [2018-10-15 12:33:42,591 INFO L460 AbstractCegarLoop]: Interpolant automaton has 143 states [2018-10-15 12:33:42,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2018-10-15 12:33:42,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5183, Invalid=15123, Unknown=0, NotChecked=0, Total=20306 [2018-10-15 12:33:42,592 INFO L87 Difference]: Start difference. First operand 730 states and 730 transitions. Second operand 143 states. [2018-10-15 12:33:53,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:33:53,473 INFO L93 Difference]: Finished difference Result 748 states and 748 transitions. [2018-10-15 12:33:53,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 213 states. [2018-10-15 12:33:53,474 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 729 [2018-10-15 12:33:53,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:33:53,476 INFO L225 Difference]: With dead ends: 748 [2018-10-15 12:33:53,476 INFO L226 Difference]: Without dead ends: 748 [2018-10-15 12:33:53,478 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 281 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14560 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=25203, Invalid=54603, Unknown=0, NotChecked=0, Total=79806 [2018-10-15 12:33:53,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2018-10-15 12:33:53,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 740. [2018-10-15 12:33:53,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 740 states. [2018-10-15 12:33:53,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 740 transitions. [2018-10-15 12:33:53,483 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 740 transitions. Word has length 729 [2018-10-15 12:33:53,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:33:53,483 INFO L481 AbstractCegarLoop]: Abstraction has 740 states and 740 transitions. [2018-10-15 12:33:53,484 INFO L482 AbstractCegarLoop]: Interpolant automaton has 143 states. [2018-10-15 12:33:53,484 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 740 transitions. [2018-10-15 12:33:53,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 740 [2018-10-15 12:33:53,487 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:33:53,487 INFO L375 BasicCegarLoop]: trace histogram [71, 71, 71, 71, 71, 71, 71, 71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:33:53,488 INFO L424 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:33:53,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:33:53,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1964235878, now seen corresponding path program 71 times [2018-10-15 12:33:53,489 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:33:53,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:33:59,865 INFO L134 CoverageAnalysis]: Checked inductivity of 24921 backedges. 0 proven. 24921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:33:59,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:33:59,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145] total 145 [2018-10-15 12:33:59,866 INFO L460 AbstractCegarLoop]: Interpolant automaton has 145 states [2018-10-15 12:33:59,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2018-10-15 12:33:59,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5328, Invalid=15552, Unknown=0, NotChecked=0, Total=20880 [2018-10-15 12:33:59,867 INFO L87 Difference]: Start difference. First operand 740 states and 740 transitions. Second operand 145 states. [2018-10-15 12:34:10,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:34:10,821 INFO L93 Difference]: Finished difference Result 758 states and 758 transitions. [2018-10-15 12:34:10,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 216 states. [2018-10-15 12:34:10,822 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 739 [2018-10-15 12:34:10,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:34:10,824 INFO L225 Difference]: With dead ends: 758 [2018-10-15 12:34:10,824 INFO L226 Difference]: Without dead ends: 758 [2018-10-15 12:34:10,826 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 12:34:10,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2018-10-15 12:34:10,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 750. [2018-10-15 12:34:10,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 750 states. [2018-10-15 12:34:10,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 750 transitions. [2018-10-15 12:34:10,831 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 750 transitions. Word has length 739 [2018-10-15 12:34:10,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:34:10,831 INFO L481 AbstractCegarLoop]: Abstraction has 750 states and 750 transitions. [2018-10-15 12:34:10,831 INFO L482 AbstractCegarLoop]: Interpolant automaton has 145 states. [2018-10-15 12:34:10,831 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 750 transitions. [2018-10-15 12:34:10,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 750 [2018-10-15 12:34:10,835 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:34:10,835 INFO L375 BasicCegarLoop]: trace histogram [72, 72, 72, 72, 72, 72, 72, 72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:34:10,835 INFO L424 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:34:10,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:34:10,836 INFO L82 PathProgramCache]: Analyzing trace with hash -804054507, now seen corresponding path program 72 times [2018-10-15 12:34:10,836 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:34:10,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:34:17,396 INFO L134 CoverageAnalysis]: Checked inductivity of 25632 backedges. 0 proven. 25632 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:34:17,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:34:17,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147] total 147 [2018-10-15 12:34:17,397 INFO L460 AbstractCegarLoop]: Interpolant automaton has 147 states [2018-10-15 12:34:17,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2018-10-15 12:34:17,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5475, Invalid=15987, Unknown=0, NotChecked=0, Total=21462 [2018-10-15 12:34:17,399 INFO L87 Difference]: Start difference. First operand 750 states and 750 transitions. Second operand 147 states. [2018-10-15 12:34:28,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:34:28,918 INFO L93 Difference]: Finished difference Result 768 states and 768 transitions. [2018-10-15 12:34:28,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 219 states. [2018-10-15 12:34:28,918 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 749 [2018-10-15 12:34:28,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:34:28,921 INFO L225 Difference]: With dead ends: 768 [2018-10-15 12:34:28,921 INFO L226 Difference]: Without dead ends: 768 [2018-10-15 12:34:28,922 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 289 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15408 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=26643, Invalid=57747, Unknown=0, NotChecked=0, Total=84390 [2018-10-15 12:34:28,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 768 states. [2018-10-15 12:34:28,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 768 to 760. [2018-10-15 12:34:28,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 760 states. [2018-10-15 12:34:28,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 760 states to 760 states and 760 transitions. [2018-10-15 12:34:28,928 INFO L78 Accepts]: Start accepts. Automaton has 760 states and 760 transitions. Word has length 749 [2018-10-15 12:34:28,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:34:28,928 INFO L481 AbstractCegarLoop]: Abstraction has 760 states and 760 transitions. [2018-10-15 12:34:28,928 INFO L482 AbstractCegarLoop]: Interpolant automaton has 147 states. [2018-10-15 12:34:28,928 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 760 transitions. [2018-10-15 12:34:28,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 760 [2018-10-15 12:34:28,932 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:34:28,932 INFO L375 BasicCegarLoop]: trace histogram [73, 73, 73, 73, 73, 73, 73, 73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:34:28,932 INFO L424 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:34:28,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:34:28,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1419742512, now seen corresponding path program 73 times [2018-10-15 12:34:28,933 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:34:29,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:34:35,851 INFO L134 CoverageAnalysis]: Checked inductivity of 26353 backedges. 0 proven. 26353 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:34:35,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:34:35,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [149] total 149 [2018-10-15 12:34:35,852 INFO L460 AbstractCegarLoop]: Interpolant automaton has 149 states [2018-10-15 12:34:35,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2018-10-15 12:34:35,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5624, Invalid=16428, Unknown=0, NotChecked=0, Total=22052 [2018-10-15 12:34:35,853 INFO L87 Difference]: Start difference. First operand 760 states and 760 transitions. Second operand 149 states.