java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplTransformed.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20181015-LoopsPathprograms/down_true-unreach-call_true-termination.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2d08e6e [2018-10-15 13:03:46,843 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 13:03:46,845 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 13:03:46,864 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 13:03:46,864 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 13:03:46,865 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 13:03:46,866 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 13:03:46,868 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 13:03:46,870 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 13:03:46,871 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 13:03:46,872 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 13:03:46,872 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 13:03:46,873 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 13:03:46,874 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 13:03:46,875 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 13:03:46,876 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 13:03:46,877 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 13:03:46,879 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 13:03:46,881 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 13:03:46,882 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 13:03:46,883 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 13:03:46,885 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 13:03:46,887 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 13:03:46,887 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 13:03:46,888 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 13:03:46,889 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 13:03:46,890 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 13:03:46,890 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 13:03:46,891 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 13:03:46,892 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 13:03:46,893 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 13:03:46,893 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 13:03:46,894 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 13:03:46,894 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 13:03:46,896 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 13:03:46,897 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 13:03:46,897 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 13:03:46,919 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 13:03:46,919 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 13:03:46,920 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 13:03:46,920 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 13:03:46,921 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 13:03:46,924 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 13:03:46,925 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 13:03:46,925 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 13:03:46,925 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 13:03:46,925 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 13:03:46,926 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 13:03:46,926 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 13:03:46,926 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 13:03:46,927 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 13:03:46,928 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 13:03:46,984 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 13:03:47,003 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 13:03:47,011 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 13:03:47,013 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 13:03:47,013 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 13:03:47,014 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/down_true-unreach-call_true-termination.i_4.bpl [2018-10-15 13:03:47,015 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/down_true-unreach-call_true-termination.i_4.bpl' [2018-10-15 13:03:47,095 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 13:03:47,097 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-15 13:03:47,098 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 13:03:47,098 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 13:03:47,098 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 13:03:47,129 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "down_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:03:47" (1/1) ... [2018-10-15 13:03:47,131 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "down_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:03:47" (1/1) ... [2018-10-15 13:03:47,143 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "down_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:03:47" (1/1) ... [2018-10-15 13:03:47,144 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "down_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:03:47" (1/1) ... [2018-10-15 13:03:47,149 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "down_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:03:47" (1/1) ... [2018-10-15 13:03:47,151 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "down_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:03:47" (1/1) ... [2018-10-15 13:03:47,152 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "down_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:03:47" (1/1) ... [2018-10-15 13:03:47,154 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 13:03:47,156 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 13:03:47,156 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 13:03:47,156 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 13:03:47,158 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "down_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:03:47" (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 13:03:47,235 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-15 13:03:47,236 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 13:03:47,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 13:03:47,685 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 13:03:47,686 INFO L202 PluginConnector]: Adding new model down_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:03:47 BoogieIcfgContainer [2018-10-15 13:03:47,686 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 13:03:47,687 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-15 13:03:47,687 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-15 13:03:47,688 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-15 13:03:47,691 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "down_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:03:47" (1/1) ... [2018-10-15 13:03:47,696 WARN L219 ansformationObserver]: HeapSeparator: input icfg has no '#valid' array -- returning unchanged Icfg! [2018-10-15 13:03:47,713 INFO L202 PluginConnector]: Adding new model down_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 01:03:47 BasicIcfg [2018-10-15 13:03:47,714 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-15 13:03:47,715 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 13:03:47,715 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 13:03:47,718 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 13:03:47,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "down_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:03:47" (1/3) ... [2018-10-15 13:03:47,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43cf289 and model type down_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:03:47, skipping insertion in model container [2018-10-15 13:03:47,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "down_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:03:47" (2/3) ... [2018-10-15 13:03:47,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43cf289 and model type down_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 01:03:47, skipping insertion in model container [2018-10-15 13:03:47,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "down_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 01:03:47" (3/3) ... [2018-10-15 13:03:47,722 INFO L112 eAbstractionObserver]: Analyzing ICFG down_true-unreach-call_true-termination.i_4.bplleft_unchanged_by_heapseparator [2018-10-15 13:03:47,732 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 13:03:47,741 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 13:03:47,759 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 13:03:47,789 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 13:03:47,789 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 13:03:47,790 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 13:03:47,790 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 13:03:47,790 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 13:03:47,790 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 13:03:47,790 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 13:03:47,791 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 13:03:47,791 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 13:03:47,806 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-10-15 13:03:47,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-15 13:03:47,815 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:47,816 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:03:47,817 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:47,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:47,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1207103758, now seen corresponding path program 1 times [2018-10-15 13:03:47,876 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:47,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:48,035 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 13:03:48,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 13:03:48,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-15 13:03:48,041 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 13:03:48,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 13:03:48,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-15 13:03:48,057 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 5 states. [2018-10-15 13:03:48,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:48,209 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2018-10-15 13:03:48,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-15 13:03:48,211 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-10-15 13:03:48,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:48,223 INFO L225 Difference]: With dead ends: 34 [2018-10-15 13:03:48,223 INFO L226 Difference]: Without dead ends: 32 [2018-10-15 13:03:48,225 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-15 13:03:48,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-10-15 13:03:48,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-10-15 13:03:48,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-15 13:03:48,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-10-15 13:03:48,266 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 16 [2018-10-15 13:03:48,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:48,266 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-10-15 13:03:48,267 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 13:03:48,267 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-10-15 13:03:48,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-15 13:03:48,268 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:48,268 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] [2018-10-15 13:03:48,269 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:48,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:48,269 INFO L82 PathProgramCache]: Analyzing trace with hash 261319903, now seen corresponding path program 1 times [2018-10-15 13:03:48,271 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:48,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:48,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:48,516 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 13:03:48,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-15 13:03:48,524 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-15 13:03:48,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-15 13:03:48,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-15 13:03:48,525 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 7 states. [2018-10-15 13:03:48,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:48,912 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-10-15 13:03:48,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-15 13:03:48,915 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-10-15 13:03:48,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:48,917 INFO L225 Difference]: With dead ends: 49 [2018-10-15 13:03:48,917 INFO L226 Difference]: Without dead ends: 49 [2018-10-15 13:03:48,918 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-10-15 13:03:48,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-15 13:03:48,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 35. [2018-10-15 13:03:48,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-15 13:03:48,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-10-15 13:03:48,924 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 23 [2018-10-15 13:03:48,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:48,925 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-10-15 13:03:48,925 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-15 13:03:48,925 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-10-15 13:03:48,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-15 13:03:48,927 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:48,927 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-15 13:03:48,927 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:48,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:48,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1627824977, now seen corresponding path program 1 times [2018-10-15 13:03:48,929 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:48,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:49,177 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:49,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:49,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-15 13:03:49,179 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 13:03:49,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 13:03:49,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-10-15 13:03:49,180 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 9 states. [2018-10-15 13:03:49,514 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-15 13:03:49,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:49,737 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2018-10-15 13:03:49,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-15 13:03:49,739 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2018-10-15 13:03:49,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:49,740 INFO L225 Difference]: With dead ends: 57 [2018-10-15 13:03:49,740 INFO L226 Difference]: Without dead ends: 44 [2018-10-15 13:03:49,743 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2018-10-15 13:03:49,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-10-15 13:03:49,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2018-10-15 13:03:49,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-10-15 13:03:49,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-10-15 13:03:49,753 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 34 [2018-10-15 13:03:49,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:49,754 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-10-15 13:03:49,754 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 13:03:49,754 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-10-15 13:03:49,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-15 13:03:49,755 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:49,756 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:03:49,756 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:49,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:49,757 INFO L82 PathProgramCache]: Analyzing trace with hash -2085951936, now seen corresponding path program 2 times [2018-10-15 13:03:49,759 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:49,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:50,047 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:50,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:50,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-15 13:03:50,048 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-15 13:03:50,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-15 13:03:50,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-10-15 13:03:50,049 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 12 states. [2018-10-15 13:03:50,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:50,665 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2018-10-15 13:03:50,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-15 13:03:50,665 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2018-10-15 13:03:50,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:50,667 INFO L225 Difference]: With dead ends: 66 [2018-10-15 13:03:50,667 INFO L226 Difference]: Without dead ends: 66 [2018-10-15 13:03:50,668 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2018-10-15 13:03:50,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-10-15 13:03:50,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 53. [2018-10-15 13:03:50,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-15 13:03:50,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 54 transitions. [2018-10-15 13:03:50,674 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 54 transitions. Word has length 41 [2018-10-15 13:03:50,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:50,675 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 54 transitions. [2018-10-15 13:03:50,675 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-15 13:03:50,675 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2018-10-15 13:03:50,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-15 13:03:50,677 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:50,677 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:03:50,678 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:50,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:50,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1744563374, now seen corresponding path program 3 times [2018-10-15 13:03:50,679 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:50,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:51,111 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 21 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:51,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:51,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-15 13:03:51,113 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-15 13:03:51,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-15 13:03:51,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-10-15 13:03:51,114 INFO L87 Difference]: Start difference. First operand 53 states and 54 transitions. Second operand 13 states. [2018-10-15 13:03:51,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:51,757 INFO L93 Difference]: Finished difference Result 86 states and 87 transitions. [2018-10-15 13:03:51,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-15 13:03:51,757 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 52 [2018-10-15 13:03:51,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:51,759 INFO L225 Difference]: With dead ends: 86 [2018-10-15 13:03:51,759 INFO L226 Difference]: Without dead ends: 62 [2018-10-15 13:03:51,760 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=135, Invalid=465, Unknown=0, NotChecked=0, Total=600 [2018-10-15 13:03:51,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-10-15 13:03:51,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 60. [2018-10-15 13:03:51,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-15 13:03:51,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2018-10-15 13:03:51,768 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 52 [2018-10-15 13:03:51,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:51,768 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2018-10-15 13:03:51,768 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-15 13:03:51,768 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-10-15 13:03:51,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-10-15 13:03:51,770 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:51,770 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:03:51,770 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:51,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:51,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1908501505, now seen corresponding path program 4 times [2018-10-15 13:03:51,771 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:51,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:52,094 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 24 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:52,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:52,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 13:03:52,095 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 13:03:52,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 13:03:52,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2018-10-15 13:03:52,096 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 15 states. [2018-10-15 13:03:52,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:52,528 INFO L93 Difference]: Finished difference Result 84 states and 85 transitions. [2018-10-15 13:03:52,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-15 13:03:52,529 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 59 [2018-10-15 13:03:52,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:52,532 INFO L225 Difference]: With dead ends: 84 [2018-10-15 13:03:52,532 INFO L226 Difference]: Without dead ends: 84 [2018-10-15 13:03:52,533 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=222, Invalid=770, Unknown=0, NotChecked=0, Total=992 [2018-10-15 13:03:52,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-10-15 13:03:52,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 71. [2018-10-15 13:03:52,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-10-15 13:03:52,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2018-10-15 13:03:52,540 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 59 [2018-10-15 13:03:52,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:52,541 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2018-10-15 13:03:52,541 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 13:03:52,541 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2018-10-15 13:03:52,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-10-15 13:03:52,543 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:52,543 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:03:52,543 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:52,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:52,544 INFO L82 PathProgramCache]: Analyzing trace with hash -573275761, now seen corresponding path program 5 times [2018-10-15 13:03:52,545 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:52,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:52,766 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 48 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:52,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:52,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-15 13:03:52,767 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-15 13:03:52,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-15 13:03:52,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2018-10-15 13:03:52,768 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 17 states. [2018-10-15 13:03:53,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:53,331 INFO L93 Difference]: Finished difference Result 115 states and 116 transitions. [2018-10-15 13:03:53,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-15 13:03:53,331 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 70 [2018-10-15 13:03:53,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:53,333 INFO L225 Difference]: With dead ends: 115 [2018-10-15 13:03:53,333 INFO L226 Difference]: Without dead ends: 80 [2018-10-15 13:03:53,335 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=230, Invalid=892, Unknown=0, NotChecked=0, Total=1122 [2018-10-15 13:03:53,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-10-15 13:03:53,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2018-10-15 13:03:53,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-10-15 13:03:53,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2018-10-15 13:03:53,341 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 70 [2018-10-15 13:03:53,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:53,342 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2018-10-15 13:03:53,342 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-15 13:03:53,342 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2018-10-15 13:03:53,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-15 13:03:53,344 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:53,344 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:03:53,344 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:53,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:53,345 INFO L82 PathProgramCache]: Analyzing trace with hash -263956832, now seen corresponding path program 6 times [2018-10-15 13:03:53,345 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:53,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:53,824 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 46 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:53,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:53,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-15 13:03:53,826 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-15 13:03:53,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-15 13:03:53,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2018-10-15 13:03:53,827 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 18 states. [2018-10-15 13:03:54,371 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 11 [2018-10-15 13:03:54,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:54,613 INFO L93 Difference]: Finished difference Result 102 states and 103 transitions. [2018-10-15 13:03:54,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-15 13:03:54,613 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 77 [2018-10-15 13:03:54,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:54,615 INFO L225 Difference]: With dead ends: 102 [2018-10-15 13:03:54,615 INFO L226 Difference]: Without dead ends: 102 [2018-10-15 13:03:54,616 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 417 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=349, Invalid=1291, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 13:03:54,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-10-15 13:03:54,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 89. [2018-10-15 13:03:54,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-10-15 13:03:54,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 90 transitions. [2018-10-15 13:03:54,622 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 90 transitions. Word has length 77 [2018-10-15 13:03:54,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:54,623 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 90 transitions. [2018-10-15 13:03:54,623 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-15 13:03:54,623 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2018-10-15 13:03:54,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-15 13:03:54,625 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:54,625 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:03:54,625 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:54,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:54,626 INFO L82 PathProgramCache]: Analyzing trace with hash -323321778, now seen corresponding path program 7 times [2018-10-15 13:03:54,626 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:54,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:55,101 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 86 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:55,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:55,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 13:03:55,102 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 13:03:55,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 13:03:55,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2018-10-15 13:03:55,104 INFO L87 Difference]: Start difference. First operand 89 states and 90 transitions. Second operand 21 states. [2018-10-15 13:03:55,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:55,532 INFO L93 Difference]: Finished difference Result 144 states and 145 transitions. [2018-10-15 13:03:55,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-15 13:03:55,533 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 88 [2018-10-15 13:03:55,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:55,534 INFO L225 Difference]: With dead ends: 144 [2018-10-15 13:03:55,535 INFO L226 Difference]: Without dead ends: 98 [2018-10-15 13:03:55,536 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=349, Invalid=1457, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 13:03:55,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-10-15 13:03:55,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2018-10-15 13:03:55,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-10-15 13:03:55,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2018-10-15 13:03:55,541 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 88 [2018-10-15 13:03:55,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:55,542 INFO L481 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2018-10-15 13:03:55,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 13:03:55,542 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2018-10-15 13:03:55,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-10-15 13:03:55,543 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:55,544 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:03:55,544 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:55,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:55,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1292866335, now seen corresponding path program 8 times [2018-10-15 13:03:55,545 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:55,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:55,837 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 75 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:55,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:55,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 13:03:55,838 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 13:03:55,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 13:03:55,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2018-10-15 13:03:55,839 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand 21 states. [2018-10-15 13:03:56,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:56,403 INFO L93 Difference]: Finished difference Result 120 states and 121 transitions. [2018-10-15 13:03:56,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-15 13:03:56,404 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 95 [2018-10-15 13:03:56,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:56,405 INFO L225 Difference]: With dead ends: 120 [2018-10-15 13:03:56,405 INFO L226 Difference]: Without dead ends: 120 [2018-10-15 13:03:56,407 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=504, Invalid=1946, Unknown=0, NotChecked=0, Total=2450 [2018-10-15 13:03:56,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-10-15 13:03:56,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 107. [2018-10-15 13:03:56,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-10-15 13:03:56,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2018-10-15 13:03:56,414 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 95 [2018-10-15 13:03:56,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:56,415 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2018-10-15 13:03:56,415 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 13:03:56,415 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2018-10-15 13:03:56,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-15 13:03:56,417 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:56,417 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:03:56,417 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:56,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:56,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1494036881, now seen corresponding path program 9 times [2018-10-15 13:03:56,419 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:56,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:56,944 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 135 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:56,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:56,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-15 13:03:56,945 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-15 13:03:56,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-15 13:03:56,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2018-10-15 13:03:56,946 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 25 states. [2018-10-15 13:03:57,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:57,736 INFO L93 Difference]: Finished difference Result 173 states and 174 transitions. [2018-10-15 13:03:57,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-15 13:03:57,736 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 106 [2018-10-15 13:03:57,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:57,737 INFO L225 Difference]: With dead ends: 173 [2018-10-15 13:03:57,737 INFO L226 Difference]: Without dead ends: 116 [2018-10-15 13:03:57,738 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=492, Invalid=2160, Unknown=0, NotChecked=0, Total=2652 [2018-10-15 13:03:57,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-10-15 13:03:57,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2018-10-15 13:03:57,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-10-15 13:03:57,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 115 transitions. [2018-10-15 13:03:57,743 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 115 transitions. Word has length 106 [2018-10-15 13:03:57,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:57,744 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 115 transitions. [2018-10-15 13:03:57,744 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-15 13:03:57,744 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 115 transitions. [2018-10-15 13:03:57,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-10-15 13:03:57,745 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:57,746 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:03:57,746 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:57,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:57,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1593913088, now seen corresponding path program 10 times [2018-10-15 13:03:57,747 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:57,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:58,136 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 111 proven. 135 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:58,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:58,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-15 13:03:58,137 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-15 13:03:58,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-15 13:03:58,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2018-10-15 13:03:58,137 INFO L87 Difference]: Start difference. First operand 114 states and 115 transitions. Second operand 24 states. [2018-10-15 13:03:59,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:59,122 INFO L93 Difference]: Finished difference Result 138 states and 139 transitions. [2018-10-15 13:03:59,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-15 13:03:59,123 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 113 [2018-10-15 13:03:59,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:59,124 INFO L225 Difference]: With dead ends: 138 [2018-10-15 13:03:59,124 INFO L226 Difference]: Without dead ends: 138 [2018-10-15 13:03:59,126 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 965 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=687, Invalid=2735, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 13:03:59,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-10-15 13:03:59,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 125. [2018-10-15 13:03:59,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-10-15 13:03:59,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 126 transitions. [2018-10-15 13:03:59,129 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 126 transitions. Word has length 113 [2018-10-15 13:03:59,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:59,130 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 126 transitions. [2018-10-15 13:03:59,130 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-15 13:03:59,130 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2018-10-15 13:03:59,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-15 13:03:59,132 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:59,132 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:03:59,133 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:59,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:59,133 INFO L82 PathProgramCache]: Analyzing trace with hash -156980242, now seen corresponding path program 11 times [2018-10-15 13:03:59,134 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:59,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:59,675 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 195 proven. 111 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:59,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:59,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 13:03:59,676 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 13:03:59,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 13:03:59,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=685, Unknown=0, NotChecked=0, Total=812 [2018-10-15 13:03:59,677 INFO L87 Difference]: Start difference. First operand 125 states and 126 transitions. Second operand 29 states. [2018-10-15 13:04:00,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:00,651 INFO L93 Difference]: Finished difference Result 202 states and 203 transitions. [2018-10-15 13:04:00,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-15 13:04:00,651 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 124 [2018-10-15 13:04:00,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:00,653 INFO L225 Difference]: With dead ends: 202 [2018-10-15 13:04:00,653 INFO L226 Difference]: Without dead ends: 134 [2018-10-15 13:04:00,654 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 830 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=659, Invalid=3001, Unknown=0, NotChecked=0, Total=3660 [2018-10-15 13:04:00,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-10-15 13:04:00,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 132. [2018-10-15 13:04:00,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-10-15 13:04:00,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 133 transitions. [2018-10-15 13:04:00,658 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 133 transitions. Word has length 124 [2018-10-15 13:04:00,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:00,658 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 133 transitions. [2018-10-15 13:04:00,659 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 13:04:00,659 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 133 transitions. [2018-10-15 13:04:00,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-10-15 13:04:00,660 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:00,661 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:00,661 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:00,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:00,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1767664191, now seen corresponding path program 12 times [2018-10-15 13:04:00,662 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:00,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:01,201 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 154 proven. 195 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:04:01,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:01,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 13:04:01,202 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 13:04:01,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 13:04:01,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=571, Unknown=0, NotChecked=0, Total=702 [2018-10-15 13:04:01,203 INFO L87 Difference]: Start difference. First operand 132 states and 133 transitions. Second operand 27 states. [2018-10-15 13:04:02,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:02,363 INFO L93 Difference]: Finished difference Result 156 states and 157 transitions. [2018-10-15 13:04:02,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-15 13:04:02,363 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 131 [2018-10-15 13:04:02,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:02,365 INFO L225 Difference]: With dead ends: 156 [2018-10-15 13:04:02,365 INFO L226 Difference]: Without dead ends: 156 [2018-10-15 13:04:02,368 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1323 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=898, Invalid=3658, Unknown=0, NotChecked=0, Total=4556 [2018-10-15 13:04:02,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-10-15 13:04:02,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 143. [2018-10-15 13:04:02,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-10-15 13:04:02,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2018-10-15 13:04:02,371 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 131 [2018-10-15 13:04:02,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:02,371 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2018-10-15 13:04:02,371 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 13:04:02,372 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2018-10-15 13:04:02,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-15 13:04:02,372 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:02,373 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:02,373 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:02,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:02,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1262371663, now seen corresponding path program 13 times [2018-10-15 13:04:02,374 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:02,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:02,776 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 266 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:04:02,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:02,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 13:04:02,777 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 13:04:02,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 13:04:02,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=895, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 13:04:02,778 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand 33 states. [2018-10-15 13:04:03,349 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-15 13:04:04,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:04,480 INFO L93 Difference]: Finished difference Result 231 states and 232 transitions. [2018-10-15 13:04:04,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-15 13:04:04,481 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 142 [2018-10-15 13:04:04,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:04,482 INFO L225 Difference]: With dead ends: 231 [2018-10-15 13:04:04,482 INFO L226 Difference]: Without dead ends: 152 [2018-10-15 13:04:04,484 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1133 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=850, Invalid=3980, Unknown=0, NotChecked=0, Total=4830 [2018-10-15 13:04:04,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-10-15 13:04:04,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2018-10-15 13:04:04,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-10-15 13:04:04,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 151 transitions. [2018-10-15 13:04:04,488 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 151 transitions. Word has length 142 [2018-10-15 13:04:04,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:04,489 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 151 transitions. [2018-10-15 13:04:04,489 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 13:04:04,489 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 151 transitions. [2018-10-15 13:04:04,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-10-15 13:04:04,490 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:04,490 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:04,491 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:04,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:04,491 INFO L82 PathProgramCache]: Analyzing trace with hash -1515491488, now seen corresponding path program 14 times [2018-10-15 13:04:04,492 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:04,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:05,466 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-15 13:04:05,681 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 204 proven. 266 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:04:05,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:05,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-15 13:04:05,682 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-15 13:04:05,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-15 13:04:05,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=710, Unknown=0, NotChecked=0, Total=870 [2018-10-15 13:04:05,683 INFO L87 Difference]: Start difference. First operand 150 states and 151 transitions. Second operand 30 states. [2018-10-15 13:04:06,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:06,803 INFO L93 Difference]: Finished difference Result 174 states and 175 transitions. [2018-10-15 13:04:06,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-15 13:04:06,804 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 149 [2018-10-15 13:04:06,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:06,806 INFO L225 Difference]: With dead ends: 174 [2018-10-15 13:04:06,806 INFO L226 Difference]: Without dead ends: 174 [2018-10-15 13:04:06,808 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1737 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1137, Invalid=4715, Unknown=0, NotChecked=0, Total=5852 [2018-10-15 13:04:06,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-10-15 13:04:06,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 161. [2018-10-15 13:04:06,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-10-15 13:04:06,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 162 transitions. [2018-10-15 13:04:06,811 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 162 transitions. Word has length 149 [2018-10-15 13:04:06,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:06,812 INFO L481 AbstractCegarLoop]: Abstraction has 161 states and 162 transitions. [2018-10-15 13:04:06,812 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-15 13:04:06,812 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 162 transitions. [2018-10-15 13:04:06,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-15 13:04:06,813 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:06,813 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:06,813 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:06,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:06,813 INFO L82 PathProgramCache]: Analyzing trace with hash 229666702, now seen corresponding path program 15 times [2018-10-15 13:04:06,814 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:06,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:07,431 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 348 proven. 204 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:04:07,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:07,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 13:04:07,432 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 13:04:07,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 13:04:07,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1133, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 13:04:07,433 INFO L87 Difference]: Start difference. First operand 161 states and 162 transitions. Second operand 37 states. [2018-10-15 13:04:08,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:08,554 INFO L93 Difference]: Finished difference Result 260 states and 261 transitions. [2018-10-15 13:04:08,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-15 13:04:08,555 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 160 [2018-10-15 13:04:08,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:08,556 INFO L225 Difference]: With dead ends: 260 [2018-10-15 13:04:08,557 INFO L226 Difference]: Without dead ends: 170 [2018-10-15 13:04:08,558 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1483 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1065, Invalid=5097, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 13:04:08,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-10-15 13:04:08,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 168. [2018-10-15 13:04:08,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-10-15 13:04:08,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 169 transitions. [2018-10-15 13:04:08,562 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 169 transitions. Word has length 160 [2018-10-15 13:04:08,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:08,562 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 169 transitions. [2018-10-15 13:04:08,562 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 13:04:08,562 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 169 transitions. [2018-10-15 13:04:08,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-10-15 13:04:08,563 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:08,563 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:08,564 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:08,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:08,564 INFO L82 PathProgramCache]: Analyzing trace with hash 2012944735, now seen corresponding path program 16 times [2018-10-15 13:04:08,565 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:08,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:09,413 INFO L134 CoverageAnalysis]: Checked inductivity of 609 backedges. 261 proven. 348 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:04:09,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:09,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 13:04:09,415 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 13:04:09,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 13:04:09,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=864, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 13:04:09,415 INFO L87 Difference]: Start difference. First operand 168 states and 169 transitions. Second operand 33 states. [2018-10-15 13:04:10,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:10,765 INFO L93 Difference]: Finished difference Result 192 states and 193 transitions. [2018-10-15 13:04:10,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-15 13:04:10,769 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 167 [2018-10-15 13:04:10,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:10,771 INFO L225 Difference]: With dead ends: 192 [2018-10-15 13:04:10,771 INFO L226 Difference]: Without dead ends: 192 [2018-10-15 13:04:10,773 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2207 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1404, Invalid=5906, Unknown=0, NotChecked=0, Total=7310 [2018-10-15 13:04:10,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-10-15 13:04:10,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 179. [2018-10-15 13:04:10,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-10-15 13:04:10,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 180 transitions. [2018-10-15 13:04:10,777 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 180 transitions. Word has length 167 [2018-10-15 13:04:10,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:10,777 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 180 transitions. [2018-10-15 13:04:10,777 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 13:04:10,777 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 180 transitions. [2018-10-15 13:04:10,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-15 13:04:10,778 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:10,779 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:10,779 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:10,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:10,779 INFO L82 PathProgramCache]: Analyzing trace with hash -199172049, now seen corresponding path program 17 times [2018-10-15 13:04:10,780 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:10,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:11,375 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 441 proven. 261 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:04:11,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:11,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 13:04:11,376 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 13:04:11,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 13:04:11,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=1399, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 13:04:11,377 INFO L87 Difference]: Start difference. First operand 179 states and 180 transitions. Second operand 41 states. [2018-10-15 13:04:12,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:12,973 INFO L93 Difference]: Finished difference Result 289 states and 290 transitions. [2018-10-15 13:04:12,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-15 13:04:12,973 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 178 [2018-10-15 13:04:12,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:12,975 INFO L225 Difference]: With dead ends: 289 [2018-10-15 13:04:12,975 INFO L226 Difference]: Without dead ends: 188 [2018-10-15 13:04:12,978 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1880 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1304, Invalid=6352, Unknown=0, NotChecked=0, Total=7656 [2018-10-15 13:04:12,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-10-15 13:04:12,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2018-10-15 13:04:12,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-10-15 13:04:12,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 187 transitions. [2018-10-15 13:04:12,983 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 187 transitions. Word has length 178 [2018-10-15 13:04:12,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:12,984 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 187 transitions. [2018-10-15 13:04:12,984 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 13:04:12,984 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 187 transitions. [2018-10-15 13:04:12,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-10-15 13:04:12,985 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:12,985 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:12,986 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:12,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:12,986 INFO L82 PathProgramCache]: Analyzing trace with hash -2104682560, now seen corresponding path program 18 times [2018-10-15 13:04:12,987 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:12,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:13,627 INFO L134 CoverageAnalysis]: Checked inductivity of 766 backedges. 325 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:04:13,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:13,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-15 13:04:13,628 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-15 13:04:13,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-15 13:04:13,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=1033, Unknown=0, NotChecked=0, Total=1260 [2018-10-15 13:04:13,629 INFO L87 Difference]: Start difference. First operand 186 states and 187 transitions. Second operand 36 states. [2018-10-15 13:04:17,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:17,600 INFO L93 Difference]: Finished difference Result 210 states and 211 transitions. [2018-10-15 13:04:17,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-15 13:04:17,601 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 185 [2018-10-15 13:04:17,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:17,603 INFO L225 Difference]: With dead ends: 210 [2018-10-15 13:04:17,603 INFO L226 Difference]: Without dead ends: 210 [2018-10-15 13:04:17,604 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2733 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=1699, Invalid=7231, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 13:04:17,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-10-15 13:04:17,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 197. [2018-10-15 13:04:17,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-10-15 13:04:17,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 198 transitions. [2018-10-15 13:04:17,608 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 198 transitions. Word has length 185 [2018-10-15 13:04:17,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:17,608 INFO L481 AbstractCegarLoop]: Abstraction has 197 states and 198 transitions. [2018-10-15 13:04:17,608 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-15 13:04:17,609 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 198 transitions. [2018-10-15 13:04:17,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-10-15 13:04:17,610 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:17,610 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:17,610 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:17,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:17,611 INFO L82 PathProgramCache]: Analyzing trace with hash -2125214930, now seen corresponding path program 19 times [2018-10-15 13:04:17,611 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:17,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:18,836 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 545 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:04:18,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:18,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 13:04:18,837 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 13:04:18,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 13:04:18,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=1693, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 13:04:18,838 INFO L87 Difference]: Start difference. First operand 197 states and 198 transitions. Second operand 45 states. [2018-10-15 13:04:20,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:20,739 INFO L93 Difference]: Finished difference Result 318 states and 319 transitions. [2018-10-15 13:04:20,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-15 13:04:20,739 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 196 [2018-10-15 13:04:20,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:20,741 INFO L225 Difference]: With dead ends: 318 [2018-10-15 13:04:20,741 INFO L226 Difference]: Without dead ends: 206 [2018-10-15 13:04:20,742 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2324 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1567, Invalid=7745, Unknown=0, NotChecked=0, Total=9312 [2018-10-15 13:04:20,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-10-15 13:04:20,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 204. [2018-10-15 13:04:20,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-10-15 13:04:20,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 205 transitions. [2018-10-15 13:04:20,746 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 205 transitions. Word has length 196 [2018-10-15 13:04:20,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:20,747 INFO L481 AbstractCegarLoop]: Abstraction has 204 states and 205 transitions. [2018-10-15 13:04:20,747 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 13:04:20,747 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 205 transitions. [2018-10-15 13:04:20,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-10-15 13:04:20,748 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:20,748 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:20,748 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:20,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:20,749 INFO L82 PathProgramCache]: Analyzing trace with hash -448683905, now seen corresponding path program 20 times [2018-10-15 13:04:20,749 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:20,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:22,056 INFO L134 CoverageAnalysis]: Checked inductivity of 941 backedges. 396 proven. 545 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:04:22,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:22,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 13:04:22,057 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 13:04:22,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 13:04:22,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=1217, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 13:04:22,057 INFO L87 Difference]: Start difference. First operand 204 states and 205 transitions. Second operand 39 states. [2018-10-15 13:04:24,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:24,074 INFO L93 Difference]: Finished difference Result 228 states and 229 transitions. [2018-10-15 13:04:24,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-15 13:04:24,077 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 203 [2018-10-15 13:04:24,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:24,079 INFO L225 Difference]: With dead ends: 228 [2018-10-15 13:04:24,079 INFO L226 Difference]: Without dead ends: 228 [2018-10-15 13:04:24,081 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3315 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2022, Invalid=8690, Unknown=0, NotChecked=0, Total=10712 [2018-10-15 13:04:24,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-10-15 13:04:24,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 215. [2018-10-15 13:04:24,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-10-15 13:04:24,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 216 transitions. [2018-10-15 13:04:24,086 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 216 transitions. Word has length 203 [2018-10-15 13:04:24,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:24,086 INFO L481 AbstractCegarLoop]: Abstraction has 215 states and 216 transitions. [2018-10-15 13:04:24,086 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 13:04:24,086 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 216 transitions. [2018-10-15 13:04:24,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-10-15 13:04:24,088 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:24,088 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:24,088 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:24,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:24,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1132766479, now seen corresponding path program 21 times [2018-10-15 13:04:24,090 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:24,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:25,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 660 proven. 396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:04:25,590 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:25,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 13:04:25,590 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 13:04:25,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 13:04:25,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=2015, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 13:04:25,591 INFO L87 Difference]: Start difference. First operand 215 states and 216 transitions. Second operand 49 states. [2018-10-15 13:04:27,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:27,510 INFO L93 Difference]: Finished difference Result 347 states and 348 transitions. [2018-10-15 13:04:27,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-15 13:04:27,510 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 214 [2018-10-15 13:04:27,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:27,512 INFO L225 Difference]: With dead ends: 347 [2018-10-15 13:04:27,512 INFO L226 Difference]: Without dead ends: 224 [2018-10-15 13:04:27,514 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2815 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1854, Invalid=9276, Unknown=0, NotChecked=0, Total=11130 [2018-10-15 13:04:27,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-10-15 13:04:27,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 222. [2018-10-15 13:04:27,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-10-15 13:04:27,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 223 transitions. [2018-10-15 13:04:27,518 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 223 transitions. Word has length 214 [2018-10-15 13:04:27,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:27,519 INFO L481 AbstractCegarLoop]: Abstraction has 222 states and 223 transitions. [2018-10-15 13:04:27,519 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 13:04:27,519 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 223 transitions. [2018-10-15 13:04:27,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-10-15 13:04:27,520 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:27,520 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:27,521 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:27,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:27,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1013983264, now seen corresponding path program 22 times [2018-10-15 13:04:27,522 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:27,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:28,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1134 backedges. 474 proven. 660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:04:28,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:28,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-15 13:04:28,498 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-15 13:04:28,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-15 13:04:28,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=1416, Unknown=0, NotChecked=0, Total=1722 [2018-10-15 13:04:28,499 INFO L87 Difference]: Start difference. First operand 222 states and 223 transitions. Second operand 42 states. [2018-10-15 13:04:30,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:30,556 INFO L93 Difference]: Finished difference Result 246 states and 247 transitions. [2018-10-15 13:04:30,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-15 13:04:30,556 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 221 [2018-10-15 13:04:30,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:30,559 INFO L225 Difference]: With dead ends: 246 [2018-10-15 13:04:30,559 INFO L226 Difference]: Without dead ends: 246 [2018-10-15 13:04:30,560 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3953 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2373, Invalid=10283, Unknown=0, NotChecked=0, Total=12656 [2018-10-15 13:04:30,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-10-15 13:04:30,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 233. [2018-10-15 13:04:30,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-10-15 13:04:30,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 234 transitions. [2018-10-15 13:04:30,564 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 234 transitions. Word has length 221 [2018-10-15 13:04:30,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:30,565 INFO L481 AbstractCegarLoop]: Abstraction has 233 states and 234 transitions. [2018-10-15 13:04:30,565 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-15 13:04:30,565 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 234 transitions. [2018-10-15 13:04:30,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-10-15 13:04:30,566 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:30,566 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:30,567 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:30,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:30,567 INFO L82 PathProgramCache]: Analyzing trace with hash -930824498, now seen corresponding path program 23 times [2018-10-15 13:04:30,568 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:30,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:31,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 786 proven. 474 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:04:31,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:31,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 13:04:31,478 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 13:04:31,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 13:04:31,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=391, Invalid=2365, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 13:04:31,479 INFO L87 Difference]: Start difference. First operand 233 states and 234 transitions. Second operand 53 states. [2018-10-15 13:04:33,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:33,538 INFO L93 Difference]: Finished difference Result 376 states and 377 transitions. [2018-10-15 13:04:33,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-15 13:04:33,538 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 232 [2018-10-15 13:04:33,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:33,539 INFO L225 Difference]: With dead ends: 376 [2018-10-15 13:04:33,540 INFO L226 Difference]: Without dead ends: 242 [2018-10-15 13:04:33,540 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3353 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2165, Invalid=10945, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 13:04:33,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-10-15 13:04:33,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 240. [2018-10-15 13:04:33,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-10-15 13:04:33,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 241 transitions. [2018-10-15 13:04:33,544 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 241 transitions. Word has length 232 [2018-10-15 13:04:33,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:33,545 INFO L481 AbstractCegarLoop]: Abstraction has 240 states and 241 transitions. [2018-10-15 13:04:33,545 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 13:04:33,545 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 241 transitions. [2018-10-15 13:04:33,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-10-15 13:04:33,546 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:33,546 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:33,547 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:33,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:33,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1426456479, now seen corresponding path program 24 times [2018-10-15 13:04:33,548 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:33,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:34,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1345 backedges. 559 proven. 786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:04:34,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:34,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 13:04:34,734 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 13:04:34,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 13:04:34,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=350, Invalid=1630, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 13:04:34,735 INFO L87 Difference]: Start difference. First operand 240 states and 241 transitions. Second operand 45 states. [2018-10-15 13:04:37,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:37,068 INFO L93 Difference]: Finished difference Result 264 states and 265 transitions. [2018-10-15 13:04:37,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-10-15 13:04:37,068 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 239 [2018-10-15 13:04:37,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:37,071 INFO L225 Difference]: With dead ends: 264 [2018-10-15 13:04:37,071 INFO L226 Difference]: Without dead ends: 264 [2018-10-15 13:04:37,072 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4647 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2752, Invalid=12010, Unknown=0, NotChecked=0, Total=14762 [2018-10-15 13:04:37,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-10-15 13:04:37,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 251. [2018-10-15 13:04:37,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-10-15 13:04:37,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 252 transitions. [2018-10-15 13:04:37,076 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 252 transitions. Word has length 239 [2018-10-15 13:04:37,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:37,076 INFO L481 AbstractCegarLoop]: Abstraction has 251 states and 252 transitions. [2018-10-15 13:04:37,077 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 13:04:37,077 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 252 transitions. [2018-10-15 13:04:37,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-10-15 13:04:37,078 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:37,078 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:37,078 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:37,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:37,079 INFO L82 PathProgramCache]: Analyzing trace with hash -204238353, now seen corresponding path program 25 times [2018-10-15 13:04:37,079 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:37,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:38,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 923 proven. 559 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:04:38,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:38,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-15 13:04:38,150 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-15 13:04:38,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-15 13:04:38,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=449, Invalid=2743, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 13:04:38,151 INFO L87 Difference]: Start difference. First operand 251 states and 252 transitions. Second operand 57 states. [2018-10-15 13:04:40,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:40,758 INFO L93 Difference]: Finished difference Result 405 states and 406 transitions. [2018-10-15 13:04:40,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-10-15 13:04:40,759 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 250 [2018-10-15 13:04:40,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:40,760 INFO L225 Difference]: With dead ends: 405 [2018-10-15 13:04:40,760 INFO L226 Difference]: Without dead ends: 260 [2018-10-15 13:04:40,761 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3938 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2500, Invalid=12752, Unknown=0, NotChecked=0, Total=15252 [2018-10-15 13:04:40,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-10-15 13:04:40,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 258. [2018-10-15 13:04:40,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-10-15 13:04:40,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 259 transitions. [2018-10-15 13:04:40,765 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 259 transitions. Word has length 250 [2018-10-15 13:04:40,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:40,765 INFO L481 AbstractCegarLoop]: Abstraction has 258 states and 259 transitions. [2018-10-15 13:04:40,765 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-15 13:04:40,766 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 259 transitions. [2018-10-15 13:04:40,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-10-15 13:04:40,767 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:40,767 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:40,767 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:40,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:40,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1117692032, now seen corresponding path program 26 times [2018-10-15 13:04:40,768 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:40,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:41,985 INFO L134 CoverageAnalysis]: Checked inductivity of 1574 backedges. 651 proven. 923 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:04:41,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:41,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-15 13:04:41,986 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-15 13:04:41,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-15 13:04:41,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=397, Invalid=1859, Unknown=0, NotChecked=0, Total=2256 [2018-10-15 13:04:41,987 INFO L87 Difference]: Start difference. First operand 258 states and 259 transitions. Second operand 48 states. [2018-10-15 13:04:44,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:44,331 INFO L93 Difference]: Finished difference Result 282 states and 283 transitions. [2018-10-15 13:04:44,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-10-15 13:04:44,331 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 257 [2018-10-15 13:04:44,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:44,334 INFO L225 Difference]: With dead ends: 282 [2018-10-15 13:04:44,334 INFO L226 Difference]: Without dead ends: 282 [2018-10-15 13:04:44,336 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5397 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3159, Invalid=13871, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 13:04:44,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-10-15 13:04:44,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 269. [2018-10-15 13:04:44,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-10-15 13:04:44,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 270 transitions. [2018-10-15 13:04:44,341 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 270 transitions. Word has length 257 [2018-10-15 13:04:44,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:44,341 INFO L481 AbstractCegarLoop]: Abstraction has 269 states and 270 transitions. [2018-10-15 13:04:44,342 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-15 13:04:44,342 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 270 transitions. [2018-10-15 13:04:44,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-10-15 13:04:44,343 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:44,343 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:44,344 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:44,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:44,344 INFO L82 PathProgramCache]: Analyzing trace with hash -507950482, now seen corresponding path program 27 times [2018-10-15 13:04:44,345 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:44,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:46,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 1071 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:04:46,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:46,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-15 13:04:46,451 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-15 13:04:46,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-15 13:04:46,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=511, Invalid=3149, Unknown=0, NotChecked=0, Total=3660 [2018-10-15 13:04:46,452 INFO L87 Difference]: Start difference. First operand 269 states and 270 transitions. Second operand 61 states. [2018-10-15 13:04:48,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:48,558 INFO L93 Difference]: Finished difference Result 434 states and 435 transitions. [2018-10-15 13:04:48,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-10-15 13:04:48,558 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 268 [2018-10-15 13:04:48,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:48,561 INFO L225 Difference]: With dead ends: 434 [2018-10-15 13:04:48,561 INFO L226 Difference]: Without dead ends: 278 [2018-10-15 13:04:48,562 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4570 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=2859, Invalid=14697, Unknown=0, NotChecked=0, Total=17556 [2018-10-15 13:04:48,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-10-15 13:04:48,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 276. [2018-10-15 13:04:48,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-10-15 13:04:48,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 277 transitions. [2018-10-15 13:04:48,566 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 277 transitions. Word has length 268 [2018-10-15 13:04:48,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:48,567 INFO L481 AbstractCegarLoop]: Abstraction has 276 states and 277 transitions. [2018-10-15 13:04:48,567 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-15 13:04:48,567 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 277 transitions. [2018-10-15 13:04:48,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-10-15 13:04:48,568 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:48,569 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:48,569 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:48,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:48,569 INFO L82 PathProgramCache]: Analyzing trace with hash 43923135, now seen corresponding path program 28 times [2018-10-15 13:04:48,570 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:48,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:50,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1821 backedges. 750 proven. 1071 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:04:50,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:50,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 13:04:50,667 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 13:04:50,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 13:04:50,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=2103, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 13:04:50,668 INFO L87 Difference]: Start difference. First operand 276 states and 277 transitions. Second operand 51 states. [2018-10-15 13:04:53,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:53,326 INFO L93 Difference]: Finished difference Result 300 states and 301 transitions. [2018-10-15 13:04:53,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-10-15 13:04:53,326 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 275 [2018-10-15 13:04:53,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:53,328 INFO L225 Difference]: With dead ends: 300 [2018-10-15 13:04:53,328 INFO L226 Difference]: Without dead ends: 300 [2018-10-15 13:04:53,330 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6203 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=3594, Invalid=15866, Unknown=0, NotChecked=0, Total=19460 [2018-10-15 13:04:53,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-10-15 13:04:53,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 287. [2018-10-15 13:04:53,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-10-15 13:04:53,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 288 transitions. [2018-10-15 13:04:53,334 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 288 transitions. Word has length 275 [2018-10-15 13:04:53,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:53,334 INFO L481 AbstractCegarLoop]: Abstraction has 287 states and 288 transitions. [2018-10-15 13:04:53,334 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 13:04:53,334 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 288 transitions. [2018-10-15 13:04:53,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-10-15 13:04:53,335 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:53,335 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:53,335 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:53,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:53,336 INFO L82 PathProgramCache]: Analyzing trace with hash 2012718799, now seen corresponding path program 29 times [2018-10-15 13:04:53,336 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:53,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:54,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 1230 proven. 750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:04:54,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:54,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-15 13:04:54,618 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-15 13:04:54,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-15 13:04:54,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=577, Invalid=3583, Unknown=0, NotChecked=0, Total=4160 [2018-10-15 13:04:54,619 INFO L87 Difference]: Start difference. First operand 287 states and 288 transitions. Second operand 65 states. [2018-10-15 13:04:57,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:57,955 INFO L93 Difference]: Finished difference Result 463 states and 464 transitions. [2018-10-15 13:04:57,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-10-15 13:04:57,956 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 286 [2018-10-15 13:04:57,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:57,957 INFO L225 Difference]: With dead ends: 463 [2018-10-15 13:04:57,957 INFO L226 Difference]: Without dead ends: 296 [2018-10-15 13:04:57,959 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5249 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3242, Invalid=16780, Unknown=0, NotChecked=0, Total=20022 [2018-10-15 13:04:57,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-10-15 13:04:57,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 294. [2018-10-15 13:04:57,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-10-15 13:04:57,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 295 transitions. [2018-10-15 13:04:57,962 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 295 transitions. Word has length 286 [2018-10-15 13:04:57,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:57,962 INFO L481 AbstractCegarLoop]: Abstraction has 294 states and 295 transitions. [2018-10-15 13:04:57,962 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-15 13:04:57,962 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 295 transitions. [2018-10-15 13:04:57,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2018-10-15 13:04:57,963 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:57,963 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:57,963 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:57,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:57,964 INFO L82 PathProgramCache]: Analyzing trace with hash -857571104, now seen corresponding path program 30 times [2018-10-15 13:04:57,964 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:57,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:59,214 INFO L134 CoverageAnalysis]: Checked inductivity of 2086 backedges. 856 proven. 1230 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:04:59,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:59,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-10-15 13:04:59,215 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-15 13:04:59,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-15 13:04:59,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=500, Invalid=2362, Unknown=0, NotChecked=0, Total=2862 [2018-10-15 13:04:59,216 INFO L87 Difference]: Start difference. First operand 294 states and 295 transitions. Second operand 54 states. [2018-10-15 13:05:02,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:02,382 INFO L93 Difference]: Finished difference Result 318 states and 319 transitions. [2018-10-15 13:05:02,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-10-15 13:05:02,382 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 293 [2018-10-15 13:05:02,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:02,385 INFO L225 Difference]: With dead ends: 318 [2018-10-15 13:05:02,385 INFO L226 Difference]: Without dead ends: 318 [2018-10-15 13:05:02,387 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7065 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4057, Invalid=17995, Unknown=0, NotChecked=0, Total=22052 [2018-10-15 13:05:02,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-10-15 13:05:02,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 305. [2018-10-15 13:05:02,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-10-15 13:05:02,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 306 transitions. [2018-10-15 13:05:02,391 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 306 transitions. Word has length 293 [2018-10-15 13:05:02,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:02,392 INFO L481 AbstractCegarLoop]: Abstraction has 305 states and 306 transitions. [2018-10-15 13:05:02,392 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-15 13:05:02,392 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 306 transitions. [2018-10-15 13:05:02,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-10-15 13:05:02,393 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:02,394 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:02,394 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:02,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:02,394 INFO L82 PathProgramCache]: Analyzing trace with hash -1293455858, now seen corresponding path program 31 times [2018-10-15 13:05:02,395 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:02,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:03,807 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 1400 proven. 856 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:05:03,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:03,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-15 13:05:03,808 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-15 13:05:03,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-15 13:05:03,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=647, Invalid=4045, Unknown=0, NotChecked=0, Total=4692 [2018-10-15 13:05:03,809 INFO L87 Difference]: Start difference. First operand 305 states and 306 transitions. Second operand 69 states. [2018-10-15 13:05:07,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:07,586 INFO L93 Difference]: Finished difference Result 492 states and 493 transitions. [2018-10-15 13:05:07,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-10-15 13:05:07,586 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 304 [2018-10-15 13:05:07,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:07,587 INFO L225 Difference]: With dead ends: 492 [2018-10-15 13:05:07,587 INFO L226 Difference]: Without dead ends: 314 [2018-10-15 13:05:07,589 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5975 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=3649, Invalid=19001, Unknown=0, NotChecked=0, Total=22650 [2018-10-15 13:05:07,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-10-15 13:05:07,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 312. [2018-10-15 13:05:07,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2018-10-15 13:05:07,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 313 transitions. [2018-10-15 13:05:07,593 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 313 transitions. Word has length 304 [2018-10-15 13:05:07,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:07,594 INFO L481 AbstractCegarLoop]: Abstraction has 312 states and 313 transitions. [2018-10-15 13:05:07,594 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-15 13:05:07,594 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 313 transitions. [2018-10-15 13:05:07,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2018-10-15 13:05:07,596 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:07,596 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:07,596 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:07,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:07,596 INFO L82 PathProgramCache]: Analyzing trace with hash 551568863, now seen corresponding path program 32 times [2018-10-15 13:05:07,597 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:07,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:08,712 INFO L134 CoverageAnalysis]: Checked inductivity of 2369 backedges. 969 proven. 1400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:05:08,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:08,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-15 13:05:08,713 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-15 13:05:08,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-15 13:05:08,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=556, Invalid=2636, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 13:05:08,713 INFO L87 Difference]: Start difference. First operand 312 states and 313 transitions. Second operand 57 states. [2018-10-15 13:05:12,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:12,135 INFO L93 Difference]: Finished difference Result 336 states and 337 transitions. [2018-10-15 13:05:12,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-10-15 13:05:12,135 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 311 [2018-10-15 13:05:12,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:12,138 INFO L225 Difference]: With dead ends: 336 [2018-10-15 13:05:12,138 INFO L226 Difference]: Without dead ends: 336 [2018-10-15 13:05:12,140 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7983 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4548, Invalid=20258, Unknown=0, NotChecked=0, Total=24806 [2018-10-15 13:05:12,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-10-15 13:05:12,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 323. [2018-10-15 13:05:12,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-10-15 13:05:12,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 324 transitions. [2018-10-15 13:05:12,144 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 324 transitions. Word has length 311 [2018-10-15 13:05:12,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:12,144 INFO L481 AbstractCegarLoop]: Abstraction has 323 states and 324 transitions. [2018-10-15 13:05:12,144 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-15 13:05:12,145 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 324 transitions. [2018-10-15 13:05:12,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-10-15 13:05:12,146 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:12,146 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:12,147 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:12,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:12,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1688542289, now seen corresponding path program 33 times [2018-10-15 13:05:12,148 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:12,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:14,073 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 1581 proven. 969 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:05:14,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:14,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-15 13:05:14,074 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-15 13:05:14,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-15 13:05:14,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=721, Invalid=4535, Unknown=0, NotChecked=0, Total=5256 [2018-10-15 13:05:14,075 INFO L87 Difference]: Start difference. First operand 323 states and 324 transitions. Second operand 73 states. [2018-10-15 13:05:18,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:18,003 INFO L93 Difference]: Finished difference Result 521 states and 522 transitions. [2018-10-15 13:05:18,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-10-15 13:05:18,003 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 322 [2018-10-15 13:05:18,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:18,004 INFO L225 Difference]: With dead ends: 521 [2018-10-15 13:05:18,004 INFO L226 Difference]: Without dead ends: 332 [2018-10-15 13:05:18,005 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6748 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=4080, Invalid=21360, Unknown=0, NotChecked=0, Total=25440 [2018-10-15 13:05:18,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-10-15 13:05:18,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 330. [2018-10-15 13:05:18,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-10-15 13:05:18,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 331 transitions. [2018-10-15 13:05:18,009 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 331 transitions. Word has length 322 [2018-10-15 13:05:18,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:18,009 INFO L481 AbstractCegarLoop]: Abstraction has 330 states and 331 transitions. [2018-10-15 13:05:18,009 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-15 13:05:18,009 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 331 transitions. [2018-10-15 13:05:18,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2018-10-15 13:05:18,011 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:18,011 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:18,011 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:18,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:18,012 INFO L82 PathProgramCache]: Analyzing trace with hash 2072365376, now seen corresponding path program 34 times [2018-10-15 13:05:18,013 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:18,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:19,720 INFO L134 CoverageAnalysis]: Checked inductivity of 2670 backedges. 1089 proven. 1581 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:05:19,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:19,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-10-15 13:05:19,721 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-15 13:05:19,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-15 13:05:19,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=615, Invalid=2925, Unknown=0, NotChecked=0, Total=3540 [2018-10-15 13:05:19,722 INFO L87 Difference]: Start difference. First operand 330 states and 331 transitions. Second operand 60 states. [2018-10-15 13:05:23,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:23,001 INFO L93 Difference]: Finished difference Result 354 states and 355 transitions. [2018-10-15 13:05:23,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-10-15 13:05:23,002 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 329 [2018-10-15 13:05:23,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:23,004 INFO L225 Difference]: With dead ends: 354 [2018-10-15 13:05:23,005 INFO L226 Difference]: Without dead ends: 354 [2018-10-15 13:05:23,007 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8957 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5067, Invalid=22655, Unknown=0, NotChecked=0, Total=27722 [2018-10-15 13:05:23,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-10-15 13:05:23,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 341. [2018-10-15 13:05:23,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-10-15 13:05:23,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 342 transitions. [2018-10-15 13:05:23,012 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 342 transitions. Word has length 329 [2018-10-15 13:05:23,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:23,012 INFO L481 AbstractCegarLoop]: Abstraction has 341 states and 342 transitions. [2018-10-15 13:05:23,012 INFO L482 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-15 13:05:23,012 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 342 transitions. [2018-10-15 13:05:23,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2018-10-15 13:05:23,014 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:23,014 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:23,015 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:23,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:23,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1770334638, now seen corresponding path program 35 times [2018-10-15 13:05:23,016 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:23,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:24,855 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 1773 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:05:24,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:24,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-10-15 13:05:24,856 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-15 13:05:24,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-15 13:05:24,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=799, Invalid=5053, Unknown=0, NotChecked=0, Total=5852 [2018-10-15 13:05:24,857 INFO L87 Difference]: Start difference. First operand 341 states and 342 transitions. Second operand 77 states. [2018-10-15 13:05:29,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:29,246 INFO L93 Difference]: Finished difference Result 550 states and 551 transitions. [2018-10-15 13:05:29,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-10-15 13:05:29,246 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 340 [2018-10-15 13:05:29,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:29,247 INFO L225 Difference]: With dead ends: 550 [2018-10-15 13:05:29,247 INFO L226 Difference]: Without dead ends: 350 [2018-10-15 13:05:29,249 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7568 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=4535, Invalid=23857, Unknown=0, NotChecked=0, Total=28392 [2018-10-15 13:05:29,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-10-15 13:05:29,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 348. [2018-10-15 13:05:29,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-10-15 13:05:29,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 349 transitions. [2018-10-15 13:05:29,254 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 349 transitions. Word has length 340 [2018-10-15 13:05:29,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:29,254 INFO L481 AbstractCegarLoop]: Abstraction has 348 states and 349 transitions. [2018-10-15 13:05:29,254 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-15 13:05:29,254 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 349 transitions. [2018-10-15 13:05:29,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2018-10-15 13:05:29,256 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:29,256 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:29,256 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:29,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:29,257 INFO L82 PathProgramCache]: Analyzing trace with hash 975318271, now seen corresponding path program 36 times [2018-10-15 13:05:29,257 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:29,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:30,582 INFO L134 CoverageAnalysis]: Checked inductivity of 2989 backedges. 1216 proven. 1773 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:05:30,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:30,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-15 13:05:30,583 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-15 13:05:30,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-15 13:05:30,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=677, Invalid=3229, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 13:05:30,584 INFO L87 Difference]: Start difference. First operand 348 states and 349 transitions. Second operand 63 states. [2018-10-15 13:05:34,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:34,526 INFO L93 Difference]: Finished difference Result 372 states and 373 transitions. [2018-10-15 13:05:34,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2018-10-15 13:05:34,527 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 347 [2018-10-15 13:05:34,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:34,529 INFO L225 Difference]: With dead ends: 372 [2018-10-15 13:05:34,529 INFO L226 Difference]: Without dead ends: 372 [2018-10-15 13:05:34,531 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9987 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5614, Invalid=25186, Unknown=0, NotChecked=0, Total=30800 [2018-10-15 13:05:34,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2018-10-15 13:05:34,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 359. [2018-10-15 13:05:34,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-10-15 13:05:34,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 360 transitions. [2018-10-15 13:05:34,535 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 360 transitions. Word has length 347 [2018-10-15 13:05:34,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:34,535 INFO L481 AbstractCegarLoop]: Abstraction has 359 states and 360 transitions. [2018-10-15 13:05:34,535 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-15 13:05:34,535 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 360 transitions. [2018-10-15 13:05:34,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2018-10-15 13:05:34,537 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:34,537 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:34,538 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:34,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:34,538 INFO L82 PathProgramCache]: Analyzing trace with hash 568805519, now seen corresponding path program 37 times [2018-10-15 13:05:34,539 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:34,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:36,925 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 1976 proven. 1216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:05:36,926 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:36,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-15 13:05:36,926 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-15 13:05:36,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-15 13:05:36,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=881, Invalid=5599, Unknown=0, NotChecked=0, Total=6480 [2018-10-15 13:05:36,927 INFO L87 Difference]: Start difference. First operand 359 states and 360 transitions. Second operand 81 states. [2018-10-15 13:05:41,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:41,662 INFO L93 Difference]: Finished difference Result 579 states and 580 transitions. [2018-10-15 13:05:41,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-10-15 13:05:41,662 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 358 [2018-10-15 13:05:41,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:41,663 INFO L225 Difference]: With dead ends: 579 [2018-10-15 13:05:41,663 INFO L226 Difference]: Without dead ends: 368 [2018-10-15 13:05:41,665 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8435 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=5014, Invalid=26492, Unknown=0, NotChecked=0, Total=31506 [2018-10-15 13:05:41,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-10-15 13:05:41,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 366. [2018-10-15 13:05:41,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-10-15 13:05:41,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 367 transitions. [2018-10-15 13:05:41,669 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 367 transitions. Word has length 358 [2018-10-15 13:05:41,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:41,669 INFO L481 AbstractCegarLoop]: Abstraction has 366 states and 367 transitions. [2018-10-15 13:05:41,669 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-15 13:05:41,669 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 367 transitions. [2018-10-15 13:05:41,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2018-10-15 13:05:41,671 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:41,671 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:41,671 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:41,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:41,672 INFO L82 PathProgramCache]: Analyzing trace with hash -145589856, now seen corresponding path program 38 times [2018-10-15 13:05:41,672 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:41,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:43,155 INFO L134 CoverageAnalysis]: Checked inductivity of 3326 backedges. 1350 proven. 1976 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:05:43,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:43,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-10-15 13:05:43,156 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-15 13:05:43,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-15 13:05:43,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=742, Invalid=3548, Unknown=0, NotChecked=0, Total=4290 [2018-10-15 13:05:43,157 INFO L87 Difference]: Start difference. First operand 366 states and 367 transitions. Second operand 66 states. [2018-10-15 13:05:47,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:47,626 INFO L93 Difference]: Finished difference Result 390 states and 391 transitions. [2018-10-15 13:05:47,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-10-15 13:05:47,627 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 365 [2018-10-15 13:05:47,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:47,629 INFO L225 Difference]: With dead ends: 390 [2018-10-15 13:05:47,629 INFO L226 Difference]: Without dead ends: 390 [2018-10-15 13:05:47,631 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11073 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6189, Invalid=27851, Unknown=0, NotChecked=0, Total=34040 [2018-10-15 13:05:47,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2018-10-15 13:05:47,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 377. [2018-10-15 13:05:47,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2018-10-15 13:05:47,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 378 transitions. [2018-10-15 13:05:47,635 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 378 transitions. Word has length 365 [2018-10-15 13:05:47,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:47,636 INFO L481 AbstractCegarLoop]: Abstraction has 377 states and 378 transitions. [2018-10-15 13:05:47,636 INFO L482 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-15 13:05:47,636 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 378 transitions. [2018-10-15 13:05:47,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2018-10-15 13:05:47,638 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:47,638 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:47,638 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:47,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:47,639 INFO L82 PathProgramCache]: Analyzing trace with hash -628589234, now seen corresponding path program 39 times [2018-10-15 13:05:47,639 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:47,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:49,675 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 2190 proven. 1350 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:05:49,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:49,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-10-15 13:05:49,676 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-15 13:05:49,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-15 13:05:49,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=967, Invalid=6173, Unknown=0, NotChecked=0, Total=7140 [2018-10-15 13:05:49,677 INFO L87 Difference]: Start difference. First operand 377 states and 378 transitions. Second operand 85 states. [2018-10-15 13:05:54,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:54,846 INFO L93 Difference]: Finished difference Result 608 states and 609 transitions. [2018-10-15 13:05:54,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-10-15 13:05:54,846 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 376 [2018-10-15 13:05:54,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:54,847 INFO L225 Difference]: With dead ends: 608 [2018-10-15 13:05:54,847 INFO L226 Difference]: Without dead ends: 386 [2018-10-15 13:05:54,848 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9349 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=5517, Invalid=29265, Unknown=0, NotChecked=0, Total=34782 [2018-10-15 13:05:54,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-10-15 13:05:54,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 384. [2018-10-15 13:05:54,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2018-10-15 13:05:54,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 385 transitions. [2018-10-15 13:05:54,852 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 385 transitions. Word has length 376 [2018-10-15 13:05:54,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:54,852 INFO L481 AbstractCegarLoop]: Abstraction has 384 states and 385 transitions. [2018-10-15 13:05:54,852 INFO L482 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-15 13:05:54,852 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 385 transitions. [2018-10-15 13:05:54,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2018-10-15 13:05:54,854 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:54,854 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:54,854 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:54,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:54,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1875252193, now seen corresponding path program 40 times [2018-10-15 13:05:54,855 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:54,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:56,367 INFO L134 CoverageAnalysis]: Checked inductivity of 3681 backedges. 1491 proven. 2190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:05:56,367 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:56,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-15 13:05:56,368 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-15 13:05:56,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-15 13:05:56,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=810, Invalid=3882, Unknown=0, NotChecked=0, Total=4692 [2018-10-15 13:05:56,369 INFO L87 Difference]: Start difference. First operand 384 states and 385 transitions. Second operand 69 states. [2018-10-15 13:06:01,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:06:01,002 INFO L93 Difference]: Finished difference Result 408 states and 409 transitions. [2018-10-15 13:06:01,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-10-15 13:06:01,002 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 383 [2018-10-15 13:06:01,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:06:01,005 INFO L225 Difference]: With dead ends: 408 [2018-10-15 13:06:01,005 INFO L226 Difference]: Without dead ends: 408 [2018-10-15 13:06:01,007 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12215 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6792, Invalid=30650, Unknown=0, NotChecked=0, Total=37442 [2018-10-15 13:06:01,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2018-10-15 13:06:01,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 395. [2018-10-15 13:06:01,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-10-15 13:06:01,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 396 transitions. [2018-10-15 13:06:01,011 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 396 transitions. Word has length 383 [2018-10-15 13:06:01,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:06:01,012 INFO L481 AbstractCegarLoop]: Abstraction has 395 states and 396 transitions. [2018-10-15 13:06:01,012 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-15 13:06:01,012 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 396 transitions. [2018-10-15 13:06:01,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2018-10-15 13:06:01,014 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:06:01,014 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:06:01,015 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:06:01,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:06:01,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1745278319, now seen corresponding path program 41 times [2018-10-15 13:06:01,016 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:06:01,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:06:03,362 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 2415 proven. 1491 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:06:03,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:06:03,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-10-15 13:06:03,363 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-15 13:06:03,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-15 13:06:03,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1057, Invalid=6775, Unknown=0, NotChecked=0, Total=7832 [2018-10-15 13:06:03,364 INFO L87 Difference]: Start difference. First operand 395 states and 396 transitions. Second operand 89 states. [2018-10-15 13:06:08,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:06:08,280 INFO L93 Difference]: Finished difference Result 637 states and 638 transitions. [2018-10-15 13:06:08,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-10-15 13:06:08,280 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 394 [2018-10-15 13:06:08,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:06:08,281 INFO L225 Difference]: With dead ends: 637 [2018-10-15 13:06:08,281 INFO L226 Difference]: Without dead ends: 404 [2018-10-15 13:06:08,283 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10310 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=6044, Invalid=32176, Unknown=0, NotChecked=0, Total=38220 [2018-10-15 13:06:08,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2018-10-15 13:06:08,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 402. [2018-10-15 13:06:08,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2018-10-15 13:06:08,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 403 transitions. [2018-10-15 13:06:08,287 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 403 transitions. Word has length 394 [2018-10-15 13:06:08,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:06:08,287 INFO L481 AbstractCegarLoop]: Abstraction has 402 states and 403 transitions. [2018-10-15 13:06:08,287 INFO L482 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-15 13:06:08,287 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 403 transitions. [2018-10-15 13:06:08,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2018-10-15 13:06:08,289 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:06:08,290 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:06:08,290 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:06:08,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:06:08,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1852665344, now seen corresponding path program 42 times [2018-10-15 13:06:08,291 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:06:08,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:06:10,208 INFO L134 CoverageAnalysis]: Checked inductivity of 4054 backedges. 1639 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:06:10,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:06:10,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-10-15 13:06:10,209 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-15 13:06:10,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-15 13:06:10,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=881, Invalid=4231, Unknown=0, NotChecked=0, Total=5112 [2018-10-15 13:06:10,210 INFO L87 Difference]: Start difference. First operand 402 states and 403 transitions. Second operand 72 states. [2018-10-15 13:06:15,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:06:15,214 INFO L93 Difference]: Finished difference Result 426 states and 427 transitions. [2018-10-15 13:06:15,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2018-10-15 13:06:15,214 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 401 [2018-10-15 13:06:15,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:06:15,216 INFO L225 Difference]: With dead ends: 426 [2018-10-15 13:06:15,217 INFO L226 Difference]: Without dead ends: 426 [2018-10-15 13:06:15,219 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13413 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=7423, Invalid=33583, Unknown=0, NotChecked=0, Total=41006 [2018-10-15 13:06:15,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2018-10-15 13:06:15,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 413. [2018-10-15 13:06:15,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2018-10-15 13:06:15,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 414 transitions. [2018-10-15 13:06:15,224 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 414 transitions. Word has length 401 [2018-10-15 13:06:15,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:06:15,225 INFO L481 AbstractCegarLoop]: Abstraction has 413 states and 414 transitions. [2018-10-15 13:06:15,225 INFO L482 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-15 13:06:15,225 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 414 transitions. [2018-10-15 13:06:15,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2018-10-15 13:06:15,227 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:06:15,227 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:06:15,227 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:06:15,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:06:15,228 INFO L82 PathProgramCache]: Analyzing trace with hash -496539410, now seen corresponding path program 43 times [2018-10-15 13:06:15,228 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:06:15,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:06:18,021 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 2651 proven. 1639 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:06:18,021 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:06:18,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-15 13:06:18,022 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-15 13:06:18,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-15 13:06:18,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1151, Invalid=7405, Unknown=0, NotChecked=0, Total=8556 [2018-10-15 13:06:18,023 INFO L87 Difference]: Start difference. First operand 413 states and 414 transitions. Second operand 93 states. [2018-10-15 13:06:24,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:06:24,199 INFO L93 Difference]: Finished difference Result 666 states and 667 transitions. [2018-10-15 13:06:24,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2018-10-15 13:06:24,200 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 412 [2018-10-15 13:06:24,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:06:24,201 INFO L225 Difference]: With dead ends: 666 [2018-10-15 13:06:24,201 INFO L226 Difference]: Without dead ends: 422 [2018-10-15 13:06:24,202 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11318 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=6595, Invalid=35225, Unknown=0, NotChecked=0, Total=41820 [2018-10-15 13:06:24,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2018-10-15 13:06:24,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 420. [2018-10-15 13:06:24,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2018-10-15 13:06:24,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 421 transitions. [2018-10-15 13:06:24,206 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 421 transitions. Word has length 412 [2018-10-15 13:06:24,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:06:24,206 INFO L481 AbstractCegarLoop]: Abstraction has 420 states and 421 transitions. [2018-10-15 13:06:24,207 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-15 13:06:24,207 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 421 transitions. [2018-10-15 13:06:24,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2018-10-15 13:06:24,209 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:06:24,209 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:06:24,209 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:06:24,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:06:24,210 INFO L82 PathProgramCache]: Analyzing trace with hash 2088600383, now seen corresponding path program 44 times [2018-10-15 13:06:24,210 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:06:24,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:06:26,061 INFO L134 CoverageAnalysis]: Checked inductivity of 4445 backedges. 1794 proven. 2651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:06:26,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:06:26,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-15 13:06:26,062 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-15 13:06:26,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-15 13:06:26,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=955, Invalid=4595, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 13:06:26,063 INFO L87 Difference]: Start difference. First operand 420 states and 421 transitions. Second operand 75 states. [2018-10-15 13:06:30,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:06:30,860 INFO L93 Difference]: Finished difference Result 444 states and 445 transitions. [2018-10-15 13:06:30,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2018-10-15 13:06:30,860 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 419 [2018-10-15 13:06:30,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:06:30,863 INFO L225 Difference]: With dead ends: 444 [2018-10-15 13:06:30,863 INFO L226 Difference]: Without dead ends: 444 [2018-10-15 13:06:30,864 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14667 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=8082, Invalid=36650, Unknown=0, NotChecked=0, Total=44732 [2018-10-15 13:06:30,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2018-10-15 13:06:30,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 431. [2018-10-15 13:06:30,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2018-10-15 13:06:30,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 432 transitions. [2018-10-15 13:06:30,868 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 432 transitions. Word has length 419 [2018-10-15 13:06:30,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:06:30,868 INFO L481 AbstractCegarLoop]: Abstraction has 431 states and 432 transitions. [2018-10-15 13:06:30,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-15 13:06:30,868 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 432 transitions. [2018-10-15 13:06:30,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2018-10-15 13:06:30,870 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:06:30,870 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:06:30,870 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:06:30,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:06:30,871 INFO L82 PathProgramCache]: Analyzing trace with hash 44272207, now seen corresponding path program 45 times [2018-10-15 13:06:30,871 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:06:30,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:06:33,862 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 2898 proven. 1794 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:06:33,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:06:33,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-10-15 13:06:33,863 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-10-15 13:06:33,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-10-15 13:06:33,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1249, Invalid=8063, Unknown=0, NotChecked=0, Total=9312 [2018-10-15 13:06:33,864 INFO L87 Difference]: Start difference. First operand 431 states and 432 transitions. Second operand 97 states. [2018-10-15 13:06:40,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:06:40,360 INFO L93 Difference]: Finished difference Result 695 states and 696 transitions. [2018-10-15 13:06:40,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-10-15 13:06:40,360 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 430 [2018-10-15 13:06:40,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:06:40,362 INFO L225 Difference]: With dead ends: 695 [2018-10-15 13:06:40,362 INFO L226 Difference]: Without dead ends: 440 [2018-10-15 13:06:40,364 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12373 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=7170, Invalid=38412, Unknown=0, NotChecked=0, Total=45582 [2018-10-15 13:06:40,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2018-10-15 13:06:40,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 438. [2018-10-15 13:06:40,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2018-10-15 13:06:40,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 439 transitions. [2018-10-15 13:06:40,367 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 439 transitions. Word has length 430 [2018-10-15 13:06:40,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:06:40,368 INFO L481 AbstractCegarLoop]: Abstraction has 438 states and 439 transitions. [2018-10-15 13:06:40,368 INFO L482 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-10-15 13:06:40,368 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 439 transitions. [2018-10-15 13:06:40,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2018-10-15 13:06:40,371 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:06:40,371 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:06:40,371 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:06:40,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:06:40,372 INFO L82 PathProgramCache]: Analyzing trace with hash -468708768, now seen corresponding path program 46 times [2018-10-15 13:06:40,372 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:06:40,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:06:42,249 INFO L134 CoverageAnalysis]: Checked inductivity of 4854 backedges. 1956 proven. 2898 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:06:42,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:06:42,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-10-15 13:06:42,250 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-15 13:06:42,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-15 13:06:42,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1032, Invalid=4974, Unknown=0, NotChecked=0, Total=6006 [2018-10-15 13:06:42,251 INFO L87 Difference]: Start difference. First operand 438 states and 439 transitions. Second operand 78 states. [2018-10-15 13:06:47,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:06:47,576 INFO L93 Difference]: Finished difference Result 462 states and 463 transitions. [2018-10-15 13:06:47,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2018-10-15 13:06:47,577 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 437 [2018-10-15 13:06:47,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:06:47,578 INFO L225 Difference]: With dead ends: 462 [2018-10-15 13:06:47,578 INFO L226 Difference]: Without dead ends: 462 [2018-10-15 13:06:47,581 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15977 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=8769, Invalid=39851, Unknown=0, NotChecked=0, Total=48620 [2018-10-15 13:06:47,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2018-10-15 13:06:47,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 449. [2018-10-15 13:06:47,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2018-10-15 13:06:47,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 450 transitions. [2018-10-15 13:06:47,585 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 450 transitions. Word has length 437 [2018-10-15 13:06:47,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:06:47,585 INFO L481 AbstractCegarLoop]: Abstraction has 449 states and 450 transitions. [2018-10-15 13:06:47,585 INFO L482 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-15 13:06:47,585 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 450 transitions. [2018-10-15 13:06:47,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2018-10-15 13:06:47,587 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:06:47,587 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:06:47,587 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:06:47,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:06:47,588 INFO L82 PathProgramCache]: Analyzing trace with hash -988287858, now seen corresponding path program 47 times [2018-10-15 13:06:47,588 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:06:47,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:06:50,479 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 3156 proven. 1956 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:06:50,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:06:50,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-10-15 13:06:50,480 INFO L460 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-10-15 13:06:50,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-10-15 13:06:50,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1351, Invalid=8749, Unknown=0, NotChecked=0, Total=10100 [2018-10-15 13:06:50,481 INFO L87 Difference]: Start difference. First operand 449 states and 450 transitions. Second operand 101 states. [2018-10-15 13:06:57,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:06:57,506 INFO L93 Difference]: Finished difference Result 724 states and 725 transitions. [2018-10-15 13:06:57,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2018-10-15 13:06:57,507 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 448 [2018-10-15 13:06:57,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:06:57,508 INFO L225 Difference]: With dead ends: 724 [2018-10-15 13:06:57,508 INFO L226 Difference]: Without dead ends: 458 [2018-10-15 13:06:57,509 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13475 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=7769, Invalid=41737, Unknown=0, NotChecked=0, Total=49506 [2018-10-15 13:06:57,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2018-10-15 13:06:57,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 456. [2018-10-15 13:06:57,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2018-10-15 13:06:57,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 457 transitions. [2018-10-15 13:06:57,514 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 457 transitions. Word has length 448 [2018-10-15 13:06:57,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:06:57,515 INFO L481 AbstractCegarLoop]: Abstraction has 456 states and 457 transitions. [2018-10-15 13:06:57,515 INFO L482 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-10-15 13:06:57,515 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 457 transitions. [2018-10-15 13:06:57,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 456 [2018-10-15 13:06:57,517 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:06:57,517 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:06:57,518 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:06:57,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:06:57,518 INFO L82 PathProgramCache]: Analyzing trace with hash -809307553, now seen corresponding path program 48 times [2018-10-15 13:06:57,519 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:06:57,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:06:59,787 INFO L134 CoverageAnalysis]: Checked inductivity of 5281 backedges. 2125 proven. 3156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:06:59,787 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:06:59,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-15 13:06:59,788 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-15 13:06:59,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-15 13:06:59,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1112, Invalid=5368, Unknown=0, NotChecked=0, Total=6480 [2018-10-15 13:06:59,789 INFO L87 Difference]: Start difference. First operand 456 states and 457 transitions. Second operand 81 states. [2018-10-15 13:07:06,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:06,092 INFO L93 Difference]: Finished difference Result 480 states and 481 transitions. [2018-10-15 13:07:06,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2018-10-15 13:07:06,092 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 455 [2018-10-15 13:07:06,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:06,094 INFO L225 Difference]: With dead ends: 480 [2018-10-15 13:07:06,094 INFO L226 Difference]: Without dead ends: 480 [2018-10-15 13:07:06,098 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17343 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=9484, Invalid=43186, Unknown=0, NotChecked=0, Total=52670 [2018-10-15 13:07:06,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2018-10-15 13:07:06,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 467. [2018-10-15 13:07:06,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2018-10-15 13:07:06,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 468 transitions. [2018-10-15 13:07:06,103 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 468 transitions. Word has length 455 [2018-10-15 13:07:06,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:06,103 INFO L481 AbstractCegarLoop]: Abstraction has 467 states and 468 transitions. [2018-10-15 13:07:06,103 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-15 13:07:06,103 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 468 transitions. [2018-10-15 13:07:06,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2018-10-15 13:07:06,106 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:06,106 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:06,106 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:06,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:06,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1596417839, now seen corresponding path program 49 times [2018-10-15 13:07:06,107 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:06,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:09,338 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 3425 proven. 2125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:07:09,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:09,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-10-15 13:07:09,339 INFO L460 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-10-15 13:07:09,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-10-15 13:07:09,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1457, Invalid=9463, Unknown=0, NotChecked=0, Total=10920 [2018-10-15 13:07:09,340 INFO L87 Difference]: Start difference. First operand 467 states and 468 transitions. Second operand 105 states. [2018-10-15 13:07:17,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:17,067 INFO L93 Difference]: Finished difference Result 753 states and 754 transitions. [2018-10-15 13:07:17,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2018-10-15 13:07:17,067 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 466 [2018-10-15 13:07:17,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:17,069 INFO L225 Difference]: With dead ends: 753 [2018-10-15 13:07:17,069 INFO L226 Difference]: Without dead ends: 476 [2018-10-15 13:07:17,071 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14624 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=8392, Invalid=45200, Unknown=0, NotChecked=0, Total=53592 [2018-10-15 13:07:17,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2018-10-15 13:07:17,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 474. [2018-10-15 13:07:17,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2018-10-15 13:07:17,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 475 transitions. [2018-10-15 13:07:17,075 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 475 transitions. Word has length 466 [2018-10-15 13:07:17,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:17,075 INFO L481 AbstractCegarLoop]: Abstraction has 474 states and 475 transitions. [2018-10-15 13:07:17,075 INFO L482 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-10-15 13:07:17,075 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 475 transitions. [2018-10-15 13:07:17,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2018-10-15 13:07:17,077 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:17,078 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:17,078 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:17,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:17,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1897200320, now seen corresponding path program 50 times [2018-10-15 13:07:17,079 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:17,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:19,572 INFO L134 CoverageAnalysis]: Checked inductivity of 5726 backedges. 2301 proven. 3425 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:07:19,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:19,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-10-15 13:07:19,573 INFO L460 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-10-15 13:07:19,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-10-15 13:07:19,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1195, Invalid=5777, Unknown=0, NotChecked=0, Total=6972 [2018-10-15 13:07:19,574 INFO L87 Difference]: Start difference. First operand 474 states and 475 transitions. Second operand 84 states. [2018-10-15 13:07:26,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:26,313 INFO L93 Difference]: Finished difference Result 498 states and 499 transitions. [2018-10-15 13:07:26,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2018-10-15 13:07:26,314 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 473 [2018-10-15 13:07:26,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:26,317 INFO L225 Difference]: With dead ends: 498 [2018-10-15 13:07:26,317 INFO L226 Difference]: Without dead ends: 498 [2018-10-15 13:07:26,318 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18765 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=10227, Invalid=46655, Unknown=0, NotChecked=0, Total=56882 [2018-10-15 13:07:26,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2018-10-15 13:07:26,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 485. [2018-10-15 13:07:26,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2018-10-15 13:07:26,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 486 transitions. [2018-10-15 13:07:26,322 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 486 transitions. Word has length 473 [2018-10-15 13:07:26,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:26,322 INFO L481 AbstractCegarLoop]: Abstraction has 485 states and 486 transitions. [2018-10-15 13:07:26,322 INFO L482 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-10-15 13:07:26,322 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 486 transitions. [2018-10-15 13:07:26,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2018-10-15 13:07:26,324 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:26,325 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:26,325 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:26,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:26,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1911551954, now seen corresponding path program 51 times [2018-10-15 13:07:26,326 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:26,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:29,604 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 3705 proven. 2301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:07:29,605 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:29,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-10-15 13:07:29,605 INFO L460 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-10-15 13:07:29,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-10-15 13:07:29,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1567, Invalid=10205, Unknown=0, NotChecked=0, Total=11772 [2018-10-15 13:07:29,606 INFO L87 Difference]: Start difference. First operand 485 states and 486 transitions. Second operand 109 states. [2018-10-15 13:07:36,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:36,895 INFO L93 Difference]: Finished difference Result 782 states and 783 transitions. [2018-10-15 13:07:36,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2018-10-15 13:07:36,896 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 484 [2018-10-15 13:07:36,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:36,897 INFO L225 Difference]: With dead ends: 782 [2018-10-15 13:07:36,897 INFO L226 Difference]: Without dead ends: 494 [2018-10-15 13:07:36,899 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 239 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15820 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=9039, Invalid=48801, Unknown=0, NotChecked=0, Total=57840 [2018-10-15 13:07:36,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2018-10-15 13:07:36,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 492. [2018-10-15 13:07:36,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 492 states. [2018-10-15 13:07:36,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 493 transitions. [2018-10-15 13:07:36,903 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 493 transitions. Word has length 484 [2018-10-15 13:07:36,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:36,903 INFO L481 AbstractCegarLoop]: Abstraction has 492 states and 493 transitions. [2018-10-15 13:07:36,903 INFO L482 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-10-15 13:07:36,903 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 493 transitions. [2018-10-15 13:07:36,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2018-10-15 13:07:36,905 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:36,905 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:36,906 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:36,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:36,906 INFO L82 PathProgramCache]: Analyzing trace with hash 845166975, now seen corresponding path program 52 times [2018-10-15 13:07:36,906 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:36,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:39,519 INFO L134 CoverageAnalysis]: Checked inductivity of 6189 backedges. 2484 proven. 3705 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:07:39,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:39,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-15 13:07:39,520 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-15 13:07:39,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-15 13:07:39,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1281, Invalid=6201, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 13:07:39,520 INFO L87 Difference]: Start difference. First operand 492 states and 493 transitions. Second operand 87 states. [2018-10-15 13:07:46,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:46,578 INFO L93 Difference]: Finished difference Result 516 states and 517 transitions. [2018-10-15 13:07:46,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2018-10-15 13:07:46,578 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 491 [2018-10-15 13:07:46,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:46,581 INFO L225 Difference]: With dead ends: 516 [2018-10-15 13:07:46,581 INFO L226 Difference]: Without dead ends: 516 [2018-10-15 13:07:46,584 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20243 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=10998, Invalid=50258, Unknown=0, NotChecked=0, Total=61256 [2018-10-15 13:07:46,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2018-10-15 13:07:46,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 503. [2018-10-15 13:07:46,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2018-10-15 13:07:46,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 504 transitions. [2018-10-15 13:07:46,587 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 504 transitions. Word has length 491 [2018-10-15 13:07:46,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:46,588 INFO L481 AbstractCegarLoop]: Abstraction has 503 states and 504 transitions. [2018-10-15 13:07:46,588 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-15 13:07:46,588 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 504 transitions. [2018-10-15 13:07:46,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2018-10-15 13:07:46,590 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:46,590 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:46,590 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:46,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:46,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1669098511, now seen corresponding path program 53 times [2018-10-15 13:07:46,591 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:46,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:50,223 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 3996 proven. 2484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:07:50,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:50,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-10-15 13:07:50,224 INFO L460 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-10-15 13:07:50,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-10-15 13:07:50,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1681, Invalid=10975, Unknown=0, NotChecked=0, Total=12656 [2018-10-15 13:07:50,224 INFO L87 Difference]: Start difference. First operand 503 states and 504 transitions. Second operand 113 states. [2018-10-15 13:07:58,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:58,248 INFO L93 Difference]: Finished difference Result 811 states and 812 transitions. [2018-10-15 13:07:58,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2018-10-15 13:07:58,248 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 502 [2018-10-15 13:07:58,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:58,250 INFO L225 Difference]: With dead ends: 811 [2018-10-15 13:07:58,250 INFO L226 Difference]: Without dead ends: 512 [2018-10-15 13:07:58,252 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17063 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=9710, Invalid=52540, Unknown=0, NotChecked=0, Total=62250 [2018-10-15 13:07:58,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2018-10-15 13:07:58,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 510. [2018-10-15 13:07:58,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2018-10-15 13:07:58,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 511 transitions. [2018-10-15 13:07:58,255 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 511 transitions. Word has length 502 [2018-10-15 13:07:58,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:58,255 INFO L481 AbstractCegarLoop]: Abstraction has 510 states and 511 transitions. [2018-10-15 13:07:58,255 INFO L482 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-10-15 13:07:58,256 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 511 transitions. [2018-10-15 13:07:58,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 510 [2018-10-15 13:07:58,257 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:58,258 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 27, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:58,258 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:58,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:58,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1131105056, now seen corresponding path program 54 times [2018-10-15 13:07:58,259 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:58,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:08:00,870 INFO L134 CoverageAnalysis]: Checked inductivity of 6670 backedges. 2674 proven. 3996 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:08:00,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:08:00,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-10-15 13:08:00,871 INFO L460 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-10-15 13:08:00,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-10-15 13:08:00,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1370, Invalid=6640, Unknown=0, NotChecked=0, Total=8010 [2018-10-15 13:08:00,871 INFO L87 Difference]: Start difference. First operand 510 states and 511 transitions. Second operand 90 states. [2018-10-15 13:08:08,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:08:08,272 INFO L93 Difference]: Finished difference Result 534 states and 535 transitions. [2018-10-15 13:08:08,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 199 states. [2018-10-15 13:08:08,273 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 509 [2018-10-15 13:08:08,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:08:08,276 INFO L225 Difference]: With dead ends: 534 [2018-10-15 13:08:08,276 INFO L226 Difference]: Without dead ends: 534 [2018-10-15 13:08:08,278 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 255 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21777 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=11797, Invalid=53995, Unknown=0, NotChecked=0, Total=65792 [2018-10-15 13:08:08,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2018-10-15 13:08:08,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 521. [2018-10-15 13:08:08,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2018-10-15 13:08:08,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 522 transitions. [2018-10-15 13:08:08,282 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 522 transitions. Word has length 509 [2018-10-15 13:08:08,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:08:08,282 INFO L481 AbstractCegarLoop]: Abstraction has 521 states and 522 transitions. [2018-10-15 13:08:08,282 INFO L482 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-10-15 13:08:08,283 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 522 transitions. [2018-10-15 13:08:08,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2018-10-15 13:08:08,284 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:08:08,285 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:08:08,285 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:08:08,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:08:08,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1883618254, now seen corresponding path program 55 times [2018-10-15 13:08:08,286 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:08:08,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:08:12,079 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 4298 proven. 2674 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:08:12,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:08:12,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-10-15 13:08:12,080 INFO L460 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-10-15 13:08:12,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-10-15 13:08:12,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1799, Invalid=11773, Unknown=0, NotChecked=0, Total=13572 [2018-10-15 13:08:12,081 INFO L87 Difference]: Start difference. First operand 521 states and 522 transitions. Second operand 117 states. [2018-10-15 13:08:21,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:08:21,577 INFO L93 Difference]: Finished difference Result 840 states and 841 transitions. [2018-10-15 13:08:21,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2018-10-15 13:08:21,577 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 520 [2018-10-15 13:08:21,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:08:21,579 INFO L225 Difference]: With dead ends: 840 [2018-10-15 13:08:21,579 INFO L226 Difference]: Without dead ends: 530 [2018-10-15 13:08:21,581 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 257 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18353 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=10405, Invalid=56417, Unknown=0, NotChecked=0, Total=66822 [2018-10-15 13:08:21,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2018-10-15 13:08:21,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 528. [2018-10-15 13:08:21,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2018-10-15 13:08:21,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 529 transitions. [2018-10-15 13:08:21,585 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 529 transitions. Word has length 520 [2018-10-15 13:08:21,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:08:21,585 INFO L481 AbstractCegarLoop]: Abstraction has 528 states and 529 transitions. [2018-10-15 13:08:21,585 INFO L482 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-10-15 13:08:21,585 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 529 transitions. [2018-10-15 13:08:21,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2018-10-15 13:08:21,587 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:08:21,588 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 28, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:08:21,588 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:08:21,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:08:21,588 INFO L82 PathProgramCache]: Analyzing trace with hash -2077534049, now seen corresponding path program 56 times [2018-10-15 13:08:21,589 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:08:21,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:08:24,129 INFO L134 CoverageAnalysis]: Checked inductivity of 7169 backedges. 2871 proven. 4298 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:08:24,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:08:24,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-15 13:08:24,130 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-15 13:08:24,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-15 13:08:24,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1462, Invalid=7094, Unknown=0, NotChecked=0, Total=8556 [2018-10-15 13:08:24,131 INFO L87 Difference]: Start difference. First operand 528 states and 529 transitions. Second operand 93 states. [2018-10-15 13:08:32,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:08:32,430 INFO L93 Difference]: Finished difference Result 552 states and 553 transitions. [2018-10-15 13:08:32,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 206 states. [2018-10-15 13:08:32,431 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 527 [2018-10-15 13:08:32,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:08:32,434 INFO L225 Difference]: With dead ends: 552 [2018-10-15 13:08:32,434 INFO L226 Difference]: Without dead ends: 552 [2018-10-15 13:08:32,437 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 264 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23367 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=12624, Invalid=57866, Unknown=0, NotChecked=0, Total=70490 [2018-10-15 13:08:32,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2018-10-15 13:08:32,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 539. [2018-10-15 13:08:32,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-10-15 13:08:32,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 540 transitions. [2018-10-15 13:08:32,441 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 540 transitions. Word has length 527 [2018-10-15 13:08:32,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:08:32,441 INFO L481 AbstractCegarLoop]: Abstraction has 539 states and 540 transitions. [2018-10-15 13:08:32,441 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-15 13:08:32,441 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 540 transitions. [2018-10-15 13:08:32,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2018-10-15 13:08:32,443 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:08:32,444 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:08:32,444 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:08:32,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:08:32,444 INFO L82 PathProgramCache]: Analyzing trace with hash 235706607, now seen corresponding path program 57 times [2018-10-15 13:08:32,445 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:08:32,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:08:36,510 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 4611 proven. 2871 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:08:36,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:08:36,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-10-15 13:08:36,511 INFO L460 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-10-15 13:08:36,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-10-15 13:08:36,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1921, Invalid=12599, Unknown=0, NotChecked=0, Total=14520 [2018-10-15 13:08:36,512 INFO L87 Difference]: Start difference. First operand 539 states and 540 transitions. Second operand 121 states. [2018-10-15 13:08:46,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:08:46,762 INFO L93 Difference]: Finished difference Result 869 states and 870 transitions. [2018-10-15 13:08:46,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 179 states. [2018-10-15 13:08:46,762 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 538 [2018-10-15 13:08:46,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:08:46,764 INFO L225 Difference]: With dead ends: 869 [2018-10-15 13:08:46,764 INFO L226 Difference]: Without dead ends: 548 [2018-10-15 13:08:46,766 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 266 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19690 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=11124, Invalid=60432, Unknown=0, NotChecked=0, Total=71556 [2018-10-15 13:08:46,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2018-10-15 13:08:46,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 546. [2018-10-15 13:08:46,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2018-10-15 13:08:46,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 547 transitions. [2018-10-15 13:08:46,770 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 547 transitions. Word has length 538 [2018-10-15 13:08:46,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:08:46,770 INFO L481 AbstractCegarLoop]: Abstraction has 546 states and 547 transitions. [2018-10-15 13:08:46,770 INFO L482 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-10-15 13:08:46,770 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 547 transitions. [2018-10-15 13:08:46,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2018-10-15 13:08:46,772 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:08:46,773 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 29, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:08:46,773 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:08:46,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:08:46,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1906506880, now seen corresponding path program 58 times [2018-10-15 13:08:46,774 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:08:46,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:08:49,518 INFO L134 CoverageAnalysis]: Checked inductivity of 7686 backedges. 3075 proven. 4611 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:08:49,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:08:49,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-10-15 13:08:49,519 INFO L460 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-10-15 13:08:49,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-10-15 13:08:49,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1557, Invalid=7563, Unknown=0, NotChecked=0, Total=9120 [2018-10-15 13:08:49,520 INFO L87 Difference]: Start difference. First operand 546 states and 547 transitions. Second operand 96 states. [2018-10-15 13:08:58,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:08:58,374 INFO L93 Difference]: Finished difference Result 570 states and 571 transitions. [2018-10-15 13:08:58,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 213 states. [2018-10-15 13:08:58,375 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 545 [2018-10-15 13:08:58,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:08:58,378 INFO L225 Difference]: With dead ends: 570 [2018-10-15 13:08:58,378 INFO L226 Difference]: Without dead ends: 570 [2018-10-15 13:08:58,380 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25013 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=13479, Invalid=61871, Unknown=0, NotChecked=0, Total=75350 [2018-10-15 13:08:58,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2018-10-15 13:08:58,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 557. [2018-10-15 13:08:58,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2018-10-15 13:08:58,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 558 transitions. [2018-10-15 13:08:58,385 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 558 transitions. Word has length 545 [2018-10-15 13:08:58,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:08:58,385 INFO L481 AbstractCegarLoop]: Abstraction has 557 states and 558 transitions. [2018-10-15 13:08:58,386 INFO L482 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-10-15 13:08:58,386 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 558 transitions. [2018-10-15 13:08:58,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 557 [2018-10-15 13:08:58,388 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:08:58,388 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:08:58,388 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:08:58,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:08:58,389 INFO L82 PathProgramCache]: Analyzing trace with hash 640616302, now seen corresponding path program 59 times [2018-10-15 13:08:58,389 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:08:58,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:09:02,604 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 4935 proven. 3075 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:09:02,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:09:02,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-10-15 13:09:02,605 INFO L460 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-10-15 13:09:02,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-10-15 13:09:02,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2047, Invalid=13453, Unknown=0, NotChecked=0, Total=15500 [2018-10-15 13:09:02,606 INFO L87 Difference]: Start difference. First operand 557 states and 558 transitions. Second operand 125 states. [2018-10-15 13:09:13,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:09:13,788 INFO L93 Difference]: Finished difference Result 898 states and 899 transitions. [2018-10-15 13:09:13,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2018-10-15 13:09:13,789 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 556 [2018-10-15 13:09:13,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:09:13,790 INFO L225 Difference]: With dead ends: 898 [2018-10-15 13:09:13,790 INFO L226 Difference]: Without dead ends: 566 [2018-10-15 13:09:13,792 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 275 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21074 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=11867, Invalid=64585, Unknown=0, NotChecked=0, Total=76452 [2018-10-15 13:09:13,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2018-10-15 13:09:13,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 564. [2018-10-15 13:09:13,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2018-10-15 13:09:13,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 565 transitions. [2018-10-15 13:09:13,796 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 565 transitions. Word has length 556 [2018-10-15 13:09:13,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:09:13,796 INFO L481 AbstractCegarLoop]: Abstraction has 564 states and 565 transitions. [2018-10-15 13:09:13,796 INFO L482 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-10-15 13:09:13,797 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 565 transitions. [2018-10-15 13:09:13,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 564 [2018-10-15 13:09:13,799 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:09:13,799 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 30, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:09:13,799 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:09:13,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:09:13,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1014648767, now seen corresponding path program 60 times [2018-10-15 13:09:13,800 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:09:13,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:09:16,881 INFO L134 CoverageAnalysis]: Checked inductivity of 8221 backedges. 3286 proven. 4935 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:09:16,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:09:16,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-10-15 13:09:16,882 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-10-15 13:09:16,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-10-15 13:09:16,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1655, Invalid=8047, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 13:09:16,883 INFO L87 Difference]: Start difference. First operand 564 states and 565 transitions. Second operand 99 states. [2018-10-15 13:09:25,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:09:25,978 INFO L93 Difference]: Finished difference Result 588 states and 589 transitions. [2018-10-15 13:09:25,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 220 states. [2018-10-15 13:09:25,978 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 563 [2018-10-15 13:09:25,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:09:25,981 INFO L225 Difference]: With dead ends: 588 [2018-10-15 13:09:25,982 INFO L226 Difference]: Without dead ends: 588 [2018-10-15 13:09:25,984 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 282 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26715 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=14362, Invalid=66010, Unknown=0, NotChecked=0, Total=80372 [2018-10-15 13:09:25,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2018-10-15 13:09:25,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 575. [2018-10-15 13:09:25,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2018-10-15 13:09:25,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 576 transitions. [2018-10-15 13:09:25,988 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 576 transitions. Word has length 563 [2018-10-15 13:09:25,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:09:25,988 INFO L481 AbstractCegarLoop]: Abstraction has 575 states and 576 transitions. [2018-10-15 13:09:25,988 INFO L482 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-10-15 13:09:25,989 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 576 transitions. [2018-10-15 13:09:25,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2018-10-15 13:09:25,991 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:09:25,991 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:09:25,991 INFO L424 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:09:25,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:09:25,992 INFO L82 PathProgramCache]: Analyzing trace with hash 365030863, now seen corresponding path program 61 times [2018-10-15 13:09:25,992 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:09:26,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:09:30,574 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 5270 proven. 3286 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:09:30,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:09:30,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-10-15 13:09:30,575 INFO L460 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-10-15 13:09:30,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-10-15 13:09:30,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2177, Invalid=14335, Unknown=0, NotChecked=0, Total=16512 [2018-10-15 13:09:30,576 INFO L87 Difference]: Start difference. First operand 575 states and 576 transitions. Second operand 129 states. [2018-10-15 13:09:42,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:09:42,461 INFO L93 Difference]: Finished difference Result 927 states and 928 transitions. [2018-10-15 13:09:42,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 191 states. [2018-10-15 13:09:42,461 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 574 [2018-10-15 13:09:42,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:09:42,463 INFO L225 Difference]: With dead ends: 927 [2018-10-15 13:09:42,463 INFO L226 Difference]: Without dead ends: 584 [2018-10-15 13:09:42,464 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 284 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22505 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=12634, Invalid=68876, Unknown=0, NotChecked=0, Total=81510 [2018-10-15 13:09:42,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2018-10-15 13:09:42,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 582. [2018-10-15 13:09:42,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2018-10-15 13:09:42,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 583 transitions. [2018-10-15 13:09:42,468 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 583 transitions. Word has length 574 [2018-10-15 13:09:42,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:09:42,469 INFO L481 AbstractCegarLoop]: Abstraction has 582 states and 583 transitions. [2018-10-15 13:09:42,469 INFO L482 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-10-15 13:09:42,469 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 583 transitions. [2018-10-15 13:09:42,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 582 [2018-10-15 13:09:42,471 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:09:42,471 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:09:42,472 INFO L424 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:09:42,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:09:42,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1303651296, now seen corresponding path program 62 times [2018-10-15 13:09:42,473 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:09:42,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:09:45,566 INFO L134 CoverageAnalysis]: Checked inductivity of 8774 backedges. 3504 proven. 5270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:09:45,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:09:45,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-10-15 13:09:45,567 INFO L460 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-10-15 13:09:45,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-10-15 13:09:45,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1756, Invalid=8546, Unknown=0, NotChecked=0, Total=10302 [2018-10-15 13:09:45,568 INFO L87 Difference]: Start difference. First operand 582 states and 583 transitions. Second operand 102 states. [2018-10-15 13:09:55,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:09:55,541 INFO L93 Difference]: Finished difference Result 606 states and 607 transitions. [2018-10-15 13:09:55,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 227 states. [2018-10-15 13:09:55,542 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 581 [2018-10-15 13:09:55,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:09:55,545 INFO L225 Difference]: With dead ends: 606 [2018-10-15 13:09:55,545 INFO L226 Difference]: Without dead ends: 606 [2018-10-15 13:09:55,547 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 291 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28473 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=15273, Invalid=70283, Unknown=0, NotChecked=0, Total=85556 [2018-10-15 13:09:55,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2018-10-15 13:09:55,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 593. [2018-10-15 13:09:55,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2018-10-15 13:09:55,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 594 transitions. [2018-10-15 13:09:55,552 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 594 transitions. Word has length 581 [2018-10-15 13:09:55,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:09:55,553 INFO L481 AbstractCegarLoop]: Abstraction has 593 states and 594 transitions. [2018-10-15 13:09:55,553 INFO L482 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-10-15 13:09:55,553 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 594 transitions. [2018-10-15 13:09:55,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 593 [2018-10-15 13:09:55,556 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:09:55,556 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:09:55,556 INFO L424 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:09:55,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:09:55,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1371663118, now seen corresponding path program 63 times [2018-10-15 13:09:55,557 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:09:55,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:10:00,232 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 5616 proven. 3504 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:10:00,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:10:00,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-10-15 13:10:00,233 INFO L460 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-10-15 13:10:00,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-10-15 13:10:00,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2311, Invalid=15245, Unknown=0, NotChecked=0, Total=17556 [2018-10-15 13:10:00,234 INFO L87 Difference]: Start difference. First operand 593 states and 594 transitions. Second operand 133 states. [2018-10-15 13:10:13,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:10:13,018 INFO L93 Difference]: Finished difference Result 956 states and 957 transitions. [2018-10-15 13:10:13,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 197 states. [2018-10-15 13:10:13,018 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 592 [2018-10-15 13:10:13,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:10:13,020 INFO L225 Difference]: With dead ends: 956 [2018-10-15 13:10:13,020 INFO L226 Difference]: Without dead ends: 602 [2018-10-15 13:10:13,022 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 293 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23983 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=13425, Invalid=73305, Unknown=0, NotChecked=0, Total=86730 [2018-10-15 13:10:13,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2018-10-15 13:10:13,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 600. [2018-10-15 13:10:13,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2018-10-15 13:10:13,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 601 transitions. [2018-10-15 13:10:13,026 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 601 transitions. Word has length 592 [2018-10-15 13:10:13,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:10:13,027 INFO L481 AbstractCegarLoop]: Abstraction has 600 states and 601 transitions. [2018-10-15 13:10:13,027 INFO L482 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-10-15 13:10:13,027 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 601 transitions. [2018-10-15 13:10:13,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2018-10-15 13:10:13,029 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:10:13,030 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 32, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:10:13,030 INFO L424 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:10:13,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:10:13,030 INFO L82 PathProgramCache]: Analyzing trace with hash -903668001, now seen corresponding path program 64 times [2018-10-15 13:10:13,031 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:10:13,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:10:16,202 INFO L134 CoverageAnalysis]: Checked inductivity of 9345 backedges. 3729 proven. 5616 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:10:16,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:10:16,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-10-15 13:10:16,203 INFO L460 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-10-15 13:10:16,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-10-15 13:10:16,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1860, Invalid=9060, Unknown=0, NotChecked=0, Total=10920 [2018-10-15 13:10:16,204 INFO L87 Difference]: Start difference. First operand 600 states and 601 transitions. Second operand 105 states. [2018-10-15 13:10:26,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:10:26,564 INFO L93 Difference]: Finished difference Result 624 states and 625 transitions. [2018-10-15 13:10:26,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 234 states. [2018-10-15 13:10:26,565 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 599 [2018-10-15 13:10:26,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:10:26,567 INFO L225 Difference]: With dead ends: 624 [2018-10-15 13:10:26,567 INFO L226 Difference]: Without dead ends: 624 [2018-10-15 13:10:26,570 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 300 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30287 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=16212, Invalid=74690, Unknown=0, NotChecked=0, Total=90902 [2018-10-15 13:10:26,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2018-10-15 13:10:26,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 611. [2018-10-15 13:10:26,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2018-10-15 13:10:26,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 612 transitions. [2018-10-15 13:10:26,574 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 612 transitions. Word has length 599 [2018-10-15 13:10:26,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:10:26,574 INFO L481 AbstractCegarLoop]: Abstraction has 611 states and 612 transitions. [2018-10-15 13:10:26,574 INFO L482 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-10-15 13:10:26,575 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 612 transitions. [2018-10-15 13:10:26,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 611 [2018-10-15 13:10:26,577 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:10:26,577 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:10:26,578 INFO L424 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:10:26,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:10:26,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1979290961, now seen corresponding path program 65 times [2018-10-15 13:10:26,578 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:10:26,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:10:31,607 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 5973 proven. 3729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:10:31,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:10:31,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2018-10-15 13:10:31,608 INFO L460 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-10-15 13:10:31,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-10-15 13:10:31,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2449, Invalid=16183, Unknown=0, NotChecked=0, Total=18632 [2018-10-15 13:10:31,609 INFO L87 Difference]: Start difference. First operand 611 states and 612 transitions. Second operand 137 states. [2018-10-15 13:10:45,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:10:45,181 INFO L93 Difference]: Finished difference Result 985 states and 986 transitions. [2018-10-15 13:10:45,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 203 states. [2018-10-15 13:10:45,181 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 610 [2018-10-15 13:10:45,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:10:45,183 INFO L225 Difference]: With dead ends: 985 [2018-10-15 13:10:45,183 INFO L226 Difference]: Without dead ends: 620 [2018-10-15 13:10:45,185 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 302 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25508 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=14240, Invalid=77872, Unknown=0, NotChecked=0, Total=92112 [2018-10-15 13:10:45,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2018-10-15 13:10:45,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 618. [2018-10-15 13:10:45,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2018-10-15 13:10:45,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 619 transitions. [2018-10-15 13:10:45,189 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 619 transitions. Word has length 610 [2018-10-15 13:10:45,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:10:45,190 INFO L481 AbstractCegarLoop]: Abstraction has 618 states and 619 transitions. [2018-10-15 13:10:45,190 INFO L482 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-10-15 13:10:45,190 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 619 transitions. [2018-10-15 13:10:45,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 618 [2018-10-15 13:10:45,193 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:10:45,193 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 33, 33, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:10:45,193 INFO L424 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:10:45,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:10:45,193 INFO L82 PathProgramCache]: Analyzing trace with hash -440751040, now seen corresponding path program 66 times [2018-10-15 13:10:45,194 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:10:45,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:10:48,885 INFO L134 CoverageAnalysis]: Checked inductivity of 9934 backedges. 3961 proven. 5973 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:10:48,885 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:10:48,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2018-10-15 13:10:48,886 INFO L460 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-10-15 13:10:48,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-10-15 13:10:48,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1967, Invalid=9589, Unknown=0, NotChecked=0, Total=11556 [2018-10-15 13:10:48,887 INFO L87 Difference]: Start difference. First operand 618 states and 619 transitions. Second operand 108 states. [2018-10-15 13:10:58,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:10:58,983 INFO L93 Difference]: Finished difference Result 642 states and 643 transitions. [2018-10-15 13:10:58,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 241 states. [2018-10-15 13:10:58,984 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 617 [2018-10-15 13:10:58,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:10:58,987 INFO L225 Difference]: With dead ends: 642 [2018-10-15 13:10:58,987 INFO L226 Difference]: Without dead ends: 642 [2018-10-15 13:10:58,990 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 309 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32157 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=17179, Invalid=79231, Unknown=0, NotChecked=0, Total=96410 [2018-10-15 13:10:58,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2018-10-15 13:10:58,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 629. [2018-10-15 13:10:58,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2018-10-15 13:10:58,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 630 transitions. [2018-10-15 13:10:58,995 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 630 transitions. Word has length 617 [2018-10-15 13:10:58,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:10:58,995 INFO L481 AbstractCegarLoop]: Abstraction has 629 states and 630 transitions. [2018-10-15 13:10:58,995 INFO L482 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-10-15 13:10:58,996 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 630 transitions. [2018-10-15 13:10:58,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 629 [2018-10-15 13:10:58,998 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:10:58,999 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:10:58,999 INFO L424 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:10:58,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:10:58,999 INFO L82 PathProgramCache]: Analyzing trace with hash -596351314, now seen corresponding path program 67 times [2018-10-15 13:10:59,000 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:10:59,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:11:04,399 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 6341 proven. 3961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:11:04,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:11:04,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141] total 141 [2018-10-15 13:11:04,400 INFO L460 AbstractCegarLoop]: Interpolant automaton has 141 states [2018-10-15 13:11:04,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2018-10-15 13:11:04,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2591, Invalid=17149, Unknown=0, NotChecked=0, Total=19740 [2018-10-15 13:11:04,401 INFO L87 Difference]: Start difference. First operand 629 states and 630 transitions. Second operand 141 states. [2018-10-15 13:11:18,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:11:18,333 INFO L93 Difference]: Finished difference Result 1014 states and 1015 transitions. [2018-10-15 13:11:18,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 209 states. [2018-10-15 13:11:18,334 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 628 [2018-10-15 13:11:18,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:11:18,336 INFO L225 Difference]: With dead ends: 1014 [2018-10-15 13:11:18,336 INFO L226 Difference]: Without dead ends: 638 [2018-10-15 13:11:18,337 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 311 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27080 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=15079, Invalid=82577, Unknown=0, NotChecked=0, Total=97656 [2018-10-15 13:11:18,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2018-10-15 13:11:18,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 636. [2018-10-15 13:11:18,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2018-10-15 13:11:18,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 637 transitions. [2018-10-15 13:11:18,342 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 637 transitions. Word has length 628 [2018-10-15 13:11:18,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:11:18,342 INFO L481 AbstractCegarLoop]: Abstraction has 636 states and 637 transitions. [2018-10-15 13:11:18,342 INFO L482 AbstractCegarLoop]: Interpolant automaton has 141 states. [2018-10-15 13:11:18,342 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 637 transitions. [2018-10-15 13:11:18,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 636 [2018-10-15 13:11:18,345 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:11:18,345 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 34, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:11:18,345 INFO L424 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:11:18,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:11:18,346 INFO L82 PathProgramCache]: Analyzing trace with hash -209992193, now seen corresponding path program 68 times [2018-10-15 13:11:18,346 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:11:18,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:11:22,215 INFO L134 CoverageAnalysis]: Checked inductivity of 10541 backedges. 4200 proven. 6341 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:11:22,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:11:22,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-10-15 13:11:22,216 INFO L460 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-10-15 13:11:22,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-10-15 13:11:22,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2077, Invalid=10133, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 13:11:22,217 INFO L87 Difference]: Start difference. First operand 636 states and 637 transitions. Second operand 111 states. [2018-10-15 13:11:32,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:11:32,300 INFO L93 Difference]: Finished difference Result 660 states and 661 transitions. [2018-10-15 13:11:32,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 248 states. [2018-10-15 13:11:32,300 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 635 [2018-10-15 13:11:32,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:11:32,304 INFO L225 Difference]: With dead ends: 660 [2018-10-15 13:11:32,304 INFO L226 Difference]: Without dead ends: 660 [2018-10-15 13:11:32,307 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 318 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34083 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=18174, Invalid=83906, Unknown=0, NotChecked=0, Total=102080 [2018-10-15 13:11:32,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2018-10-15 13:11:32,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 647. [2018-10-15 13:11:32,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 647 states. [2018-10-15 13:11:32,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 648 transitions. [2018-10-15 13:11:32,311 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 648 transitions. Word has length 635 [2018-10-15 13:11:32,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:11:32,312 INFO L481 AbstractCegarLoop]: Abstraction has 647 states and 648 transitions. [2018-10-15 13:11:32,312 INFO L482 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-10-15 13:11:32,312 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 648 transitions. [2018-10-15 13:11:32,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 647 [2018-10-15 13:11:32,315 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:11:32,315 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:11:32,315 INFO L424 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:11:32,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:11:32,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1925451663, now seen corresponding path program 69 times [2018-10-15 13:11:32,316 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:11:32,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:11:37,871 INFO L134 CoverageAnalysis]: Checked inductivity of 10920 backedges. 6720 proven. 4200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:11:37,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:11:37,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145] total 145 [2018-10-15 13:11:37,872 INFO L460 AbstractCegarLoop]: Interpolant automaton has 145 states [2018-10-15 13:11:37,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2018-10-15 13:11:37,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2737, Invalid=18143, Unknown=0, NotChecked=0, Total=20880 [2018-10-15 13:11:37,873 INFO L87 Difference]: Start difference. First operand 647 states and 648 transitions. Second operand 145 states. [2018-10-15 13:11:48,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:11:48,326 INFO L93 Difference]: Finished difference Result 1043 states and 1044 transitions. [2018-10-15 13:11:48,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 215 states. [2018-10-15 13:11:48,326 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 646 [2018-10-15 13:11:48,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:11:48,328 INFO L225 Difference]: With dead ends: 1043 [2018-10-15 13:11:48,328 INFO L226 Difference]: Without dead ends: 656 [2018-10-15 13:11:48,331 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 320 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28699 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=15942, Invalid=87420, Unknown=0, NotChecked=0, Total=103362 [2018-10-15 13:11:48,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 656 states. [2018-10-15 13:11:48,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 656 to 654. [2018-10-15 13:11:48,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 654 states. [2018-10-15 13:11:48,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 655 transitions. [2018-10-15 13:11:48,335 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 655 transitions. Word has length 646 [2018-10-15 13:11:48,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:11:48,335 INFO L481 AbstractCegarLoop]: Abstraction has 654 states and 655 transitions. [2018-10-15 13:11:48,336 INFO L482 AbstractCegarLoop]: Interpolant automaton has 145 states. [2018-10-15 13:11:48,336 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 655 transitions. [2018-10-15 13:11:48,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 654 [2018-10-15 13:11:48,338 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:11:48,339 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 35, 35, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:11:48,339 INFO L424 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:11:48,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:11:48,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1019568992, now seen corresponding path program 70 times [2018-10-15 13:11:48,340 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:11:48,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:11:52,486 INFO L134 CoverageAnalysis]: Checked inductivity of 11166 backedges. 4446 proven. 6720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:11:52,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:11:52,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2018-10-15 13:11:52,487 INFO L460 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-10-15 13:11:52,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-10-15 13:11:52,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2190, Invalid=10692, Unknown=0, NotChecked=0, Total=12882 [2018-10-15 13:11:52,488 INFO L87 Difference]: Start difference. First operand 654 states and 655 transitions. Second operand 114 states. [2018-10-15 13:12:03,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:03,665 INFO L93 Difference]: Finished difference Result 678 states and 679 transitions. [2018-10-15 13:12:03,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 255 states. [2018-10-15 13:12:03,665 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 653 [2018-10-15 13:12:03,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:03,669 INFO L225 Difference]: With dead ends: 678 [2018-10-15 13:12:03,669 INFO L226 Difference]: Without dead ends: 678 [2018-10-15 13:12:03,671 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 327 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36065 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=19197, Invalid=88715, Unknown=0, NotChecked=0, Total=107912 [2018-10-15 13:12:03,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2018-10-15 13:12:03,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 665. [2018-10-15 13:12:03,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 665 states. [2018-10-15 13:12:03,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 665 states and 666 transitions. [2018-10-15 13:12:03,676 INFO L78 Accepts]: Start accepts. Automaton has 665 states and 666 transitions. Word has length 653 [2018-10-15 13:12:03,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:03,676 INFO L481 AbstractCegarLoop]: Abstraction has 665 states and 666 transitions. [2018-10-15 13:12:03,676 INFO L482 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-10-15 13:12:03,676 INFO L276 IsEmpty]: Start isEmpty. Operand 665 states and 666 transitions. [2018-10-15 13:12:03,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 665 [2018-10-15 13:12:03,679 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:03,679 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:03,679 INFO L424 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:03,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:03,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1463581262, now seen corresponding path program 71 times [2018-10-15 13:12:03,680 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:03,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:09,548 INFO L134 CoverageAnalysis]: Checked inductivity of 11556 backedges. 7110 proven. 4446 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:09,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:09,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [149] total 149 [2018-10-15 13:12:09,549 INFO L460 AbstractCegarLoop]: Interpolant automaton has 149 states [2018-10-15 13:12:09,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2018-10-15 13:12:09,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2887, Invalid=19165, Unknown=0, NotChecked=0, Total=22052 [2018-10-15 13:12:09,550 INFO L87 Difference]: Start difference. First operand 665 states and 666 transitions. Second operand 149 states.