java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplTransformed.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20181015-LoopsPathprograms/simple_true-unreach-call4.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2d08e6e [2018-10-15 13:13:02,349 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 13:13:02,351 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 13:13:02,367 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 13:13:02,367 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 13:13:02,368 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 13:13:02,370 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 13:13:02,373 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 13:13:02,375 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 13:13:02,383 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 13:13:02,384 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 13:13:02,384 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 13:13:02,385 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 13:13:02,386 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 13:13:02,390 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 13:13:02,391 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 13:13:02,392 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 13:13:02,395 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 13:13:02,399 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 13:13:02,403 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 13:13:02,404 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 13:13:02,405 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 13:13:02,408 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 13:13:02,408 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 13:13:02,409 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 13:13:02,409 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 13:13:02,412 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 13:13:02,413 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 13:13:02,414 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 13:13:02,416 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 13:13:02,416 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 13:13:02,417 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 13:13:02,417 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 13:13:02,417 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 13:13:02,421 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 13:13:02,422 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 13:13:02,422 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-15 13:13:02,438 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 13:13:02,438 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 13:13:02,440 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 13:13:02,440 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 13:13:02,440 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 13:13:02,440 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 13:13:02,441 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 13:13:02,441 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 13:13:02,441 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 13:13:02,442 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 13:13:02,442 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 13:13:02,443 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 13:13:02,443 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 13:13:02,446 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 13:13:02,447 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 13:13:02,502 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 13:13:02,518 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 13:13:02,524 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 13:13:02,526 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 13:13:02,526 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 13:13:02,527 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/simple_true-unreach-call4.i_3.bpl [2018-10-15 13:13:02,527 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/simple_true-unreach-call4.i_3.bpl' [2018-10-15 13:13:02,583 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 13:13:02,585 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-15 13:13:02,586 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 13:13:02,586 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 13:13:02,586 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 13:13:02,614 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "simple_true-unreach-call4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:13:02" (1/1) ... [2018-10-15 13:13:02,616 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "simple_true-unreach-call4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:13:02" (1/1) ... [2018-10-15 13:13:02,626 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "simple_true-unreach-call4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:13:02" (1/1) ... [2018-10-15 13:13:02,626 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "simple_true-unreach-call4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:13:02" (1/1) ... [2018-10-15 13:13:02,629 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "simple_true-unreach-call4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:13:02" (1/1) ... [2018-10-15 13:13:02,631 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "simple_true-unreach-call4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:13:02" (1/1) ... [2018-10-15 13:13:02,632 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "simple_true-unreach-call4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:13:02" (1/1) ... [2018-10-15 13:13:02,634 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 13:13:02,635 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 13:13:02,635 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 13:13:02,636 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 13:13:02,636 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "simple_true-unreach-call4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:13:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-15 13:13:02,712 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-15 13:13:02,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 13:13:02,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 13:13:03,025 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 13:13:03,025 INFO L202 PluginConnector]: Adding new model simple_true-unreach-call4.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:13:03 BoogieIcfgContainer [2018-10-15 13:13:03,026 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 13:13:03,026 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-15 13:13:03,026 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-15 13:13:03,027 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-15 13:13:03,031 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "simple_true-unreach-call4.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:13:03" (1/1) ... [2018-10-15 13:13:03,036 WARN L219 ansformationObserver]: HeapSeparator: input icfg has no '#valid' array -- returning unchanged Icfg! [2018-10-15 13:13:03,053 INFO L202 PluginConnector]: Adding new model simple_true-unreach-call4.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 01:13:03 BasicIcfg [2018-10-15 13:13:03,054 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-15 13:13:03,055 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 13:13:03,055 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 13:13:03,058 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 13:13:03,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "simple_true-unreach-call4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:13:02" (1/3) ... [2018-10-15 13:13:03,060 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78bc2332 and model type simple_true-unreach-call4.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:13:03, skipping insertion in model container [2018-10-15 13:13:03,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "simple_true-unreach-call4.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:13:03" (2/3) ... [2018-10-15 13:13:03,061 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78bc2332 and model type simple_true-unreach-call4.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 01:13:03, skipping insertion in model container [2018-10-15 13:13:03,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "simple_true-unreach-call4.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 01:13:03" (3/3) ... [2018-10-15 13:13:03,062 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_true-unreach-call4.i_3.bplleft_unchanged_by_heapseparator [2018-10-15 13:13:03,073 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 13:13:03,082 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 13:13:03,100 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 13:13:03,125 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 13:13:03,126 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 13:13:03,126 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 13:13:03,126 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 13:13:03,127 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 13:13:03,127 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 13:13:03,127 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 13:13:03,127 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 13:13:03,127 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 13:13:03,139 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2018-10-15 13:13:03,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-15 13:13:03,147 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:03,148 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:03,149 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:03,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:03,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1367695513, now seen corresponding path program 1 times [2018-10-15 13:13:03,215 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:03,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:03,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:03,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 13:13:03,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 13:13:03,438 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 13:13:03,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 13:13:03,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 13:13:03,474 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 3 states. [2018-10-15 13:13:03,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:03,569 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-10-15 13:13:03,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 13:13:03,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-10-15 13:13:03,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:03,584 INFO L225 Difference]: With dead ends: 14 [2018-10-15 13:13:03,584 INFO L226 Difference]: Without dead ends: 14 [2018-10-15 13:13:03,586 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 13:13:03,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-10-15 13:13:03,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-10-15 13:13:03,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-10-15 13:13:03,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-10-15 13:13:03,623 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-10-15 13:13:03,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:03,623 INFO L481 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-10-15 13:13:03,623 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 13:13:03,624 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-10-15 13:13:03,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-15 13:13:03,624 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:03,624 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:03,625 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:03,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:03,625 INFO L82 PathProgramCache]: Analyzing trace with hash 497117989, now seen corresponding path program 1 times [2018-10-15 13:13:03,626 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:03,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:03,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:03,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:03,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-10-15 13:13:03,765 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-15 13:13:03,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-15 13:13:03,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-15 13:13:03,766 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 4 states. [2018-10-15 13:13:03,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:03,844 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-10-15 13:13:03,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-15 13:13:03,846 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-10-15 13:13:03,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:03,847 INFO L225 Difference]: With dead ends: 16 [2018-10-15 13:13:03,847 INFO L226 Difference]: Without dead ends: 16 [2018-10-15 13:13:03,848 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-15 13:13:03,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-10-15 13:13:03,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-10-15 13:13:03,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-10-15 13:13:03,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-10-15 13:13:03,853 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-10-15 13:13:03,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:03,854 INFO L481 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-10-15 13:13:03,855 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-15 13:13:03,855 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-10-15 13:13:03,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-15 13:13:03,855 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:03,856 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:03,856 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:03,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:03,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1581530979, now seen corresponding path program 2 times [2018-10-15 13:13:03,858 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:03,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:04,032 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:04,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:04,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-15 13:13:04,034 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 13:13:04,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 13:13:04,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-15 13:13:04,035 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 5 states. [2018-10-15 13:13:04,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:04,206 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-10-15 13:13:04,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-15 13:13:04,207 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-10-15 13:13:04,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:04,208 INFO L225 Difference]: With dead ends: 18 [2018-10-15 13:13:04,208 INFO L226 Difference]: Without dead ends: 18 [2018-10-15 13:13:04,209 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-15 13:13:04,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-10-15 13:13:04,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-10-15 13:13:04,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-10-15 13:13:04,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-10-15 13:13:04,212 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-10-15 13:13:04,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:04,213 INFO L481 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-10-15 13:13:04,213 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 13:13:04,213 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-10-15 13:13:04,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-15 13:13:04,214 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:04,214 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:04,214 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:04,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:04,215 INFO L82 PathProgramCache]: Analyzing trace with hash 25361441, now seen corresponding path program 3 times [2018-10-15 13:13:04,216 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:04,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:04,497 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:04,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:04,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-10-15 13:13:04,498 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-15 13:13:04,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-15 13:13:04,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-15 13:13:04,499 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 6 states. [2018-10-15 13:13:04,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:04,591 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-10-15 13:13:04,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-15 13:13:04,592 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-10-15 13:13:04,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:04,592 INFO L225 Difference]: With dead ends: 20 [2018-10-15 13:13:04,593 INFO L226 Difference]: Without dead ends: 20 [2018-10-15 13:13:04,593 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-15 13:13:04,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-10-15 13:13:04,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2018-10-15 13:13:04,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-15 13:13:04,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-10-15 13:13:04,597 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2018-10-15 13:13:04,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:04,597 INFO L481 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-10-15 13:13:04,598 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-15 13:13:04,598 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-10-15 13:13:04,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-15 13:13:04,599 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:04,599 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:04,599 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:04,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:04,600 INFO L82 PathProgramCache]: Analyzing trace with hash -804945569, now seen corresponding path program 4 times [2018-10-15 13:13:04,601 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:04,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:04,840 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:04,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:04,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-15 13:13:04,841 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-15 13:13:04,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-15 13:13:04,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-15 13:13:04,842 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 7 states. [2018-10-15 13:13:04,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:04,997 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-10-15 13:13:04,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-15 13:13:04,998 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-10-15 13:13:04,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:04,999 INFO L225 Difference]: With dead ends: 22 [2018-10-15 13:13:04,999 INFO L226 Difference]: Without dead ends: 22 [2018-10-15 13:13:05,000 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-15 13:13:05,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-10-15 13:13:05,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-10-15 13:13:05,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-15 13:13:05,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-10-15 13:13:05,003 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2018-10-15 13:13:05,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:05,004 INFO L481 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-10-15 13:13:05,004 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-15 13:13:05,004 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-10-15 13:13:05,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-15 13:13:05,005 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:05,005 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:05,005 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:05,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:05,006 INFO L82 PathProgramCache]: Analyzing trace with hash 133934877, now seen corresponding path program 5 times [2018-10-15 13:13:05,007 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:05,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:05,314 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:05,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:05,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-15 13:13:05,317 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-15 13:13:05,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-15 13:13:05,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-15 13:13:05,318 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 8 states. [2018-10-15 13:13:05,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:05,604 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-10-15 13:13:05,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-15 13:13:05,605 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-10-15 13:13:05,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:05,605 INFO L225 Difference]: With dead ends: 24 [2018-10-15 13:13:05,606 INFO L226 Difference]: Without dead ends: 24 [2018-10-15 13:13:05,606 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-15 13:13:05,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-10-15 13:13:05,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-10-15 13:13:05,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-15 13:13:05,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-10-15 13:13:05,610 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2018-10-15 13:13:05,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:05,610 INFO L481 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-10-15 13:13:05,610 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-15 13:13:05,611 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-10-15 13:13:05,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-15 13:13:05,611 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:05,612 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:05,612 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:05,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:05,613 INFO L82 PathProgramCache]: Analyzing trace with hash 454911323, now seen corresponding path program 6 times [2018-10-15 13:13:05,614 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:05,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:05,983 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:05,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:05,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-15 13:13:05,985 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 13:13:05,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 13:13:05,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-15 13:13:05,985 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 9 states. [2018-10-15 13:13:06,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:06,245 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-10-15 13:13:06,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-15 13:13:06,246 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-10-15 13:13:06,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:06,248 INFO L225 Difference]: With dead ends: 26 [2018-10-15 13:13:06,248 INFO L226 Difference]: Without dead ends: 26 [2018-10-15 13:13:06,249 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-15 13:13:06,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-10-15 13:13:06,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-10-15 13:13:06,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-15 13:13:06,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-10-15 13:13:06,253 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2018-10-15 13:13:06,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:06,254 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-10-15 13:13:06,254 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 13:13:06,254 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-10-15 13:13:06,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-15 13:13:06,255 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:06,255 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:06,255 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:06,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:06,256 INFO L82 PathProgramCache]: Analyzing trace with hash -324369383, now seen corresponding path program 7 times [2018-10-15 13:13:06,257 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:06,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:06,466 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:06,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:06,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-15 13:13:06,467 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-15 13:13:06,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-15 13:13:06,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-10-15 13:13:06,468 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 10 states. [2018-10-15 13:13:06,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:06,818 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-10-15 13:13:06,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-15 13:13:06,819 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-10-15 13:13:06,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:06,820 INFO L225 Difference]: With dead ends: 28 [2018-10-15 13:13:06,821 INFO L226 Difference]: Without dead ends: 28 [2018-10-15 13:13:06,821 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-10-15 13:13:06,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-10-15 13:13:06,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-10-15 13:13:06,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-15 13:13:06,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-10-15 13:13:06,824 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2018-10-15 13:13:06,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:06,825 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-10-15 13:13:06,825 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-15 13:13:06,825 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-10-15 13:13:06,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-15 13:13:06,826 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:06,826 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:06,826 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:06,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:06,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1888818345, now seen corresponding path program 8 times [2018-10-15 13:13:06,828 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:06,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:07,139 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:07,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:07,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 13:13:07,140 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 13:13:07,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 13:13:07,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-10-15 13:13:07,143 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 11 states. [2018-10-15 13:13:07,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:07,486 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-10-15 13:13:07,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-15 13:13:07,487 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2018-10-15 13:13:07,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:07,488 INFO L225 Difference]: With dead ends: 30 [2018-10-15 13:13:07,488 INFO L226 Difference]: Without dead ends: 30 [2018-10-15 13:13:07,488 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-10-15 13:13:07,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-10-15 13:13:07,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-10-15 13:13:07,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-15 13:13:07,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-10-15 13:13:07,492 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2018-10-15 13:13:07,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:07,493 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-10-15 13:13:07,493 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 13:13:07,493 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-10-15 13:13:07,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-15 13:13:07,494 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:07,494 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:07,495 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:07,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:07,495 INFO L82 PathProgramCache]: Analyzing trace with hash -2085717227, now seen corresponding path program 9 times [2018-10-15 13:13:07,496 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:07,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:07,887 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:07,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:07,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-15 13:13:07,888 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-15 13:13:07,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-15 13:13:07,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-10-15 13:13:07,889 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 12 states. [2018-10-15 13:13:08,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:08,243 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-10-15 13:13:08,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-15 13:13:08,250 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2018-10-15 13:13:08,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:08,251 INFO L225 Difference]: With dead ends: 32 [2018-10-15 13:13:08,251 INFO L226 Difference]: Without dead ends: 32 [2018-10-15 13:13:08,252 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-10-15 13:13:08,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-10-15 13:13:08,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-10-15 13:13:08,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-15 13:13:08,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-10-15 13:13:08,256 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2018-10-15 13:13:08,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:08,256 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-10-15 13:13:08,256 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-15 13:13:08,256 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-10-15 13:13:08,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-15 13:13:08,257 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:08,257 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:08,258 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:08,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:08,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1967985491, now seen corresponding path program 10 times [2018-10-15 13:13:08,259 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:08,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:08,677 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:08,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:08,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-15 13:13:08,678 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-15 13:13:08,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-15 13:13:08,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-10-15 13:13:08,679 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 13 states. [2018-10-15 13:13:09,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:09,311 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-10-15 13:13:09,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-15 13:13:09,312 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2018-10-15 13:13:09,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:09,313 INFO L225 Difference]: With dead ends: 34 [2018-10-15 13:13:09,313 INFO L226 Difference]: Without dead ends: 34 [2018-10-15 13:13:09,314 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-10-15 13:13:09,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-15 13:13:09,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-10-15 13:13:09,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-15 13:13:09,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-10-15 13:13:09,318 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2018-10-15 13:13:09,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:09,319 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-10-15 13:13:09,319 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-15 13:13:09,319 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-10-15 13:13:09,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-15 13:13:09,320 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:09,320 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:09,320 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:09,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:09,321 INFO L82 PathProgramCache]: Analyzing trace with hash 2040960017, now seen corresponding path program 11 times [2018-10-15 13:13:09,322 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:09,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:09,705 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:09,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:09,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-15 13:13:09,706 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-15 13:13:09,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-15 13:13:09,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-10-15 13:13:09,707 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 14 states. [2018-10-15 13:13:10,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:10,196 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-10-15 13:13:10,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-15 13:13:10,197 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2018-10-15 13:13:10,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:10,198 INFO L225 Difference]: With dead ends: 36 [2018-10-15 13:13:10,198 INFO L226 Difference]: Without dead ends: 36 [2018-10-15 13:13:10,199 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-10-15 13:13:10,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-15 13:13:10,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-10-15 13:13:10,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-15 13:13:10,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-10-15 13:13:10,203 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2018-10-15 13:13:10,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:10,204 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-10-15 13:13:10,204 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-15 13:13:10,204 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-10-15 13:13:10,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-15 13:13:10,206 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:10,207 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:10,207 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:10,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:10,207 INFO L82 PathProgramCache]: Analyzing trace with hash -844964529, now seen corresponding path program 12 times [2018-10-15 13:13:10,208 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:10,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:10,727 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:10,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:10,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 13:13:10,728 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 13:13:10,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 13:13:10,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-10-15 13:13:10,729 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 15 states. [2018-10-15 13:13:11,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:11,243 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-10-15 13:13:11,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-15 13:13:11,243 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2018-10-15 13:13:11,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:11,245 INFO L225 Difference]: With dead ends: 38 [2018-10-15 13:13:11,245 INFO L226 Difference]: Without dead ends: 38 [2018-10-15 13:13:11,246 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-10-15 13:13:11,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-10-15 13:13:11,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-10-15 13:13:11,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-15 13:13:11,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-10-15 13:13:11,249 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2018-10-15 13:13:11,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:11,250 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-10-15 13:13:11,250 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 13:13:11,250 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-10-15 13:13:11,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-15 13:13:11,251 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:11,251 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:11,251 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:11,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:11,252 INFO L82 PathProgramCache]: Analyzing trace with hash 330419981, now seen corresponding path program 13 times [2018-10-15 13:13:11,253 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:11,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:12,014 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:12,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:12,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-15 13:13:12,015 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-15 13:13:12,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-15 13:13:12,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-10-15 13:13:12,016 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 16 states. [2018-10-15 13:13:12,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:12,772 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-10-15 13:13:12,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-15 13:13:12,773 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 36 [2018-10-15 13:13:12,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:12,773 INFO L225 Difference]: With dead ends: 40 [2018-10-15 13:13:12,774 INFO L226 Difference]: Without dead ends: 40 [2018-10-15 13:13:12,774 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-10-15 13:13:12,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-10-15 13:13:12,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-10-15 13:13:12,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-15 13:13:12,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-10-15 13:13:12,777 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2018-10-15 13:13:12,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:12,778 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-10-15 13:13:12,778 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-15 13:13:12,778 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-10-15 13:13:12,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-15 13:13:12,779 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:12,779 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:12,779 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:12,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:12,780 INFO L82 PathProgramCache]: Analyzing trace with hash 298535243, now seen corresponding path program 14 times [2018-10-15 13:13:12,780 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:12,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:13,246 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:13,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:13,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-15 13:13:13,246 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-15 13:13:13,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-15 13:13:13,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-10-15 13:13:13,247 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 17 states. [2018-10-15 13:13:13,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:13,751 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-10-15 13:13:13,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-15 13:13:13,752 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 38 [2018-10-15 13:13:13,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:13,753 INFO L225 Difference]: With dead ends: 42 [2018-10-15 13:13:13,753 INFO L226 Difference]: Without dead ends: 42 [2018-10-15 13:13:13,754 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-10-15 13:13:13,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-10-15 13:13:13,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-10-15 13:13:13,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-15 13:13:13,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-10-15 13:13:13,758 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2018-10-15 13:13:13,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:13,759 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-10-15 13:13:13,759 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-15 13:13:13,759 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-10-15 13:13:13,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-15 13:13:13,760 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:13,760 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:13,760 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:13,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:13,761 INFO L82 PathProgramCache]: Analyzing trace with hash -277926903, now seen corresponding path program 15 times [2018-10-15 13:13:13,762 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:13,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:14,158 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:14,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:14,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-15 13:13:14,159 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-15 13:13:14,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-15 13:13:14,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-10-15 13:13:14,160 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 18 states. [2018-10-15 13:13:14,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:14,662 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-10-15 13:13:14,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-15 13:13:14,662 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 40 [2018-10-15 13:13:14,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:14,663 INFO L225 Difference]: With dead ends: 44 [2018-10-15 13:13:14,663 INFO L226 Difference]: Without dead ends: 44 [2018-10-15 13:13:14,664 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-10-15 13:13:14,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-10-15 13:13:14,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2018-10-15 13:13:14,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-15 13:13:14,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-10-15 13:13:14,668 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2018-10-15 13:13:14,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:14,668 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-10-15 13:13:14,668 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-15 13:13:14,668 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-10-15 13:13:14,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-15 13:13:14,669 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:14,669 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:14,669 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:14,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:14,670 INFO L82 PathProgramCache]: Analyzing trace with hash -207268025, now seen corresponding path program 16 times [2018-10-15 13:13:14,670 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:14,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:15,015 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:15,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:15,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-15 13:13:15,016 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-15 13:13:15,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-15 13:13:15,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-10-15 13:13:15,016 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 19 states. [2018-10-15 13:13:15,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:15,916 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-10-15 13:13:15,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-15 13:13:15,916 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 42 [2018-10-15 13:13:15,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:15,917 INFO L225 Difference]: With dead ends: 46 [2018-10-15 13:13:15,917 INFO L226 Difference]: Without dead ends: 46 [2018-10-15 13:13:15,918 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-10-15 13:13:15,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-10-15 13:13:15,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2018-10-15 13:13:15,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-15 13:13:15,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-10-15 13:13:15,922 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2018-10-15 13:13:15,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:15,922 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-10-15 13:13:15,922 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-15 13:13:15,922 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-10-15 13:13:15,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-15 13:13:15,923 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:15,923 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:15,923 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:15,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:15,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1023563003, now seen corresponding path program 17 times [2018-10-15 13:13:15,924 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:15,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:16,578 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:16,579 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:16,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-15 13:13:16,579 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-15 13:13:16,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-15 13:13:16,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-10-15 13:13:16,580 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 20 states. [2018-10-15 13:13:17,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:17,519 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-10-15 13:13:17,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-15 13:13:17,520 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 44 [2018-10-15 13:13:17,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:17,521 INFO L225 Difference]: With dead ends: 48 [2018-10-15 13:13:17,521 INFO L226 Difference]: Without dead ends: 48 [2018-10-15 13:13:17,522 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-10-15 13:13:17,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-10-15 13:13:17,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2018-10-15 13:13:17,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-15 13:13:17,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-10-15 13:13:17,526 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2018-10-15 13:13:17,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:17,526 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-10-15 13:13:17,526 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-15 13:13:17,526 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-10-15 13:13:17,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-15 13:13:17,527 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:17,527 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:17,527 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:17,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:17,528 INFO L82 PathProgramCache]: Analyzing trace with hash 495978307, now seen corresponding path program 18 times [2018-10-15 13:13:17,528 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:17,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:18,107 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:18,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:18,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 13:13:18,108 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 13:13:18,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 13:13:18,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-10-15 13:13:18,109 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 21 states. [2018-10-15 13:13:18,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:18,774 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-10-15 13:13:18,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-15 13:13:18,776 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 46 [2018-10-15 13:13:18,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:18,777 INFO L225 Difference]: With dead ends: 50 [2018-10-15 13:13:18,777 INFO L226 Difference]: Without dead ends: 50 [2018-10-15 13:13:18,778 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-10-15 13:13:18,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-10-15 13:13:18,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-10-15 13:13:18,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-15 13:13:18,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-10-15 13:13:18,780 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2018-10-15 13:13:18,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:18,781 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-10-15 13:13:18,781 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 13:13:18,781 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-10-15 13:13:18,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-15 13:13:18,781 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:18,782 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:18,782 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:18,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:18,782 INFO L82 PathProgramCache]: Analyzing trace with hash 486296577, now seen corresponding path program 19 times [2018-10-15 13:13:18,783 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:18,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:19,208 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:19,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:19,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-15 13:13:19,209 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-15 13:13:19,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-15 13:13:19,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-10-15 13:13:19,210 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 22 states. [2018-10-15 13:13:19,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:19,922 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-10-15 13:13:19,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-15 13:13:19,923 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 48 [2018-10-15 13:13:19,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:19,923 INFO L225 Difference]: With dead ends: 52 [2018-10-15 13:13:19,923 INFO L226 Difference]: Without dead ends: 52 [2018-10-15 13:13:19,924 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-10-15 13:13:19,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-10-15 13:13:19,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2018-10-15 13:13:19,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-15 13:13:19,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-10-15 13:13:19,928 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2018-10-15 13:13:19,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:19,928 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-10-15 13:13:19,929 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-15 13:13:19,929 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-10-15 13:13:19,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-15 13:13:19,929 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:19,929 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:19,930 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:19,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:19,930 INFO L82 PathProgramCache]: Analyzing trace with hash -227911361, now seen corresponding path program 20 times [2018-10-15 13:13:19,931 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:19,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:20,835 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:20,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:20,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-15 13:13:20,835 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-15 13:13:20,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-15 13:13:20,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-10-15 13:13:20,836 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 23 states. [2018-10-15 13:13:21,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:21,548 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-10-15 13:13:21,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-15 13:13:21,548 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 50 [2018-10-15 13:13:21,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:21,549 INFO L225 Difference]: With dead ends: 54 [2018-10-15 13:13:21,549 INFO L226 Difference]: Without dead ends: 54 [2018-10-15 13:13:21,550 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-10-15 13:13:21,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-15 13:13:21,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-10-15 13:13:21,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-15 13:13:21,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-10-15 13:13:21,553 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2018-10-15 13:13:21,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:21,554 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-10-15 13:13:21,554 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-15 13:13:21,554 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-10-15 13:13:21,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-15 13:13:21,554 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:21,554 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:21,555 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:21,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:21,555 INFO L82 PathProgramCache]: Analyzing trace with hash 613027581, now seen corresponding path program 21 times [2018-10-15 13:13:21,556 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:21,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:22,018 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:22,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:22,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-15 13:13:22,018 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-15 13:13:22,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-15 13:13:22,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-10-15 13:13:22,019 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 24 states. [2018-10-15 13:13:22,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:22,974 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-10-15 13:13:22,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-15 13:13:22,975 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 52 [2018-10-15 13:13:22,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:22,976 INFO L225 Difference]: With dead ends: 56 [2018-10-15 13:13:22,977 INFO L226 Difference]: Without dead ends: 56 [2018-10-15 13:13:22,977 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-10-15 13:13:22,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-10-15 13:13:22,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2018-10-15 13:13:22,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-15 13:13:22,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-10-15 13:13:22,980 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2018-10-15 13:13:22,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:22,980 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-10-15 13:13:22,980 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-15 13:13:22,980 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-10-15 13:13:22,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-15 13:13:22,981 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:22,981 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:22,981 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:22,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:22,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1301499195, now seen corresponding path program 22 times [2018-10-15 13:13:22,982 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:22,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:23,817 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:23,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:23,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-15 13:13:23,817 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-15 13:13:23,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-15 13:13:23,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-10-15 13:13:23,818 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 25 states. [2018-10-15 13:13:24,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:24,643 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-10-15 13:13:24,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-15 13:13:24,644 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 54 [2018-10-15 13:13:24,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:24,645 INFO L225 Difference]: With dead ends: 58 [2018-10-15 13:13:24,645 INFO L226 Difference]: Without dead ends: 58 [2018-10-15 13:13:24,645 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-10-15 13:13:24,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-10-15 13:13:24,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-10-15 13:13:24,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-15 13:13:24,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-10-15 13:13:24,649 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2018-10-15 13:13:24,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:24,650 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-10-15 13:13:24,650 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-15 13:13:24,650 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-10-15 13:13:24,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-15 13:13:24,650 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:24,650 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:24,651 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:24,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:24,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1497756665, now seen corresponding path program 23 times [2018-10-15 13:13:24,652 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:24,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:25,370 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:25,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:25,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-15 13:13:25,370 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-15 13:13:25,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-15 13:13:25,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-10-15 13:13:25,371 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 26 states. [2018-10-15 13:13:26,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:26,330 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-10-15 13:13:26,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-15 13:13:26,331 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 56 [2018-10-15 13:13:26,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:26,332 INFO L225 Difference]: With dead ends: 60 [2018-10-15 13:13:26,332 INFO L226 Difference]: Without dead ends: 60 [2018-10-15 13:13:26,333 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-10-15 13:13:26,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-10-15 13:13:26,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2018-10-15 13:13:26,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-15 13:13:26,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-10-15 13:13:26,336 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2018-10-15 13:13:26,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:26,337 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-10-15 13:13:26,337 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-15 13:13:26,337 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-10-15 13:13:26,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-15 13:13:26,337 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:26,338 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:26,338 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:26,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:26,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1122624311, now seen corresponding path program 24 times [2018-10-15 13:13:26,339 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:26,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:26,852 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:26,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:26,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 13:13:26,852 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 13:13:26,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 13:13:26,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-10-15 13:13:26,853 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 27 states. [2018-10-15 13:13:27,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:27,941 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-10-15 13:13:27,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-15 13:13:27,941 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 58 [2018-10-15 13:13:27,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:27,942 INFO L225 Difference]: With dead ends: 62 [2018-10-15 13:13:27,942 INFO L226 Difference]: Without dead ends: 62 [2018-10-15 13:13:27,943 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-10-15 13:13:27,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-10-15 13:13:27,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2018-10-15 13:13:27,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-15 13:13:27,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-10-15 13:13:27,946 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2018-10-15 13:13:27,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:27,946 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-10-15 13:13:27,946 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 13:13:27,947 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-10-15 13:13:27,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-15 13:13:27,947 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:27,947 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:27,948 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:27,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:27,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1397684981, now seen corresponding path program 25 times [2018-10-15 13:13:27,949 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:27,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:28,759 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:28,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:28,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-15 13:13:28,759 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-15 13:13:28,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-15 13:13:28,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-10-15 13:13:28,761 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 28 states. [2018-10-15 13:13:29,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:29,811 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-10-15 13:13:29,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-15 13:13:29,811 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 60 [2018-10-15 13:13:29,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:29,812 INFO L225 Difference]: With dead ends: 64 [2018-10-15 13:13:29,812 INFO L226 Difference]: Without dead ends: 64 [2018-10-15 13:13:29,813 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-10-15 13:13:29,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-10-15 13:13:29,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2018-10-15 13:13:29,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-15 13:13:29,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-10-15 13:13:29,816 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2018-10-15 13:13:29,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:29,816 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-10-15 13:13:29,816 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-15 13:13:29,816 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-10-15 13:13:29,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-15 13:13:29,817 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:29,817 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:29,817 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:29,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:29,818 INFO L82 PathProgramCache]: Analyzing trace with hash -556983501, now seen corresponding path program 26 times [2018-10-15 13:13:29,818 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:29,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:31,035 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:31,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:31,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 13:13:31,036 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 13:13:31,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 13:13:31,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-10-15 13:13:31,037 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 29 states. [2018-10-15 13:13:32,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:32,164 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-10-15 13:13:32,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-15 13:13:32,164 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 62 [2018-10-15 13:13:32,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:32,165 INFO L225 Difference]: With dead ends: 66 [2018-10-15 13:13:32,166 INFO L226 Difference]: Without dead ends: 66 [2018-10-15 13:13:32,166 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-10-15 13:13:32,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-10-15 13:13:32,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2018-10-15 13:13:32,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-10-15 13:13:32,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-10-15 13:13:32,169 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 62 [2018-10-15 13:13:32,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:32,169 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-10-15 13:13:32,169 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 13:13:32,169 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-10-15 13:13:32,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-15 13:13:32,170 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:32,170 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:32,170 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:32,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:32,170 INFO L82 PathProgramCache]: Analyzing trace with hash -2092686351, now seen corresponding path program 27 times [2018-10-15 13:13:32,171 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:32,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:33,231 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:33,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:33,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-15 13:13:33,232 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-15 13:13:33,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-15 13:13:33,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-10-15 13:13:33,232 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 30 states. [2018-10-15 13:13:34,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:34,474 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-10-15 13:13:34,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-15 13:13:34,475 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 64 [2018-10-15 13:13:34,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:34,475 INFO L225 Difference]: With dead ends: 68 [2018-10-15 13:13:34,476 INFO L226 Difference]: Without dead ends: 68 [2018-10-15 13:13:34,476 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-10-15 13:13:34,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-10-15 13:13:34,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2018-10-15 13:13:34,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-15 13:13:34,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-10-15 13:13:34,479 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 64 [2018-10-15 13:13:34,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:34,479 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-10-15 13:13:34,479 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-15 13:13:34,479 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-10-15 13:13:34,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-15 13:13:34,480 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:34,480 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:34,480 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:34,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:34,481 INFO L82 PathProgramCache]: Analyzing trace with hash -434375377, now seen corresponding path program 28 times [2018-10-15 13:13:34,481 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:34,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:35,056 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:35,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:35,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 13:13:35,057 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 13:13:35,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 13:13:35,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-10-15 13:13:35,058 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 31 states. [2018-10-15 13:13:36,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:36,407 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-10-15 13:13:36,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-15 13:13:36,408 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 66 [2018-10-15 13:13:36,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:36,409 INFO L225 Difference]: With dead ends: 70 [2018-10-15 13:13:36,409 INFO L226 Difference]: Without dead ends: 70 [2018-10-15 13:13:36,410 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-10-15 13:13:36,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-10-15 13:13:36,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2018-10-15 13:13:36,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-10-15 13:13:36,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-10-15 13:13:36,413 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 66 [2018-10-15 13:13:36,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:36,413 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-10-15 13:13:36,413 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 13:13:36,414 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-10-15 13:13:36,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-15 13:13:36,414 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:36,414 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:36,414 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:36,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:36,415 INFO L82 PathProgramCache]: Analyzing trace with hash -230396179, now seen corresponding path program 29 times [2018-10-15 13:13:36,415 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:36,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:37,359 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:37,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:37,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-15 13:13:37,360 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-15 13:13:37,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-15 13:13:37,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-10-15 13:13:37,361 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 32 states. [2018-10-15 13:13:38,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:38,850 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-10-15 13:13:38,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-15 13:13:38,851 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 68 [2018-10-15 13:13:38,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:38,852 INFO L225 Difference]: With dead ends: 72 [2018-10-15 13:13:38,852 INFO L226 Difference]: Without dead ends: 72 [2018-10-15 13:13:38,853 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-10-15 13:13:38,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-10-15 13:13:38,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2018-10-15 13:13:38,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-10-15 13:13:38,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-10-15 13:13:38,855 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 68 [2018-10-15 13:13:38,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:38,856 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-10-15 13:13:38,856 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-15 13:13:38,856 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-10-15 13:13:38,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-10-15 13:13:38,856 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:38,857 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:38,857 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:38,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:38,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1774882517, now seen corresponding path program 30 times [2018-10-15 13:13:38,858 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:38,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:39,902 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:39,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:39,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 13:13:39,903 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 13:13:39,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 13:13:39,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 13:13:39,904 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 33 states. [2018-10-15 13:13:41,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:41,327 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-10-15 13:13:41,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-15 13:13:41,328 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 70 [2018-10-15 13:13:41,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:41,329 INFO L225 Difference]: With dead ends: 74 [2018-10-15 13:13:41,329 INFO L226 Difference]: Without dead ends: 74 [2018-10-15 13:13:41,330 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 13:13:41,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-15 13:13:41,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2018-10-15 13:13:41,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-15 13:13:41,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-10-15 13:13:41,332 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 70 [2018-10-15 13:13:41,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:41,332 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-10-15 13:13:41,333 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 13:13:41,333 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-10-15 13:13:41,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-15 13:13:41,333 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:41,333 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:41,334 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:41,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:41,334 INFO L82 PathProgramCache]: Analyzing trace with hash 32431081, now seen corresponding path program 31 times [2018-10-15 13:13:41,335 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:41,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:42,091 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:42,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:42,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-15 13:13:42,092 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-15 13:13:42,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-15 13:13:42,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-10-15 13:13:42,093 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 34 states. [2018-10-15 13:13:43,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:43,816 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-10-15 13:13:43,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-15 13:13:43,816 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 72 [2018-10-15 13:13:43,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:43,817 INFO L225 Difference]: With dead ends: 76 [2018-10-15 13:13:43,817 INFO L226 Difference]: Without dead ends: 76 [2018-10-15 13:13:43,818 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-10-15 13:13:43,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-10-15 13:13:43,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2018-10-15 13:13:43,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-15 13:13:43,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-10-15 13:13:43,822 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 72 [2018-10-15 13:13:43,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:43,822 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-10-15 13:13:43,822 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-15 13:13:43,822 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-10-15 13:13:43,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-15 13:13:43,824 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:43,824 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:43,824 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:43,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:43,825 INFO L82 PathProgramCache]: Analyzing trace with hash 1694011175, now seen corresponding path program 32 times [2018-10-15 13:13:43,826 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:43,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:44,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:44,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:44,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 13:13:44,615 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 13:13:44,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 13:13:44,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 13:13:44,616 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 35 states. [2018-10-15 13:13:46,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:46,218 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-10-15 13:13:46,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-15 13:13:46,218 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 74 [2018-10-15 13:13:46,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:46,219 INFO L225 Difference]: With dead ends: 78 [2018-10-15 13:13:46,219 INFO L226 Difference]: Without dead ends: 78 [2018-10-15 13:13:46,220 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 13:13:46,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-10-15 13:13:46,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-10-15 13:13:46,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-10-15 13:13:46,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-10-15 13:13:46,223 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 74 [2018-10-15 13:13:46,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:46,223 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-10-15 13:13:46,223 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 13:13:46,223 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-10-15 13:13:46,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-15 13:13:46,224 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:46,224 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:46,224 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:46,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:46,224 INFO L82 PathProgramCache]: Analyzing trace with hash 744647397, now seen corresponding path program 33 times [2018-10-15 13:13:46,225 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:46,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:47,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:47,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:47,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-15 13:13:47,185 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-15 13:13:47,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-15 13:13:47,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-10-15 13:13:47,186 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 36 states. [2018-10-15 13:13:49,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:49,075 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-10-15 13:13:49,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-15 13:13:49,075 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 76 [2018-10-15 13:13:49,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:49,076 INFO L225 Difference]: With dead ends: 80 [2018-10-15 13:13:49,076 INFO L226 Difference]: Without dead ends: 80 [2018-10-15 13:13:49,077 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-10-15 13:13:49,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-10-15 13:13:49,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2018-10-15 13:13:49,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-10-15 13:13:49,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-10-15 13:13:49,079 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 76 [2018-10-15 13:13:49,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:49,079 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-10-15 13:13:49,080 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-15 13:13:49,080 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-10-15 13:13:49,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-15 13:13:49,080 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:49,080 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:49,081 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:49,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:49,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1060876509, now seen corresponding path program 34 times [2018-10-15 13:13:49,081 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:49,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:49,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:49,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:49,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 13:13:49,916 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 13:13:49,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 13:13:49,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 13:13:49,916 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 37 states. [2018-10-15 13:13:51,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:51,735 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-10-15 13:13:51,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-15 13:13:51,735 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 78 [2018-10-15 13:13:51,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:51,736 INFO L225 Difference]: With dead ends: 82 [2018-10-15 13:13:51,737 INFO L226 Difference]: Without dead ends: 82 [2018-10-15 13:13:51,737 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 13:13:51,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-10-15 13:13:51,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2018-10-15 13:13:51,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-10-15 13:13:51,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-10-15 13:13:51,740 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 78 [2018-10-15 13:13:51,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:51,740 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-10-15 13:13:51,740 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 13:13:51,740 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-10-15 13:13:51,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-15 13:13:51,741 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:51,741 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:51,741 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:51,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:51,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1002562591, now seen corresponding path program 35 times [2018-10-15 13:13:51,742 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:51,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:53,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:53,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:53,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-15 13:13:53,040 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-15 13:13:53,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-15 13:13:53,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-10-15 13:13:53,041 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 38 states. [2018-10-15 13:13:55,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:55,068 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-10-15 13:13:55,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-15 13:13:55,069 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 80 [2018-10-15 13:13:55,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:55,070 INFO L225 Difference]: With dead ends: 84 [2018-10-15 13:13:55,070 INFO L226 Difference]: Without dead ends: 84 [2018-10-15 13:13:55,071 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-10-15 13:13:55,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-10-15 13:13:55,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2018-10-15 13:13:55,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-10-15 13:13:55,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-10-15 13:13:55,073 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 80 [2018-10-15 13:13:55,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:55,073 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-10-15 13:13:55,073 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-15 13:13:55,073 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-10-15 13:13:55,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-15 13:13:55,074 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:55,074 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:55,074 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:55,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:55,074 INFO L82 PathProgramCache]: Analyzing trace with hash -797462241, now seen corresponding path program 36 times [2018-10-15 13:13:55,075 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:55,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:13:57,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:13:57,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:13:57,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 13:13:57,357 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 13:13:57,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 13:13:57,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 13:13:57,358 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 39 states. [2018-10-15 13:13:59,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:13:59,570 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-10-15 13:13:59,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-15 13:13:59,570 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 82 [2018-10-15 13:13:59,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:13:59,571 INFO L225 Difference]: With dead ends: 86 [2018-10-15 13:13:59,571 INFO L226 Difference]: Without dead ends: 86 [2018-10-15 13:13:59,573 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 13:13:59,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-10-15 13:13:59,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2018-10-15 13:13:59,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-15 13:13:59,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-10-15 13:13:59,576 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 82 [2018-10-15 13:13:59,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:13:59,576 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-10-15 13:13:59,576 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 13:13:59,576 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-10-15 13:13:59,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-15 13:13:59,577 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:13:59,577 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:13:59,577 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:13:59,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:13:59,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1264521507, now seen corresponding path program 37 times [2018-10-15 13:13:59,578 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:13:59,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:00,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:00,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:00,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-15 13:14:00,556 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-15 13:14:00,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-15 13:14:00,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-10-15 13:14:00,557 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 40 states. [2018-10-15 13:14:02,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:02,652 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-10-15 13:14:02,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-15 13:14:02,652 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 84 [2018-10-15 13:14:02,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:02,653 INFO L225 Difference]: With dead ends: 88 [2018-10-15 13:14:02,654 INFO L226 Difference]: Without dead ends: 88 [2018-10-15 13:14:02,655 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-10-15 13:14:02,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-10-15 13:14:02,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2018-10-15 13:14:02,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-10-15 13:14:02,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-10-15 13:14:02,657 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 84 [2018-10-15 13:14:02,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:02,657 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-10-15 13:14:02,658 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-15 13:14:02,658 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-10-15 13:14:02,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-15 13:14:02,658 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:02,658 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:02,659 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:02,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:02,659 INFO L82 PathProgramCache]: Analyzing trace with hash 863089947, now seen corresponding path program 38 times [2018-10-15 13:14:02,660 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:02,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:03,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:03,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:03,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 13:14:03,898 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 13:14:03,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 13:14:03,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 13:14:03,899 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 41 states. [2018-10-15 13:14:06,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:06,337 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-10-15 13:14:06,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-15 13:14:06,338 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 86 [2018-10-15 13:14:06,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:06,338 INFO L225 Difference]: With dead ends: 90 [2018-10-15 13:14:06,339 INFO L226 Difference]: Without dead ends: 90 [2018-10-15 13:14:06,340 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 13:14:06,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-10-15 13:14:06,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2018-10-15 13:14:06,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-10-15 13:14:06,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-10-15 13:14:06,342 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 86 [2018-10-15 13:14:06,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:06,342 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-10-15 13:14:06,342 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 13:14:06,343 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-10-15 13:14:06,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-15 13:14:06,343 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:06,343 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:06,343 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:06,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:06,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1093264345, now seen corresponding path program 39 times [2018-10-15 13:14:06,344 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:06,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:07,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:07,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:07,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-15 13:14:07,348 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-15 13:14:07,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-15 13:14:07,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-10-15 13:14:07,349 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 42 states. [2018-10-15 13:14:09,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:09,828 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-10-15 13:14:09,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-15 13:14:09,828 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 88 [2018-10-15 13:14:09,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:09,829 INFO L225 Difference]: With dead ends: 92 [2018-10-15 13:14:09,829 INFO L226 Difference]: Without dead ends: 92 [2018-10-15 13:14:09,830 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-10-15 13:14:09,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-10-15 13:14:09,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2018-10-15 13:14:09,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-10-15 13:14:09,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-10-15 13:14:09,833 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 88 [2018-10-15 13:14:09,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:09,833 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-10-15 13:14:09,833 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-15 13:14:09,833 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-10-15 13:14:09,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-15 13:14:09,834 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:09,834 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:09,834 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:09,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:09,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1047438569, now seen corresponding path program 40 times [2018-10-15 13:14:09,835 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:09,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:11,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:11,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:11,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 13:14:11,147 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 13:14:11,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 13:14:11,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 13:14:11,148 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 43 states. [2018-10-15 13:14:13,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:13,648 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-10-15 13:14:13,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-15 13:14:13,649 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 90 [2018-10-15 13:14:13,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:13,649 INFO L225 Difference]: With dead ends: 94 [2018-10-15 13:14:13,649 INFO L226 Difference]: Without dead ends: 94 [2018-10-15 13:14:13,650 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 13:14:13,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-10-15 13:14:13,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2018-10-15 13:14:13,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-10-15 13:14:13,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-10-15 13:14:13,652 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 90 [2018-10-15 13:14:13,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:13,652 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-10-15 13:14:13,652 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 13:14:13,652 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-10-15 13:14:13,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-10-15 13:14:13,653 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:13,653 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:13,653 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:13,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:13,654 INFO L82 PathProgramCache]: Analyzing trace with hash -973604139, now seen corresponding path program 41 times [2018-10-15 13:14:13,654 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:13,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:14,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:14,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:14,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-15 13:14:14,875 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-15 13:14:14,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-15 13:14:14,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-10-15 13:14:14,876 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 44 states. [2018-10-15 13:14:17,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:17,451 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-10-15 13:14:17,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-15 13:14:17,451 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 92 [2018-10-15 13:14:17,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:17,452 INFO L225 Difference]: With dead ends: 96 [2018-10-15 13:14:17,452 INFO L226 Difference]: Without dead ends: 96 [2018-10-15 13:14:17,453 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-10-15 13:14:17,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-10-15 13:14:17,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2018-10-15 13:14:17,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-10-15 13:14:17,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-10-15 13:14:17,456 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 92 [2018-10-15 13:14:17,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:17,456 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-10-15 13:14:17,456 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-15 13:14:17,456 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-10-15 13:14:17,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-15 13:14:17,457 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:17,457 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:17,457 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:17,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:17,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1261806355, now seen corresponding path program 42 times [2018-10-15 13:14:17,458 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:17,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:18,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:18,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:18,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 13:14:18,637 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 13:14:18,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 13:14:18,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 13:14:18,638 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 45 states. [2018-10-15 13:14:21,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:21,479 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-10-15 13:14:21,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-15 13:14:21,479 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 94 [2018-10-15 13:14:21,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:21,480 INFO L225 Difference]: With dead ends: 98 [2018-10-15 13:14:21,480 INFO L226 Difference]: Without dead ends: 98 [2018-10-15 13:14:21,482 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 13:14:21,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-10-15 13:14:21,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2018-10-15 13:14:21,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-10-15 13:14:21,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-10-15 13:14:21,485 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 94 [2018-10-15 13:14:21,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:21,485 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-10-15 13:14:21,485 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 13:14:21,485 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-10-15 13:14:21,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-15 13:14:21,486 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:21,486 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:21,486 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:21,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:21,486 INFO L82 PathProgramCache]: Analyzing trace with hash 2007643089, now seen corresponding path program 43 times [2018-10-15 13:14:21,487 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:21,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:22,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:22,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:22,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-15 13:14:22,760 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-15 13:14:22,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-15 13:14:22,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-10-15 13:14:22,761 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 46 states. [2018-10-15 13:14:25,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:25,731 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-10-15 13:14:25,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-15 13:14:25,732 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 96 [2018-10-15 13:14:25,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:25,733 INFO L225 Difference]: With dead ends: 100 [2018-10-15 13:14:25,733 INFO L226 Difference]: Without dead ends: 100 [2018-10-15 13:14:25,734 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-10-15 13:14:25,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-10-15 13:14:25,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2018-10-15 13:14:25,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-10-15 13:14:25,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-10-15 13:14:25,737 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 96 [2018-10-15 13:14:25,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:25,737 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-10-15 13:14:25,738 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-15 13:14:25,738 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-10-15 13:14:25,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-10-15 13:14:25,738 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:25,738 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:25,739 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:25,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:25,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1497206031, now seen corresponding path program 44 times [2018-10-15 13:14:25,740 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:25,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:27,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:27,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:27,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 13:14:27,022 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 13:14:27,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 13:14:27,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 13:14:27,023 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 47 states. [2018-10-15 13:14:30,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:30,062 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-10-15 13:14:30,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-15 13:14:30,063 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 98 [2018-10-15 13:14:30,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:30,064 INFO L225 Difference]: With dead ends: 102 [2018-10-15 13:14:30,064 INFO L226 Difference]: Without dead ends: 102 [2018-10-15 13:14:30,065 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 13:14:30,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-10-15 13:14:30,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2018-10-15 13:14:30,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-10-15 13:14:30,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-10-15 13:14:30,068 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 98 [2018-10-15 13:14:30,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:30,069 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-10-15 13:14:30,069 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 13:14:30,069 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-10-15 13:14:30,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-15 13:14:30,069 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:30,070 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:30,070 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:30,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:30,070 INFO L82 PathProgramCache]: Analyzing trace with hash 593465037, now seen corresponding path program 45 times [2018-10-15 13:14:30,071 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:30,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:31,384 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:31,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:31,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-15 13:14:31,385 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-15 13:14:31,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-15 13:14:31,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-10-15 13:14:31,385 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 48 states. [2018-10-15 13:14:34,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:34,585 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-10-15 13:14:34,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-15 13:14:34,586 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 100 [2018-10-15 13:14:34,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:34,587 INFO L225 Difference]: With dead ends: 104 [2018-10-15 13:14:34,587 INFO L226 Difference]: Without dead ends: 104 [2018-10-15 13:14:34,587 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-10-15 13:14:34,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-10-15 13:14:34,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2018-10-15 13:14:34,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-10-15 13:14:34,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-10-15 13:14:34,591 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 100 [2018-10-15 13:14:34,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:34,591 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-10-15 13:14:34,591 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-15 13:14:34,591 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-10-15 13:14:34,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-15 13:14:34,592 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:34,592 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:34,592 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:34,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:34,593 INFO L82 PathProgramCache]: Analyzing trace with hash -318236405, now seen corresponding path program 46 times [2018-10-15 13:14:34,593 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:34,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:35,880 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:35,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:35,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 13:14:35,880 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 13:14:35,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 13:14:35,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 13:14:35,881 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 49 states. [2018-10-15 13:14:39,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:39,122 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-10-15 13:14:39,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-15 13:14:39,125 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 102 [2018-10-15 13:14:39,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:39,125 INFO L225 Difference]: With dead ends: 106 [2018-10-15 13:14:39,125 INFO L226 Difference]: Without dead ends: 106 [2018-10-15 13:14:39,126 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 13:14:39,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-10-15 13:14:39,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2018-10-15 13:14:39,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-10-15 13:14:39,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-10-15 13:14:39,128 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 102 [2018-10-15 13:14:39,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:39,129 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-10-15 13:14:39,129 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 13:14:39,129 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-10-15 13:14:39,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-10-15 13:14:39,129 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:39,130 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:39,130 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:39,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:39,130 INFO L82 PathProgramCache]: Analyzing trace with hash -289993783, now seen corresponding path program 47 times [2018-10-15 13:14:39,131 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:39,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:40,558 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:40,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:40,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-15 13:14:40,559 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-15 13:14:40,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-15 13:14:40,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-10-15 13:14:40,560 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 50 states. [2018-10-15 13:14:43,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:43,929 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-10-15 13:14:43,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-15 13:14:43,932 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 104 [2018-10-15 13:14:43,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:43,933 INFO L225 Difference]: With dead ends: 108 [2018-10-15 13:14:43,934 INFO L226 Difference]: Without dead ends: 108 [2018-10-15 13:14:43,934 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-10-15 13:14:43,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-10-15 13:14:43,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2018-10-15 13:14:43,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-10-15 13:14:43,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-10-15 13:14:43,936 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 104 [2018-10-15 13:14:43,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:43,937 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-10-15 13:14:43,937 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-15 13:14:43,937 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-10-15 13:14:43,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-15 13:14:43,938 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:43,938 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:43,938 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:43,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:43,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1081362183, now seen corresponding path program 48 times [2018-10-15 13:14:43,939 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:43,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:45,653 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:45,653 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:45,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 13:14:45,653 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 13:14:45,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 13:14:45,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 13:14:45,654 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 51 states. [2018-10-15 13:14:49,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:49,529 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2018-10-15 13:14:49,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-15 13:14:49,530 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 106 [2018-10-15 13:14:49,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:49,531 INFO L225 Difference]: With dead ends: 110 [2018-10-15 13:14:49,531 INFO L226 Difference]: Without dead ends: 110 [2018-10-15 13:14:49,532 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 13:14:49,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-10-15 13:14:49,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2018-10-15 13:14:49,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-10-15 13:14:49,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-10-15 13:14:49,535 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 106 [2018-10-15 13:14:49,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:49,535 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-10-15 13:14:49,535 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 13:14:49,535 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-10-15 13:14:49,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-15 13:14:49,536 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:49,536 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:49,536 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:49,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:49,536 INFO L82 PathProgramCache]: Analyzing trace with hash 399485637, now seen corresponding path program 49 times [2018-10-15 13:14:49,537 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:49,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:51,161 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:51,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:51,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-10-15 13:14:51,161 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-15 13:14:51,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-15 13:14:51,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-10-15 13:14:51,162 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 52 states. [2018-10-15 13:14:54,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:14:54,836 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2018-10-15 13:14:54,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-15 13:14:54,837 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 108 [2018-10-15 13:14:54,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:14:54,838 INFO L225 Difference]: With dead ends: 112 [2018-10-15 13:14:54,838 INFO L226 Difference]: Without dead ends: 112 [2018-10-15 13:14:54,839 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-10-15 13:14:54,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-10-15 13:14:54,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2018-10-15 13:14:54,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-10-15 13:14:54,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-10-15 13:14:54,842 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 108 [2018-10-15 13:14:54,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:14:54,842 INFO L481 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-10-15 13:14:54,842 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-15 13:14:54,842 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-10-15 13:14:54,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-15 13:14:54,843 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:14:54,843 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:14:54,843 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:14:54,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:14:54,844 INFO L82 PathProgramCache]: Analyzing trace with hash -2048846077, now seen corresponding path program 50 times [2018-10-15 13:14:54,844 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:14:54,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:14:56,274 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:14:56,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:14:56,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 13:14:56,275 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 13:14:56,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 13:14:56,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 13:14:56,276 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 53 states. [2018-10-15 13:15:00,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:00,196 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-10-15 13:15:00,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-15 13:15:00,197 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 110 [2018-10-15 13:15:00,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:00,198 INFO L225 Difference]: With dead ends: 114 [2018-10-15 13:15:00,198 INFO L226 Difference]: Without dead ends: 114 [2018-10-15 13:15:00,199 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 13:15:00,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-10-15 13:15:00,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2018-10-15 13:15:00,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-10-15 13:15:00,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-10-15 13:15:00,200 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 110 [2018-10-15 13:15:00,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:00,201 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-10-15 13:15:00,201 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 13:15:00,201 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-10-15 13:15:00,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-15 13:15:00,201 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:00,202 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:15:00,202 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:00,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:00,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1253545023, now seen corresponding path program 51 times [2018-10-15 13:15:00,203 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:00,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:01,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:01,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:01,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-10-15 13:15:01,636 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-15 13:15:01,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-15 13:15:01,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2018-10-15 13:15:01,636 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 54 states. [2018-10-15 13:15:05,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:05,628 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2018-10-15 13:15:05,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-15 13:15:05,628 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 112 [2018-10-15 13:15:05,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:05,629 INFO L225 Difference]: With dead ends: 116 [2018-10-15 13:15:05,629 INFO L226 Difference]: Without dead ends: 116 [2018-10-15 13:15:05,630 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2018-10-15 13:15:05,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-10-15 13:15:05,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2018-10-15 13:15:05,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-10-15 13:15:05,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-10-15 13:15:05,633 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 112 [2018-10-15 13:15:05,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:05,633 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-10-15 13:15:05,634 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-15 13:15:05,634 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-10-15 13:15:05,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-10-15 13:15:05,634 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:05,634 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:15:05,635 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:05,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:05,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1473410817, now seen corresponding path program 52 times [2018-10-15 13:15:05,636 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:05,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:07,586 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:07,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:07,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-15 13:15:07,587 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-15 13:15:07,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-15 13:15:07,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 13:15:07,587 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 55 states. [2018-10-15 13:15:11,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:11,768 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2018-10-15 13:15:11,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-15 13:15:11,769 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 114 [2018-10-15 13:15:11,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:11,770 INFO L225 Difference]: With dead ends: 118 [2018-10-15 13:15:11,770 INFO L226 Difference]: Without dead ends: 118 [2018-10-15 13:15:11,771 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 13:15:11,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-10-15 13:15:11,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2018-10-15 13:15:11,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-10-15 13:15:11,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-10-15 13:15:11,774 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 114 [2018-10-15 13:15:11,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:11,774 INFO L481 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-10-15 13:15:11,774 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-15 13:15:11,775 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-10-15 13:15:11,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-15 13:15:11,775 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:11,775 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:15:11,776 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:11,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:11,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1983925949, now seen corresponding path program 53 times [2018-10-15 13:15:11,777 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:11,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:13,326 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:13,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:13,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-10-15 13:15:13,327 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-15 13:15:13,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-15 13:15:13,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2018-10-15 13:15:13,328 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 56 states. [2018-10-15 13:15:17,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:17,639 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2018-10-15 13:15:17,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-15 13:15:17,639 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 116 [2018-10-15 13:15:17,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:17,641 INFO L225 Difference]: With dead ends: 120 [2018-10-15 13:15:17,641 INFO L226 Difference]: Without dead ends: 120 [2018-10-15 13:15:17,641 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2018-10-15 13:15:17,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-10-15 13:15:17,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2018-10-15 13:15:17,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-10-15 13:15:17,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2018-10-15 13:15:17,644 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 116 [2018-10-15 13:15:17,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:17,644 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2018-10-15 13:15:17,644 INFO L482 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-15 13:15:17,644 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2018-10-15 13:15:17,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-15 13:15:17,645 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:17,645 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:15:17,645 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:17,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:17,645 INFO L82 PathProgramCache]: Analyzing trace with hash 179870971, now seen corresponding path program 54 times [2018-10-15 13:15:17,646 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:17,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:19,399 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:19,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:19,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-15 13:15:19,400 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-15 13:15:19,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-15 13:15:19,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 13:15:19,401 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 57 states. [2018-10-15 13:15:23,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:23,896 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2018-10-15 13:15:23,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-15 13:15:23,897 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 118 [2018-10-15 13:15:23,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:23,898 INFO L225 Difference]: With dead ends: 122 [2018-10-15 13:15:23,898 INFO L226 Difference]: Without dead ends: 122 [2018-10-15 13:15:23,899 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 13:15:23,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-10-15 13:15:23,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2018-10-15 13:15:23,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-10-15 13:15:23,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-10-15 13:15:23,901 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 118 [2018-10-15 13:15:23,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:23,901 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-10-15 13:15:23,902 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-15 13:15:23,902 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-10-15 13:15:23,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-15 13:15:23,902 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:23,902 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:15:23,903 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:23,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:23,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1649824697, now seen corresponding path program 55 times [2018-10-15 13:15:23,904 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:23,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:25,794 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:25,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:25,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-10-15 13:15:25,795 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-15 13:15:25,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-15 13:15:25,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-10-15 13:15:25,796 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 58 states. [2018-10-15 13:15:30,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:30,244 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2018-10-15 13:15:30,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-15 13:15:30,245 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 120 [2018-10-15 13:15:30,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:30,246 INFO L225 Difference]: With dead ends: 124 [2018-10-15 13:15:30,246 INFO L226 Difference]: Without dead ends: 124 [2018-10-15 13:15:30,247 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-10-15 13:15:30,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-10-15 13:15:30,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2018-10-15 13:15:30,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-10-15 13:15:30,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-10-15 13:15:30,249 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 120 [2018-10-15 13:15:30,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:30,249 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-10-15 13:15:30,250 INFO L482 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-15 13:15:30,250 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-10-15 13:15:30,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-15 13:15:30,250 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:30,251 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:15:30,251 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:30,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:30,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1231114999, now seen corresponding path program 56 times [2018-10-15 13:15:30,252 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:30,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:32,238 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:32,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:32,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-15 13:15:32,239 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-15 13:15:32,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-15 13:15:32,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 13:15:32,240 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 59 states. [2018-10-15 13:15:37,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:37,058 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2018-10-15 13:15:37,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-15 13:15:37,059 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 122 [2018-10-15 13:15:37,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:37,059 INFO L225 Difference]: With dead ends: 126 [2018-10-15 13:15:37,060 INFO L226 Difference]: Without dead ends: 126 [2018-10-15 13:15:37,060 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 13:15:37,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-10-15 13:15:37,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2018-10-15 13:15:37,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-10-15 13:15:37,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-10-15 13:15:37,062 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 122 [2018-10-15 13:15:37,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:37,063 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-10-15 13:15:37,063 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-15 13:15:37,063 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-10-15 13:15:37,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-15 13:15:37,064 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:37,064 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:15:37,064 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:37,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:37,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1716946251, now seen corresponding path program 57 times [2018-10-15 13:15:37,065 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:37,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:39,921 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:39,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:39,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-10-15 13:15:39,922 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-15 13:15:39,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-15 13:15:39,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2018-10-15 13:15:39,923 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 60 states. [2018-10-15 13:15:44,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:44,797 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2018-10-15 13:15:44,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-15 13:15:44,797 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 124 [2018-10-15 13:15:44,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:44,798 INFO L225 Difference]: With dead ends: 128 [2018-10-15 13:15:44,798 INFO L226 Difference]: Without dead ends: 128 [2018-10-15 13:15:44,799 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2018-10-15 13:15:44,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-10-15 13:15:44,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2018-10-15 13:15:44,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-10-15 13:15:44,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2018-10-15 13:15:44,801 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 124 [2018-10-15 13:15:44,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:44,801 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2018-10-15 13:15:44,802 INFO L482 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-15 13:15:44,802 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2018-10-15 13:15:44,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-10-15 13:15:44,802 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:44,802 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:15:44,803 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:44,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:44,803 INFO L82 PathProgramCache]: Analyzing trace with hash -125392141, now seen corresponding path program 58 times [2018-10-15 13:15:44,803 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:44,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:47,560 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:47,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:47,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-15 13:15:47,561 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-15 13:15:47,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-15 13:15:47,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-10-15 13:15:47,561 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 61 states. [2018-10-15 13:15:52,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:52,609 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2018-10-15 13:15:52,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-15 13:15:52,609 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 126 [2018-10-15 13:15:52,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:52,610 INFO L225 Difference]: With dead ends: 130 [2018-10-15 13:15:52,610 INFO L226 Difference]: Without dead ends: 130 [2018-10-15 13:15:52,611 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-10-15 13:15:52,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-10-15 13:15:52,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2018-10-15 13:15:52,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-10-15 13:15:52,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-10-15 13:15:52,613 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 126 [2018-10-15 13:15:52,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:52,613 INFO L481 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-10-15 13:15:52,613 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-15 13:15:52,614 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-10-15 13:15:52,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-15 13:15:52,614 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:52,614 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:15:52,614 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:52,615 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:52,615 INFO L82 PathProgramCache]: Analyzing trace with hash 349750193, now seen corresponding path program 59 times [2018-10-15 13:15:52,615 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:52,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:15:54,515 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 0 proven. 3481 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:15:54,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:15:54,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-10-15 13:15:54,516 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-15 13:15:54,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-15 13:15:54,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2018-10-15 13:15:54,516 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 62 states. [2018-10-15 13:15:59,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:15:59,699 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2018-10-15 13:15:59,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-15 13:15:59,700 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 128 [2018-10-15 13:15:59,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:15:59,701 INFO L225 Difference]: With dead ends: 132 [2018-10-15 13:15:59,701 INFO L226 Difference]: Without dead ends: 132 [2018-10-15 13:15:59,702 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2018-10-15 13:15:59,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-10-15 13:15:59,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2018-10-15 13:15:59,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-10-15 13:15:59,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-10-15 13:15:59,705 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 128 [2018-10-15 13:15:59,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:15:59,705 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-10-15 13:15:59,705 INFO L482 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-15 13:15:59,705 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-10-15 13:15:59,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-15 13:15:59,706 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:15:59,706 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:15:59,706 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:15:59,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:15:59,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1694999791, now seen corresponding path program 60 times [2018-10-15 13:15:59,707 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:15:59,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:16:01,854 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:16:01,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:16:01,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-15 13:16:01,854 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-15 13:16:01,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-15 13:16:01,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 13:16:01,855 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 63 states. [2018-10-15 13:16:07,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:16:07,226 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2018-10-15 13:16:07,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-15 13:16:07,226 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 130 [2018-10-15 13:16:07,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:16:07,227 INFO L225 Difference]: With dead ends: 134 [2018-10-15 13:16:07,227 INFO L226 Difference]: Without dead ends: 134 [2018-10-15 13:16:07,228 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 13:16:07,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-10-15 13:16:07,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2018-10-15 13:16:07,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-10-15 13:16:07,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-10-15 13:16:07,230 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 130 [2018-10-15 13:16:07,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:16:07,230 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-10-15 13:16:07,230 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-15 13:16:07,230 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-10-15 13:16:07,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-15 13:16:07,231 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:16:07,231 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:16:07,231 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:16:07,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:16:07,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1694707373, now seen corresponding path program 61 times [2018-10-15 13:16:07,232 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:16:07,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:16:09,201 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:16:09,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:16:09,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-10-15 13:16:09,201 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-15 13:16:09,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-15 13:16:09,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2018-10-15 13:16:09,202 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 64 states. [2018-10-15 13:16:14,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:16:14,801 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2018-10-15 13:16:14,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-15 13:16:14,802 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 132 [2018-10-15 13:16:14,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:16:14,803 INFO L225 Difference]: With dead ends: 136 [2018-10-15 13:16:14,803 INFO L226 Difference]: Without dead ends: 136 [2018-10-15 13:16:14,804 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2018-10-15 13:16:14,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-10-15 13:16:14,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2018-10-15 13:16:14,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-10-15 13:16:14,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2018-10-15 13:16:14,807 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 132 [2018-10-15 13:16:14,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:16:14,807 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2018-10-15 13:16:14,807 INFO L482 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-15 13:16:14,807 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2018-10-15 13:16:14,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-15 13:16:14,808 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:16:14,808 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:16:14,808 INFO L424 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:16:14,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:16:14,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1413693675, now seen corresponding path program 62 times [2018-10-15 13:16:14,809 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:16:14,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:16:17,037 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 0 proven. 3844 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:16:17,037 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:16:17,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-15 13:16:17,038 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-15 13:16:17,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-15 13:16:17,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-10-15 13:16:17,038 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 65 states. [2018-10-15 13:16:22,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:16:22,841 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2018-10-15 13:16:22,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-15 13:16:22,841 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 134 [2018-10-15 13:16:22,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:16:22,842 INFO L225 Difference]: With dead ends: 138 [2018-10-15 13:16:22,842 INFO L226 Difference]: Without dead ends: 138 [2018-10-15 13:16:22,843 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-10-15 13:16:22,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-10-15 13:16:22,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2018-10-15 13:16:22,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-10-15 13:16:22,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-10-15 13:16:22,846 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 134 [2018-10-15 13:16:22,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:16:22,847 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-10-15 13:16:22,847 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-15 13:16:22,847 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-10-15 13:16:22,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-15 13:16:22,848 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:16:22,848 INFO L375 BasicCegarLoop]: trace histogram [63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:16:22,848 INFO L424 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:16:22,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:16:22,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1942469545, now seen corresponding path program 63 times [2018-10-15 13:16:22,849 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:16:22,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:16:25,043 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:16:25,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:16:25,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-10-15 13:16:25,044 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-15 13:16:25,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-15 13:16:25,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2018-10-15 13:16:25,045 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 66 states. [2018-10-15 13:16:31,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:16:31,042 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2018-10-15 13:16:31,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-15 13:16:31,043 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 136 [2018-10-15 13:16:31,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:16:31,044 INFO L225 Difference]: With dead ends: 140 [2018-10-15 13:16:31,044 INFO L226 Difference]: Without dead ends: 140 [2018-10-15 13:16:31,044 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2018-10-15 13:16:31,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-10-15 13:16:31,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2018-10-15 13:16:31,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-10-15 13:16:31,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2018-10-15 13:16:31,047 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 136 [2018-10-15 13:16:31,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:16:31,048 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2018-10-15 13:16:31,048 INFO L482 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-15 13:16:31,048 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2018-10-15 13:16:31,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-10-15 13:16:31,048 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:16:31,049 INFO L375 BasicCegarLoop]: trace histogram [64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:16:31,049 INFO L424 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:16:31,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:16:31,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1005027609, now seen corresponding path program 64 times [2018-10-15 13:16:31,050 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:16:31,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:16:33,454 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:16:33,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:16:33,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-15 13:16:33,455 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-15 13:16:33,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-15 13:16:33,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 13:16:33,456 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 67 states. [2018-10-15 13:16:39,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:16:39,540 INFO L93 Difference]: Finished difference Result 142 states and 142 transitions. [2018-10-15 13:16:39,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-15 13:16:39,541 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 138 [2018-10-15 13:16:39,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:16:39,542 INFO L225 Difference]: With dead ends: 142 [2018-10-15 13:16:39,542 INFO L226 Difference]: Without dead ends: 142 [2018-10-15 13:16:39,543 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 13:16:39,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-10-15 13:16:39,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2018-10-15 13:16:39,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-10-15 13:16:39,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-10-15 13:16:39,545 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 138 [2018-10-15 13:16:39,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:16:39,545 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-10-15 13:16:39,545 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-15 13:16:39,545 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-10-15 13:16:39,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-10-15 13:16:39,546 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:16:39,546 INFO L375 BasicCegarLoop]: trace histogram [65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:16:39,546 INFO L424 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:16:39,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:16:39,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1128622757, now seen corresponding path program 65 times [2018-10-15 13:16:39,547 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:16:39,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:16:41,772 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 0 proven. 4225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:16:41,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:16:41,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-10-15 13:16:41,773 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-15 13:16:41,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-15 13:16:41,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2018-10-15 13:16:41,773 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 68 states. [2018-10-15 13:16:48,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:16:48,259 INFO L93 Difference]: Finished difference Result 144 states and 144 transitions. [2018-10-15 13:16:48,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-15 13:16:48,260 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 140 [2018-10-15 13:16:48,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:16:48,261 INFO L225 Difference]: With dead ends: 144 [2018-10-15 13:16:48,261 INFO L226 Difference]: Without dead ends: 144 [2018-10-15 13:16:48,261 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2018-10-15 13:16:48,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-10-15 13:16:48,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 143. [2018-10-15 13:16:48,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-10-15 13:16:48,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-10-15 13:16:48,264 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 140 [2018-10-15 13:16:48,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:16:48,264 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-10-15 13:16:48,264 INFO L482 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-15 13:16:48,264 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-10-15 13:16:48,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-15 13:16:48,265 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:16:48,265 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:16:48,265 INFO L424 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:16:48,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:16:48,265 INFO L82 PathProgramCache]: Analyzing trace with hash -1427743005, now seen corresponding path program 66 times [2018-10-15 13:16:48,266 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:16:48,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:16:50,488 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:16:50,488 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:16:50,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-15 13:16:50,489 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-15 13:16:50,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-15 13:16:50,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-10-15 13:16:50,490 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 69 states. [2018-10-15 13:16:57,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:16:57,041 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2018-10-15 13:16:57,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-15 13:16:57,042 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 142 [2018-10-15 13:16:57,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:16:57,043 INFO L225 Difference]: With dead ends: 146 [2018-10-15 13:16:57,043 INFO L226 Difference]: Without dead ends: 146 [2018-10-15 13:16:57,044 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-10-15 13:16:57,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-10-15 13:16:57,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2018-10-15 13:16:57,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-10-15 13:16:57,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-10-15 13:16:57,047 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 142 [2018-10-15 13:16:57,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:16:57,047 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-10-15 13:16:57,047 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-15 13:16:57,047 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-10-15 13:16:57,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-15 13:16:57,047 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:16:57,048 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:16:57,048 INFO L424 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:16:57,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:16:57,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1373946975, now seen corresponding path program 67 times [2018-10-15 13:16:57,049 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:16:57,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:16:59,661 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 0 proven. 4489 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:16:59,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:16:59,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-10-15 13:16:59,661 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-10-15 13:16:59,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-10-15 13:16:59,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2018-10-15 13:16:59,662 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 70 states. [2018-10-15 13:17:06,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:17:06,311 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2018-10-15 13:17:06,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-15 13:17:06,311 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 144 [2018-10-15 13:17:06,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:17:06,312 INFO L225 Difference]: With dead ends: 148 [2018-10-15 13:17:06,312 INFO L226 Difference]: Without dead ends: 148 [2018-10-15 13:17:06,313 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2018-10-15 13:17:06,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-10-15 13:17:06,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2018-10-15 13:17:06,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-10-15 13:17:06,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-10-15 13:17:06,316 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 144 [2018-10-15 13:17:06,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:17:06,316 INFO L481 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-10-15 13:17:06,316 INFO L482 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-10-15 13:17:06,316 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-10-15 13:17:06,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-10-15 13:17:06,317 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:17:06,317 INFO L375 BasicCegarLoop]: trace histogram [68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:17:06,317 INFO L424 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:17:06,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:17:06,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1215569697, now seen corresponding path program 68 times [2018-10-15 13:17:06,318 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:17:06,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:17:08,957 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 0 proven. 4624 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:17:08,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:17:08,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-15 13:17:08,958 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-15 13:17:08,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-15 13:17:08,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 13:17:08,958 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 71 states. [2018-10-15 13:17:15,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:17:15,768 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2018-10-15 13:17:15,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-15 13:17:15,768 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 146 [2018-10-15 13:17:15,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:17:15,769 INFO L225 Difference]: With dead ends: 150 [2018-10-15 13:17:15,770 INFO L226 Difference]: Without dead ends: 150 [2018-10-15 13:17:15,770 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 13:17:15,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-10-15 13:17:15,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2018-10-15 13:17:15,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-10-15 13:17:15,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-10-15 13:17:15,774 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 146 [2018-10-15 13:17:15,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:17:15,774 INFO L481 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2018-10-15 13:17:15,774 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-15 13:17:15,774 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-10-15 13:17:15,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-15 13:17:15,775 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:17:15,775 INFO L375 BasicCegarLoop]: trace histogram [69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:17:15,776 INFO L424 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:17:15,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:17:15,776 INFO L82 PathProgramCache]: Analyzing trace with hash 661139101, now seen corresponding path program 69 times [2018-10-15 13:17:15,776 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:17:15,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:17:18,470 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 0 proven. 4761 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:17:18,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:17:18,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-10-15 13:17:18,471 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-15 13:17:18,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-15 13:17:18,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2018-10-15 13:17:18,472 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 72 states. [2018-10-15 13:17:25,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:17:25,432 INFO L93 Difference]: Finished difference Result 152 states and 152 transitions. [2018-10-15 13:17:25,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-15 13:17:25,433 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 148 [2018-10-15 13:17:25,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:17:25,434 INFO L225 Difference]: With dead ends: 152 [2018-10-15 13:17:25,434 INFO L226 Difference]: Without dead ends: 152 [2018-10-15 13:17:25,434 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2018-10-15 13:17:25,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-10-15 13:17:25,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2018-10-15 13:17:25,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-10-15 13:17:25,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-10-15 13:17:25,437 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 148 [2018-10-15 13:17:25,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:17:25,437 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-10-15 13:17:25,438 INFO L482 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-15 13:17:25,438 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-10-15 13:17:25,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-15 13:17:25,438 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:17:25,439 INFO L375 BasicCegarLoop]: trace histogram [70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:17:25,439 INFO L424 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:17:25,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:17:25,439 INFO L82 PathProgramCache]: Analyzing trace with hash 292029659, now seen corresponding path program 70 times [2018-10-15 13:17:25,440 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:17:25,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:17:27,996 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 4900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:17:27,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:17:27,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-15 13:17:27,997 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-15 13:17:27,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-15 13:17:27,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-10-15 13:17:27,997 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 73 states. [2018-10-15 13:17:35,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:17:35,256 INFO L93 Difference]: Finished difference Result 154 states and 154 transitions. [2018-10-15 13:17:35,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-15 13:17:35,256 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 150 [2018-10-15 13:17:35,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:17:35,257 INFO L225 Difference]: With dead ends: 154 [2018-10-15 13:17:35,257 INFO L226 Difference]: Without dead ends: 154 [2018-10-15 13:17:35,257 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-10-15 13:17:35,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-10-15 13:17:35,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2018-10-15 13:17:35,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-10-15 13:17:35,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-10-15 13:17:35,260 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 150 [2018-10-15 13:17:35,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:17:35,261 INFO L481 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-10-15 13:17:35,261 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-15 13:17:35,261 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-10-15 13:17:35,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-10-15 13:17:35,261 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:17:35,262 INFO L375 BasicCegarLoop]: trace histogram [71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:17:35,262 INFO L424 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:17:35,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:17:35,262 INFO L82 PathProgramCache]: Analyzing trace with hash 2060141465, now seen corresponding path program 71 times [2018-10-15 13:17:35,263 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:17:35,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:17:37,927 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 0 proven. 5041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:17:37,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:17:37,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-10-15 13:17:37,928 INFO L460 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-10-15 13:17:37,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-10-15 13:17:37,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2018-10-15 13:17:37,929 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 74 states. [2018-10-15 13:17:45,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:17:45,362 INFO L93 Difference]: Finished difference Result 156 states and 156 transitions. [2018-10-15 13:17:45,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-15 13:17:45,363 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 152 [2018-10-15 13:17:45,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:17:45,364 INFO L225 Difference]: With dead ends: 156 [2018-10-15 13:17:45,364 INFO L226 Difference]: Without dead ends: 156 [2018-10-15 13:17:45,365 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2018-10-15 13:17:45,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-10-15 13:17:45,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 155. [2018-10-15 13:17:45,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-10-15 13:17:45,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2018-10-15 13:17:45,368 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 152 [2018-10-15 13:17:45,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:17:45,368 INFO L481 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2018-10-15 13:17:45,368 INFO L482 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-10-15 13:17:45,368 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2018-10-15 13:17:45,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-15 13:17:45,369 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:17:45,369 INFO L375 BasicCegarLoop]: trace histogram [72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:17:45,369 INFO L424 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:17:45,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:17:45,370 INFO L82 PathProgramCache]: Analyzing trace with hash 408537815, now seen corresponding path program 72 times [2018-10-15 13:17:45,370 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:17:45,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:17:48,017 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 0 proven. 5184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:17:48,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:17:48,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-15 13:17:48,017 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-15 13:17:48,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-15 13:17:48,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 13:17:48,018 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 75 states. [2018-10-15 13:17:55,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:17:55,691 INFO L93 Difference]: Finished difference Result 158 states and 158 transitions. [2018-10-15 13:17:55,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-15 13:17:55,691 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 154 [2018-10-15 13:17:55,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:17:55,692 INFO L225 Difference]: With dead ends: 158 [2018-10-15 13:17:55,693 INFO L226 Difference]: Without dead ends: 158 [2018-10-15 13:17:55,693 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 13:17:55,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-10-15 13:17:55,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2018-10-15 13:17:55,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-10-15 13:17:55,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-10-15 13:17:55,696 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 154 [2018-10-15 13:17:55,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:17:55,696 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-10-15 13:17:55,696 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-15 13:17:55,696 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-10-15 13:17:55,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-10-15 13:17:55,697 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:17:55,697 INFO L375 BasicCegarLoop]: trace histogram [73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:17:55,697 INFO L424 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:17:55,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:17:55,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1939637611, now seen corresponding path program 73 times [2018-10-15 13:17:55,698 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:17:55,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:17:58,400 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 0 proven. 5329 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:17:58,400 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:17:58,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-10-15 13:17:58,400 INFO L460 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-10-15 13:17:58,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-10-15 13:17:58,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2018-10-15 13:17:58,401 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 76 states. [2018-10-15 13:18:06,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:18:06,296 INFO L93 Difference]: Finished difference Result 160 states and 160 transitions. [2018-10-15 13:18:06,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-15 13:18:06,296 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 156 [2018-10-15 13:18:06,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:18:06,297 INFO L225 Difference]: With dead ends: 160 [2018-10-15 13:18:06,297 INFO L226 Difference]: Without dead ends: 160 [2018-10-15 13:18:06,298 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2018-10-15 13:18:06,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-10-15 13:18:06,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 159. [2018-10-15 13:18:06,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-10-15 13:18:06,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2018-10-15 13:18:06,301 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 156 [2018-10-15 13:18:06,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:18:06,301 INFO L481 AbstractCegarLoop]: Abstraction has 159 states and 159 transitions. [2018-10-15 13:18:06,301 INFO L482 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-10-15 13:18:06,301 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 159 transitions. [2018-10-15 13:18:06,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-10-15 13:18:06,301 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:18:06,302 INFO L375 BasicCegarLoop]: trace histogram [74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:18:06,302 INFO L424 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:18:06,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:18:06,302 INFO L82 PathProgramCache]: Analyzing trace with hash 616575699, now seen corresponding path program 74 times [2018-10-15 13:18:06,302 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:18:06,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:18:09,121 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 0 proven. 5476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:18:09,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:18:09,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-10-15 13:18:09,122 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-15 13:18:09,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-15 13:18:09,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-10-15 13:18:09,122 INFO L87 Difference]: Start difference. First operand 159 states and 159 transitions. Second operand 77 states. [2018-10-15 13:18:17,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:18:17,173 INFO L93 Difference]: Finished difference Result 162 states and 162 transitions. [2018-10-15 13:18:17,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-15 13:18:17,173 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 158 [2018-10-15 13:18:17,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:18:17,174 INFO L225 Difference]: With dead ends: 162 [2018-10-15 13:18:17,174 INFO L226 Difference]: Without dead ends: 162 [2018-10-15 13:18:17,175 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-10-15 13:18:17,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-10-15 13:18:17,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2018-10-15 13:18:17,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-10-15 13:18:17,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-10-15 13:18:17,177 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 158 [2018-10-15 13:18:17,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:18:17,177 INFO L481 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-10-15 13:18:17,177 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-15 13:18:17,178 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-10-15 13:18:17,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-15 13:18:17,178 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:18:17,178 INFO L375 BasicCegarLoop]: trace histogram [75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:18:17,179 INFO L424 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:18:17,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:18:17,179 INFO L82 PathProgramCache]: Analyzing trace with hash 416273297, now seen corresponding path program 75 times [2018-10-15 13:18:17,180 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:18:17,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:18:20,168 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 0 proven. 5625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:18:20,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:18:20,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-10-15 13:18:20,169 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-15 13:18:20,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-15 13:18:20,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2018-10-15 13:18:20,170 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 78 states. [2018-10-15 13:18:28,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:18:28,407 INFO L93 Difference]: Finished difference Result 164 states and 164 transitions. [2018-10-15 13:18:28,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-15 13:18:28,407 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 160 [2018-10-15 13:18:28,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:18:28,408 INFO L225 Difference]: With dead ends: 164 [2018-10-15 13:18:28,408 INFO L226 Difference]: Without dead ends: 164 [2018-10-15 13:18:28,408 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2018-10-15 13:18:28,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-10-15 13:18:28,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 163. [2018-10-15 13:18:28,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-10-15 13:18:28,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2018-10-15 13:18:28,411 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 160 [2018-10-15 13:18:28,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:18:28,411 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2018-10-15 13:18:28,411 INFO L482 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-15 13:18:28,411 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2018-10-15 13:18:28,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-10-15 13:18:28,412 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:18:28,412 INFO L375 BasicCegarLoop]: trace histogram [76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:18:28,412 INFO L424 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:18:28,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:18:28,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1199193295, now seen corresponding path program 76 times [2018-10-15 13:18:28,413 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:18:28,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:18:31,624 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 0 proven. 5776 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:18:31,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:18:31,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-10-15 13:18:31,624 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-15 13:18:31,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-15 13:18:31,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 13:18:31,625 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 79 states. [2018-10-15 13:18:40,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:18:40,134 INFO L93 Difference]: Finished difference Result 166 states and 166 transitions. [2018-10-15 13:18:40,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-15 13:18:40,134 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 162 [2018-10-15 13:18:40,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:18:40,135 INFO L225 Difference]: With dead ends: 166 [2018-10-15 13:18:40,135 INFO L226 Difference]: Without dead ends: 166 [2018-10-15 13:18:40,136 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 13:18:40,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-10-15 13:18:40,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2018-10-15 13:18:40,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-10-15 13:18:40,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-10-15 13:18:40,138 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 162 [2018-10-15 13:18:40,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:18:40,138 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-10-15 13:18:40,138 INFO L482 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-15 13:18:40,139 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-10-15 13:18:40,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-10-15 13:18:40,139 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:18:40,139 INFO L375 BasicCegarLoop]: trace histogram [77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:18:40,140 INFO L424 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:18:40,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:18:40,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1966034573, now seen corresponding path program 77 times [2018-10-15 13:18:40,140 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:18:40,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:18:43,141 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 0 proven. 5929 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:18:43,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:18:43,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-10-15 13:18:43,142 INFO L460 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-10-15 13:18:43,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-10-15 13:18:43,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2018-10-15 13:18:43,142 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 80 states. [2018-10-15 13:18:51,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:18:51,808 INFO L93 Difference]: Finished difference Result 168 states and 168 transitions. [2018-10-15 13:18:51,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-15 13:18:51,808 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 164 [2018-10-15 13:18:51,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:18:51,809 INFO L225 Difference]: With dead ends: 168 [2018-10-15 13:18:51,810 INFO L226 Difference]: Without dead ends: 168 [2018-10-15 13:18:51,810 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2018-10-15 13:18:51,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-10-15 13:18:51,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 167. [2018-10-15 13:18:51,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-10-15 13:18:51,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2018-10-15 13:18:51,813 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 164 [2018-10-15 13:18:51,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:18:51,813 INFO L481 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2018-10-15 13:18:51,813 INFO L482 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-10-15 13:18:51,814 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2018-10-15 13:18:51,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-10-15 13:18:51,814 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:18:51,814 INFO L375 BasicCegarLoop]: trace histogram [78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:18:51,814 INFO L424 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:18:51,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:18:51,815 INFO L82 PathProgramCache]: Analyzing trace with hash 166127819, now seen corresponding path program 78 times [2018-10-15 13:18:51,815 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:18:51,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:18:54,827 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 0 proven. 6084 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:18:54,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:18:54,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-15 13:18:54,827 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-15 13:18:54,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-15 13:18:54,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-10-15 13:18:54,828 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 81 states. [2018-10-15 13:19:03,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:19:03,787 INFO L93 Difference]: Finished difference Result 170 states and 170 transitions. [2018-10-15 13:19:03,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-15 13:19:03,788 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 166 [2018-10-15 13:19:03,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:19:03,789 INFO L225 Difference]: With dead ends: 170 [2018-10-15 13:19:03,789 INFO L226 Difference]: Without dead ends: 170 [2018-10-15 13:19:03,790 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-10-15 13:19:03,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-10-15 13:19:03,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2018-10-15 13:19:03,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-10-15 13:19:03,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2018-10-15 13:19:03,792 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 166 [2018-10-15 13:19:03,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:19:03,793 INFO L481 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2018-10-15 13:19:03,793 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-15 13:19:03,793 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2018-10-15 13:19:03,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-10-15 13:19:03,794 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:19:03,794 INFO L375 BasicCegarLoop]: trace histogram [79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:19:03,794 INFO L424 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:19:03,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:19:03,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1327557513, now seen corresponding path program 79 times [2018-10-15 13:19:03,795 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:19:03,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:19:07,644 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 0 proven. 6241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:19:07,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:19:07,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-10-15 13:19:07,645 INFO L460 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-10-15 13:19:07,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-10-15 13:19:07,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2018-10-15 13:19:07,645 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 82 states. [2018-10-15 13:19:16,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:19:16,908 INFO L93 Difference]: Finished difference Result 172 states and 172 transitions. [2018-10-15 13:19:16,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-15 13:19:16,909 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 168 [2018-10-15 13:19:16,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:19:16,910 INFO L225 Difference]: With dead ends: 172 [2018-10-15 13:19:16,910 INFO L226 Difference]: Without dead ends: 172 [2018-10-15 13:19:16,910 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2018-10-15 13:19:16,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-10-15 13:19:16,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 171. [2018-10-15 13:19:16,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-10-15 13:19:16,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-10-15 13:19:16,912 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 168 [2018-10-15 13:19:16,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:19:16,913 INFO L481 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-10-15 13:19:16,913 INFO L482 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-10-15 13:19:16,913 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-10-15 13:19:16,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-15 13:19:16,913 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:19:16,913 INFO L375 BasicCegarLoop]: trace histogram [80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:19:16,914 INFO L424 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:19:16,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:19:16,914 INFO L82 PathProgramCache]: Analyzing trace with hash 769996487, now seen corresponding path program 80 times [2018-10-15 13:19:16,914 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:19:16,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:19:20,190 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 0 proven. 6400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:19:20,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:19:20,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-15 13:19:20,191 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-15 13:19:20,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-15 13:19:20,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 13:19:20,192 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 83 states. [2018-10-15 13:19:29,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:19:29,583 INFO L93 Difference]: Finished difference Result 174 states and 174 transitions. [2018-10-15 13:19:29,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-10-15 13:19:29,587 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 170 [2018-10-15 13:19:29,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:19:29,588 INFO L225 Difference]: With dead ends: 174 [2018-10-15 13:19:29,588 INFO L226 Difference]: Without dead ends: 174 [2018-10-15 13:19:29,588 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 13:19:29,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-10-15 13:19:29,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2018-10-15 13:19:29,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-10-15 13:19:29,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-10-15 13:19:29,590 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 170 [2018-10-15 13:19:29,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:19:29,590 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-10-15 13:19:29,590 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-15 13:19:29,590 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-10-15 13:19:29,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-15 13:19:29,591 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:19:29,591 INFO L375 BasicCegarLoop]: trace histogram [81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:19:29,591 INFO L424 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:19:29,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:19:29,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1824762501, now seen corresponding path program 81 times [2018-10-15 13:19:29,592 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:19:29,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:19:33,030 INFO L134 CoverageAnalysis]: Checked inductivity of 6561 backedges. 0 proven. 6561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:19:33,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:19:33,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-10-15 13:19:33,031 INFO L460 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-10-15 13:19:33,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-10-15 13:19:33,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2018-10-15 13:19:33,032 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 84 states. [2018-10-15 13:19:42,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:19:42,616 INFO L93 Difference]: Finished difference Result 176 states and 176 transitions. [2018-10-15 13:19:42,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-15 13:19:42,617 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 172 [2018-10-15 13:19:42,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:19:42,618 INFO L225 Difference]: With dead ends: 176 [2018-10-15 13:19:42,618 INFO L226 Difference]: Without dead ends: 176 [2018-10-15 13:19:42,619 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2018-10-15 13:19:42,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-10-15 13:19:42,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 175. [2018-10-15 13:19:42,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-10-15 13:19:42,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2018-10-15 13:19:42,622 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 172 [2018-10-15 13:19:42,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:19:42,622 INFO L481 AbstractCegarLoop]: Abstraction has 175 states and 175 transitions. [2018-10-15 13:19:42,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-10-15 13:19:42,622 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 175 transitions. [2018-10-15 13:19:42,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-10-15 13:19:42,623 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:19:42,623 INFO L375 BasicCegarLoop]: trace histogram [82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:19:42,624 INFO L424 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:19:42,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:19:42,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1842620099, now seen corresponding path program 82 times [2018-10-15 13:19:42,624 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:19:42,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:19:45,886 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 0 proven. 6724 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:19:45,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:19:45,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-10-15 13:19:45,887 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-15 13:19:45,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-15 13:19:45,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2018-10-15 13:19:45,888 INFO L87 Difference]: Start difference. First operand 175 states and 175 transitions. Second operand 85 states. [2018-10-15 13:19:55,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:19:55,667 INFO L93 Difference]: Finished difference Result 178 states and 178 transitions. [2018-10-15 13:19:55,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-15 13:19:55,667 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 174 [2018-10-15 13:19:55,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:19:55,668 INFO L225 Difference]: With dead ends: 178 [2018-10-15 13:19:55,669 INFO L226 Difference]: Without dead ends: 178 [2018-10-15 13:19:55,669 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2018-10-15 13:19:55,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-10-15 13:19:55,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2018-10-15 13:19:55,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-10-15 13:19:55,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-10-15 13:19:55,672 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 174 [2018-10-15 13:19:55,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:19:55,672 INFO L481 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-10-15 13:19:55,672 INFO L482 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-15 13:19:55,672 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-10-15 13:19:55,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-10-15 13:19:55,673 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:19:55,673 INFO L375 BasicCegarLoop]: trace histogram [83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:19:55,673 INFO L424 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:19:55,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:19:55,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1823902593, now seen corresponding path program 83 times [2018-10-15 13:19:55,674 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:19:55,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:19:59,600 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 0 proven. 6889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:19:59,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:19:59,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-10-15 13:19:59,601 INFO L460 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-10-15 13:19:59,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-10-15 13:19:59,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2018-10-15 13:19:59,601 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 86 states. [2018-10-15 13:20:09,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:20:09,595 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2018-10-15 13:20:09,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-10-15 13:20:09,595 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 176 [2018-10-15 13:20:09,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:20:09,597 INFO L225 Difference]: With dead ends: 180 [2018-10-15 13:20:09,597 INFO L226 Difference]: Without dead ends: 180 [2018-10-15 13:20:09,597 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2018-10-15 13:20:09,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-10-15 13:20:09,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 179. [2018-10-15 13:20:09,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-10-15 13:20:09,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2018-10-15 13:20:09,600 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 179 transitions. Word has length 176 [2018-10-15 13:20:09,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:20:09,600 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 179 transitions. [2018-10-15 13:20:09,600 INFO L482 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-10-15 13:20:09,600 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 179 transitions. [2018-10-15 13:20:09,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-15 13:20:09,601 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:20:09,601 INFO L375 BasicCegarLoop]: trace histogram [84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:20:09,601 INFO L424 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:20:09,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:20:09,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1016248511, now seen corresponding path program 84 times [2018-10-15 13:20:09,602 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:20:09,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:20:13,284 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 0 proven. 7056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:20:13,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:20:13,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-15 13:20:13,285 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-15 13:20:13,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-15 13:20:13,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 13:20:13,285 INFO L87 Difference]: Start difference. First operand 179 states and 179 transitions. Second operand 87 states. [2018-10-15 13:20:23,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:20:23,609 INFO L93 Difference]: Finished difference Result 182 states and 182 transitions. [2018-10-15 13:20:23,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-15 13:20:23,609 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 178 [2018-10-15 13:20:23,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:20:23,611 INFO L225 Difference]: With dead ends: 182 [2018-10-15 13:20:23,611 INFO L226 Difference]: Without dead ends: 182 [2018-10-15 13:20:23,611 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 13:20:23,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-10-15 13:20:23,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2018-10-15 13:20:23,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-10-15 13:20:23,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-10-15 13:20:23,614 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 178 [2018-10-15 13:20:23,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:20:23,615 INFO L481 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-10-15 13:20:23,615 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-15 13:20:23,615 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-10-15 13:20:23,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-15 13:20:23,616 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:20:23,616 INFO L375 BasicCegarLoop]: trace histogram [85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:20:23,616 INFO L424 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:20:23,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:20:23,616 INFO L82 PathProgramCache]: Analyzing trace with hash -2045211011, now seen corresponding path program 85 times [2018-10-15 13:20:23,617 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:20:23,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:20:27,491 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 0 proven. 7225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:20:27,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:20:27,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-10-15 13:20:27,492 INFO L460 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-10-15 13:20:27,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-10-15 13:20:27,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2018-10-15 13:20:27,493 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 88 states. [2018-10-15 13:20:37,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:20:37,911 INFO L93 Difference]: Finished difference Result 184 states and 184 transitions. [2018-10-15 13:20:37,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-10-15 13:20:37,912 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 180 [2018-10-15 13:20:37,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:20:37,913 INFO L225 Difference]: With dead ends: 184 [2018-10-15 13:20:37,913 INFO L226 Difference]: Without dead ends: 184 [2018-10-15 13:20:37,914 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2018-10-15 13:20:37,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-10-15 13:20:37,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 183. [2018-10-15 13:20:37,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-10-15 13:20:37,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2018-10-15 13:20:37,917 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 180 [2018-10-15 13:20:37,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:20:37,917 INFO L481 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2018-10-15 13:20:37,917 INFO L482 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-10-15 13:20:37,917 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2018-10-15 13:20:37,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-15 13:20:37,918 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:20:37,918 INFO L375 BasicCegarLoop]: trace histogram [86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:20:37,918 INFO L424 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:20:37,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:20:37,918 INFO L82 PathProgramCache]: Analyzing trace with hash -2055213893, now seen corresponding path program 86 times [2018-10-15 13:20:37,919 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:20:37,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:20:41,543 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 0 proven. 7396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:20:41,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:20:41,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-10-15 13:20:41,544 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-15 13:20:41,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-15 13:20:41,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2018-10-15 13:20:41,545 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 89 states. [2018-10-15 13:20:52,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:20:52,073 INFO L93 Difference]: Finished difference Result 186 states and 186 transitions. [2018-10-15 13:20:52,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-10-15 13:20:52,073 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 182 [2018-10-15 13:20:52,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:20:52,074 INFO L225 Difference]: With dead ends: 186 [2018-10-15 13:20:52,074 INFO L226 Difference]: Without dead ends: 186 [2018-10-15 13:20:52,075 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2018-10-15 13:20:52,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-10-15 13:20:52,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2018-10-15 13:20:52,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-10-15 13:20:52,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2018-10-15 13:20:52,077 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 182 [2018-10-15 13:20:52,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:20:52,077 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2018-10-15 13:20:52,078 INFO L482 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-15 13:20:52,078 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2018-10-15 13:20:52,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-15 13:20:52,078 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:20:52,079 INFO L375 BasicCegarLoop]: trace histogram [87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:20:52,079 INFO L424 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:20:52,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:20:52,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1216918393, now seen corresponding path program 87 times [2018-10-15 13:20:52,080 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:20:52,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:20:55,848 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 0 proven. 7569 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:20:55,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:20:55,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-10-15 13:20:55,848 INFO L460 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-10-15 13:20:55,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-10-15 13:20:55,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=7833, Unknown=0, NotChecked=0, Total=8010 [2018-10-15 13:20:55,849 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 90 states. [2018-10-15 13:21:06,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:21:06,456 INFO L93 Difference]: Finished difference Result 188 states and 188 transitions. [2018-10-15 13:21:06,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-15 13:21:06,456 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 184 [2018-10-15 13:21:06,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:21:06,458 INFO L225 Difference]: With dead ends: 188 [2018-10-15 13:21:06,458 INFO L226 Difference]: Without dead ends: 188 [2018-10-15 13:21:06,458 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=177, Invalid=7833, Unknown=0, NotChecked=0, Total=8010 [2018-10-15 13:21:06,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-10-15 13:21:06,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 187. [2018-10-15 13:21:06,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-10-15 13:21:06,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2018-10-15 13:21:06,461 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 184 [2018-10-15 13:21:06,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:21:06,461 INFO L481 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2018-10-15 13:21:06,461 INFO L482 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-10-15 13:21:06,461 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2018-10-15 13:21:06,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-10-15 13:21:06,462 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:21:06,463 INFO L375 BasicCegarLoop]: trace histogram [88, 88, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:21:06,463 INFO L424 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:21:06,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:21:06,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1819984567, now seen corresponding path program 88 times [2018-10-15 13:21:06,464 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:21:06,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:21:10,180 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 0 proven. 7744 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:21:10,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:21:10,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-10-15 13:21:10,181 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-15 13:21:10,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-15 13:21:10,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=8011, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 13:21:10,182 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 91 states. [2018-10-15 13:21:20,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:21:20,971 INFO L93 Difference]: Finished difference Result 190 states and 190 transitions. [2018-10-15 13:21:20,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-10-15 13:21:20,972 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 186 [2018-10-15 13:21:20,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:21:20,973 INFO L225 Difference]: With dead ends: 190 [2018-10-15 13:21:20,973 INFO L226 Difference]: Without dead ends: 190 [2018-10-15 13:21:20,974 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=179, Invalid=8011, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 13:21:20,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-10-15 13:21:20,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2018-10-15 13:21:20,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-10-15 13:21:20,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2018-10-15 13:21:20,977 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 186 [2018-10-15 13:21:20,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:21:20,977 INFO L481 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2018-10-15 13:21:20,977 INFO L482 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-15 13:21:20,977 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2018-10-15 13:21:20,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-10-15 13:21:20,978 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:21:20,978 INFO L375 BasicCegarLoop]: trace histogram [89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:21:20,978 INFO L424 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:21:20,979 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:21:20,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1545992821, now seen corresponding path program 89 times [2018-10-15 13:21:20,979 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:21:20,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:21:25,029 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 0 proven. 7921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:21:25,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:21:25,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-10-15 13:21:25,029 INFO L460 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-10-15 13:21:25,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-10-15 13:21:25,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=8191, Unknown=0, NotChecked=0, Total=8372 [2018-10-15 13:21:25,030 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 92 states. [2018-10-15 13:21:36,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:21:36,048 INFO L93 Difference]: Finished difference Result 192 states and 192 transitions. [2018-10-15 13:21:36,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-10-15 13:21:36,049 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 188 [2018-10-15 13:21:36,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:21:36,050 INFO L225 Difference]: With dead ends: 192 [2018-10-15 13:21:36,050 INFO L226 Difference]: Without dead ends: 192 [2018-10-15 13:21:36,051 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=181, Invalid=8191, Unknown=0, NotChecked=0, Total=8372 [2018-10-15 13:21:36,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-10-15 13:21:36,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 191. [2018-10-15 13:21:36,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-10-15 13:21:36,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2018-10-15 13:21:36,054 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 188 [2018-10-15 13:21:36,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:21:36,054 INFO L481 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2018-10-15 13:21:36,054 INFO L482 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-10-15 13:21:36,054 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2018-10-15 13:21:36,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-15 13:21:36,055 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:21:36,055 INFO L375 BasicCegarLoop]: trace histogram [90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:21:36,055 INFO L424 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:21:36,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:21:36,056 INFO L82 PathProgramCache]: Analyzing trace with hash 232929971, now seen corresponding path program 90 times [2018-10-15 13:21:36,056 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:21:36,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat