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/nested_true-unreach-call1.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2d08e6e [2018-10-15 13:05:06,979 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 13:05:06,982 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 13:05:07,000 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 13:05:07,000 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 13:05:07,002 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 13:05:07,004 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 13:05:07,007 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 13:05:07,008 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 13:05:07,011 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 13:05:07,013 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 13:05:07,014 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 13:05:07,014 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 13:05:07,017 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 13:05:07,021 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 13:05:07,022 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 13:05:07,024 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 13:05:07,032 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 13:05:07,034 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 13:05:07,039 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 13:05:07,043 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 13:05:07,044 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 13:05:07,049 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 13:05:07,049 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 13:05:07,049 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 13:05:07,050 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 13:05:07,052 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 13:05:07,053 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 13:05:07,053 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 13:05:07,057 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 13:05:07,057 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 13:05:07,059 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 13:05:07,059 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 13:05:07,059 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 13:05:07,060 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 13:05:07,061 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 13:05:07,061 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:05:07,079 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 13:05:07,079 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 13:05:07,080 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 13:05:07,081 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 13:05:07,082 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 13:05:07,082 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 13:05:07,083 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 13:05:07,083 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 13:05:07,083 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 13:05:07,083 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 13:05:07,083 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 13:05:07,084 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 13:05:07,084 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 13:05:07,085 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 13:05:07,085 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 13:05:07,137 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 13:05:07,152 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 13:05:07,160 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 13:05:07,162 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 13:05:07,163 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 13:05:07,163 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/nested_true-unreach-call1.i_4.bpl [2018-10-15 13:05:07,164 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/nested_true-unreach-call1.i_4.bpl' [2018-10-15 13:05:07,243 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 13:05:07,245 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-15 13:05:07,246 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 13:05:07,246 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 13:05:07,247 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 13:05:07,275 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "nested_true-unreach-call1.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:05:07" (1/1) ... [2018-10-15 13:05:07,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "nested_true-unreach-call1.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:05:07" (1/1) ... [2018-10-15 13:05:07,287 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "nested_true-unreach-call1.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:05:07" (1/1) ... [2018-10-15 13:05:07,288 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "nested_true-unreach-call1.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:05:07" (1/1) ... [2018-10-15 13:05:07,294 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "nested_true-unreach-call1.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:05:07" (1/1) ... [2018-10-15 13:05:07,299 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "nested_true-unreach-call1.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:05:07" (1/1) ... [2018-10-15 13:05:07,300 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "nested_true-unreach-call1.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:05:07" (1/1) ... [2018-10-15 13:05:07,306 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 13:05:07,307 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 13:05:07,307 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 13:05:07,307 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 13:05:07,308 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "nested_true-unreach-call1.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:05:07" (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:05:07,384 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-15 13:05:07,385 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 13:05:07,385 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 13:05:07,718 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 13:05:07,719 INFO L202 PluginConnector]: Adding new model nested_true-unreach-call1.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:05:07 BoogieIcfgContainer [2018-10-15 13:05:07,719 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 13:05:07,720 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-15 13:05:07,720 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-15 13:05:07,721 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-15 13:05:07,725 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "nested_true-unreach-call1.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:05:07" (1/1) ... [2018-10-15 13:05:07,733 WARN L219 ansformationObserver]: HeapSeparator: input icfg has no '#valid' array -- returning unchanged Icfg! [2018-10-15 13:05:07,761 INFO L202 PluginConnector]: Adding new model nested_true-unreach-call1.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 01:05:07 BasicIcfg [2018-10-15 13:05:07,761 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-15 13:05:07,763 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 13:05:07,763 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 13:05:07,775 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 13:05:07,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nested_true-unreach-call1.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:05:07" (1/3) ... [2018-10-15 13:05:07,779 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2505f2aa and model type nested_true-unreach-call1.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:05:07, skipping insertion in model container [2018-10-15 13:05:07,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nested_true-unreach-call1.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:05:07" (2/3) ... [2018-10-15 13:05:07,780 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2505f2aa and model type nested_true-unreach-call1.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 01:05:07, skipping insertion in model container [2018-10-15 13:05:07,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "nested_true-unreach-call1.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 01:05:07" (3/3) ... [2018-10-15 13:05:07,787 INFO L112 eAbstractionObserver]: Analyzing ICFG nested_true-unreach-call1.i_4.bplleft_unchanged_by_heapseparator [2018-10-15 13:05:07,811 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 13:05:07,829 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 13:05:07,858 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 13:05:07,892 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 13:05:07,893 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 13:05:07,894 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 13:05:07,894 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 13:05:07,894 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 13:05:07,894 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 13:05:07,894 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 13:05:07,895 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 13:05:07,895 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 13:05:07,911 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-10-15 13:05:07,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-10-15 13:05:07,929 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:07,930 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:07,931 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:07,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:07,937 INFO L82 PathProgramCache]: Analyzing trace with hash -300415764, now seen corresponding path program 1 times [2018-10-15 13:05:07,992 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:08,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:08,153 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:05:08,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 13:05:08,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 13:05:08,159 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 13:05:08,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 13:05:08,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 13:05:08,175 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 3 states. [2018-10-15 13:05:08,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:08,278 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2018-10-15 13:05:08,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 13:05:08,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-10-15 13:05:08,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:08,292 INFO L225 Difference]: With dead ends: 28 [2018-10-15 13:05:08,292 INFO L226 Difference]: Without dead ends: 28 [2018-10-15 13:05:08,296 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 13:05:08,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-10-15 13:05:08,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 21. [2018-10-15 13:05:08,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-15 13:05:08,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-10-15 13:05:08,333 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 11 [2018-10-15 13:05:08,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:08,334 INFO L481 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-10-15 13:05:08,334 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 13:05:08,334 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-10-15 13:05:08,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-10-15 13:05:08,335 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:08,335 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:08,335 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:08,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:08,336 INFO L82 PathProgramCache]: Analyzing trace with hash -825055452, now seen corresponding path program 1 times [2018-10-15 13:05:08,337 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:08,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:08,421 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:05:08,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 13:05:08,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 13:05:08,424 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 13:05:08,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 13:05:08,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 13:05:08,425 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 3 states. [2018-10-15 13:05:08,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:08,464 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-10-15 13:05:08,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 13:05:08,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-10-15 13:05:08,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:08,466 INFO L225 Difference]: With dead ends: 25 [2018-10-15 13:05:08,466 INFO L226 Difference]: Without dead ends: 25 [2018-10-15 13:05:08,467 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 13:05:08,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-15 13:05:08,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 22. [2018-10-15 13:05:08,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-10-15 13:05:08,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2018-10-15 13:05:08,471 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 17 [2018-10-15 13:05:08,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:08,471 INFO L481 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2018-10-15 13:05:08,471 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 13:05:08,472 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2018-10-15 13:05:08,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-15 13:05:08,472 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:08,473 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] [2018-10-15 13:05:08,473 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:08,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:08,473 INFO L82 PathProgramCache]: Analyzing trace with hash -571430242, now seen corresponding path program 1 times [2018-10-15 13:05:08,475 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:08,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:08,627 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:05:08,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:08,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-15 13:05:08,628 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 13:05:08,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 13:05:08,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-15 13:05:08,629 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 5 states. [2018-10-15 13:05:08,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:08,936 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-10-15 13:05:08,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-15 13:05:08,937 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-10-15 13:05:08,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:08,938 INFO L225 Difference]: With dead ends: 29 [2018-10-15 13:05:08,938 INFO L226 Difference]: Without dead ends: 29 [2018-10-15 13:05:08,940 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-15 13:05:08,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-15 13:05:08,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2018-10-15 13:05:08,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-15 13:05:08,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-10-15 13:05:08,948 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 21 [2018-10-15 13:05:08,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:08,948 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-10-15 13:05:08,948 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 13:05:08,948 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-10-15 13:05:08,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-15 13:05:08,950 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:08,950 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] [2018-10-15 13:05:08,950 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:08,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:08,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1594646808, now seen corresponding path program 2 times [2018-10-15 13:05:08,953 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:08,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:09,183 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:05:09,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:09,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-15 13:05:09,184 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-15 13:05:09,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-15 13:05:09,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-15 13:05:09,185 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 7 states. [2018-10-15 13:05:09,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:09,500 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2018-10-15 13:05:09,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-15 13:05:09,503 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-10-15 13:05:09,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:09,504 INFO L225 Difference]: With dead ends: 33 [2018-10-15 13:05:09,504 INFO L226 Difference]: Without dead ends: 33 [2018-10-15 13:05:09,505 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-10-15 13:05:09,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-15 13:05:09,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2018-10-15 13:05:09,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-15 13:05:09,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-10-15 13:05:09,510 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 25 [2018-10-15 13:05:09,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:09,511 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-10-15 13:05:09,511 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-15 13:05:09,511 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-10-15 13:05:09,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-15 13:05:09,512 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:09,513 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:09,513 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:09,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:09,514 INFO L82 PathProgramCache]: Analyzing trace with hash -434877806, now seen corresponding path program 3 times [2018-10-15 13:05:09,515 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:09,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:09,782 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:05:09,782 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:09,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-15 13:05:09,783 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 13:05:09,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 13:05:09,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-15 13:05:09,784 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 9 states. [2018-10-15 13:05:10,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:10,446 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2018-10-15 13:05:10,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-15 13:05:10,448 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2018-10-15 13:05:10,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:10,449 INFO L225 Difference]: With dead ends: 37 [2018-10-15 13:05:10,449 INFO L226 Difference]: Without dead ends: 37 [2018-10-15 13:05:10,450 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-10-15 13:05:10,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-15 13:05:10,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2018-10-15 13:05:10,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-10-15 13:05:10,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-10-15 13:05:10,454 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 29 [2018-10-15 13:05:10,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:10,455 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2018-10-15 13:05:10,455 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 13:05:10,455 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-10-15 13:05:10,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-15 13:05:10,456 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:10,456 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:10,457 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:10,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:10,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1807148812, now seen corresponding path program 4 times [2018-10-15 13:05:10,458 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:10,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:11,007 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:05:11,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:11,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 13:05:11,008 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 13:05:11,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 13:05:11,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-10-15 13:05:11,009 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 11 states. [2018-10-15 13:05:11,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:11,428 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2018-10-15 13:05:11,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-15 13:05:11,429 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 33 [2018-10-15 13:05:11,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:11,430 INFO L225 Difference]: With dead ends: 41 [2018-10-15 13:05:11,430 INFO L226 Difference]: Without dead ends: 41 [2018-10-15 13:05:11,431 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-10-15 13:05:11,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-15 13:05:11,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2018-10-15 13:05:11,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-10-15 13:05:11,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2018-10-15 13:05:11,435 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 33 [2018-10-15 13:05:11,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:11,435 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2018-10-15 13:05:11,435 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 13:05:11,436 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2018-10-15 13:05:11,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-15 13:05:11,437 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:11,437 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:11,437 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:11,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:11,438 INFO L82 PathProgramCache]: Analyzing trace with hash -312297850, now seen corresponding path program 5 times [2018-10-15 13:05:11,439 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:11,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:11,722 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 1 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:05:11,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:11,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-15 13:05:11,723 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-15 13:05:11,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-15 13:05:11,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-10-15 13:05:11,724 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 13 states. [2018-10-15 13:05:12,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:12,342 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2018-10-15 13:05:12,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-15 13:05:12,343 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 37 [2018-10-15 13:05:12,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:12,344 INFO L225 Difference]: With dead ends: 45 [2018-10-15 13:05:12,345 INFO L226 Difference]: Without dead ends: 45 [2018-10-15 13:05:12,346 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2018-10-15 13:05:12,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-15 13:05:12,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2018-10-15 13:05:12,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-10-15 13:05:12,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-10-15 13:05:12,351 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 37 [2018-10-15 13:05:12,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:12,351 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-10-15 13:05:12,351 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-15 13:05:12,351 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-10-15 13:05:12,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-15 13:05:12,352 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:12,353 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:12,353 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:12,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:12,354 INFO L82 PathProgramCache]: Analyzing trace with hash 222705920, now seen corresponding path program 6 times [2018-10-15 13:05:12,354 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:12,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:12,792 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 1 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:05:12,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:12,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 13:05:12,793 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 13:05:12,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 13:05:12,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-10-15 13:05:12,794 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 15 states. [2018-10-15 13:05:13,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:13,318 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-10-15 13:05:13,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-15 13:05:13,319 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 41 [2018-10-15 13:05:13,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:13,319 INFO L225 Difference]: With dead ends: 49 [2018-10-15 13:05:13,320 INFO L226 Difference]: Without dead ends: 49 [2018-10-15 13:05:13,320 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2018-10-15 13:05:13,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-15 13:05:13,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2018-10-15 13:05:13,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-10-15 13:05:13,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 47 transitions. [2018-10-15 13:05:13,326 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 47 transitions. Word has length 41 [2018-10-15 13:05:13,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:13,326 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 47 transitions. [2018-10-15 13:05:13,326 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 13:05:13,326 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 47 transitions. [2018-10-15 13:05:13,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-15 13:05:13,328 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:13,328 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:13,328 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:13,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:13,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1303384454, now seen corresponding path program 7 times [2018-10-15 13:05:13,330 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:13,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:13,742 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 1 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:05:13,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:13,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-15 13:05:13,743 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-15 13:05:13,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-15 13:05:13,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-10-15 13:05:13,745 INFO L87 Difference]: Start difference. First operand 46 states and 47 transitions. Second operand 17 states. [2018-10-15 13:05:14,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:14,570 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2018-10-15 13:05:14,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-15 13:05:14,572 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 45 [2018-10-15 13:05:14,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:14,573 INFO L225 Difference]: With dead ends: 53 [2018-10-15 13:05:14,573 INFO L226 Difference]: Without dead ends: 53 [2018-10-15 13:05:14,574 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2018-10-15 13:05:14,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-15 13:05:14,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2018-10-15 13:05:14,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-10-15 13:05:14,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 51 transitions. [2018-10-15 13:05:14,578 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 51 transitions. Word has length 45 [2018-10-15 13:05:14,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:14,579 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 51 transitions. [2018-10-15 13:05:14,579 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-15 13:05:14,579 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 51 transitions. [2018-10-15 13:05:14,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-15 13:05:14,580 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:14,580 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:14,581 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:14,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:14,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1473358092, now seen corresponding path program 8 times [2018-10-15 13:05:14,582 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:14,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:15,062 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 1 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:05:15,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:15,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-15 13:05:15,063 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-15 13:05:15,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-15 13:05:15,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-10-15 13:05:15,064 INFO L87 Difference]: Start difference. First operand 50 states and 51 transitions. Second operand 19 states. [2018-10-15 13:05:16,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:16,119 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2018-10-15 13:05:16,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-15 13:05:16,122 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 49 [2018-10-15 13:05:16,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:16,123 INFO L225 Difference]: With dead ends: 57 [2018-10-15 13:05:16,123 INFO L226 Difference]: Without dead ends: 57 [2018-10-15 13:05:16,124 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 13:05:16,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-15 13:05:16,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2018-10-15 13:05:16,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-10-15 13:05:16,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2018-10-15 13:05:16,128 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 49 [2018-10-15 13:05:16,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:16,128 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2018-10-15 13:05:16,129 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-15 13:05:16,129 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2018-10-15 13:05:16,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-15 13:05:16,130 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:16,130 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:16,130 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:16,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:16,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1062204014, now seen corresponding path program 9 times [2018-10-15 13:05:16,131 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:16,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:16,599 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 1 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:05:16,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:16,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 13:05:16,600 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 13:05:16,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 13:05:16,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-10-15 13:05:16,601 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 21 states. [2018-10-15 13:05:17,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:17,427 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2018-10-15 13:05:17,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-15 13:05:17,427 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 53 [2018-10-15 13:05:17,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:17,429 INFO L225 Difference]: With dead ends: 61 [2018-10-15 13:05:17,429 INFO L226 Difference]: Without dead ends: 61 [2018-10-15 13:05:17,430 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 13:05:17,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-10-15 13:05:17,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2018-10-15 13:05:17,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-10-15 13:05:17,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2018-10-15 13:05:17,435 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 53 [2018-10-15 13:05:17,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:17,435 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2018-10-15 13:05:17,435 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 13:05:17,435 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2018-10-15 13:05:17,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-15 13:05:17,436 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:17,436 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:17,437 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:17,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:17,437 INFO L82 PathProgramCache]: Analyzing trace with hash -320651032, now seen corresponding path program 10 times [2018-10-15 13:05:17,438 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:17,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:17,806 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-10-15 13:05:17,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:17,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-15 13:05:17,807 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 13:05:17,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 13:05:17,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-15 13:05:17,808 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 5 states. [2018-10-15 13:05:18,000 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-15 13:05:18,173 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-15 13:05:18,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:18,375 INFO L93 Difference]: Finished difference Result 148 states and 151 transitions. [2018-10-15 13:05:18,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-15 13:05:18,375 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2018-10-15 13:05:18,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:18,376 INFO L225 Difference]: With dead ends: 148 [2018-10-15 13:05:18,377 INFO L226 Difference]: Without dead ends: 148 [2018-10-15 13:05:18,377 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-15 13:05:18,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-10-15 13:05:18,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 104. [2018-10-15 13:05:18,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-10-15 13:05:18,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 106 transitions. [2018-10-15 13:05:18,392 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 106 transitions. Word has length 57 [2018-10-15 13:05:18,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:18,392 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 106 transitions. [2018-10-15 13:05:18,392 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 13:05:18,393 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 106 transitions. [2018-10-15 13:05:18,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-15 13:05:18,394 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:18,394 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:18,395 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:18,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:18,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1954749468, now seen corresponding path program 11 times [2018-10-15 13:05:18,396 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:18,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:19,114 INFO L134 CoverageAnalysis]: Checked inductivity of 808 backedges. 0 proven. 428 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-10-15 13:05:19,115 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:19,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-15 13:05:19,115 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-15 13:05:19,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-15 13:05:19,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-15 13:05:19,116 INFO L87 Difference]: Start difference. First operand 104 states and 106 transitions. Second operand 7 states. [2018-10-15 13:05:19,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:19,231 INFO L93 Difference]: Finished difference Result 194 states and 198 transitions. [2018-10-15 13:05:19,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-15 13:05:19,235 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 103 [2018-10-15 13:05:19,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:19,237 INFO L225 Difference]: With dead ends: 194 [2018-10-15 13:05:19,237 INFO L226 Difference]: Without dead ends: 194 [2018-10-15 13:05:19,237 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-10-15 13:05:19,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-10-15 13:05:19,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 150. [2018-10-15 13:05:19,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-10-15 13:05:19,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 153 transitions. [2018-10-15 13:05:19,245 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 153 transitions. Word has length 103 [2018-10-15 13:05:19,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:19,246 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 153 transitions. [2018-10-15 13:05:19,246 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-15 13:05:19,246 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 153 transitions. [2018-10-15 13:05:19,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-10-15 13:05:19,248 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:19,248 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:19,248 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:19,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:19,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1992863200, now seen corresponding path program 12 times [2018-10-15 13:05:19,250 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:19,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:19,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1851 backedges. 0 proven. 1281 refuted. 0 times theorem prover too weak. 570 trivial. 0 not checked. [2018-10-15 13:05:19,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:19,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-15 13:05:19,588 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 13:05:19,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 13:05:19,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-15 13:05:19,590 INFO L87 Difference]: Start difference. First operand 150 states and 153 transitions. Second operand 9 states. [2018-10-15 13:05:19,757 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-15 13:05:19,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:19,892 INFO L93 Difference]: Finished difference Result 240 states and 245 transitions. [2018-10-15 13:05:19,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-15 13:05:19,893 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 149 [2018-10-15 13:05:19,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:19,895 INFO L225 Difference]: With dead ends: 240 [2018-10-15 13:05:19,895 INFO L226 Difference]: Without dead ends: 240 [2018-10-15 13:05:19,896 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-10-15 13:05:19,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-10-15 13:05:19,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 196. [2018-10-15 13:05:19,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-10-15 13:05:19,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 200 transitions. [2018-10-15 13:05:19,903 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 200 transitions. Word has length 149 [2018-10-15 13:05:19,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:19,904 INFO L481 AbstractCegarLoop]: Abstraction has 196 states and 200 transitions. [2018-10-15 13:05:19,904 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 13:05:19,904 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 200 transitions. [2018-10-15 13:05:19,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-10-15 13:05:19,907 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:19,907 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 40, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:19,907 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:19,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:19,908 INFO L82 PathProgramCache]: Analyzing trace with hash -484811044, now seen corresponding path program 13 times [2018-10-15 13:05:19,908 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:19,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:20,298 INFO L134 CoverageAnalysis]: Checked inductivity of 3320 backedges. 0 proven. 2560 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2018-10-15 13:05:20,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:20,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 13:05:20,299 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 13:05:20,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 13:05:20,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-10-15 13:05:20,299 INFO L87 Difference]: Start difference. First operand 196 states and 200 transitions. Second operand 11 states. [2018-10-15 13:05:20,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:20,732 INFO L93 Difference]: Finished difference Result 286 states and 292 transitions. [2018-10-15 13:05:20,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-15 13:05:20,733 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 195 [2018-10-15 13:05:20,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:20,735 INFO L225 Difference]: With dead ends: 286 [2018-10-15 13:05:20,735 INFO L226 Difference]: Without dead ends: 286 [2018-10-15 13:05:20,736 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-10-15 13:05:20,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-10-15 13:05:20,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 242. [2018-10-15 13:05:20,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-10-15 13:05:20,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 247 transitions. [2018-10-15 13:05:20,743 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 247 transitions. Word has length 195 [2018-10-15 13:05:20,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:20,744 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 247 transitions. [2018-10-15 13:05:20,744 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 13:05:20,744 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 247 transitions. [2018-10-15 13:05:20,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-10-15 13:05:20,748 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:20,749 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 50, 50, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:20,749 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:20,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:20,749 INFO L82 PathProgramCache]: Analyzing trace with hash 137737944, now seen corresponding path program 14 times [2018-10-15 13:05:20,750 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:20,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:21,136 INFO L134 CoverageAnalysis]: Checked inductivity of 5215 backedges. 0 proven. 4265 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2018-10-15 13:05:21,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:21,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-15 13:05:21,137 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-15 13:05:21,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-15 13:05:21,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-10-15 13:05:21,138 INFO L87 Difference]: Start difference. First operand 242 states and 247 transitions. Second operand 13 states. [2018-10-15 13:05:21,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:21,743 INFO L93 Difference]: Finished difference Result 332 states and 339 transitions. [2018-10-15 13:05:21,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-15 13:05:21,743 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 241 [2018-10-15 13:05:21,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:21,748 INFO L225 Difference]: With dead ends: 332 [2018-10-15 13:05:21,749 INFO L226 Difference]: Without dead ends: 332 [2018-10-15 13:05:21,749 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2018-10-15 13:05:21,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-10-15 13:05:21,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 288. [2018-10-15 13:05:21,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-10-15 13:05:21,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 294 transitions. [2018-10-15 13:05:21,755 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 294 transitions. Word has length 241 [2018-10-15 13:05:21,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:21,755 INFO L481 AbstractCegarLoop]: Abstraction has 288 states and 294 transitions. [2018-10-15 13:05:21,755 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-15 13:05:21,756 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 294 transitions. [2018-10-15 13:05:21,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-10-15 13:05:21,759 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:21,760 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 60, 60, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:21,760 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:21,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:21,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1655802412, now seen corresponding path program 15 times [2018-10-15 13:05:21,761 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:21,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:22,338 INFO L134 CoverageAnalysis]: Checked inductivity of 7536 backedges. 0 proven. 6396 refuted. 0 times theorem prover too weak. 1140 trivial. 0 not checked. [2018-10-15 13:05:22,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:22,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 13:05:22,338 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 13:05:22,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 13:05:22,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-10-15 13:05:22,339 INFO L87 Difference]: Start difference. First operand 288 states and 294 transitions. Second operand 15 states. [2018-10-15 13:05:22,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:22,807 INFO L93 Difference]: Finished difference Result 378 states and 386 transitions. [2018-10-15 13:05:22,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-15 13:05:22,809 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 287 [2018-10-15 13:05:22,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:22,811 INFO L225 Difference]: With dead ends: 378 [2018-10-15 13:05:22,811 INFO L226 Difference]: Without dead ends: 378 [2018-10-15 13:05:22,814 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2018-10-15 13:05:22,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2018-10-15 13:05:22,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 334. [2018-10-15 13:05:22,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-10-15 13:05:22,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 341 transitions. [2018-10-15 13:05:22,820 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 341 transitions. Word has length 287 [2018-10-15 13:05:22,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:22,820 INFO L481 AbstractCegarLoop]: Abstraction has 334 states and 341 transitions. [2018-10-15 13:05:22,821 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 13:05:22,821 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 341 transitions. [2018-10-15 13:05:22,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2018-10-15 13:05:22,822 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:22,823 INFO L375 BasicCegarLoop]: trace histogram [70, 70, 70, 70, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:22,823 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:22,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:22,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1426611152, now seen corresponding path program 16 times [2018-10-15 13:05:22,824 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:22,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:24,109 INFO L134 CoverageAnalysis]: Checked inductivity of 10283 backedges. 0 proven. 8953 refuted. 0 times theorem prover too weak. 1330 trivial. 0 not checked. [2018-10-15 13:05:24,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:24,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-15 13:05:24,111 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-15 13:05:24,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-15 13:05:24,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-10-15 13:05:24,111 INFO L87 Difference]: Start difference. First operand 334 states and 341 transitions. Second operand 17 states. [2018-10-15 13:05:24,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:24,738 INFO L93 Difference]: Finished difference Result 424 states and 433 transitions. [2018-10-15 13:05:24,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-15 13:05:24,738 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 333 [2018-10-15 13:05:24,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:24,742 INFO L225 Difference]: With dead ends: 424 [2018-10-15 13:05:24,742 INFO L226 Difference]: Without dead ends: 424 [2018-10-15 13:05:24,743 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2018-10-15 13:05:24,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2018-10-15 13:05:24,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 380. [2018-10-15 13:05:24,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-10-15 13:05:24,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 388 transitions. [2018-10-15 13:05:24,750 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 388 transitions. Word has length 333 [2018-10-15 13:05:24,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:24,750 INFO L481 AbstractCegarLoop]: Abstraction has 380 states and 388 transitions. [2018-10-15 13:05:24,750 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-15 13:05:24,750 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 388 transitions. [2018-10-15 13:05:24,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2018-10-15 13:05:24,752 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:24,753 INFO L375 BasicCegarLoop]: trace histogram [80, 80, 80, 80, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:24,753 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:24,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:24,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1500981452, now seen corresponding path program 17 times [2018-10-15 13:05:24,754 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:24,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:25,624 INFO L134 CoverageAnalysis]: Checked inductivity of 13456 backedges. 0 proven. 11936 refuted. 0 times theorem prover too weak. 1520 trivial. 0 not checked. [2018-10-15 13:05:25,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:25,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-15 13:05:25,625 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-15 13:05:25,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-15 13:05:25,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-10-15 13:05:25,625 INFO L87 Difference]: Start difference. First operand 380 states and 388 transitions. Second operand 19 states. [2018-10-15 13:05:26,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:26,408 INFO L93 Difference]: Finished difference Result 470 states and 480 transitions. [2018-10-15 13:05:26,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-15 13:05:26,412 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 379 [2018-10-15 13:05:26,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:26,415 INFO L225 Difference]: With dead ends: 470 [2018-10-15 13:05:26,415 INFO L226 Difference]: Without dead ends: 470 [2018-10-15 13:05:26,415 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 13:05:26,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2018-10-15 13:05:26,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 426. [2018-10-15 13:05:26,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2018-10-15 13:05:26,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 435 transitions. [2018-10-15 13:05:26,422 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 435 transitions. Word has length 379 [2018-10-15 13:05:26,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:26,423 INFO L481 AbstractCegarLoop]: Abstraction has 426 states and 435 transitions. [2018-10-15 13:05:26,423 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-15 13:05:26,423 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 435 transitions. [2018-10-15 13:05:26,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2018-10-15 13:05:26,425 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:26,425 INFO L375 BasicCegarLoop]: trace histogram [90, 90, 90, 90, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:26,425 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:26,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:26,426 INFO L82 PathProgramCache]: Analyzing trace with hash -937517880, now seen corresponding path program 18 times [2018-10-15 13:05:26,426 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:26,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:27,881 INFO L134 CoverageAnalysis]: Checked inductivity of 17055 backedges. 0 proven. 15345 refuted. 0 times theorem prover too weak. 1710 trivial. 0 not checked. [2018-10-15 13:05:27,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:27,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 13:05:27,882 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 13:05:27,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 13:05:27,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-10-15 13:05:27,883 INFO L87 Difference]: Start difference. First operand 426 states and 435 transitions. Second operand 21 states. [2018-10-15 13:05:28,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:28,746 INFO L93 Difference]: Finished difference Result 516 states and 527 transitions. [2018-10-15 13:05:28,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-15 13:05:28,746 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 425 [2018-10-15 13:05:28,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:28,751 INFO L225 Difference]: With dead ends: 516 [2018-10-15 13:05:28,751 INFO L226 Difference]: Without dead ends: 516 [2018-10-15 13:05:28,752 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 13:05:28,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2018-10-15 13:05:28,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 472. [2018-10-15 13:05:28,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2018-10-15 13:05:28,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 482 transitions. [2018-10-15 13:05:28,759 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 482 transitions. Word has length 425 [2018-10-15 13:05:28,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:28,760 INFO L481 AbstractCegarLoop]: Abstraction has 472 states and 482 transitions. [2018-10-15 13:05:28,760 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 13:05:28,760 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 482 transitions. [2018-10-15 13:05:28,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2018-10-15 13:05:28,763 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:28,763 INFO L375 BasicCegarLoop]: trace histogram [100, 100, 100, 100, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:28,763 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:28,764 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:28,764 INFO L82 PathProgramCache]: Analyzing trace with hash 770865092, now seen corresponding path program 19 times [2018-10-15 13:05:28,765 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:28,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:29,951 INFO L134 CoverageAnalysis]: Checked inductivity of 21080 backedges. 0 proven. 19180 refuted. 0 times theorem prover too weak. 1900 trivial. 0 not checked. [2018-10-15 13:05:29,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:29,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-15 13:05:29,952 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-15 13:05:29,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-15 13:05:29,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-10-15 13:05:29,953 INFO L87 Difference]: Start difference. First operand 472 states and 482 transitions. Second operand 23 states. [2018-10-15 13:05:31,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:31,582 INFO L93 Difference]: Finished difference Result 562 states and 574 transitions. [2018-10-15 13:05:31,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-15 13:05:31,582 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 471 [2018-10-15 13:05:31,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:31,586 INFO L225 Difference]: With dead ends: 562 [2018-10-15 13:05:31,586 INFO L226 Difference]: Without dead ends: 562 [2018-10-15 13:05:31,587 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 13:05:31,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2018-10-15 13:05:31,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 518. [2018-10-15 13:05:31,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2018-10-15 13:05:31,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 529 transitions. [2018-10-15 13:05:31,611 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 529 transitions. Word has length 471 [2018-10-15 13:05:31,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:31,612 INFO L481 AbstractCegarLoop]: Abstraction has 518 states and 529 transitions. [2018-10-15 13:05:31,612 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-15 13:05:31,613 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 529 transitions. [2018-10-15 13:05:31,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 518 [2018-10-15 13:05:31,616 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:31,616 INFO L375 BasicCegarLoop]: trace histogram [110, 110, 110, 110, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:31,616 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:31,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:31,617 INFO L82 PathProgramCache]: Analyzing trace with hash 55998912, now seen corresponding path program 20 times [2018-10-15 13:05:31,618 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:31,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:32,882 INFO L134 CoverageAnalysis]: Checked inductivity of 25531 backedges. 0 proven. 23441 refuted. 0 times theorem prover too weak. 2090 trivial. 0 not checked. [2018-10-15 13:05:32,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:32,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-15 13:05:32,883 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-15 13:05:32,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-15 13:05:32,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-10-15 13:05:32,884 INFO L87 Difference]: Start difference. First operand 518 states and 529 transitions. Second operand 25 states. [2018-10-15 13:05:34,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:34,121 INFO L93 Difference]: Finished difference Result 608 states and 621 transitions. [2018-10-15 13:05:34,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-15 13:05:34,124 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 517 [2018-10-15 13:05:34,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:34,128 INFO L225 Difference]: With dead ends: 608 [2018-10-15 13:05:34,128 INFO L226 Difference]: Without dead ends: 608 [2018-10-15 13:05:34,129 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=135, Invalid=2027, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 13:05:34,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2018-10-15 13:05:34,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 564. [2018-10-15 13:05:34,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2018-10-15 13:05:34,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 576 transitions. [2018-10-15 13:05:34,137 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 576 transitions. Word has length 517 [2018-10-15 13:05:34,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:34,138 INFO L481 AbstractCegarLoop]: Abstraction has 564 states and 576 transitions. [2018-10-15 13:05:34,138 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-15 13:05:34,138 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 576 transitions. [2018-10-15 13:05:34,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 564 [2018-10-15 13:05:34,142 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:34,142 INFO L375 BasicCegarLoop]: trace histogram [120, 120, 120, 120, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:34,143 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:34,143 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:34,143 INFO L82 PathProgramCache]: Analyzing trace with hash 673079996, now seen corresponding path program 21 times [2018-10-15 13:05:34,144 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:34,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:35,766 INFO L134 CoverageAnalysis]: Checked inductivity of 30408 backedges. 0 proven. 28128 refuted. 0 times theorem prover too weak. 2280 trivial. 0 not checked. [2018-10-15 13:05:35,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:35,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 13:05:35,767 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 13:05:35,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 13:05:35,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-10-15 13:05:35,768 INFO L87 Difference]: Start difference. First operand 564 states and 576 transitions. Second operand 27 states. [2018-10-15 13:05:37,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:37,294 INFO L93 Difference]: Finished difference Result 654 states and 668 transitions. [2018-10-15 13:05:37,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-15 13:05:37,295 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 563 [2018-10-15 13:05:37,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:37,299 INFO L225 Difference]: With dead ends: 654 [2018-10-15 13:05:37,299 INFO L226 Difference]: Without dead ends: 654 [2018-10-15 13:05:37,300 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=147, Invalid=2403, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 13:05:37,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2018-10-15 13:05:37,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 610. [2018-10-15 13:05:37,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2018-10-15 13:05:37,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 623 transitions. [2018-10-15 13:05:37,308 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 623 transitions. Word has length 563 [2018-10-15 13:05:37,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:37,309 INFO L481 AbstractCegarLoop]: Abstraction has 610 states and 623 transitions. [2018-10-15 13:05:37,309 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 13:05:37,309 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 623 transitions. [2018-10-15 13:05:37,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 610 [2018-10-15 13:05:37,314 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:37,314 INFO L375 BasicCegarLoop]: trace histogram [130, 130, 130, 130, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:37,314 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:37,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:37,315 INFO L82 PathProgramCache]: Analyzing trace with hash 1603138232, now seen corresponding path program 22 times [2018-10-15 13:05:37,315 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:37,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:39,349 INFO L134 CoverageAnalysis]: Checked inductivity of 35711 backedges. 0 proven. 33241 refuted. 0 times theorem prover too weak. 2470 trivial. 0 not checked. [2018-10-15 13:05:39,349 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:39,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 13:05:39,350 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 13:05:39,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 13:05:39,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-10-15 13:05:39,351 INFO L87 Difference]: Start difference. First operand 610 states and 623 transitions. Second operand 29 states. [2018-10-15 13:05:40,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:40,819 INFO L93 Difference]: Finished difference Result 700 states and 715 transitions. [2018-10-15 13:05:40,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-15 13:05:40,819 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 609 [2018-10-15 13:05:40,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:40,824 INFO L225 Difference]: With dead ends: 700 [2018-10-15 13:05:40,824 INFO L226 Difference]: Without dead ends: 700 [2018-10-15 13:05:40,825 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=159, Invalid=2811, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 13:05:40,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2018-10-15 13:05:40,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 656. [2018-10-15 13:05:40,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 656 states. [2018-10-15 13:05:40,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656 states to 656 states and 670 transitions. [2018-10-15 13:05:40,834 INFO L78 Accepts]: Start accepts. Automaton has 656 states and 670 transitions. Word has length 609 [2018-10-15 13:05:40,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:40,835 INFO L481 AbstractCegarLoop]: Abstraction has 656 states and 670 transitions. [2018-10-15 13:05:40,835 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 13:05:40,835 INFO L276 IsEmpty]: Start isEmpty. Operand 656 states and 670 transitions. [2018-10-15 13:05:40,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 656 [2018-10-15 13:05:40,839 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:40,840 INFO L375 BasicCegarLoop]: trace histogram [140, 140, 140, 140, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:40,840 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:40,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:40,841 INFO L82 PathProgramCache]: Analyzing trace with hash -866588236, now seen corresponding path program 23 times [2018-10-15 13:05:40,841 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:40,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:43,228 INFO L134 CoverageAnalysis]: Checked inductivity of 41440 backedges. 0 proven. 38780 refuted. 0 times theorem prover too weak. 2660 trivial. 0 not checked. [2018-10-15 13:05:43,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:43,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 13:05:43,229 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 13:05:43,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 13:05:43,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-10-15 13:05:43,230 INFO L87 Difference]: Start difference. First operand 656 states and 670 transitions. Second operand 31 states. [2018-10-15 13:05:44,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:44,978 INFO L93 Difference]: Finished difference Result 746 states and 762 transitions. [2018-10-15 13:05:44,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-15 13:05:44,979 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 655 [2018-10-15 13:05:44,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:44,983 INFO L225 Difference]: With dead ends: 746 [2018-10-15 13:05:44,983 INFO L226 Difference]: Without dead ends: 746 [2018-10-15 13:05:44,985 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=171, Invalid=3251, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 13:05:44,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2018-10-15 13:05:44,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 702. [2018-10-15 13:05:44,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 702 states. [2018-10-15 13:05:44,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 717 transitions. [2018-10-15 13:05:44,993 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 717 transitions. Word has length 655 [2018-10-15 13:05:44,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:44,994 INFO L481 AbstractCegarLoop]: Abstraction has 702 states and 717 transitions. [2018-10-15 13:05:44,994 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 13:05:44,994 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 717 transitions. [2018-10-15 13:05:44,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 702 [2018-10-15 13:05:44,999 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:45,000 INFO L375 BasicCegarLoop]: trace histogram [150, 150, 150, 150, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:45,000 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:45,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:45,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1822623664, now seen corresponding path program 24 times [2018-10-15 13:05:45,001 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:45,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:47,408 INFO L134 CoverageAnalysis]: Checked inductivity of 47595 backedges. 0 proven. 44745 refuted. 0 times theorem prover too weak. 2850 trivial. 0 not checked. [2018-10-15 13:05:47,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:47,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 13:05:47,409 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 13:05:47,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 13:05:47,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 13:05:47,410 INFO L87 Difference]: Start difference. First operand 702 states and 717 transitions. Second operand 33 states. [2018-10-15 13:05:49,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:49,675 INFO L93 Difference]: Finished difference Result 792 states and 809 transitions. [2018-10-15 13:05:49,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-15 13:05:49,675 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 701 [2018-10-15 13:05:49,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:49,680 INFO L225 Difference]: With dead ends: 792 [2018-10-15 13:05:49,680 INFO L226 Difference]: Without dead ends: 792 [2018-10-15 13:05:49,682 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=183, Invalid=3723, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 13:05:49,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2018-10-15 13:05:49,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 748. [2018-10-15 13:05:49,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2018-10-15 13:05:49,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 764 transitions. [2018-10-15 13:05:49,691 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 764 transitions. Word has length 701 [2018-10-15 13:05:49,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:49,692 INFO L481 AbstractCegarLoop]: Abstraction has 748 states and 764 transitions. [2018-10-15 13:05:49,692 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 13:05:49,692 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 764 transitions. [2018-10-15 13:05:49,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 748 [2018-10-15 13:05:49,700 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:49,701 INFO L375 BasicCegarLoop]: trace histogram [160, 160, 160, 160, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:49,701 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:49,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:49,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1778381652, now seen corresponding path program 25 times [2018-10-15 13:05:49,702 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:49,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:51,592 INFO L134 CoverageAnalysis]: Checked inductivity of 54176 backedges. 0 proven. 51136 refuted. 0 times theorem prover too weak. 3040 trivial. 0 not checked. [2018-10-15 13:05:51,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:51,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 13:05:51,593 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 13:05:51,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 13:05:51,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 13:05:51,594 INFO L87 Difference]: Start difference. First operand 748 states and 764 transitions. Second operand 35 states. [2018-10-15 13:05:52,180 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-15 13:05:53,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:53,958 INFO L93 Difference]: Finished difference Result 838 states and 856 transitions. [2018-10-15 13:05:53,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-15 13:05:53,958 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 747 [2018-10-15 13:05:53,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:53,962 INFO L225 Difference]: With dead ends: 838 [2018-10-15 13:05:53,962 INFO L226 Difference]: Without dead ends: 838 [2018-10-15 13:05:53,964 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=195, Invalid=4227, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 13:05:53,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2018-10-15 13:05:53,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 794. [2018-10-15 13:05:53,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2018-10-15 13:05:53,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 811 transitions. [2018-10-15 13:05:53,973 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 811 transitions. Word has length 747 [2018-10-15 13:05:53,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:53,974 INFO L481 AbstractCegarLoop]: Abstraction has 794 states and 811 transitions. [2018-10-15 13:05:53,974 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 13:05:53,974 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 811 transitions. [2018-10-15 13:05:53,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 794 [2018-10-15 13:05:53,980 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:53,980 INFO L375 BasicCegarLoop]: trace histogram [170, 170, 170, 170, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:53,981 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:53,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:53,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1903409320, now seen corresponding path program 26 times [2018-10-15 13:05:53,982 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:54,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:56,490 INFO L134 CoverageAnalysis]: Checked inductivity of 61183 backedges. 0 proven. 57953 refuted. 0 times theorem prover too weak. 3230 trivial. 0 not checked. [2018-10-15 13:05:56,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:56,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 13:05:56,491 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 13:05:56,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 13:05:56,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 13:05:56,491 INFO L87 Difference]: Start difference. First operand 794 states and 811 transitions. Second operand 37 states. [2018-10-15 13:05:58,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:58,900 INFO L93 Difference]: Finished difference Result 884 states and 903 transitions. [2018-10-15 13:05:58,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-15 13:05:58,901 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 793 [2018-10-15 13:05:58,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:58,905 INFO L225 Difference]: With dead ends: 884 [2018-10-15 13:05:58,905 INFO L226 Difference]: Without dead ends: 884 [2018-10-15 13:05:58,907 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=207, Invalid=4763, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 13:05:58,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2018-10-15 13:05:58,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 840. [2018-10-15 13:05:58,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 840 states. [2018-10-15 13:05:58,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 840 states to 840 states and 858 transitions. [2018-10-15 13:05:58,917 INFO L78 Accepts]: Start accepts. Automaton has 840 states and 858 transitions. Word has length 793 [2018-10-15 13:05:58,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:58,917 INFO L481 AbstractCegarLoop]: Abstraction has 840 states and 858 transitions. [2018-10-15 13:05:58,917 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 13:05:58,918 INFO L276 IsEmpty]: Start isEmpty. Operand 840 states and 858 transitions. [2018-10-15 13:05:58,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 840 [2018-10-15 13:05:58,924 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:58,925 INFO L375 BasicCegarLoop]: trace histogram [180, 180, 180, 180, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:58,925 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:58,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:58,926 INFO L82 PathProgramCache]: Analyzing trace with hash 2003946404, now seen corresponding path program 27 times [2018-10-15 13:05:58,926 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:58,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:06:01,044 INFO L134 CoverageAnalysis]: Checked inductivity of 68616 backedges. 0 proven. 65196 refuted. 0 times theorem prover too weak. 3420 trivial. 0 not checked. [2018-10-15 13:06:01,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:06:01,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 13:06:01,045 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 13:06:01,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 13:06:01,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 13:06:01,045 INFO L87 Difference]: Start difference. First operand 840 states and 858 transitions. Second operand 39 states. [2018-10-15 13:06:04,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:06:04,199 INFO L93 Difference]: Finished difference Result 930 states and 950 transitions. [2018-10-15 13:06:04,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-15 13:06:04,200 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 839 [2018-10-15 13:06:04,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:06:04,204 INFO L225 Difference]: With dead ends: 930 [2018-10-15 13:06:04,205 INFO L226 Difference]: Without dead ends: 930 [2018-10-15 13:06:04,206 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=219, Invalid=5331, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 13:06:04,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2018-10-15 13:06:04,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 886. [2018-10-15 13:06:04,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 886 states. [2018-10-15 13:06:04,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 905 transitions. [2018-10-15 13:06:04,215 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 905 transitions. Word has length 839 [2018-10-15 13:06:04,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:06:04,216 INFO L481 AbstractCegarLoop]: Abstraction has 886 states and 905 transitions. [2018-10-15 13:06:04,216 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 13:06:04,216 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 905 transitions. [2018-10-15 13:06:04,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 886 [2018-10-15 13:06:04,223 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:06:04,224 INFO L375 BasicCegarLoop]: trace histogram [190, 190, 190, 190, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:06:04,224 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:06:04,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:06:04,224 INFO L82 PathProgramCache]: Analyzing trace with hash -337771104, now seen corresponding path program 28 times [2018-10-15 13:06:04,225 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:06:04,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:06:07,389 INFO L134 CoverageAnalysis]: Checked inductivity of 76475 backedges. 0 proven. 72865 refuted. 0 times theorem prover too weak. 3610 trivial. 0 not checked. [2018-10-15 13:06:07,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:06:07,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 13:06:07,390 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 13:06:07,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 13:06:07,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 13:06:07,390 INFO L87 Difference]: Start difference. First operand 886 states and 905 transitions. Second operand 41 states. [2018-10-15 13:06:10,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:06:10,278 INFO L93 Difference]: Finished difference Result 976 states and 997 transitions. [2018-10-15 13:06:10,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-15 13:06:10,279 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 885 [2018-10-15 13:06:10,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:06:10,283 INFO L225 Difference]: With dead ends: 976 [2018-10-15 13:06:10,283 INFO L226 Difference]: Without dead ends: 976 [2018-10-15 13:06:10,285 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=231, Invalid=5931, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 13:06:10,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2018-10-15 13:06:10,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 932. [2018-10-15 13:06:10,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 932 states. [2018-10-15 13:06:10,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 952 transitions. [2018-10-15 13:06:10,295 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 952 transitions. Word has length 885 [2018-10-15 13:06:10,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:06:10,296 INFO L481 AbstractCegarLoop]: Abstraction has 932 states and 952 transitions. [2018-10-15 13:06:10,296 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 13:06:10,296 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 952 transitions. [2018-10-15 13:06:10,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 932 [2018-10-15 13:06:10,304 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:06:10,305 INFO L375 BasicCegarLoop]: trace histogram [200, 200, 200, 200, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:06:10,305 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:06:10,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:06:10,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1510745756, now seen corresponding path program 29 times [2018-10-15 13:06:10,306 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:06:10,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:06:12,548 INFO L134 CoverageAnalysis]: Checked inductivity of 84760 backedges. 0 proven. 80960 refuted. 0 times theorem prover too weak. 3800 trivial. 0 not checked. [2018-10-15 13:06:12,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:06:12,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 13:06:12,549 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 13:06:12,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 13:06:12,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 13:06:12,550 INFO L87 Difference]: Start difference. First operand 932 states and 952 transitions. Second operand 43 states. [2018-10-15 13:06:15,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:06:15,675 INFO L93 Difference]: Finished difference Result 1022 states and 1044 transitions. [2018-10-15 13:06:15,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-15 13:06:15,675 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 931 [2018-10-15 13:06:15,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:06:15,680 INFO L225 Difference]: With dead ends: 1022 [2018-10-15 13:06:15,680 INFO L226 Difference]: Without dead ends: 1022 [2018-10-15 13:06:15,681 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=243, Invalid=6563, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 13:06:15,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1022 states. [2018-10-15 13:06:15,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1022 to 978. [2018-10-15 13:06:15,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 978 states. [2018-10-15 13:06:15,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 999 transitions. [2018-10-15 13:06:15,690 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 999 transitions. Word has length 931 [2018-10-15 13:06:15,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:06:15,691 INFO L481 AbstractCegarLoop]: Abstraction has 978 states and 999 transitions. [2018-10-15 13:06:15,691 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 13:06:15,691 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 999 transitions. [2018-10-15 13:06:15,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 978 [2018-10-15 13:06:15,700 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:06:15,700 INFO L375 BasicCegarLoop]: trace histogram [210, 210, 210, 210, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:06:15,701 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:06:15,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:06:15,701 INFO L82 PathProgramCache]: Analyzing trace with hash 281013912, now seen corresponding path program 30 times [2018-10-15 13:06:15,702 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:06:15,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:06:19,011 INFO L134 CoverageAnalysis]: Checked inductivity of 93471 backedges. 0 proven. 89481 refuted. 0 times theorem prover too weak. 3990 trivial. 0 not checked. [2018-10-15 13:06:19,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:06:19,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 13:06:19,012 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 13:06:19,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 13:06:19,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 13:06:19,012 INFO L87 Difference]: Start difference. First operand 978 states and 999 transitions. Second operand 45 states. [2018-10-15 13:06:22,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:06:22,506 INFO L93 Difference]: Finished difference Result 1068 states and 1091 transitions. [2018-10-15 13:06:22,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-15 13:06:22,506 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 977 [2018-10-15 13:06:22,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:06:22,511 INFO L225 Difference]: With dead ends: 1068 [2018-10-15 13:06:22,511 INFO L226 Difference]: Without dead ends: 1068 [2018-10-15 13:06:22,512 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=255, Invalid=7227, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 13:06:22,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2018-10-15 13:06:22,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 1024. [2018-10-15 13:06:22,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1024 states. [2018-10-15 13:06:22,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1046 transitions. [2018-10-15 13:06:22,521 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1046 transitions. Word has length 977 [2018-10-15 13:06:22,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:06:22,522 INFO L481 AbstractCegarLoop]: Abstraction has 1024 states and 1046 transitions. [2018-10-15 13:06:22,522 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 13:06:22,522 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1046 transitions. [2018-10-15 13:06:22,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1024 [2018-10-15 13:06:22,531 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:06:22,532 INFO L375 BasicCegarLoop]: trace histogram [220, 220, 220, 220, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:06:22,532 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:06:22,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:06:22,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1641210476, now seen corresponding path program 31 times [2018-10-15 13:06:22,533 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:06:22,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:06:26,216 INFO L134 CoverageAnalysis]: Checked inductivity of 102608 backedges. 0 proven. 98428 refuted. 0 times theorem prover too weak. 4180 trivial. 0 not checked. [2018-10-15 13:06:26,216 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:06:26,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 13:06:26,217 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 13:06:26,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 13:06:26,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 13:06:26,218 INFO L87 Difference]: Start difference. First operand 1024 states and 1046 transitions. Second operand 47 states. [2018-10-15 13:06:30,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:06:30,107 INFO L93 Difference]: Finished difference Result 1114 states and 1138 transitions. [2018-10-15 13:06:30,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-15 13:06:30,107 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 1023 [2018-10-15 13:06:30,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:06:30,112 INFO L225 Difference]: With dead ends: 1114 [2018-10-15 13:06:30,112 INFO L226 Difference]: Without dead ends: 1114 [2018-10-15 13:06:30,114 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=267, Invalid=7923, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 13:06:30,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1114 states. [2018-10-15 13:06:30,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1114 to 1070. [2018-10-15 13:06:30,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1070 states. [2018-10-15 13:06:30,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1070 states to 1070 states and 1093 transitions. [2018-10-15 13:06:30,122 INFO L78 Accepts]: Start accepts. Automaton has 1070 states and 1093 transitions. Word has length 1023 [2018-10-15 13:06:30,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:06:30,123 INFO L481 AbstractCegarLoop]: Abstraction has 1070 states and 1093 transitions. [2018-10-15 13:06:30,123 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 13:06:30,123 INFO L276 IsEmpty]: Start isEmpty. Operand 1070 states and 1093 transitions. [2018-10-15 13:06:30,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1070 [2018-10-15 13:06:30,133 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:06:30,134 INFO L375 BasicCegarLoop]: trace histogram [230, 230, 230, 230, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:06:30,134 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:06:30,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:06:30,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1274508176, now seen corresponding path program 32 times [2018-10-15 13:06:30,135 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:06:30,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:06:33,404 INFO L134 CoverageAnalysis]: Checked inductivity of 112171 backedges. 0 proven. 107801 refuted. 0 times theorem prover too weak. 4370 trivial. 0 not checked. [2018-10-15 13:06:33,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:06:33,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 13:06:33,405 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 13:06:33,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 13:06:33,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 13:06:33,406 INFO L87 Difference]: Start difference. First operand 1070 states and 1093 transitions. Second operand 49 states. [2018-10-15 13:06:37,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:06:37,591 INFO L93 Difference]: Finished difference Result 1160 states and 1185 transitions. [2018-10-15 13:06:37,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-15 13:06:37,591 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 1069 [2018-10-15 13:06:37,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:06:37,597 INFO L225 Difference]: With dead ends: 1160 [2018-10-15 13:06:37,597 INFO L226 Difference]: Without dead ends: 1160 [2018-10-15 13:06:37,597 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=279, Invalid=8651, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 13:06:37,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2018-10-15 13:06:37,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 1116. [2018-10-15 13:06:37,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1116 states. [2018-10-15 13:06:37,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1140 transitions. [2018-10-15 13:06:37,608 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1140 transitions. Word has length 1069 [2018-10-15 13:06:37,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:06:37,609 INFO L481 AbstractCegarLoop]: Abstraction has 1116 states and 1140 transitions. [2018-10-15 13:06:37,609 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 13:06:37,609 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1140 transitions. [2018-10-15 13:06:37,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1116 [2018-10-15 13:06:37,621 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:06:37,621 INFO L375 BasicCegarLoop]: trace histogram [240, 240, 240, 240, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:06:37,622 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:06:37,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:06:37,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1691176820, now seen corresponding path program 33 times [2018-10-15 13:06:37,623 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:06:37,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:06:40,533 INFO L134 CoverageAnalysis]: Checked inductivity of 122160 backedges. 0 proven. 117600 refuted. 0 times theorem prover too weak. 4560 trivial. 0 not checked. [2018-10-15 13:06:40,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:06:40,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 13:06:40,534 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 13:06:40,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 13:06:40,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 13:06:40,535 INFO L87 Difference]: Start difference. First operand 1116 states and 1140 transitions. Second operand 51 states. [2018-10-15 13:06:44,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:06:44,954 INFO L93 Difference]: Finished difference Result 1206 states and 1232 transitions. [2018-10-15 13:06:44,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-15 13:06:44,954 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 1115 [2018-10-15 13:06:44,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:06:44,960 INFO L225 Difference]: With dead ends: 1206 [2018-10-15 13:06:44,960 INFO L226 Difference]: Without dead ends: 1206 [2018-10-15 13:06:44,961 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=291, Invalid=9411, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 13:06:44,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2018-10-15 13:06:44,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 1162. [2018-10-15 13:06:44,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1162 states. [2018-10-15 13:06:44,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 1162 states and 1187 transitions. [2018-10-15 13:06:44,972 INFO L78 Accepts]: Start accepts. Automaton has 1162 states and 1187 transitions. Word has length 1115 [2018-10-15 13:06:44,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:06:44,973 INFO L481 AbstractCegarLoop]: Abstraction has 1162 states and 1187 transitions. [2018-10-15 13:06:44,973 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 13:06:44,973 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 1187 transitions. [2018-10-15 13:06:44,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1162 [2018-10-15 13:06:44,985 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:06:44,986 INFO L375 BasicCegarLoop]: trace histogram [250, 250, 250, 250, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:06:44,986 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:06:44,986 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:06:44,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1067281272, now seen corresponding path program 34 times [2018-10-15 13:06:44,987 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:06:45,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:06:48,394 INFO L134 CoverageAnalysis]: Checked inductivity of 132575 backedges. 0 proven. 127825 refuted. 0 times theorem prover too weak. 4750 trivial. 0 not checked. [2018-10-15 13:06:48,395 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:06:48,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 13:06:48,396 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 13:06:48,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 13:06:48,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 13:06:48,396 INFO L87 Difference]: Start difference. First operand 1162 states and 1187 transitions. Second operand 53 states. [2018-10-15 13:06:53,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:06:53,344 INFO L93 Difference]: Finished difference Result 1252 states and 1279 transitions. [2018-10-15 13:06:53,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-15 13:06:53,344 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 1161 [2018-10-15 13:06:53,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:06:53,350 INFO L225 Difference]: With dead ends: 1252 [2018-10-15 13:06:53,350 INFO L226 Difference]: Without dead ends: 1252 [2018-10-15 13:06:53,351 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=303, Invalid=10203, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 13:06:53,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2018-10-15 13:06:53,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1208. [2018-10-15 13:06:53,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1208 states. [2018-10-15 13:06:53,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 1208 states and 1234 transitions. [2018-10-15 13:06:53,361 INFO L78 Accepts]: Start accepts. Automaton has 1208 states and 1234 transitions. Word has length 1161 [2018-10-15 13:06:53,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:06:53,362 INFO L481 AbstractCegarLoop]: Abstraction has 1208 states and 1234 transitions. [2018-10-15 13:06:53,362 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 13:06:53,362 INFO L276 IsEmpty]: Start isEmpty. Operand 1208 states and 1234 transitions. [2018-10-15 13:06:53,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1208 [2018-10-15 13:06:53,374 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:06:53,375 INFO L375 BasicCegarLoop]: trace histogram [260, 260, 260, 260, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:06:53,375 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:06:53,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:06:53,375 INFO L82 PathProgramCache]: Analyzing trace with hash 528146308, now seen corresponding path program 35 times [2018-10-15 13:06:53,376 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:06:53,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:06:57,072 INFO L134 CoverageAnalysis]: Checked inductivity of 143416 backedges. 0 proven. 138476 refuted. 0 times theorem prover too weak. 4940 trivial. 0 not checked. [2018-10-15 13:06:57,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:06:57,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-15 13:06:57,074 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-15 13:06:57,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-15 13:06:57,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 13:06:57,074 INFO L87 Difference]: Start difference. First operand 1208 states and 1234 transitions. Second operand 55 states. [2018-10-15 13:07:02,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:02,328 INFO L93 Difference]: Finished difference Result 1298 states and 1326 transitions. [2018-10-15 13:07:02,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-15 13:07:02,328 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 1207 [2018-10-15 13:07:02,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:02,334 INFO L225 Difference]: With dead ends: 1298 [2018-10-15 13:07:02,334 INFO L226 Difference]: Without dead ends: 1298 [2018-10-15 13:07:02,335 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1326 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=315, Invalid=11027, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 13:07:02,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2018-10-15 13:07:02,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 1254. [2018-10-15 13:07:02,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1254 states. [2018-10-15 13:07:02,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 1281 transitions. [2018-10-15 13:07:02,344 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 1281 transitions. Word has length 1207 [2018-10-15 13:07:02,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:02,345 INFO L481 AbstractCegarLoop]: Abstraction has 1254 states and 1281 transitions. [2018-10-15 13:07:02,345 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-15 13:07:02,345 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1281 transitions. [2018-10-15 13:07:02,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1254 [2018-10-15 13:07:02,355 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:02,356 INFO L375 BasicCegarLoop]: trace histogram [270, 270, 270, 270, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:02,356 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:02,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:02,356 INFO L82 PathProgramCache]: Analyzing trace with hash -941665920, now seen corresponding path program 36 times [2018-10-15 13:07:02,357 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:02,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:06,285 INFO L134 CoverageAnalysis]: Checked inductivity of 154683 backedges. 0 proven. 149553 refuted. 0 times theorem prover too weak. 5130 trivial. 0 not checked. [2018-10-15 13:07:06,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:06,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-15 13:07:06,286 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-15 13:07:06,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-15 13:07:06,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 13:07:06,287 INFO L87 Difference]: Start difference. First operand 1254 states and 1281 transitions. Second operand 57 states. [2018-10-15 13:07:11,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:11,810 INFO L93 Difference]: Finished difference Result 1344 states and 1373 transitions. [2018-10-15 13:07:11,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-15 13:07:11,810 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 1253 [2018-10-15 13:07:11,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:11,816 INFO L225 Difference]: With dead ends: 1344 [2018-10-15 13:07:11,816 INFO L226 Difference]: Without dead ends: 1344 [2018-10-15 13:07:11,817 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1431 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=327, Invalid=11883, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 13:07:11,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1344 states. [2018-10-15 13:07:11,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1344 to 1300. [2018-10-15 13:07:11,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1300 states. [2018-10-15 13:07:11,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 1328 transitions. [2018-10-15 13:07:11,827 INFO L78 Accepts]: Start accepts. Automaton has 1300 states and 1328 transitions. Word has length 1253 [2018-10-15 13:07:11,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:11,828 INFO L481 AbstractCegarLoop]: Abstraction has 1300 states and 1328 transitions. [2018-10-15 13:07:11,828 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-15 13:07:11,828 INFO L276 IsEmpty]: Start isEmpty. Operand 1300 states and 1328 transitions. [2018-10-15 13:07:11,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1300 [2018-10-15 13:07:11,838 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:11,838 INFO L375 BasicCegarLoop]: trace histogram [280, 280, 280, 280, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:11,839 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:11,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:11,839 INFO L82 PathProgramCache]: Analyzing trace with hash -261903748, now seen corresponding path program 37 times [2018-10-15 13:07:11,840 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:11,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:16,284 INFO L134 CoverageAnalysis]: Checked inductivity of 166376 backedges. 0 proven. 161056 refuted. 0 times theorem prover too weak. 5320 trivial. 0 not checked. [2018-10-15 13:07:16,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:16,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-15 13:07:16,285 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-15 13:07:16,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-15 13:07:16,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 13:07:16,286 INFO L87 Difference]: Start difference. First operand 1300 states and 1328 transitions. Second operand 59 states. [2018-10-15 13:07:22,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:22,224 INFO L93 Difference]: Finished difference Result 1390 states and 1420 transitions. [2018-10-15 13:07:22,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-15 13:07:22,225 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 1299 [2018-10-15 13:07:22,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:22,230 INFO L225 Difference]: With dead ends: 1390 [2018-10-15 13:07:22,230 INFO L226 Difference]: Without dead ends: 1390 [2018-10-15 13:07:22,231 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1540 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=339, Invalid=12771, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 13:07:22,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2018-10-15 13:07:22,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 1346. [2018-10-15 13:07:22,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1346 states. [2018-10-15 13:07:22,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 1375 transitions. [2018-10-15 13:07:22,240 INFO L78 Accepts]: Start accepts. Automaton has 1346 states and 1375 transitions. Word has length 1299 [2018-10-15 13:07:22,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:22,241 INFO L481 AbstractCegarLoop]: Abstraction has 1346 states and 1375 transitions. [2018-10-15 13:07:22,241 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-15 13:07:22,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 1375 transitions. [2018-10-15 13:07:22,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1346 [2018-10-15 13:07:22,252 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:22,252 INFO L375 BasicCegarLoop]: trace histogram [290, 290, 290, 290, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:22,253 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:22,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:22,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1934338680, now seen corresponding path program 38 times [2018-10-15 13:07:22,254 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:22,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:27,151 INFO L134 CoverageAnalysis]: Checked inductivity of 178495 backedges. 0 proven. 172985 refuted. 0 times theorem prover too weak. 5510 trivial. 0 not checked. [2018-10-15 13:07:27,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:27,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-15 13:07:27,152 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-15 13:07:27,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-15 13:07:27,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-10-15 13:07:27,152 INFO L87 Difference]: Start difference. First operand 1346 states and 1375 transitions. Second operand 61 states. [2018-10-15 13:07:34,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:34,230 INFO L93 Difference]: Finished difference Result 1436 states and 1467 transitions. [2018-10-15 13:07:34,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-15 13:07:34,230 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 1345 [2018-10-15 13:07:34,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:34,236 INFO L225 Difference]: With dead ends: 1436 [2018-10-15 13:07:34,236 INFO L226 Difference]: Without dead ends: 1436 [2018-10-15 13:07:34,237 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1653 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=351, Invalid=13691, Unknown=0, NotChecked=0, Total=14042 [2018-10-15 13:07:34,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2018-10-15 13:07:34,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 1392. [2018-10-15 13:07:34,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1392 states. [2018-10-15 13:07:34,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 1422 transitions. [2018-10-15 13:07:34,247 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 1422 transitions. Word has length 1345 [2018-10-15 13:07:34,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:34,248 INFO L481 AbstractCegarLoop]: Abstraction has 1392 states and 1422 transitions. [2018-10-15 13:07:34,248 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-15 13:07:34,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 1422 transitions. [2018-10-15 13:07:34,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1392 [2018-10-15 13:07:34,259 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:34,260 INFO L375 BasicCegarLoop]: trace histogram [300, 300, 300, 300, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:34,260 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:34,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:34,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1246433652, now seen corresponding path program 39 times [2018-10-15 13:07:34,261 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:34,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:38,694 INFO L134 CoverageAnalysis]: Checked inductivity of 191040 backedges. 0 proven. 185340 refuted. 0 times theorem prover too weak. 5700 trivial. 0 not checked. [2018-10-15 13:07:38,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:38,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-15 13:07:38,695 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-15 13:07:38,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-15 13:07:38,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 13:07:38,696 INFO L87 Difference]: Start difference. First operand 1392 states and 1422 transitions. Second operand 63 states. [2018-10-15 13:07:45,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:45,622 INFO L93 Difference]: Finished difference Result 1482 states and 1514 transitions. [2018-10-15 13:07:45,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-15 13:07:45,623 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 1391 [2018-10-15 13:07:45,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:45,628 INFO L225 Difference]: With dead ends: 1482 [2018-10-15 13:07:45,628 INFO L226 Difference]: Without dead ends: 1482 [2018-10-15 13:07:45,629 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1770 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=363, Invalid=14643, Unknown=0, NotChecked=0, Total=15006 [2018-10-15 13:07:45,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2018-10-15 13:07:45,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 1438. [2018-10-15 13:07:45,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1438 states. [2018-10-15 13:07:45,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1438 states to 1438 states and 1469 transitions. [2018-10-15 13:07:45,639 INFO L78 Accepts]: Start accepts. Automaton has 1438 states and 1469 transitions. Word has length 1391 [2018-10-15 13:07:45,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:45,640 INFO L481 AbstractCegarLoop]: Abstraction has 1438 states and 1469 transitions. [2018-10-15 13:07:45,640 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-15 13:07:45,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1438 states and 1469 transitions. [2018-10-15 13:07:45,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1438 [2018-10-15 13:07:45,652 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:45,652 INFO L375 BasicCegarLoop]: trace histogram [310, 310, 310, 310, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:45,653 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:45,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:45,653 INFO L82 PathProgramCache]: Analyzing trace with hash 176529264, now seen corresponding path program 40 times [2018-10-15 13:07:45,654 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:45,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:50,235 INFO L134 CoverageAnalysis]: Checked inductivity of 204011 backedges. 0 proven. 198121 refuted. 0 times theorem prover too weak. 5890 trivial. 0 not checked. [2018-10-15 13:07:50,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:50,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-15 13:07:50,237 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-15 13:07:50,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-15 13:07:50,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-10-15 13:07:50,237 INFO L87 Difference]: Start difference. First operand 1438 states and 1469 transitions. Second operand 65 states. [2018-10-15 13:07:57,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:57,335 INFO L93 Difference]: Finished difference Result 1528 states and 1561 transitions. [2018-10-15 13:07:57,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-15 13:07:57,336 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 1437 [2018-10-15 13:07:57,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:57,342 INFO L225 Difference]: With dead ends: 1528 [2018-10-15 13:07:57,342 INFO L226 Difference]: Without dead ends: 1528 [2018-10-15 13:07:57,343 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1891 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=375, Invalid=15627, Unknown=0, NotChecked=0, Total=16002 [2018-10-15 13:07:57,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1528 states. [2018-10-15 13:07:57,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1528 to 1484. [2018-10-15 13:07:57,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1484 states. [2018-10-15 13:07:57,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1484 states to 1484 states and 1516 transitions. [2018-10-15 13:07:57,353 INFO L78 Accepts]: Start accepts. Automaton has 1484 states and 1516 transitions. Word has length 1437 [2018-10-15 13:07:57,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:57,354 INFO L481 AbstractCegarLoop]: Abstraction has 1484 states and 1516 transitions. [2018-10-15 13:07:57,354 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-15 13:07:57,354 INFO L276 IsEmpty]: Start isEmpty. Operand 1484 states and 1516 transitions. [2018-10-15 13:07:57,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1484 [2018-10-15 13:07:57,367 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:57,368 INFO L375 BasicCegarLoop]: trace histogram [320, 320, 320, 320, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:57,368 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:57,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:57,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1619989612, now seen corresponding path program 41 times [2018-10-15 13:07:57,369 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:57,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:08:02,466 INFO L134 CoverageAnalysis]: Checked inductivity of 217408 backedges. 0 proven. 211328 refuted. 0 times theorem prover too weak. 6080 trivial. 0 not checked. [2018-10-15 13:08:02,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:08:02,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-15 13:08:02,467 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-15 13:08:02,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-15 13:08:02,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 13:08:02,468 INFO L87 Difference]: Start difference. First operand 1484 states and 1516 transitions. Second operand 67 states. [2018-10-15 13:08:10,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:08:10,180 INFO L93 Difference]: Finished difference Result 1574 states and 1608 transitions. [2018-10-15 13:08:10,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-10-15 13:08:10,181 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 1483 [2018-10-15 13:08:10,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:08:10,186 INFO L225 Difference]: With dead ends: 1574 [2018-10-15 13:08:10,187 INFO L226 Difference]: Without dead ends: 1574 [2018-10-15 13:08:10,188 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=387, Invalid=16643, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 13:08:10,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1574 states. [2018-10-15 13:08:10,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1574 to 1530. [2018-10-15 13:08:10,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1530 states. [2018-10-15 13:08:10,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1530 states to 1530 states and 1563 transitions. [2018-10-15 13:08:10,199 INFO L78 Accepts]: Start accepts. Automaton has 1530 states and 1563 transitions. Word has length 1483 [2018-10-15 13:08:10,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:08:10,200 INFO L481 AbstractCegarLoop]: Abstraction has 1530 states and 1563 transitions. [2018-10-15 13:08:10,200 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-15 13:08:10,201 INFO L276 IsEmpty]: Start isEmpty. Operand 1530 states and 1563 transitions. [2018-10-15 13:08:10,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1530 [2018-10-15 13:08:10,215 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:08:10,216 INFO L375 BasicCegarLoop]: trace histogram [330, 330, 330, 330, 33, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:08:10,216 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:08:10,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:08:10,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1939132312, now seen corresponding path program 42 times [2018-10-15 13:08:10,217 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:08:10,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:08:15,393 INFO L134 CoverageAnalysis]: Checked inductivity of 231231 backedges. 0 proven. 224961 refuted. 0 times theorem prover too weak. 6270 trivial. 0 not checked. [2018-10-15 13:08:15,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:08:15,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-15 13:08:15,395 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-15 13:08:15,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-15 13:08:15,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-10-15 13:08:15,396 INFO L87 Difference]: Start difference. First operand 1530 states and 1563 transitions. Second operand 69 states. [2018-10-15 13:08:23,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:08:23,394 INFO L93 Difference]: Finished difference Result 1620 states and 1655 transitions. [2018-10-15 13:08:23,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-10-15 13:08:23,395 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 1529 [2018-10-15 13:08:23,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:08:23,401 INFO L225 Difference]: With dead ends: 1620 [2018-10-15 13:08:23,401 INFO L226 Difference]: Without dead ends: 1620 [2018-10-15 13:08:23,402 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2145 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=399, Invalid=17691, Unknown=0, NotChecked=0, Total=18090 [2018-10-15 13:08:23,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1620 states. [2018-10-15 13:08:23,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1620 to 1576. [2018-10-15 13:08:23,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2018-10-15 13:08:23,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1610 transitions. [2018-10-15 13:08:23,413 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1610 transitions. Word has length 1529 [2018-10-15 13:08:23,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:08:23,414 INFO L481 AbstractCegarLoop]: Abstraction has 1576 states and 1610 transitions. [2018-10-15 13:08:23,414 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-15 13:08:23,414 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1610 transitions. [2018-10-15 13:08:23,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1576 [2018-10-15 13:08:23,429 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:08:23,429 INFO L375 BasicCegarLoop]: trace histogram [340, 340, 340, 340, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:08:23,429 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:08:23,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:08:23,430 INFO L82 PathProgramCache]: Analyzing trace with hash -577916060, now seen corresponding path program 43 times [2018-10-15 13:08:23,430 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:08:23,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:08:29,165 INFO L134 CoverageAnalysis]: Checked inductivity of 245480 backedges. 0 proven. 239020 refuted. 0 times theorem prover too weak. 6460 trivial. 0 not checked. [2018-10-15 13:08:29,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:08:29,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-15 13:08:29,167 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-15 13:08:29,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-15 13:08:29,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 13:08:29,167 INFO L87 Difference]: Start difference. First operand 1576 states and 1610 transitions. Second operand 71 states. [2018-10-15 13:08:37,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:08:37,990 INFO L93 Difference]: Finished difference Result 1666 states and 1702 transitions. [2018-10-15 13:08:37,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-10-15 13:08:37,992 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 1575 [2018-10-15 13:08:37,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:08:38,000 INFO L225 Difference]: With dead ends: 1666 [2018-10-15 13:08:38,000 INFO L226 Difference]: Without dead ends: 1666 [2018-10-15 13:08:38,001 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2278 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=411, Invalid=18771, Unknown=0, NotChecked=0, Total=19182 [2018-10-15 13:08:38,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1666 states. [2018-10-15 13:08:38,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1666 to 1622. [2018-10-15 13:08:38,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1622 states. [2018-10-15 13:08:38,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1622 states to 1622 states and 1657 transitions. [2018-10-15 13:08:38,015 INFO L78 Accepts]: Start accepts. Automaton has 1622 states and 1657 transitions. Word has length 1575 [2018-10-15 13:08:38,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:08:38,016 INFO L481 AbstractCegarLoop]: Abstraction has 1622 states and 1657 transitions. [2018-10-15 13:08:38,016 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-15 13:08:38,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 1657 transitions. [2018-10-15 13:08:38,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1622 [2018-10-15 13:08:38,031 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:08:38,032 INFO L375 BasicCegarLoop]: trace histogram [350, 350, 350, 350, 35, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:08:38,032 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:08:38,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:08:38,033 INFO L82 PathProgramCache]: Analyzing trace with hash 786062688, now seen corresponding path program 44 times [2018-10-15 13:08:38,033 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:08:38,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:08:43,963 INFO L134 CoverageAnalysis]: Checked inductivity of 260155 backedges. 0 proven. 253505 refuted. 0 times theorem prover too weak. 6650 trivial. 0 not checked. [2018-10-15 13:08:43,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:08:43,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-15 13:08:43,964 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-15 13:08:43,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-15 13:08:43,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-10-15 13:08:43,965 INFO L87 Difference]: Start difference. First operand 1622 states and 1657 transitions. Second operand 73 states. [2018-10-15 13:08:53,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:08:53,086 INFO L93 Difference]: Finished difference Result 1712 states and 1749 transitions. [2018-10-15 13:08:53,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-10-15 13:08:53,086 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 1621 [2018-10-15 13:08:53,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:08:53,092 INFO L225 Difference]: With dead ends: 1712 [2018-10-15 13:08:53,092 INFO L226 Difference]: Without dead ends: 1712 [2018-10-15 13:08:53,093 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2415 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=423, Invalid=19883, Unknown=0, NotChecked=0, Total=20306 [2018-10-15 13:08:53,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2018-10-15 13:08:53,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1668. [2018-10-15 13:08:53,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1668 states. [2018-10-15 13:08:53,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1668 states to 1668 states and 1704 transitions. [2018-10-15 13:08:53,107 INFO L78 Accepts]: Start accepts. Automaton has 1668 states and 1704 transitions. Word has length 1621 [2018-10-15 13:08:53,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:08:53,109 INFO L481 AbstractCegarLoop]: Abstraction has 1668 states and 1704 transitions. [2018-10-15 13:08:53,109 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-15 13:08:53,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1668 states and 1704 transitions. [2018-10-15 13:08:53,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1668 [2018-10-15 13:08:53,126 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:08:53,126 INFO L375 BasicCegarLoop]: trace histogram [360, 360, 360, 360, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:08:53,127 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:08:53,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:08:53,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1654976092, now seen corresponding path program 45 times [2018-10-15 13:08:53,128 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:08:53,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:08:59,271 INFO L134 CoverageAnalysis]: Checked inductivity of 275256 backedges. 0 proven. 268416 refuted. 0 times theorem prover too weak. 6840 trivial. 0 not checked. [2018-10-15 13:08:59,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:08:59,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-15 13:08:59,272 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-15 13:08:59,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-15 13:08:59,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 13:08:59,272 INFO L87 Difference]: Start difference. First operand 1668 states and 1704 transitions. Second operand 75 states. [2018-10-15 13:09:08,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:09:08,857 INFO L93 Difference]: Finished difference Result 1758 states and 1796 transitions. [2018-10-15 13:09:08,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-10-15 13:09:08,857 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 1667 [2018-10-15 13:09:08,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:09:08,862 INFO L225 Difference]: With dead ends: 1758 [2018-10-15 13:09:08,862 INFO L226 Difference]: Without dead ends: 1758 [2018-10-15 13:09:08,863 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2556 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=435, Invalid=21027, Unknown=0, NotChecked=0, Total=21462 [2018-10-15 13:09:08,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1758 states. [2018-10-15 13:09:08,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1758 to 1714. [2018-10-15 13:09:08,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1714 states. [2018-10-15 13:09:08,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1714 states to 1714 states and 1751 transitions. [2018-10-15 13:09:08,877 INFO L78 Accepts]: Start accepts. Automaton has 1714 states and 1751 transitions. Word has length 1667 [2018-10-15 13:09:08,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:09:08,878 INFO L481 AbstractCegarLoop]: Abstraction has 1714 states and 1751 transitions. [2018-10-15 13:09:08,879 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-15 13:09:08,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1714 states and 1751 transitions. [2018-10-15 13:09:08,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1714 [2018-10-15 13:09:08,895 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:09:08,896 INFO L375 BasicCegarLoop]: trace histogram [370, 370, 370, 370, 37, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:09:08,896 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:09:08,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:09:08,897 INFO L82 PathProgramCache]: Analyzing trace with hash -558815656, now seen corresponding path program 46 times [2018-10-15 13:09:08,897 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:09:08,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:09:15,439 INFO L134 CoverageAnalysis]: Checked inductivity of 290783 backedges. 0 proven. 283753 refuted. 0 times theorem prover too weak. 7030 trivial. 0 not checked. [2018-10-15 13:09:15,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:09:15,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-10-15 13:09:15,440 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-15 13:09:15,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-15 13:09:15,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-10-15 13:09:15,440 INFO L87 Difference]: Start difference. First operand 1714 states and 1751 transitions. Second operand 77 states. [2018-10-15 13:09:25,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:09:25,431 INFO L93 Difference]: Finished difference Result 1804 states and 1843 transitions. [2018-10-15 13:09:25,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-10-15 13:09:25,431 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 1713 [2018-10-15 13:09:25,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:09:25,435 INFO L225 Difference]: With dead ends: 1804 [2018-10-15 13:09:25,435 INFO L226 Difference]: Without dead ends: 1804 [2018-10-15 13:09:25,437 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2701 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=447, Invalid=22203, Unknown=0, NotChecked=0, Total=22650 [2018-10-15 13:09:25,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1804 states. [2018-10-15 13:09:25,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1804 to 1760. [2018-10-15 13:09:25,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1760 states. [2018-10-15 13:09:25,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1760 states to 1760 states and 1798 transitions. [2018-10-15 13:09:25,450 INFO L78 Accepts]: Start accepts. Automaton has 1760 states and 1798 transitions. Word has length 1713 [2018-10-15 13:09:25,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:09:25,451 INFO L481 AbstractCegarLoop]: Abstraction has 1760 states and 1798 transitions. [2018-10-15 13:09:25,451 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-15 13:09:25,451 INFO L276 IsEmpty]: Start isEmpty. Operand 1760 states and 1798 transitions. [2018-10-15 13:09:25,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1760 [2018-10-15 13:09:25,473 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:09:25,474 INFO L375 BasicCegarLoop]: trace histogram [380, 380, 380, 380, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:09:25,474 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:09:25,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:09:25,475 INFO L82 PathProgramCache]: Analyzing trace with hash 137545044, now seen corresponding path program 47 times [2018-10-15 13:09:25,475 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:09:25,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:09:32,475 INFO L134 CoverageAnalysis]: Checked inductivity of 306736 backedges. 0 proven. 299516 refuted. 0 times theorem prover too weak. 7220 trivial. 0 not checked. [2018-10-15 13:09:32,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:09:32,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-10-15 13:09:32,476 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-15 13:09:32,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-15 13:09:32,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 13:09:32,477 INFO L87 Difference]: Start difference. First operand 1760 states and 1798 transitions. Second operand 79 states. [2018-10-15 13:09:43,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:09:43,012 INFO L93 Difference]: Finished difference Result 1850 states and 1890 transitions. [2018-10-15 13:09:43,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-10-15 13:09:43,013 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 1759 [2018-10-15 13:09:43,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:09:43,015 INFO L225 Difference]: With dead ends: 1850 [2018-10-15 13:09:43,016 INFO L226 Difference]: Without dead ends: 1850 [2018-10-15 13:09:43,017 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2850 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=459, Invalid=23411, Unknown=0, NotChecked=0, Total=23870 [2018-10-15 13:09:43,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1850 states. [2018-10-15 13:09:43,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1850 to 1806. [2018-10-15 13:09:43,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1806 states. [2018-10-15 13:09:43,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1806 states to 1806 states and 1845 transitions. [2018-10-15 13:09:43,027 INFO L78 Accepts]: Start accepts. Automaton has 1806 states and 1845 transitions. Word has length 1759 [2018-10-15 13:09:43,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:09:43,028 INFO L481 AbstractCegarLoop]: Abstraction has 1806 states and 1845 transitions. [2018-10-15 13:09:43,028 INFO L482 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-15 13:09:43,028 INFO L276 IsEmpty]: Start isEmpty. Operand 1806 states and 1845 transitions. [2018-10-15 13:09:43,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1806 [2018-10-15 13:09:43,047 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:09:43,047 INFO L375 BasicCegarLoop]: trace histogram [390, 390, 390, 390, 39, 39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:09:43,048 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:09:43,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:09:43,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1077048496, now seen corresponding path program 48 times [2018-10-15 13:09:43,049 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:09:43,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:09:50,065 INFO L134 CoverageAnalysis]: Checked inductivity of 323115 backedges. 0 proven. 315705 refuted. 0 times theorem prover too weak. 7410 trivial. 0 not checked. [2018-10-15 13:09:50,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:09:50,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-15 13:09:50,066 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-15 13:09:50,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-15 13:09:50,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-10-15 13:09:50,067 INFO L87 Difference]: Start difference. First operand 1806 states and 1845 transitions. Second operand 81 states. [2018-10-15 13:10:01,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:10:01,242 INFO L93 Difference]: Finished difference Result 1896 states and 1937 transitions. [2018-10-15 13:10:01,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-10-15 13:10:01,243 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 1805 [2018-10-15 13:10:01,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:10:01,247 INFO L225 Difference]: With dead ends: 1896 [2018-10-15 13:10:01,247 INFO L226 Difference]: Without dead ends: 1896 [2018-10-15 13:10:01,249 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3003 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=471, Invalid=24651, Unknown=0, NotChecked=0, Total=25122 [2018-10-15 13:10:01,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1896 states. [2018-10-15 13:10:01,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1896 to 1852. [2018-10-15 13:10:01,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1852 states. [2018-10-15 13:10:01,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1852 states to 1852 states and 1892 transitions. [2018-10-15 13:10:01,262 INFO L78 Accepts]: Start accepts. Automaton has 1852 states and 1892 transitions. Word has length 1805 [2018-10-15 13:10:01,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:10:01,263 INFO L481 AbstractCegarLoop]: Abstraction has 1852 states and 1892 transitions. [2018-10-15 13:10:01,263 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-15 13:10:01,263 INFO L276 IsEmpty]: Start isEmpty. Operand 1852 states and 1892 transitions. [2018-10-15 13:10:01,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1852 [2018-10-15 13:10:01,282 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:10:01,283 INFO L375 BasicCegarLoop]: trace histogram [400, 400, 400, 400, 40, 40, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:10:01,283 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:10:01,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:10:01,284 INFO L82 PathProgramCache]: Analyzing trace with hash -577423284, now seen corresponding path program 49 times [2018-10-15 13:10:01,284 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:10:01,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:10:08,881 INFO L134 CoverageAnalysis]: Checked inductivity of 339920 backedges. 0 proven. 332320 refuted. 0 times theorem prover too weak. 7600 trivial. 0 not checked. [2018-10-15 13:10:08,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:10:08,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-15 13:10:08,882 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-15 13:10:08,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-15 13:10:08,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 13:10:08,883 INFO L87 Difference]: Start difference. First operand 1852 states and 1892 transitions. Second operand 83 states. [2018-10-15 13:10:20,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:10:20,437 INFO L93 Difference]: Finished difference Result 1942 states and 1984 transitions. [2018-10-15 13:10:20,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-10-15 13:10:20,438 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 1851 [2018-10-15 13:10:20,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:10:20,441 INFO L225 Difference]: With dead ends: 1942 [2018-10-15 13:10:20,441 INFO L226 Difference]: Without dead ends: 1942 [2018-10-15 13:10:20,442 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3160 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=483, Invalid=25923, Unknown=0, NotChecked=0, Total=26406 [2018-10-15 13:10:20,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1942 states. [2018-10-15 13:10:20,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1942 to 1898. [2018-10-15 13:10:20,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1898 states. [2018-10-15 13:10:20,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1898 states to 1898 states and 1939 transitions. [2018-10-15 13:10:20,455 INFO L78 Accepts]: Start accepts. Automaton has 1898 states and 1939 transitions. Word has length 1851 [2018-10-15 13:10:20,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:10:20,457 INFO L481 AbstractCegarLoop]: Abstraction has 1898 states and 1939 transitions. [2018-10-15 13:10:20,457 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-15 13:10:20,457 INFO L276 IsEmpty]: Start isEmpty. Operand 1898 states and 1939 transitions. [2018-10-15 13:10:20,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1898 [2018-10-15 13:10:20,486 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:10:20,487 INFO L375 BasicCegarLoop]: trace histogram [410, 410, 410, 410, 41, 41, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:10:20,487 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:10:20,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:10:20,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1391621048, now seen corresponding path program 50 times [2018-10-15 13:10:20,489 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:10:20,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:10:28,461 INFO L134 CoverageAnalysis]: Checked inductivity of 357151 backedges. 0 proven. 349361 refuted. 0 times theorem prover too weak. 7790 trivial. 0 not checked. [2018-10-15 13:10:28,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:10:28,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-10-15 13:10:28,463 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-15 13:10:28,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-15 13:10:28,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2018-10-15 13:10:28,463 INFO L87 Difference]: Start difference. First operand 1898 states and 1939 transitions. Second operand 85 states. [2018-10-15 13:10:40,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:10:40,783 INFO L93 Difference]: Finished difference Result 1988 states and 2031 transitions. [2018-10-15 13:10:40,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-10-15 13:10:40,784 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 1897 [2018-10-15 13:10:40,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:10:40,787 INFO L225 Difference]: With dead ends: 1988 [2018-10-15 13:10:40,787 INFO L226 Difference]: Without dead ends: 1988 [2018-10-15 13:10:40,789 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3321 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=495, Invalid=27227, Unknown=0, NotChecked=0, Total=27722 [2018-10-15 13:10:40,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1988 states. [2018-10-15 13:10:40,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1988 to 1944. [2018-10-15 13:10:40,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1944 states. [2018-10-15 13:10:40,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1944 states to 1944 states and 1986 transitions. [2018-10-15 13:10:40,804 INFO L78 Accepts]: Start accepts. Automaton has 1944 states and 1986 transitions. Word has length 1897 [2018-10-15 13:10:40,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:10:40,805 INFO L481 AbstractCegarLoop]: Abstraction has 1944 states and 1986 transitions. [2018-10-15 13:10:40,805 INFO L482 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-15 13:10:40,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1944 states and 1986 transitions. [2018-10-15 13:10:40,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1944 [2018-10-15 13:10:40,836 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:10:40,837 INFO L375 BasicCegarLoop]: trace histogram [420, 420, 420, 420, 42, 42, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:10:40,837 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:10:40,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:10:40,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1764378436, now seen corresponding path program 51 times [2018-10-15 13:10:40,839 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:10:40,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:10:49,305 INFO L134 CoverageAnalysis]: Checked inductivity of 374808 backedges. 0 proven. 366828 refuted. 0 times theorem prover too weak. 7980 trivial. 0 not checked. [2018-10-15 13:10:49,305 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:10:49,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-15 13:10:49,306 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-15 13:10:49,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-15 13:10:49,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 13:10:49,307 INFO L87 Difference]: Start difference. First operand 1944 states and 1986 transitions. Second operand 87 states. [2018-10-15 13:11:02,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:11:02,177 INFO L93 Difference]: Finished difference Result 2034 states and 2078 transitions. [2018-10-15 13:11:02,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-10-15 13:11:02,178 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 1943 [2018-10-15 13:11:02,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:11:02,181 INFO L225 Difference]: With dead ends: 2034 [2018-10-15 13:11:02,181 INFO L226 Difference]: Without dead ends: 2034 [2018-10-15 13:11:02,183 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3486 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=507, Invalid=28563, Unknown=0, NotChecked=0, Total=29070 [2018-10-15 13:11:02,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2034 states. [2018-10-15 13:11:02,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2034 to 1990. [2018-10-15 13:11:02,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1990 states. [2018-10-15 13:11:02,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1990 states to 1990 states and 2033 transitions. [2018-10-15 13:11:02,197 INFO L78 Accepts]: Start accepts. Automaton has 1990 states and 2033 transitions. Word has length 1943 [2018-10-15 13:11:02,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:11:02,198 INFO L481 AbstractCegarLoop]: Abstraction has 1990 states and 2033 transitions. [2018-10-15 13:11:02,198 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-15 13:11:02,198 INFO L276 IsEmpty]: Start isEmpty. Operand 1990 states and 2033 transitions. [2018-10-15 13:11:02,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1990 [2018-10-15 13:11:02,231 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:11:02,232 INFO L375 BasicCegarLoop]: trace histogram [430, 430, 430, 430, 43, 43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:11:02,232 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:11:02,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:11:02,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1202771648, now seen corresponding path program 52 times [2018-10-15 13:11:02,234 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:11:02,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:11:10,837 INFO L134 CoverageAnalysis]: Checked inductivity of 392891 backedges. 0 proven. 384721 refuted. 0 times theorem prover too weak. 8170 trivial. 0 not checked. [2018-10-15 13:11:10,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:11:10,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-10-15 13:11:10,839 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-15 13:11:10,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-15 13:11:10,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2018-10-15 13:11:10,839 INFO L87 Difference]: Start difference. First operand 1990 states and 2033 transitions. Second operand 89 states. [2018-10-15 13:11:24,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:11:24,484 INFO L93 Difference]: Finished difference Result 2080 states and 2125 transitions. [2018-10-15 13:11:24,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-10-15 13:11:24,485 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 1989 [2018-10-15 13:11:24,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:11:24,490 INFO L225 Difference]: With dead ends: 2080 [2018-10-15 13:11:24,490 INFO L226 Difference]: Without dead ends: 2080 [2018-10-15 13:11:24,492 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3655 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=519, Invalid=29931, Unknown=0, NotChecked=0, Total=30450 [2018-10-15 13:11:24,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2080 states. [2018-10-15 13:11:24,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2080 to 2036. [2018-10-15 13:11:24,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2036 states. [2018-10-15 13:11:24,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2036 states to 2036 states and 2080 transitions. [2018-10-15 13:11:24,507 INFO L78 Accepts]: Start accepts. Automaton has 2036 states and 2080 transitions. Word has length 1989 [2018-10-15 13:11:24,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:11:24,509 INFO L481 AbstractCegarLoop]: Abstraction has 2036 states and 2080 transitions. [2018-10-15 13:11:24,509 INFO L482 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-15 13:11:24,509 INFO L276 IsEmpty]: Start isEmpty. Operand 2036 states and 2080 transitions. [2018-10-15 13:11:24,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2036 [2018-10-15 13:11:24,543 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:11:24,544 INFO L375 BasicCegarLoop]: trace histogram [440, 440, 440, 440, 44, 44, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:11:24,544 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:11:24,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:11:24,545 INFO L82 PathProgramCache]: Analyzing trace with hash 676327996, now seen corresponding path program 53 times [2018-10-15 13:11:24,545 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:11:24,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:11:33,362 INFO L134 CoverageAnalysis]: Checked inductivity of 411400 backedges. 0 proven. 403040 refuted. 0 times theorem prover too weak. 8360 trivial. 0 not checked. [2018-10-15 13:11:33,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:11:33,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-10-15 13:11:33,364 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-15 13:11:33,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-15 13:11:33,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=8011, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 13:11:33,364 INFO L87 Difference]: Start difference. First operand 2036 states and 2080 transitions. Second operand 91 states. [2018-10-15 13:11:47,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:11:47,703 INFO L93 Difference]: Finished difference Result 2126 states and 2172 transitions. [2018-10-15 13:11:47,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-10-15 13:11:47,704 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 2035 [2018-10-15 13:11:47,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:11:47,707 INFO L225 Difference]: With dead ends: 2126 [2018-10-15 13:11:47,707 INFO L226 Difference]: Without dead ends: 2126 [2018-10-15 13:11:47,707 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3828 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=531, Invalid=31331, Unknown=0, NotChecked=0, Total=31862 [2018-10-15 13:11:47,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2126 states. [2018-10-15 13:11:47,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2126 to 2082. [2018-10-15 13:11:47,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2082 states. [2018-10-15 13:11:47,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2082 states to 2082 states and 2127 transitions. [2018-10-15 13:11:47,721 INFO L78 Accepts]: Start accepts. Automaton has 2082 states and 2127 transitions. Word has length 2035 [2018-10-15 13:11:47,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:11:47,722 INFO L481 AbstractCegarLoop]: Abstraction has 2082 states and 2127 transitions. [2018-10-15 13:11:47,722 INFO L482 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-15 13:11:47,723 INFO L276 IsEmpty]: Start isEmpty. Operand 2082 states and 2127 transitions. [2018-10-15 13:11:47,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2082 [2018-10-15 13:11:47,761 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:11:47,762 INFO L375 BasicCegarLoop]: trace histogram [450, 450, 450, 450, 45, 45, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:11:47,762 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:11:47,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:11:47,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1435475400, now seen corresponding path program 54 times [2018-10-15 13:11:47,763 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:11:47,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:11:57,385 INFO L134 CoverageAnalysis]: Checked inductivity of 430335 backedges. 0 proven. 421785 refuted. 0 times theorem prover too weak. 8550 trivial. 0 not checked. [2018-10-15 13:11:57,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:11:57,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-15 13:11:57,387 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-15 13:11:57,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-15 13:11:57,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=8373, Unknown=0, NotChecked=0, Total=8556 [2018-10-15 13:11:57,387 INFO L87 Difference]: Start difference. First operand 2082 states and 2127 transitions. Second operand 93 states. [2018-10-15 13:12:12,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:12,778 INFO L93 Difference]: Finished difference Result 2172 states and 2219 transitions. [2018-10-15 13:12:12,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-10-15 13:12:12,778 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 2081 [2018-10-15 13:12:12,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:12,781 INFO L225 Difference]: With dead ends: 2172 [2018-10-15 13:12:12,781 INFO L226 Difference]: Without dead ends: 2172 [2018-10-15 13:12:12,783 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4005 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=543, Invalid=32763, Unknown=0, NotChecked=0, Total=33306 [2018-10-15 13:12:12,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2172 states. [2018-10-15 13:12:12,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2172 to 2128. [2018-10-15 13:12:12,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2128 states. [2018-10-15 13:12:12,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2128 states to 2128 states and 2174 transitions. [2018-10-15 13:12:12,798 INFO L78 Accepts]: Start accepts. Automaton has 2128 states and 2174 transitions. Word has length 2081 [2018-10-15 13:12:12,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:12,800 INFO L481 AbstractCegarLoop]: Abstraction has 2128 states and 2174 transitions. [2018-10-15 13:12:12,800 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-15 13:12:12,800 INFO L276 IsEmpty]: Start isEmpty. Operand 2128 states and 2174 transitions. [2018-10-15 13:12:12,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2128 [2018-10-15 13:12:12,837 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:12,838 INFO L375 BasicCegarLoop]: trace histogram [460, 460, 460, 460, 46, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:12,838 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:12,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:12,839 INFO L82 PathProgramCache]: Analyzing trace with hash 258226484, now seen corresponding path program 55 times [2018-10-15 13:12:12,840 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:12,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:23,990 INFO L134 CoverageAnalysis]: Checked inductivity of 449696 backedges. 0 proven. 440956 refuted. 0 times theorem prover too weak. 8740 trivial. 0 not checked. [2018-10-15 13:12:23,991 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:23,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-10-15 13:12:23,992 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-15 13:12:23,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-15 13:12:23,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=8743, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 13:12:23,992 INFO L87 Difference]: Start difference. First operand 2128 states and 2174 transitions. Second operand 95 states. [2018-10-15 13:12:39,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:39,396 INFO L93 Difference]: Finished difference Result 2218 states and 2266 transitions. [2018-10-15 13:12:39,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-10-15 13:12:39,396 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 2127 [2018-10-15 13:12:39,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:39,399 INFO L225 Difference]: With dead ends: 2218 [2018-10-15 13:12:39,399 INFO L226 Difference]: Without dead ends: 2218 [2018-10-15 13:12:39,401 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4186 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=555, Invalid=34227, Unknown=0, NotChecked=0, Total=34782 [2018-10-15 13:12:39,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2218 states. [2018-10-15 13:12:39,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2218 to 2174. [2018-10-15 13:12:39,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2174 states. [2018-10-15 13:12:39,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2174 states to 2174 states and 2221 transitions. [2018-10-15 13:12:39,411 INFO L78 Accepts]: Start accepts. Automaton has 2174 states and 2221 transitions. Word has length 2127 [2018-10-15 13:12:39,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:39,412 INFO L481 AbstractCegarLoop]: Abstraction has 2174 states and 2221 transitions. [2018-10-15 13:12:39,412 INFO L482 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-15 13:12:39,412 INFO L276 IsEmpty]: Start isEmpty. Operand 2174 states and 2221 transitions. [2018-10-15 13:12:39,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2174 [2018-10-15 13:12:39,439 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:39,440 INFO L375 BasicCegarLoop]: trace histogram [470, 470, 470, 470, 47, 47, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:39,440 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:39,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:39,440 INFO L82 PathProgramCache]: Analyzing trace with hash -2091960528, now seen corresponding path program 56 times [2018-10-15 13:12:39,441 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:39,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:49,521 INFO L134 CoverageAnalysis]: Checked inductivity of 469483 backedges. 0 proven. 460553 refuted. 0 times theorem prover too weak. 8930 trivial. 0 not checked. [2018-10-15 13:12:49,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:49,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-10-15 13:12:49,523 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-10-15 13:12:49,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-10-15 13:12:49,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=9121, Unknown=0, NotChecked=0, Total=9312 [2018-10-15 13:12:49,523 INFO L87 Difference]: Start difference. First operand 2174 states and 2221 transitions. Second operand 97 states. [2018-10-15 13:13:05,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:05,459 INFO L93 Difference]: Finished difference Result 2264 states and 2313 transitions. [2018-10-15 13:13:05,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-10-15 13:13:05,459 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 2173 [2018-10-15 13:13:05,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:05,462 INFO L225 Difference]: With dead ends: 2264 [2018-10-15 13:13:05,462 INFO L226 Difference]: Without dead ends: 2264 [2018-10-15 13:13:05,463 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4371 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=567, Invalid=35723, Unknown=0, NotChecked=0, Total=36290 [2018-10-15 13:13:05,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2264 states. [2018-10-15 13:13:05,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2264 to 2220. [2018-10-15 13:13:05,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2220 states. [2018-10-15 13:13:05,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2220 states to 2220 states and 2268 transitions. [2018-10-15 13:13:05,476 INFO L78 Accepts]: Start accepts. Automaton has 2220 states and 2268 transitions. Word has length 2173 [2018-10-15 13:13:05,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:05,477 INFO L481 AbstractCegarLoop]: Abstraction has 2220 states and 2268 transitions. [2018-10-15 13:13:05,477 INFO L482 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-10-15 13:13:05,477 INFO L276 IsEmpty]: Start isEmpty. Operand 2220 states and 2268 transitions. [2018-10-15 13:13:05,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2220 [2018-10-15 13:13:05,505 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:05,505 INFO L375 BasicCegarLoop]: trace histogram [480, 480, 480, 480, 48, 48, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:05,506 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:05,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:05,506 INFO L82 PathProgramCache]: Analyzing trace with hash 163912748, now seen corresponding path program 57 times [2018-10-15 13:13:05,507 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:05,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:18,513 INFO L134 CoverageAnalysis]: Checked inductivity of 489696 backedges. 0 proven. 480576 refuted. 0 times theorem prover too weak. 9120 trivial. 0 not checked. [2018-10-15 13:13:18,516 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:18,516 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-10-15 13:13:18,517 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-10-15 13:13:18,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-10-15 13:13:18,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=9507, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 13:13:18,518 INFO L87 Difference]: Start difference. First operand 2220 states and 2268 transitions. Second operand 99 states. [2018-10-15 13:13:35,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:35,038 INFO L93 Difference]: Finished difference Result 2310 states and 2360 transitions. [2018-10-15 13:13:35,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-10-15 13:13:35,038 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 2219 [2018-10-15 13:13:35,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:35,040 INFO L225 Difference]: With dead ends: 2310 [2018-10-15 13:13:35,040 INFO L226 Difference]: Without dead ends: 2310 [2018-10-15 13:13:35,041 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4560 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=579, Invalid=37251, Unknown=0, NotChecked=0, Total=37830 [2018-10-15 13:13:35,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2310 states. [2018-10-15 13:13:35,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2310 to 2266. [2018-10-15 13:13:35,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2266 states. [2018-10-15 13:13:35,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2266 states to 2266 states and 2315 transitions. [2018-10-15 13:13:35,053 INFO L78 Accepts]: Start accepts. Automaton has 2266 states and 2315 transitions. Word has length 2219 [2018-10-15 13:13:35,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:35,054 INFO L481 AbstractCegarLoop]: Abstraction has 2266 states and 2315 transitions. [2018-10-15 13:13:35,054 INFO L482 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-10-15 13:13:35,054 INFO L276 IsEmpty]: Start isEmpty. Operand 2266 states and 2315 transitions. [2018-10-15 13:13:35,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2266 [2018-10-15 13:13:35,082 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:35,083 INFO L375 BasicCegarLoop]: trace histogram [490, 490, 490, 490, 49, 49, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:35,083 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:35,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:35,083 INFO L82 PathProgramCache]: Analyzing trace with hash -104224728, now seen corresponding path program 58 times [2018-10-15 13:13:35,084 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:35,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat