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/20170304-DifficultPathPrograms/const1.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d769cf3 [2018-10-15 15:23:32,429 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 15:23:32,431 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 15:23:32,444 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 15:23:32,444 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 15:23:32,445 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 15:23:32,446 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 15:23:32,449 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 15:23:32,451 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 15:23:32,452 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 15:23:32,455 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 15:23:32,455 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 15:23:32,456 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 15:23:32,457 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 15:23:32,461 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 15:23:32,462 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 15:23:32,462 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 15:23:32,473 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 15:23:32,478 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 15:23:32,480 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 15:23:32,481 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 15:23:32,488 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 15:23:32,492 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 15:23:32,492 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 15:23:32,493 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 15:23:32,494 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 15:23:32,495 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 15:23:32,495 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 15:23:32,496 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 15:23:32,498 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 15:23:32,498 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 15:23:32,499 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 15:23:32,499 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 15:23:32,499 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 15:23:32,500 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 15:23:32,501 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 15:23:32,501 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 15:23:32,515 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 15:23:32,515 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 15:23:32,516 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 15:23:32,516 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 15:23:32,516 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 15:23:32,517 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 15:23:32,517 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 15:23:32,518 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 15:23:32,518 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 15:23:32,518 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 15:23:32,518 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 15:23:32,518 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 15:23:32,519 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 15:23:32,519 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 15:23:32,520 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 15:23:32,581 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 15:23:32,595 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 15:23:32,602 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 15:23:32,604 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 15:23:32,604 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 15:23:32,605 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/const1.i_3.bpl [2018-10-15 15:23:32,606 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/const1.i_3.bpl' [2018-10-15 15:23:32,659 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 15:23:32,661 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-15 15:23:32,662 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 15:23:32,662 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 15:23:32,662 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 15:23:32,687 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:23:32" (1/1) ... [2018-10-15 15:23:32,689 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:23:32" (1/1) ... [2018-10-15 15:23:32,699 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:23:32" (1/1) ... [2018-10-15 15:23:32,700 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:23:32" (1/1) ... [2018-10-15 15:23:32,702 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:23:32" (1/1) ... [2018-10-15 15:23:32,704 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:23:32" (1/1) ... [2018-10-15 15:23:32,705 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:23:32" (1/1) ... [2018-10-15 15:23:32,707 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 15:23:32,708 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 15:23:32,708 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 15:23:32,708 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 15:23:32,709 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:23:32" (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 15:23:32,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 15:23:32,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 15:23:33,088 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 15:23:33,089 INFO L202 PluginConnector]: Adding new model const1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:23:33 BoogieIcfgContainer [2018-10-15 15:23:33,090 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 15:23:33,090 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-15 15:23:33,090 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-15 15:23:33,091 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-15 15:23:33,095 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:23:33" (1/1) ... [2018-10-15 15:23:33,101 WARN L219 ansformationObserver]: HeapSeparator: input icfg has no '#valid' array -- returning unchanged Icfg! [2018-10-15 15:23:33,119 INFO L202 PluginConnector]: Adding new model const1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 03:23:33 BasicIcfg [2018-10-15 15:23:33,119 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-15 15:23:33,120 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 15:23:33,121 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 15:23:33,124 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 15:23:33,124 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:23:32" (1/3) ... [2018-10-15 15:23:33,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39255c80 and model type const1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:23:33, skipping insertion in model container [2018-10-15 15:23:33,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:23:33" (2/3) ... [2018-10-15 15:23:33,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39255c80 and model type const1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 03:23:33, skipping insertion in model container [2018-10-15 15:23:33,127 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "const1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 03:23:33" (3/3) ... [2018-10-15 15:23:33,128 INFO L112 eAbstractionObserver]: Analyzing ICFG const1.i_3.bplleft_unchanged_by_heapseparator [2018-10-15 15:23:33,139 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 15:23:33,147 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 15:23:33,160 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 15:23:33,185 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 15:23:33,186 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 15:23:33,187 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 15:23:33,187 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 15:23:33,187 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 15:23:33,187 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 15:23:33,187 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 15:23:33,188 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 15:23:33,188 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 15:23:33,200 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-10-15 15:23:33,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-15 15:23:33,209 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:33,210 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:33,211 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:33,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:33,218 INFO L82 PathProgramCache]: Analyzing trace with hash -111570519, now seen corresponding path program 1 times [2018-10-15 15:23:33,267 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:33,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:33,481 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 15:23:33,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:23:33,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:23:33,499 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:23:33,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:23:33,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:23:33,519 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2018-10-15 15:23:33,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:33,602 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-10-15 15:23:33,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:23:33,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-10-15 15:23:33,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:33,617 INFO L225 Difference]: With dead ends: 22 [2018-10-15 15:23:33,618 INFO L226 Difference]: Without dead ends: 22 [2018-10-15 15:23:33,620 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:23:33,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-10-15 15:23:33,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2018-10-15 15:23:33,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-15 15:23:33,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-10-15 15:23:33,657 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 12 [2018-10-15 15:23:33,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:33,658 INFO L481 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-10-15 15:23:33,658 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:23:33,659 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-10-15 15:23:33,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-15 15:23:33,659 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:33,660 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:33,660 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:33,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:33,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1245259697, now seen corresponding path program 1 times [2018-10-15 15:23:33,662 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:33,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:33,826 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:23:33,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:33,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-15 15:23:33,829 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 15:23:33,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 15:23:33,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-15 15:23:33,830 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 5 states. [2018-10-15 15:23:34,044 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-15 15:23:34,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:34,255 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-10-15 15:23:34,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-15 15:23:34,256 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-10-15 15:23:34,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:34,257 INFO L225 Difference]: With dead ends: 28 [2018-10-15 15:23:34,257 INFO L226 Difference]: Without dead ends: 28 [2018-10-15 15:23:34,259 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-15 15:23:34,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-10-15 15:23:34,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2018-10-15 15:23:34,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-15 15:23:34,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-10-15 15:23:34,263 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 18 [2018-10-15 15:23:34,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:34,264 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-10-15 15:23:34,264 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 15:23:34,264 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-10-15 15:23:34,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-15 15:23:34,265 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:34,265 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:34,266 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:34,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:34,266 INFO L82 PathProgramCache]: Analyzing trace with hash -302904715, now seen corresponding path program 2 times [2018-10-15 15:23:34,267 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:34,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:34,772 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:23:34,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:34,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-15 15:23:34,773 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-15 15:23:34,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-15 15:23:34,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-15 15:23:34,774 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 7 states. [2018-10-15 15:23:35,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:35,077 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-10-15 15:23:35,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-15 15:23:35,078 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-10-15 15:23:35,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:35,079 INFO L225 Difference]: With dead ends: 34 [2018-10-15 15:23:35,080 INFO L226 Difference]: Without dead ends: 34 [2018-10-15 15:23:35,080 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 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 15:23:35,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-15 15:23:35,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2018-10-15 15:23:35,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-15 15:23:35,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-10-15 15:23:35,086 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 24 [2018-10-15 15:23:35,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:35,088 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-10-15 15:23:35,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-15 15:23:35,089 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-10-15 15:23:35,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-15 15:23:35,090 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:35,090 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:35,090 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:35,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:35,091 INFO L82 PathProgramCache]: Analyzing trace with hash -342063077, now seen corresponding path program 3 times [2018-10-15 15:23:35,092 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:35,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:35,334 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:23:35,335 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:35,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-15 15:23:35,335 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 15:23:35,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 15:23:35,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-15 15:23:35,337 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 9 states. [2018-10-15 15:23:35,704 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-15 15:23:36,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:36,062 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-10-15 15:23:36,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-15 15:23:36,067 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-10-15 15:23:36,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:36,068 INFO L225 Difference]: With dead ends: 40 [2018-10-15 15:23:36,068 INFO L226 Difference]: Without dead ends: 40 [2018-10-15 15:23:36,069 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 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 15:23:36,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-10-15 15:23:36,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2018-10-15 15:23:36,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-15 15:23:36,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-10-15 15:23:36,075 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 30 [2018-10-15 15:23:36,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:36,075 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-10-15 15:23:36,076 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 15:23:36,076 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-10-15 15:23:36,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-15 15:23:36,077 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:36,077 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:36,078 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:36,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:36,078 INFO L82 PathProgramCache]: Analyzing trace with hash 973058369, now seen corresponding path program 4 times [2018-10-15 15:23:36,079 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:36,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:36,333 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:23:36,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:36,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 15:23:36,334 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 15:23:36,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 15:23:36,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-10-15 15:23:36,335 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 11 states. [2018-10-15 15:23:36,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:36,765 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-10-15 15:23:36,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-15 15:23:36,767 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2018-10-15 15:23:36,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:36,768 INFO L225 Difference]: With dead ends: 46 [2018-10-15 15:23:36,768 INFO L226 Difference]: Without dead ends: 46 [2018-10-15 15:23:36,769 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-10-15 15:23:36,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-10-15 15:23:36,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2018-10-15 15:23:36,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-15 15:23:36,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-10-15 15:23:36,775 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 36 [2018-10-15 15:23:36,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:36,775 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-10-15 15:23:36,776 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 15:23:36,776 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-10-15 15:23:36,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-15 15:23:36,777 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:36,777 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:36,778 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:36,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:36,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1412635161, now seen corresponding path program 5 times [2018-10-15 15:23:36,779 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:36,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:37,062 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:23:37,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:37,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-15 15:23:37,063 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-15 15:23:37,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-15 15:23:37,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-10-15 15:23:37,064 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 13 states. [2018-10-15 15:23:37,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:37,902 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-10-15 15:23:37,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-15 15:23:37,903 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 42 [2018-10-15 15:23:37,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:37,905 INFO L225 Difference]: With dead ends: 52 [2018-10-15 15:23:37,905 INFO L226 Difference]: Without dead ends: 52 [2018-10-15 15:23:37,905 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 15:23:37,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-10-15 15:23:37,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2018-10-15 15:23:37,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-15 15:23:37,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-10-15 15:23:37,911 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 42 [2018-10-15 15:23:37,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:37,912 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-10-15 15:23:37,914 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-15 15:23:37,914 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-10-15 15:23:37,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-15 15:23:37,915 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:37,915 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:37,915 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:37,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:37,916 INFO L82 PathProgramCache]: Analyzing trace with hash -517110259, now seen corresponding path program 6 times [2018-10-15 15:23:37,917 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:37,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:38,347 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:23:38,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:38,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 15:23:38,348 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 15:23:38,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 15:23:38,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-10-15 15:23:38,349 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 15 states. [2018-10-15 15:23:38,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:38,846 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-10-15 15:23:38,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-15 15:23:38,847 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 48 [2018-10-15 15:23:38,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:38,849 INFO L225 Difference]: With dead ends: 58 [2018-10-15 15:23:38,849 INFO L226 Difference]: Without dead ends: 58 [2018-10-15 15:23:38,850 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 15:23:38,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-10-15 15:23:38,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2018-10-15 15:23:38,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-15 15:23:38,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-10-15 15:23:38,857 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 48 [2018-10-15 15:23:38,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:38,858 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-10-15 15:23:38,858 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 15:23:38,858 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-10-15 15:23:38,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-15 15:23:38,859 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:38,859 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:38,860 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:38,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:38,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1304621491, now seen corresponding path program 7 times [2018-10-15 15:23:38,861 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:38,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:39,245 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:23:39,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:39,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-15 15:23:39,246 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-15 15:23:39,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-15 15:23:39,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-10-15 15:23:39,247 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 17 states. [2018-10-15 15:23:40,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:40,082 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-10-15 15:23:40,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-15 15:23:40,086 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 54 [2018-10-15 15:23:40,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:40,087 INFO L225 Difference]: With dead ends: 64 [2018-10-15 15:23:40,087 INFO L226 Difference]: Without dead ends: 64 [2018-10-15 15:23:40,088 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2018-10-15 15:23:40,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-10-15 15:23:40,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2018-10-15 15:23:40,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-15 15:23:40,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-10-15 15:23:40,093 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 54 [2018-10-15 15:23:40,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:40,094 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-10-15 15:23:40,094 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-15 15:23:40,094 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-10-15 15:23:40,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-15 15:23:40,095 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:40,095 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:40,096 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:40,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:40,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1096382247, now seen corresponding path program 8 times [2018-10-15 15:23:40,097 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:40,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:40,457 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:23:40,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:40,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-15 15:23:40,458 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-15 15:23:40,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-15 15:23:40,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-10-15 15:23:40,459 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 19 states. [2018-10-15 15:23:41,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:41,352 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-10-15 15:23:41,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-15 15:23:41,357 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 60 [2018-10-15 15:23:41,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:41,358 INFO L225 Difference]: With dead ends: 70 [2018-10-15 15:23:41,358 INFO L226 Difference]: Without dead ends: 70 [2018-10-15 15:23:41,359 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 15:23:41,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-10-15 15:23:41,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2018-10-15 15:23:41,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-15 15:23:41,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-10-15 15:23:41,364 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 60 [2018-10-15 15:23:41,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:41,364 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-10-15 15:23:41,365 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-15 15:23:41,365 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-10-15 15:23:41,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-15 15:23:41,366 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:41,366 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:41,366 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:41,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:41,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1617537919, now seen corresponding path program 9 times [2018-10-15 15:23:41,367 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:41,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:41,792 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:23:41,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:41,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 15:23:41,793 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 15:23:41,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 15:23:41,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-10-15 15:23:41,794 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 21 states. [2018-10-15 15:23:43,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:43,086 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-10-15 15:23:43,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-15 15:23:43,092 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 66 [2018-10-15 15:23:43,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:43,093 INFO L225 Difference]: With dead ends: 76 [2018-10-15 15:23:43,093 INFO L226 Difference]: Without dead ends: 76 [2018-10-15 15:23:43,094 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 15:23:43,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-10-15 15:23:43,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2018-10-15 15:23:43,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-15 15:23:43,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-10-15 15:23:43,099 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 66 [2018-10-15 15:23:43,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:43,100 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-10-15 15:23:43,100 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 15:23:43,100 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-10-15 15:23:43,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-15 15:23:43,101 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:43,101 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:43,101 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:43,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:43,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1159051685, now seen corresponding path program 10 times [2018-10-15 15:23:43,103 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:43,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:43,923 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 0 proven. 290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:23:43,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:43,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-15 15:23:43,924 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-15 15:23:43,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-15 15:23:43,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-10-15 15:23:43,925 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 23 states. [2018-10-15 15:23:45,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:45,078 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-10-15 15:23:45,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-15 15:23:45,078 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 72 [2018-10-15 15:23:45,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:45,080 INFO L225 Difference]: With dead ends: 82 [2018-10-15 15:23:45,080 INFO L226 Difference]: Without dead ends: 82 [2018-10-15 15:23:45,082 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 15:23:45,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-10-15 15:23:45,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2018-10-15 15:23:45,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-10-15 15:23:45,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-10-15 15:23:45,089 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 72 [2018-10-15 15:23:45,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:45,089 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-10-15 15:23:45,090 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-15 15:23:45,090 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-10-15 15:23:45,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-15 15:23:45,091 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:45,091 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:45,091 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:45,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:45,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1781273419, now seen corresponding path program 11 times [2018-10-15 15:23:45,093 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:45,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:45,532 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 0 proven. 352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:23:45,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:45,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-15 15:23:45,533 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-15 15:23:45,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-15 15:23:45,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-10-15 15:23:45,534 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 25 states. [2018-10-15 15:23:46,404 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-15 15:23:47,054 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-15 15:23:47,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:47,775 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-10-15 15:23:47,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-15 15:23:47,776 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 78 [2018-10-15 15:23:47,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:47,777 INFO L225 Difference]: With dead ends: 88 [2018-10-15 15:23:47,777 INFO L226 Difference]: Without dead ends: 88 [2018-10-15 15:23:47,779 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=135, Invalid=2027, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 15:23:47,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-10-15 15:23:47,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 85. [2018-10-15 15:23:47,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-15 15:23:47,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-10-15 15:23:47,784 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 78 [2018-10-15 15:23:47,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:47,784 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-10-15 15:23:47,784 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-15 15:23:47,784 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-10-15 15:23:47,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-15 15:23:47,786 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:47,786 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:47,787 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:47,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:47,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1051072625, now seen corresponding path program 12 times [2018-10-15 15:23:47,788 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:47,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:48,748 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:23:48,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:48,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 15:23:48,748 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 15:23:48,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 15:23:48,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-10-15 15:23:48,749 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 27 states. [2018-10-15 15:23:50,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:50,142 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-10-15 15:23:50,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-15 15:23:50,143 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 84 [2018-10-15 15:23:50,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:50,144 INFO L225 Difference]: With dead ends: 94 [2018-10-15 15:23:50,144 INFO L226 Difference]: Without dead ends: 94 [2018-10-15 15:23:50,146 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=147, Invalid=2403, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 15:23:50,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-10-15 15:23:50,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2018-10-15 15:23:50,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-10-15 15:23:50,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-10-15 15:23:50,150 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 84 [2018-10-15 15:23:50,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:50,151 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-10-15 15:23:50,151 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 15:23:50,151 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-10-15 15:23:50,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-15 15:23:50,152 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:50,152 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:50,152 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:50,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:50,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1460328169, now seen corresponding path program 13 times [2018-10-15 15:23:50,154 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:50,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:51,071 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 0 proven. 494 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:23:51,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:51,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 15:23:51,071 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 15:23:51,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 15:23:51,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-10-15 15:23:51,072 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 29 states. [2018-10-15 15:23:52,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:52,542 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-10-15 15:23:52,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-15 15:23:52,542 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 90 [2018-10-15 15:23:52,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:52,544 INFO L225 Difference]: With dead ends: 100 [2018-10-15 15:23:52,544 INFO L226 Difference]: Without dead ends: 100 [2018-10-15 15:23:52,546 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=159, Invalid=2811, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 15:23:52,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-10-15 15:23:52,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2018-10-15 15:23:52,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-10-15 15:23:52,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-10-15 15:23:52,550 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 90 [2018-10-15 15:23:52,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:52,550 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-10-15 15:23:52,550 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 15:23:52,551 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-10-15 15:23:52,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-15 15:23:52,552 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:52,552 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:52,552 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:52,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:52,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1929206467, now seen corresponding path program 14 times [2018-10-15 15:23:52,554 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:52,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:53,708 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 0 proven. 574 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:23:53,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:53,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 15:23:53,709 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 15:23:53,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 15:23:53,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-10-15 15:23:53,710 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 31 states. [2018-10-15 15:23:55,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:55,350 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-10-15 15:23:55,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-15 15:23:55,360 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 96 [2018-10-15 15:23:55,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:55,361 INFO L225 Difference]: With dead ends: 106 [2018-10-15 15:23:55,361 INFO L226 Difference]: Without dead ends: 106 [2018-10-15 15:23:55,362 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=171, Invalid=3251, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 15:23:55,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-10-15 15:23:55,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 103. [2018-10-15 15:23:55,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-10-15 15:23:55,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-10-15 15:23:55,367 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 96 [2018-10-15 15:23:55,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:55,367 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-10-15 15:23:55,367 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 15:23:55,368 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-10-15 15:23:55,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-15 15:23:55,369 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:55,371 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:55,371 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:55,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:55,371 INFO L82 PathProgramCache]: Analyzing trace with hash -768611101, now seen corresponding path program 15 times [2018-10-15 15:23:55,372 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:55,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:56,520 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 0 proven. 660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:23:56,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:56,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 15:23:56,521 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 15:23:56,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 15:23:56,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 15:23:56,522 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 33 states. [2018-10-15 15:23:58,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:58,767 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2018-10-15 15:23:58,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-15 15:23:58,769 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 102 [2018-10-15 15:23:58,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:58,769 INFO L225 Difference]: With dead ends: 112 [2018-10-15 15:23:58,769 INFO L226 Difference]: Without dead ends: 112 [2018-10-15 15:23:58,771 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=183, Invalid=3723, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 15:23:58,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-10-15 15:23:58,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2018-10-15 15:23:58,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-10-15 15:23:58,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-10-15 15:23:58,774 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 102 [2018-10-15 15:23:58,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:58,775 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-10-15 15:23:58,775 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 15:23:58,775 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-10-15 15:23:58,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-15 15:23:58,776 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:58,776 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:58,776 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:58,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:58,777 INFO L82 PathProgramCache]: Analyzing trace with hash -380215287, now seen corresponding path program 16 times [2018-10-15 15:23:58,778 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:58,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:00,069 INFO L134 CoverageAnalysis]: Checked inductivity of 752 backedges. 0 proven. 752 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:24:00,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:00,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 15:24:00,070 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 15:24:00,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 15:24:00,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 15:24:00,071 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 35 states. [2018-10-15 15:24:01,942 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-15 15:24:02,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:02,842 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2018-10-15 15:24:02,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-15 15:24:02,844 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 108 [2018-10-15 15:24:02,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:02,845 INFO L225 Difference]: With dead ends: 118 [2018-10-15 15:24:02,845 INFO L226 Difference]: Without dead ends: 118 [2018-10-15 15:24:02,848 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=195, Invalid=4227, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 15:24:02,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-10-15 15:24:02,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 115. [2018-10-15 15:24:02,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-10-15 15:24:02,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-10-15 15:24:02,852 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 108 [2018-10-15 15:24:02,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:02,852 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-10-15 15:24:02,852 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 15:24:02,852 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-10-15 15:24:02,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-10-15 15:24:02,853 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:02,853 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:02,853 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:02,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:02,854 INFO L82 PathProgramCache]: Analyzing trace with hash -758686033, now seen corresponding path program 17 times [2018-10-15 15:24:02,854 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:02,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:03,927 INFO L134 CoverageAnalysis]: Checked inductivity of 850 backedges. 0 proven. 850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:24:03,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:03,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 15:24:03,928 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 15:24:03,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 15:24:03,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 15:24:03,929 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 37 states. [2018-10-15 15:24:06,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:06,234 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2018-10-15 15:24:06,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-15 15:24:06,235 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 114 [2018-10-15 15:24:06,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:06,236 INFO L225 Difference]: With dead ends: 124 [2018-10-15 15:24:06,236 INFO L226 Difference]: Without dead ends: 124 [2018-10-15 15:24:06,238 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=207, Invalid=4763, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 15:24:06,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-10-15 15:24:06,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 121. [2018-10-15 15:24:06,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-10-15 15:24:06,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-10-15 15:24:06,242 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 114 [2018-10-15 15:24:06,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:06,242 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-10-15 15:24:06,242 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 15:24:06,242 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-10-15 15:24:06,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-15 15:24:06,243 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:06,243 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:06,243 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:06,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:06,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1538504491, now seen corresponding path program 18 times [2018-10-15 15:24:06,244 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:06,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:07,565 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 0 proven. 954 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:24:07,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:07,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 15:24:07,566 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 15:24:07,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 15:24:07,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 15:24:07,567 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 39 states. [2018-10-15 15:24:10,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:10,594 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2018-10-15 15:24:10,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-15 15:24:10,596 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 120 [2018-10-15 15:24:10,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:10,597 INFO L225 Difference]: With dead ends: 130 [2018-10-15 15:24:10,597 INFO L226 Difference]: Without dead ends: 130 [2018-10-15 15:24:10,599 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=219, Invalid=5331, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 15:24:10,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-10-15 15:24:10,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2018-10-15 15:24:10,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-10-15 15:24:10,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2018-10-15 15:24:10,602 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 120 [2018-10-15 15:24:10,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:10,603 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2018-10-15 15:24:10,603 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 15:24:10,603 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2018-10-15 15:24:10,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-10-15 15:24:10,604 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:10,604 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:10,604 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:10,604 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:10,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1893302661, now seen corresponding path program 19 times [2018-10-15 15:24:10,605 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:10,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:11,521 INFO L134 CoverageAnalysis]: Checked inductivity of 1064 backedges. 0 proven. 1064 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:24:11,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:11,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 15:24:11,522 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 15:24:11,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 15:24:11,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 15:24:11,523 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 41 states. [2018-10-15 15:24:14,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:14,583 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2018-10-15 15:24:14,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-15 15:24:14,584 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 126 [2018-10-15 15:24:14,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:14,585 INFO L225 Difference]: With dead ends: 136 [2018-10-15 15:24:14,585 INFO L226 Difference]: Without dead ends: 136 [2018-10-15 15:24:14,587 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=231, Invalid=5931, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 15:24:14,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-10-15 15:24:14,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 133. [2018-10-15 15:24:14,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-10-15 15:24:14,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-10-15 15:24:14,590 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 126 [2018-10-15 15:24:14,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:14,591 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-10-15 15:24:14,591 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 15:24:14,591 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-10-15 15:24:14,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-15 15:24:14,592 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:14,592 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:14,592 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:14,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:14,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1712283553, now seen corresponding path program 20 times [2018-10-15 15:24:14,593 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:14,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:16,234 INFO L134 CoverageAnalysis]: Checked inductivity of 1180 backedges. 0 proven. 1180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:24:16,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:16,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 15:24:16,235 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 15:24:16,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 15:24:16,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 15:24:16,236 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 43 states. [2018-10-15 15:24:19,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:19,478 INFO L93 Difference]: Finished difference Result 142 states and 142 transitions. [2018-10-15 15:24:19,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-15 15:24:19,478 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 132 [2018-10-15 15:24:19,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:19,480 INFO L225 Difference]: With dead ends: 142 [2018-10-15 15:24:19,480 INFO L226 Difference]: Without dead ends: 142 [2018-10-15 15:24:19,483 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=243, Invalid=6563, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 15:24:19,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-10-15 15:24:19,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 139. [2018-10-15 15:24:19,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-10-15 15:24:19,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2018-10-15 15:24:19,486 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 132 [2018-10-15 15:24:19,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:19,486 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2018-10-15 15:24:19,486 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 15:24:19,486 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2018-10-15 15:24:19,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-10-15 15:24:19,487 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:19,487 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:19,487 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:19,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:19,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1556591545, now seen corresponding path program 21 times [2018-10-15 15:24:19,488 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:19,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:20,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1302 backedges. 0 proven. 1302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:24:20,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:20,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 15:24:20,675 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 15:24:20,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 15:24:20,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 15:24:20,676 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 45 states. [2018-10-15 15:24:24,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:24,727 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2018-10-15 15:24:24,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-15 15:24:24,728 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 138 [2018-10-15 15:24:24,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:24,730 INFO L225 Difference]: With dead ends: 148 [2018-10-15 15:24:24,730 INFO L226 Difference]: Without dead ends: 148 [2018-10-15 15:24:24,732 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=255, Invalid=7227, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 15:24:24,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-10-15 15:24:24,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 145. [2018-10-15 15:24:24,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-10-15 15:24:24,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-10-15 15:24:24,735 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 138 [2018-10-15 15:24:24,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:24,735 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-10-15 15:24:24,735 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 15:24:24,735 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-10-15 15:24:24,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-15 15:24:24,736 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:24,736 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:24,737 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:24,737 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:24,737 INFO L82 PathProgramCache]: Analyzing trace with hash -297098131, now seen corresponding path program 22 times [2018-10-15 15:24:24,738 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:24,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:27,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1430 backedges. 0 proven. 1430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:24:27,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:27,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 15:24:27,004 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 15:24:27,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 15:24:27,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 15:24:27,005 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 47 states. [2018-10-15 15:24:30,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:30,866 INFO L93 Difference]: Finished difference Result 154 states and 154 transitions. [2018-10-15 15:24:30,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-15 15:24:30,866 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 144 [2018-10-15 15:24:30,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:30,867 INFO L225 Difference]: With dead ends: 154 [2018-10-15 15:24:30,867 INFO L226 Difference]: Without dead ends: 154 [2018-10-15 15:24:30,868 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 0 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 15:24:30,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-10-15 15:24:30,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 151. [2018-10-15 15:24:30,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-10-15 15:24:30,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-10-15 15:24:30,872 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 144 [2018-10-15 15:24:30,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:30,872 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-10-15 15:24:30,872 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 15:24:30,872 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-10-15 15:24:30,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-15 15:24:30,873 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:30,873 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:30,874 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:30,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:30,874 INFO L82 PathProgramCache]: Analyzing trace with hash 577226771, now seen corresponding path program 23 times [2018-10-15 15:24:30,875 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:30,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:32,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1564 backedges. 0 proven. 1564 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:24:32,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:32,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 15:24:32,236 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 15:24:32,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 15:24:32,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 15:24:32,237 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 49 states. [2018-10-15 15:24:36,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:36,541 INFO L93 Difference]: Finished difference Result 160 states and 160 transitions. [2018-10-15 15:24:36,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-15 15:24:36,546 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 150 [2018-10-15 15:24:36,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:36,547 INFO L225 Difference]: With dead ends: 160 [2018-10-15 15:24:36,547 INFO L226 Difference]: Without dead ends: 160 [2018-10-15 15:24:36,548 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=279, Invalid=8651, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 15:24:36,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-10-15 15:24:36,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 157. [2018-10-15 15:24:36,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-10-15 15:24:36,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-10-15 15:24:36,552 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 150 [2018-10-15 15:24:36,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:36,552 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-10-15 15:24:36,552 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 15:24:36,552 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-10-15 15:24:36,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-10-15 15:24:36,553 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:36,553 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:36,553 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:36,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:36,554 INFO L82 PathProgramCache]: Analyzing trace with hash -735504583, now seen corresponding path program 24 times [2018-10-15 15:24:36,555 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:36,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:37,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1704 backedges. 0 proven. 1704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:24:37,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:37,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 15:24:37,984 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 15:24:37,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 15:24:37,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 15:24:37,985 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 51 states. [2018-10-15 15:24:42,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:42,545 INFO L93 Difference]: Finished difference Result 166 states and 166 transitions. [2018-10-15 15:24:42,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-15 15:24:42,547 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 156 [2018-10-15 15:24:42,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:42,548 INFO L225 Difference]: With dead ends: 166 [2018-10-15 15:24:42,548 INFO L226 Difference]: Without dead ends: 166 [2018-10-15 15:24:42,549 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=291, Invalid=9411, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 15:24:42,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-10-15 15:24:42,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 163. [2018-10-15 15:24:42,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-10-15 15:24:42,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2018-10-15 15:24:42,553 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 156 [2018-10-15 15:24:42,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:42,553 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2018-10-15 15:24:42,553 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 15:24:42,553 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2018-10-15 15:24:42,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-10-15 15:24:42,554 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:42,554 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:42,555 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:42,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:42,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1470099935, now seen corresponding path program 25 times [2018-10-15 15:24:42,556 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:42,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:44,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1850 backedges. 0 proven. 1850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:24:44,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:44,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 15:24:44,368 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 15:24:44,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 15:24:44,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 15:24:44,369 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 53 states. [2018-10-15 15:24:49,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:49,037 INFO L93 Difference]: Finished difference Result 172 states and 172 transitions. [2018-10-15 15:24:49,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-15 15:24:49,038 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 162 [2018-10-15 15:24:49,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:49,039 INFO L225 Difference]: With dead ends: 172 [2018-10-15 15:24:49,040 INFO L226 Difference]: Without dead ends: 172 [2018-10-15 15:24:49,040 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=303, Invalid=10203, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 15:24:49,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-10-15 15:24:49,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 169. [2018-10-15 15:24:49,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-10-15 15:24:49,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2018-10-15 15:24:49,045 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 162 [2018-10-15 15:24:49,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:49,045 INFO L481 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2018-10-15 15:24:49,045 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 15:24:49,045 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2018-10-15 15:24:49,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-10-15 15:24:49,046 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:49,046 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:49,047 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:49,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:49,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1180022789, now seen corresponding path program 26 times [2018-10-15 15:24:49,048 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:49,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:50,597 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:24:50,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:50,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-15 15:24:50,598 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-15 15:24:50,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-15 15:24:50,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 15:24:50,599 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 55 states. [2018-10-15 15:24:55,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:55,794 INFO L93 Difference]: Finished difference Result 178 states and 178 transitions. [2018-10-15 15:24:55,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-15 15:24:55,795 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 168 [2018-10-15 15:24:55,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:55,796 INFO L225 Difference]: With dead ends: 178 [2018-10-15 15:24:55,796 INFO L226 Difference]: Without dead ends: 178 [2018-10-15 15:24:55,797 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1326 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=315, Invalid=11027, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 15:24:55,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-10-15 15:24:55,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 175. [2018-10-15 15:24:55,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-10-15 15:24:55,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2018-10-15 15:24:55,800 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 168 [2018-10-15 15:24:55,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:55,800 INFO L481 AbstractCegarLoop]: Abstraction has 175 states and 175 transitions. [2018-10-15 15:24:55,800 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-15 15:24:55,801 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 175 transitions. [2018-10-15 15:24:55,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-10-15 15:24:55,801 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:55,801 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:55,802 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:55,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:55,802 INFO L82 PathProgramCache]: Analyzing trace with hash -2058630741, now seen corresponding path program 27 times [2018-10-15 15:24:55,802 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:55,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:57,569 INFO L134 CoverageAnalysis]: Checked inductivity of 2160 backedges. 0 proven. 2160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:24:57,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:57,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-15 15:24:57,570 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-15 15:24:57,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-15 15:24:57,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 15:24:57,571 INFO L87 Difference]: Start difference. First operand 175 states and 175 transitions. Second operand 57 states. [2018-10-15 15:25:03,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:25:03,203 INFO L93 Difference]: Finished difference Result 184 states and 184 transitions. [2018-10-15 15:25:03,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-15 15:25:03,204 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 174 [2018-10-15 15:25:03,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:25:03,206 INFO L225 Difference]: With dead ends: 184 [2018-10-15 15:25:03,206 INFO L226 Difference]: Without dead ends: 184 [2018-10-15 15:25:03,209 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1431 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=327, Invalid=11883, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 15:25:03,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-10-15 15:25:03,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 181. [2018-10-15 15:25:03,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-10-15 15:25:03,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-10-15 15:25:03,212 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 174 [2018-10-15 15:25:03,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:25:03,213 INFO L481 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-10-15 15:25:03,213 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-15 15:25:03,213 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-10-15 15:25:03,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-15 15:25:03,214 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:25:03,214 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:25:03,214 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:25:03,215 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:25:03,215 INFO L82 PathProgramCache]: Analyzing trace with hash -889485615, now seen corresponding path program 28 times [2018-10-15 15:25:03,215 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:25:03,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:25:05,620 INFO L134 CoverageAnalysis]: Checked inductivity of 2324 backedges. 0 proven. 2324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:25:05,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:25:05,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-15 15:25:05,621 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-15 15:25:05,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-15 15:25:05,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 15:25:05,621 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 59 states. [2018-10-15 15:25:12,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:25:12,822 INFO L93 Difference]: Finished difference Result 190 states and 190 transitions. [2018-10-15 15:25:12,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-15 15:25:12,823 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 180 [2018-10-15 15:25:12,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:25:12,827 INFO L225 Difference]: With dead ends: 190 [2018-10-15 15:25:12,828 INFO L226 Difference]: Without dead ends: 190 [2018-10-15 15:25:12,829 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1540 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=339, Invalid=12771, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 15:25:12,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-10-15 15:25:12,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 187. [2018-10-15 15:25:12,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-10-15 15:25:12,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2018-10-15 15:25:12,836 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 180 [2018-10-15 15:25:12,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:25:12,836 INFO L481 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2018-10-15 15:25:12,836 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-15 15:25:12,836 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2018-10-15 15:25:12,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-10-15 15:25:12,837 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:25:12,837 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:25:12,838 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:25:12,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:25:12,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1521070217, now seen corresponding path program 29 times [2018-10-15 15:25:12,839 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:25:12,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:25:15,316 INFO L134 CoverageAnalysis]: Checked inductivity of 2494 backedges. 0 proven. 2494 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:25:15,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:25:15,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-15 15:25:15,317 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-15 15:25:15,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-15 15:25:15,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-10-15 15:25:15,317 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 61 states. [2018-10-15 15:25:21,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:25:21,681 INFO L93 Difference]: Finished difference Result 196 states and 196 transitions. [2018-10-15 15:25:21,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-15 15:25:21,681 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 186 [2018-10-15 15:25:21,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:25:21,684 INFO L225 Difference]: With dead ends: 196 [2018-10-15 15:25:21,684 INFO L226 Difference]: Without dead ends: 196 [2018-10-15 15:25:21,685 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 2 SyntacticMatches, 0 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 15:25:21,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-10-15 15:25:21,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 193. [2018-10-15 15:25:21,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-10-15 15:25:21,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2018-10-15 15:25:21,689 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 186 [2018-10-15 15:25:21,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:25:21,689 INFO L481 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2018-10-15 15:25:21,689 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-15 15:25:21,690 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2018-10-15 15:25:21,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-10-15 15:25:21,690 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:25:21,691 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:25:21,691 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:25:21,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:25:21,691 INFO L82 PathProgramCache]: Analyzing trace with hash -3832931, now seen corresponding path program 30 times [2018-10-15 15:25:21,692 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:25:21,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:25:23,688 INFO L134 CoverageAnalysis]: Checked inductivity of 2670 backedges. 0 proven. 2670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:25:23,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:25:23,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-15 15:25:23,689 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-15 15:25:23,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-15 15:25:23,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 15:25:23,689 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 63 states. [2018-10-15 15:25:30,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:25:30,715 INFO L93 Difference]: Finished difference Result 202 states and 202 transitions. [2018-10-15 15:25:30,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-15 15:25:30,716 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 192 [2018-10-15 15:25:30,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:25:30,718 INFO L225 Difference]: With dead ends: 202 [2018-10-15 15:25:30,718 INFO L226 Difference]: Without dead ends: 202 [2018-10-15 15:25:30,719 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1770 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=363, Invalid=14643, Unknown=0, NotChecked=0, Total=15006 [2018-10-15 15:25:30,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-10-15 15:25:30,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 199. [2018-10-15 15:25:30,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-10-15 15:25:30,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 199 transitions. [2018-10-15 15:25:30,722 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 199 transitions. Word has length 192 [2018-10-15 15:25:30,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:25:30,722 INFO L481 AbstractCegarLoop]: Abstraction has 199 states and 199 transitions. [2018-10-15 15:25:30,722 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-15 15:25:30,723 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 199 transitions. [2018-10-15 15:25:30,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-10-15 15:25:30,724 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:25:30,724 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:25:30,724 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:25:30,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:25:30,724 INFO L82 PathProgramCache]: Analyzing trace with hash 690651971, now seen corresponding path program 31 times [2018-10-15 15:25:30,725 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:25:30,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:25:33,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2852 backedges. 0 proven. 2852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:25:33,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:25:33,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-15 15:25:33,066 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-15 15:25:33,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-15 15:25:33,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-10-15 15:25:33,067 INFO L87 Difference]: Start difference. First operand 199 states and 199 transitions. Second operand 65 states. [2018-10-15 15:25:40,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:25:40,214 INFO L93 Difference]: Finished difference Result 208 states and 208 transitions. [2018-10-15 15:25:40,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-15 15:25:40,215 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 198 [2018-10-15 15:25:40,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:25:40,216 INFO L225 Difference]: With dead ends: 208 [2018-10-15 15:25:40,217 INFO L226 Difference]: Without dead ends: 208 [2018-10-15 15:25:40,218 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1891 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=375, Invalid=15627, Unknown=0, NotChecked=0, Total=16002 [2018-10-15 15:25:40,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-10-15 15:25:40,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 205. [2018-10-15 15:25:40,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-10-15 15:25:40,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2018-10-15 15:25:40,222 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 198 [2018-10-15 15:25:40,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:25:40,222 INFO L481 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2018-10-15 15:25:40,222 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-15 15:25:40,222 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2018-10-15 15:25:40,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-10-15 15:25:40,223 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:25:40,224 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:25:40,224 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:25:40,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:25:40,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1507765865, now seen corresponding path program 32 times [2018-10-15 15:25:40,225 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:25:40,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:25:42,648 INFO L134 CoverageAnalysis]: Checked inductivity of 3040 backedges. 0 proven. 3040 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:25:42,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:25:42,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-15 15:25:42,649 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-15 15:25:42,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-15 15:25:42,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 15:25:42,650 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 67 states. [2018-10-15 15:25:50,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:25:50,277 INFO L93 Difference]: Finished difference Result 214 states and 214 transitions. [2018-10-15 15:25:50,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-10-15 15:25:50,278 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 204 [2018-10-15 15:25:50,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:25:50,279 INFO L225 Difference]: With dead ends: 214 [2018-10-15 15:25:50,279 INFO L226 Difference]: Without dead ends: 214 [2018-10-15 15:25:50,281 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 2 SyntacticMatches, 0 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 15:25:50,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-10-15 15:25:50,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 211. [2018-10-15 15:25:50,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-10-15 15:25:50,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2018-10-15 15:25:50,285 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 204 [2018-10-15 15:25:50,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:25:50,285 INFO L481 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2018-10-15 15:25:50,285 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-15 15:25:50,285 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2018-10-15 15:25:50,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-10-15 15:25:50,286 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:25:50,287 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:25:50,287 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:25:50,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:25:50,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1179425521, now seen corresponding path program 33 times [2018-10-15 15:25:50,288 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:25:50,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:25:52,921 INFO L134 CoverageAnalysis]: Checked inductivity of 3234 backedges. 0 proven. 3234 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:25:52,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:25:52,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-15 15:25:52,922 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-15 15:25:52,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-15 15:25:52,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-10-15 15:25:52,923 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 69 states. [2018-10-15 15:26:00,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:26:00,952 INFO L93 Difference]: Finished difference Result 220 states and 220 transitions. [2018-10-15 15:26:00,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-10-15 15:26:00,953 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 210 [2018-10-15 15:26:00,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:26:00,954 INFO L225 Difference]: With dead ends: 220 [2018-10-15 15:26:00,955 INFO L226 Difference]: Without dead ends: 220 [2018-10-15 15:26:00,956 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2145 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=399, Invalid=17691, Unknown=0, NotChecked=0, Total=18090 [2018-10-15 15:26:00,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-10-15 15:26:00,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 217. [2018-10-15 15:26:00,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-10-15 15:26:00,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2018-10-15 15:26:00,959 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 210 [2018-10-15 15:26:00,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:26:00,959 INFO L481 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2018-10-15 15:26:00,960 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-15 15:26:00,960 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2018-10-15 15:26:00,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-10-15 15:26:00,961 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:26:00,961 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:26:00,961 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:26:00,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:26:00,962 INFO L82 PathProgramCache]: Analyzing trace with hash -437123275, now seen corresponding path program 34 times [2018-10-15 15:26:00,962 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:26:00,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:26:03,875 INFO L134 CoverageAnalysis]: Checked inductivity of 3434 backedges. 0 proven. 3434 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:26:03,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:26:03,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-15 15:26:03,876 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-15 15:26:03,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-15 15:26:03,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 15:26:03,876 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 71 states. [2018-10-15 15:26:12,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:26:12,493 INFO L93 Difference]: Finished difference Result 226 states and 226 transitions. [2018-10-15 15:26:12,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-10-15 15:26:12,494 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 216 [2018-10-15 15:26:12,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:26:12,495 INFO L225 Difference]: With dead ends: 226 [2018-10-15 15:26:12,495 INFO L226 Difference]: Without dead ends: 226 [2018-10-15 15:26:12,496 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2278 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=411, Invalid=18771, Unknown=0, NotChecked=0, Total=19182 [2018-10-15 15:26:12,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-10-15 15:26:12,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 223. [2018-10-15 15:26:12,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-10-15 15:26:12,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 223 transitions. [2018-10-15 15:26:12,499 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 223 transitions. Word has length 216 [2018-10-15 15:26:12,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:26:12,499 INFO L481 AbstractCegarLoop]: Abstraction has 223 states and 223 transitions. [2018-10-15 15:26:12,499 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-15 15:26:12,499 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 223 transitions. [2018-10-15 15:26:12,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-10-15 15:26:12,500 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:26:12,500 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:26:12,501 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:26:12,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:26:12,501 INFO L82 PathProgramCache]: Analyzing trace with hash -144968485, now seen corresponding path program 35 times [2018-10-15 15:26:12,501 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:26:12,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:26:16,150 INFO L134 CoverageAnalysis]: Checked inductivity of 3640 backedges. 0 proven. 3640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:26:16,150 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:26:16,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-15 15:26:16,151 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-15 15:26:16,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-15 15:26:16,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-10-15 15:26:16,152 INFO L87 Difference]: Start difference. First operand 223 states and 223 transitions. Second operand 73 states. [2018-10-15 15:26:25,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:26:25,167 INFO L93 Difference]: Finished difference Result 232 states and 232 transitions. [2018-10-15 15:26:25,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-10-15 15:26:25,168 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 222 [2018-10-15 15:26:25,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:26:25,169 INFO L225 Difference]: With dead ends: 232 [2018-10-15 15:26:25,169 INFO L226 Difference]: Without dead ends: 232 [2018-10-15 15:26:25,171 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2415 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=423, Invalid=19883, Unknown=0, NotChecked=0, Total=20306 [2018-10-15 15:26:25,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-10-15 15:26:25,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 229. [2018-10-15 15:26:25,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-10-15 15:26:25,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2018-10-15 15:26:25,174 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 222 [2018-10-15 15:26:25,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:26:25,174 INFO L481 AbstractCegarLoop]: Abstraction has 229 states and 229 transitions. [2018-10-15 15:26:25,175 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-15 15:26:25,175 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 229 transitions. [2018-10-15 15:26:25,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-10-15 15:26:25,175 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:26:25,176 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:26:25,176 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:26:25,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:26:25,176 INFO L82 PathProgramCache]: Analyzing trace with hash 137006593, now seen corresponding path program 36 times [2018-10-15 15:26:25,176 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:26:25,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:26:28,559 INFO L134 CoverageAnalysis]: Checked inductivity of 3852 backedges. 0 proven. 3852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:26:28,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:26:28,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-15 15:26:28,560 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-15 15:26:28,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-15 15:26:28,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 15:26:28,561 INFO L87 Difference]: Start difference. First operand 229 states and 229 transitions. Second operand 75 states. [2018-10-15 15:26:38,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:26:38,176 INFO L93 Difference]: Finished difference Result 238 states and 238 transitions. [2018-10-15 15:26:38,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-10-15 15:26:38,177 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 228 [2018-10-15 15:26:38,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:26:38,182 INFO L225 Difference]: With dead ends: 238 [2018-10-15 15:26:38,182 INFO L226 Difference]: Without dead ends: 238 [2018-10-15 15:26:38,183 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2556 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=435, Invalid=21027, Unknown=0, NotChecked=0, Total=21462 [2018-10-15 15:26:38,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-10-15 15:26:38,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 235. [2018-10-15 15:26:38,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-10-15 15:26:38,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 235 transitions. [2018-10-15 15:26:38,187 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 235 transitions. Word has length 228 [2018-10-15 15:26:38,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:26:38,187 INFO L481 AbstractCegarLoop]: Abstraction has 235 states and 235 transitions. [2018-10-15 15:26:38,187 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-15 15:26:38,187 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 235 transitions. [2018-10-15 15:26:38,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-10-15 15:26:38,188 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:26:38,189 INFO L375 BasicCegarLoop]: trace histogram [38, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:26:38,190 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:26:38,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:26:38,191 INFO L82 PathProgramCache]: Analyzing trace with hash 974074535, now seen corresponding path program 37 times [2018-10-15 15:26:38,191 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:26:38,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:26:41,244 INFO L134 CoverageAnalysis]: Checked inductivity of 4070 backedges. 0 proven. 4070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:26:41,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:26:41,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-10-15 15:26:41,245 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-15 15:26:41,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-15 15:26:41,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-10-15 15:26:41,245 INFO L87 Difference]: Start difference. First operand 235 states and 235 transitions. Second operand 77 states. [2018-10-15 15:26:51,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:26:51,264 INFO L93 Difference]: Finished difference Result 244 states and 244 transitions. [2018-10-15 15:26:51,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-10-15 15:26:51,264 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 234 [2018-10-15 15:26:51,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:26:51,266 INFO L225 Difference]: With dead ends: 244 [2018-10-15 15:26:51,266 INFO L226 Difference]: Without dead ends: 244 [2018-10-15 15:26:51,267 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 2 SyntacticMatches, 0 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 15:26:51,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-10-15 15:26:51,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 241. [2018-10-15 15:26:51,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-10-15 15:26:51,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2018-10-15 15:26:51,271 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 234 [2018-10-15 15:26:51,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:26:51,271 INFO L481 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2018-10-15 15:26:51,271 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-15 15:26:51,271 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2018-10-15 15:26:51,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-10-15 15:26:51,272 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:26:51,272 INFO L375 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:26:51,272 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:26:51,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:26:51,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1009992397, now seen corresponding path program 38 times [2018-10-15 15:26:51,273 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:26:51,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:26:54,710 INFO L134 CoverageAnalysis]: Checked inductivity of 4294 backedges. 0 proven. 4294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:26:54,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:26:54,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-10-15 15:26:54,711 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-15 15:26:54,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-15 15:26:54,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 15:26:54,711 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 79 states. [2018-10-15 15:27:05,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:27:05,217 INFO L93 Difference]: Finished difference Result 250 states and 250 transitions. [2018-10-15 15:27:05,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-10-15 15:27:05,217 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 240 [2018-10-15 15:27:05,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:27:05,219 INFO L225 Difference]: With dead ends: 250 [2018-10-15 15:27:05,219 INFO L226 Difference]: Without dead ends: 250 [2018-10-15 15:27:05,220 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2850 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=459, Invalid=23411, Unknown=0, NotChecked=0, Total=23870 [2018-10-15 15:27:05,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-10-15 15:27:05,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 247. [2018-10-15 15:27:05,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-10-15 15:27:05,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 247 transitions. [2018-10-15 15:27:05,223 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 247 transitions. Word has length 240 [2018-10-15 15:27:05,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:27:05,223 INFO L481 AbstractCegarLoop]: Abstraction has 247 states and 247 transitions. [2018-10-15 15:27:05,224 INFO L482 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-15 15:27:05,224 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 247 transitions. [2018-10-15 15:27:05,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-10-15 15:27:05,224 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:27:05,225 INFO L375 BasicCegarLoop]: trace histogram [40, 39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:27:05,225 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:27:05,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:27:05,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1362632307, now seen corresponding path program 39 times [2018-10-15 15:27:05,226 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:27:05,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:27:09,156 INFO L134 CoverageAnalysis]: Checked inductivity of 4524 backedges. 0 proven. 4524 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:27:09,157 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:27:09,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-15 15:27:09,157 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-15 15:27:09,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-15 15:27:09,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-10-15 15:27:09,158 INFO L87 Difference]: Start difference. First operand 247 states and 247 transitions. Second operand 81 states. [2018-10-15 15:27:20,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:27:20,133 INFO L93 Difference]: Finished difference Result 256 states and 256 transitions. [2018-10-15 15:27:20,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-10-15 15:27:20,133 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 246 [2018-10-15 15:27:20,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:27:20,135 INFO L225 Difference]: With dead ends: 256 [2018-10-15 15:27:20,135 INFO L226 Difference]: Without dead ends: 256 [2018-10-15 15:27:20,137 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3003 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=471, Invalid=24651, Unknown=0, NotChecked=0, Total=25122 [2018-10-15 15:27:20,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-10-15 15:27:20,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 253. [2018-10-15 15:27:20,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-10-15 15:27:20,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2018-10-15 15:27:20,140 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 246 [2018-10-15 15:27:20,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:27:20,140 INFO L481 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2018-10-15 15:27:20,141 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-15 15:27:20,141 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2018-10-15 15:27:20,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-10-15 15:27:20,142 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:27:20,142 INFO L375 BasicCegarLoop]: trace histogram [41, 40, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:27:20,142 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:27:20,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:27:20,143 INFO L82 PathProgramCache]: Analyzing trace with hash -717806183, now seen corresponding path program 40 times [2018-10-15 15:27:20,143 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:27:20,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:27:24,292 INFO L134 CoverageAnalysis]: Checked inductivity of 4760 backedges. 0 proven. 4760 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:27:24,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:27:24,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-15 15:27:24,293 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-15 15:27:24,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-15 15:27:24,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 15:27:24,294 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 83 states. [2018-10-15 15:27:35,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:27:35,913 INFO L93 Difference]: Finished difference Result 262 states and 262 transitions. [2018-10-15 15:27:35,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-10-15 15:27:35,914 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 252 [2018-10-15 15:27:35,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:27:35,915 INFO L225 Difference]: With dead ends: 262 [2018-10-15 15:27:35,915 INFO L226 Difference]: Without dead ends: 262 [2018-10-15 15:27:35,916 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3160 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=483, Invalid=25923, Unknown=0, NotChecked=0, Total=26406 [2018-10-15 15:27:35,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-10-15 15:27:35,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 259. [2018-10-15 15:27:35,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-10-15 15:27:35,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 259 transitions. [2018-10-15 15:27:35,920 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 259 transitions. Word has length 252 [2018-10-15 15:27:35,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:27:35,921 INFO L481 AbstractCegarLoop]: Abstraction has 259 states and 259 transitions. [2018-10-15 15:27:35,921 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-15 15:27:35,921 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 259 transitions. [2018-10-15 15:27:35,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-10-15 15:27:35,922 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:27:35,922 INFO L375 BasicCegarLoop]: trace histogram [42, 41, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:27:35,922 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:27:35,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:27:35,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1136769087, now seen corresponding path program 41 times [2018-10-15 15:27:35,923 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:27:35,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:27:39,666 INFO L134 CoverageAnalysis]: Checked inductivity of 5002 backedges. 0 proven. 5002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:27:39,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:27:39,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-10-15 15:27:39,667 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-15 15:27:39,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-15 15:27:39,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2018-10-15 15:27:39,668 INFO L87 Difference]: Start difference. First operand 259 states and 259 transitions. Second operand 85 states. [2018-10-15 15:27:51,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:27:51,743 INFO L93 Difference]: Finished difference Result 268 states and 268 transitions. [2018-10-15 15:27:51,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-10-15 15:27:51,744 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 258 [2018-10-15 15:27:51,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:27:51,745 INFO L225 Difference]: With dead ends: 268 [2018-10-15 15:27:51,745 INFO L226 Difference]: Without dead ends: 268 [2018-10-15 15:27:51,746 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3321 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=495, Invalid=27227, Unknown=0, NotChecked=0, Total=27722 [2018-10-15 15:27:51,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-10-15 15:27:51,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 265. [2018-10-15 15:27:51,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-10-15 15:27:51,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 265 transitions. [2018-10-15 15:27:51,748 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 265 transitions. Word has length 258 [2018-10-15 15:27:51,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:27:51,749 INFO L481 AbstractCegarLoop]: Abstraction has 265 states and 265 transitions. [2018-10-15 15:27:51,749 INFO L482 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-15 15:27:51,749 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 265 transitions. [2018-10-15 15:27:51,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-10-15 15:27:51,750 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:27:51,750 INFO L375 BasicCegarLoop]: trace histogram [43, 42, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:27:51,750 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:27:51,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:27:51,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1109313947, now seen corresponding path program 42 times [2018-10-15 15:27:51,751 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:27:51,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:27:55,625 INFO L134 CoverageAnalysis]: Checked inductivity of 5250 backedges. 0 proven. 5250 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:27:55,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:27:55,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-15 15:27:55,626 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-15 15:27:55,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-15 15:27:55,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 15:27:55,627 INFO L87 Difference]: Start difference. First operand 265 states and 265 transitions. Second operand 87 states. [2018-10-15 15:28:08,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:28:08,379 INFO L93 Difference]: Finished difference Result 274 states and 274 transitions. [2018-10-15 15:28:08,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-10-15 15:28:08,380 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 264 [2018-10-15 15:28:08,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:28:08,381 INFO L225 Difference]: With dead ends: 274 [2018-10-15 15:28:08,381 INFO L226 Difference]: Without dead ends: 274 [2018-10-15 15:28:08,382 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 2 SyntacticMatches, 0 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 15:28:08,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-10-15 15:28:08,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 271. [2018-10-15 15:28:08,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-10-15 15:28:08,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 271 transitions. [2018-10-15 15:28:08,386 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 271 transitions. Word has length 264 [2018-10-15 15:28:08,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:28:08,386 INFO L481 AbstractCegarLoop]: Abstraction has 271 states and 271 transitions. [2018-10-15 15:28:08,387 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-15 15:28:08,387 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 271 transitions. [2018-10-15 15:28:08,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-10-15 15:28:08,388 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:28:08,388 INFO L375 BasicCegarLoop]: trace histogram [44, 43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:28:08,388 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:28:08,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:28:08,389 INFO L82 PathProgramCache]: Analyzing trace with hash 269942795, now seen corresponding path program 43 times [2018-10-15 15:28:08,389 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:28:08,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:28:12,622 INFO L134 CoverageAnalysis]: Checked inductivity of 5504 backedges. 0 proven. 5504 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:28:12,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:28:12,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-10-15 15:28:12,622 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-15 15:28:12,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-15 15:28:12,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2018-10-15 15:28:12,623 INFO L87 Difference]: Start difference. First operand 271 states and 271 transitions. Second operand 89 states. [2018-10-15 15:28:26,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:28:26,125 INFO L93 Difference]: Finished difference Result 280 states and 280 transitions. [2018-10-15 15:28:26,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-10-15 15:28:26,126 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 270 [2018-10-15 15:28:26,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:28:26,128 INFO L225 Difference]: With dead ends: 280 [2018-10-15 15:28:26,128 INFO L226 Difference]: Without dead ends: 280 [2018-10-15 15:28:26,129 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3655 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=519, Invalid=29931, Unknown=0, NotChecked=0, Total=30450 [2018-10-15 15:28:26,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-10-15 15:28:26,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 277. [2018-10-15 15:28:26,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-10-15 15:28:26,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2018-10-15 15:28:26,132 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 270 [2018-10-15 15:28:26,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:28:26,133 INFO L481 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2018-10-15 15:28:26,133 INFO L482 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-15 15:28:26,133 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2018-10-15 15:28:26,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-10-15 15:28:26,134 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:28:26,134 INFO L375 BasicCegarLoop]: trace histogram [45, 44, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:28:26,135 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:28:26,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:28:26,135 INFO L82 PathProgramCache]: Analyzing trace with hash 945583409, now seen corresponding path program 44 times [2018-10-15 15:28:26,136 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:28:26,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:28:30,442 INFO L134 CoverageAnalysis]: Checked inductivity of 5764 backedges. 0 proven. 5764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:28:30,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:28:30,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-10-15 15:28:30,443 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-15 15:28:30,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-15 15:28:30,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=8011, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 15:28:30,443 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 91 states. [2018-10-15 15:28:44,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:28:44,348 INFO L93 Difference]: Finished difference Result 286 states and 286 transitions. [2018-10-15 15:28:44,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-10-15 15:28:44,349 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 276 [2018-10-15 15:28:44,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:28:44,350 INFO L225 Difference]: With dead ends: 286 [2018-10-15 15:28:44,350 INFO L226 Difference]: Without dead ends: 286 [2018-10-15 15:28:44,351 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3828 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=531, Invalid=31331, Unknown=0, NotChecked=0, Total=31862 [2018-10-15 15:28:44,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-10-15 15:28:44,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 283. [2018-10-15 15:28:44,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-10-15 15:28:44,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 283 transitions. [2018-10-15 15:28:44,355 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 283 transitions. Word has length 276 [2018-10-15 15:28:44,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:28:44,355 INFO L481 AbstractCegarLoop]: Abstraction has 283 states and 283 transitions. [2018-10-15 15:28:44,355 INFO L482 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-15 15:28:44,355 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 283 transitions. [2018-10-15 15:28:44,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-10-15 15:28:44,357 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:28:44,357 INFO L375 BasicCegarLoop]: trace histogram [46, 45, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:28:44,357 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:28:44,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:28:44,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1814230487, now seen corresponding path program 45 times [2018-10-15 15:28:44,358 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:28:44,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:28:48,864 INFO L134 CoverageAnalysis]: Checked inductivity of 6030 backedges. 0 proven. 6030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:28:48,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:28:48,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-15 15:28:48,865 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-15 15:28:48,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-15 15:28:48,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=8373, Unknown=0, NotChecked=0, Total=8556 [2018-10-15 15:28:48,866 INFO L87 Difference]: Start difference. First operand 283 states and 283 transitions. Second operand 93 states. [2018-10-15 15:29:03,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:29:03,640 INFO L93 Difference]: Finished difference Result 292 states and 292 transitions. [2018-10-15 15:29:03,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-10-15 15:29:03,641 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 282 [2018-10-15 15:29:03,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:29:03,642 INFO L225 Difference]: With dead ends: 292 [2018-10-15 15:29:03,642 INFO L226 Difference]: Without dead ends: 292 [2018-10-15 15:29:03,643 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 2 SyntacticMatches, 0 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 15:29:03,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-10-15 15:29:03,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 289. [2018-10-15 15:29:03,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-10-15 15:29:03,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 289 transitions. [2018-10-15 15:29:03,647 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 289 transitions. Word has length 282 [2018-10-15 15:29:03,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:29:03,647 INFO L481 AbstractCegarLoop]: Abstraction has 289 states and 289 transitions. [2018-10-15 15:29:03,647 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-15 15:29:03,647 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 289 transitions. [2018-10-15 15:29:03,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-10-15 15:29:03,648 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:29:03,649 INFO L375 BasicCegarLoop]: trace histogram [47, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:29:03,649 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:29:03,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:29:03,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1638669827, now seen corresponding path program 46 times [2018-10-15 15:29:03,650 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:29:03,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:29:08,101 INFO L134 CoverageAnalysis]: Checked inductivity of 6302 backedges. 0 proven. 6302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:29:08,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:29:08,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-10-15 15:29:08,102 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-15 15:29:08,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-15 15:29:08,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=8743, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 15:29:08,103 INFO L87 Difference]: Start difference. First operand 289 states and 289 transitions. Second operand 95 states. [2018-10-15 15:29:23,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:29:23,446 INFO L93 Difference]: Finished difference Result 298 states and 298 transitions. [2018-10-15 15:29:23,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-10-15 15:29:23,446 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 288 [2018-10-15 15:29:23,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:29:23,448 INFO L225 Difference]: With dead ends: 298 [2018-10-15 15:29:23,448 INFO L226 Difference]: Without dead ends: 298 [2018-10-15 15:29:23,449 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4186 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=555, Invalid=34227, Unknown=0, NotChecked=0, Total=34782 [2018-10-15 15:29:23,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-10-15 15:29:23,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 295. [2018-10-15 15:29:23,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-10-15 15:29:23,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 295 transitions. [2018-10-15 15:29:23,452 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 295 transitions. Word has length 288 [2018-10-15 15:29:23,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:29:23,453 INFO L481 AbstractCegarLoop]: Abstraction has 295 states and 295 transitions. [2018-10-15 15:29:23,453 INFO L482 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-15 15:29:23,453 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 295 transitions. [2018-10-15 15:29:23,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-10-15 15:29:23,454 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:29:23,454 INFO L375 BasicCegarLoop]: trace histogram [48, 47, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:29:23,454 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:29:23,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:29:23,454 INFO L82 PathProgramCache]: Analyzing trace with hash -2058315357, now seen corresponding path program 47 times [2018-10-15 15:29:23,455 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:29:23,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:29:28,720 INFO L134 CoverageAnalysis]: Checked inductivity of 6580 backedges. 0 proven. 6580 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:29:28,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:29:28,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-10-15 15:29:28,721 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-10-15 15:29:28,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-10-15 15:29:28,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=9121, Unknown=0, NotChecked=0, Total=9312 [2018-10-15 15:29:28,722 INFO L87 Difference]: Start difference. First operand 295 states and 295 transitions. Second operand 97 states. [2018-10-15 15:29:44,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:29:44,770 INFO L93 Difference]: Finished difference Result 304 states and 304 transitions. [2018-10-15 15:29:44,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-10-15 15:29:44,770 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 294 [2018-10-15 15:29:44,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:29:44,772 INFO L225 Difference]: With dead ends: 304 [2018-10-15 15:29:44,772 INFO L226 Difference]: Without dead ends: 304 [2018-10-15 15:29:44,773 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4371 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=567, Invalid=35723, Unknown=0, NotChecked=0, Total=36290 [2018-10-15 15:29:44,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-10-15 15:29:44,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 301. [2018-10-15 15:29:44,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-10-15 15:29:44,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2018-10-15 15:29:44,777 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 294 [2018-10-15 15:29:44,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:29:44,777 INFO L481 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2018-10-15 15:29:44,778 INFO L482 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-10-15 15:29:44,778 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2018-10-15 15:29:44,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-10-15 15:29:44,779 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:29:44,779 INFO L375 BasicCegarLoop]: trace histogram [49, 48, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:29:44,780 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:29:44,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:29:44,780 INFO L82 PathProgramCache]: Analyzing trace with hash 552762569, now seen corresponding path program 48 times [2018-10-15 15:29:44,782 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:29:44,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:29:49,828 INFO L134 CoverageAnalysis]: Checked inductivity of 6864 backedges. 0 proven. 6864 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:29:49,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:29:49,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-10-15 15:29:49,829 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-10-15 15:29:49,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-10-15 15:29:49,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=9507, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 15:29:49,830 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 99 states. [2018-10-15 15:30:06,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:30:06,377 INFO L93 Difference]: Finished difference Result 310 states and 310 transitions. [2018-10-15 15:30:06,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-10-15 15:30:06,377 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 300 [2018-10-15 15:30:06,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:30:06,379 INFO L225 Difference]: With dead ends: 310 [2018-10-15 15:30:06,379 INFO L226 Difference]: Without dead ends: 310 [2018-10-15 15:30:06,381 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4560 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=579, Invalid=37251, Unknown=0, NotChecked=0, Total=37830 [2018-10-15 15:30:06,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-10-15 15:30:06,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 307. [2018-10-15 15:30:06,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-10-15 15:30:06,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 307 transitions. [2018-10-15 15:30:06,384 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 307 transitions. Word has length 300 [2018-10-15 15:30:06,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:30:06,385 INFO L481 AbstractCegarLoop]: Abstraction has 307 states and 307 transitions. [2018-10-15 15:30:06,385 INFO L482 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-10-15 15:30:06,385 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 307 transitions. [2018-10-15 15:30:06,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-10-15 15:30:06,387 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:30:06,387 INFO L375 BasicCegarLoop]: trace histogram [50, 49, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:30:06,387 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:30:06,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:30:06,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1064637585, now seen corresponding path program 49 times [2018-10-15 15:30:06,388 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:30:06,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:30:11,362 INFO L134 CoverageAnalysis]: Checked inductivity of 7154 backedges. 0 proven. 7154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:30:11,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:30:11,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-10-15 15:30:11,363 INFO L460 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-10-15 15:30:11,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-10-15 15:30:11,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=9901, Unknown=0, NotChecked=0, Total=10100 [2018-10-15 15:30:11,363 INFO L87 Difference]: Start difference. First operand 307 states and 307 transitions. Second operand 101 states. [2018-10-15 15:30:28,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:30:28,783 INFO L93 Difference]: Finished difference Result 316 states and 316 transitions. [2018-10-15 15:30:28,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-10-15 15:30:28,783 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 306 [2018-10-15 15:30:28,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:30:28,785 INFO L225 Difference]: With dead ends: 316 [2018-10-15 15:30:28,785 INFO L226 Difference]: Without dead ends: 316 [2018-10-15 15:30:28,787 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4753 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=591, Invalid=38811, Unknown=0, NotChecked=0, Total=39402 [2018-10-15 15:30:28,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-10-15 15:30:28,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 313. [2018-10-15 15:30:28,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-10-15 15:30:28,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 313 transitions. [2018-10-15 15:30:28,791 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 313 transitions. Word has length 306 [2018-10-15 15:30:28,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:30:28,791 INFO L481 AbstractCegarLoop]: Abstraction has 313 states and 313 transitions. [2018-10-15 15:30:28,791 INFO L482 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-10-15 15:30:28,791 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 313 transitions. [2018-10-15 15:30:28,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-10-15 15:30:28,793 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:30:28,793 INFO L375 BasicCegarLoop]: trace histogram [51, 50, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:30:28,793 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:30:28,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:30:28,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1998371435, now seen corresponding path program 50 times [2018-10-15 15:30:28,794 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:30:28,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:30:34,024 INFO L134 CoverageAnalysis]: Checked inductivity of 7450 backedges. 0 proven. 7450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:30:34,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:30:34,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-10-15 15:30:34,025 INFO L460 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-10-15 15:30:34,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-10-15 15:30:34,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=10303, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 15:30:34,025 INFO L87 Difference]: Start difference. First operand 313 states and 313 transitions. Second operand 103 states. [2018-10-15 15:30:52,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:30:52,121 INFO L93 Difference]: Finished difference Result 322 states and 322 transitions. [2018-10-15 15:30:52,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2018-10-15 15:30:52,122 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 312 [2018-10-15 15:30:52,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:30:52,124 INFO L225 Difference]: With dead ends: 322 [2018-10-15 15:30:52,124 INFO L226 Difference]: Without dead ends: 322 [2018-10-15 15:30:52,125 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4950 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=603, Invalid=40403, Unknown=0, NotChecked=0, Total=41006 [2018-10-15 15:30:52,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-10-15 15:30:52,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 319. [2018-10-15 15:30:52,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-10-15 15:30:52,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 319 transitions. [2018-10-15 15:30:52,128 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 319 transitions. Word has length 312 [2018-10-15 15:30:52,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:30:52,128 INFO L481 AbstractCegarLoop]: Abstraction has 319 states and 319 transitions. [2018-10-15 15:30:52,128 INFO L482 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-10-15 15:30:52,128 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 319 transitions. [2018-10-15 15:30:52,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2018-10-15 15:30:52,130 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:30:52,130 INFO L375 BasicCegarLoop]: trace histogram [52, 51, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:30:52,130 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:30:52,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:30:52,130 INFO L82 PathProgramCache]: Analyzing trace with hash 2050812731, now seen corresponding path program 51 times [2018-10-15 15:30:52,131 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:30:52,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:30:57,674 INFO L134 CoverageAnalysis]: Checked inductivity of 7752 backedges. 0 proven. 7752 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:30:57,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:30:57,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-10-15 15:30:57,676 INFO L460 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-10-15 15:30:57,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-10-15 15:30:57,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=10713, Unknown=0, NotChecked=0, Total=10920 [2018-10-15 15:30:57,677 INFO L87 Difference]: Start difference. First operand 319 states and 319 transitions. Second operand 105 states. [2018-10-15 15:31:16,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:31:16,687 INFO L93 Difference]: Finished difference Result 328 states and 328 transitions. [2018-10-15 15:31:16,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2018-10-15 15:31:16,688 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 318 [2018-10-15 15:31:16,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:31:16,690 INFO L225 Difference]: With dead ends: 328 [2018-10-15 15:31:16,690 INFO L226 Difference]: Without dead ends: 328 [2018-10-15 15:31:16,691 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5151 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=615, Invalid=42027, Unknown=0, NotChecked=0, Total=42642 [2018-10-15 15:31:16,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-10-15 15:31:16,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 325. [2018-10-15 15:31:16,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-10-15 15:31:16,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 325 transitions. [2018-10-15 15:31:16,696 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 325 transitions. Word has length 318 [2018-10-15 15:31:16,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:31:16,696 INFO L481 AbstractCegarLoop]: Abstraction has 325 states and 325 transitions. [2018-10-15 15:31:16,696 INFO L482 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-10-15 15:31:16,696 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 325 transitions. [2018-10-15 15:31:16,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-10-15 15:31:16,698 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:31:16,698 INFO L375 BasicCegarLoop]: trace histogram [53, 52, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:31:16,698 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:31:16,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:31:16,699 INFO L82 PathProgramCache]: Analyzing trace with hash -162448287, now seen corresponding path program 52 times [2018-10-15 15:31:16,699 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:31:16,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:31:22,343 INFO L134 CoverageAnalysis]: Checked inductivity of 8060 backedges. 0 proven. 8060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:31:22,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:31:22,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-10-15 15:31:22,344 INFO L460 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-10-15 15:31:22,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-10-15 15:31:22,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=11131, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 15:31:22,344 INFO L87 Difference]: Start difference. First operand 325 states and 325 transitions. Second operand 107 states. [2018-10-15 15:31:41,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:31:41,868 INFO L93 Difference]: Finished difference Result 334 states and 334 transitions. [2018-10-15 15:31:41,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2018-10-15 15:31:41,869 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 324 [2018-10-15 15:31:41,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:31:41,870 INFO L225 Difference]: With dead ends: 334 [2018-10-15 15:31:41,870 INFO L226 Difference]: Without dead ends: 334 [2018-10-15 15:31:41,871 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5356 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=627, Invalid=43683, Unknown=0, NotChecked=0, Total=44310 [2018-10-15 15:31:41,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-10-15 15:31:41,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 331. [2018-10-15 15:31:41,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-10-15 15:31:41,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 331 transitions. [2018-10-15 15:31:41,874 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 331 transitions. Word has length 324 [2018-10-15 15:31:41,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:31:41,875 INFO L481 AbstractCegarLoop]: Abstraction has 331 states and 331 transitions. [2018-10-15 15:31:41,875 INFO L482 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-10-15 15:31:41,875 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 331 transitions. [2018-10-15 15:31:41,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-10-15 15:31:41,877 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:31:41,877 INFO L375 BasicCegarLoop]: trace histogram [54, 53, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:31:41,877 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:31:41,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:31:41,877 INFO L82 PathProgramCache]: Analyzing trace with hash -967730937, now seen corresponding path program 53 times [2018-10-15 15:31:41,878 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:31:41,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:31:47,717 INFO L134 CoverageAnalysis]: Checked inductivity of 8374 backedges. 0 proven. 8374 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:31:47,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:31:47,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-10-15 15:31:47,718 INFO L460 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-10-15 15:31:47,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-10-15 15:31:47,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=11557, Unknown=0, NotChecked=0, Total=11772 [2018-10-15 15:31:47,719 INFO L87 Difference]: Start difference. First operand 331 states and 331 transitions. Second operand 109 states.