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 -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/MonadicInvariant01.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ff8eab6 [2018-09-26 08:24:34,701 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 08:24:34,703 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 08:24:34,716 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 08:24:34,716 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 08:24:34,717 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 08:24:34,719 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 08:24:34,720 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 08:24:34,722 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 08:24:34,723 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 08:24:34,724 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 08:24:34,724 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 08:24:34,725 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 08:24:34,726 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 08:24:34,727 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 08:24:34,728 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 08:24:34,729 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 08:24:34,731 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 08:24:34,733 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 08:24:34,734 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 08:24:34,735 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 08:24:34,736 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 08:24:34,739 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 08:24:34,739 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 08:24:34,740 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 08:24:34,741 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 08:24:34,742 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 08:24:34,743 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 08:24:34,743 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 08:24:34,745 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 08:24:34,745 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 08:24:34,746 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 08:24:34,746 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 08:24:34,746 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 08:24:34,747 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 08:24:34,748 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 08:24:34,748 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-09-26 08:24:34,756 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 08:24:34,756 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 08:24:34,758 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 08:24:34,758 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-09-26 08:24:34,758 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 08:24:34,758 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-09-26 08:24:34,759 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-09-26 08:24:34,759 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 08:24:34,811 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 08:24:34,831 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 08:24:34,835 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 08:24:34,837 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 08:24:34,837 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 08:24:34,838 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/MonadicInvariant01.bpl [2018-09-26 08:24:34,838 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/MonadicInvariant01.bpl' [2018-09-26 08:24:34,895 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 08:24:34,899 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 08:24:34,900 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 08:24:34,900 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 08:24:34,900 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 08:24:34,924 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "MonadicInvariant01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:24:34" (1/1) ... [2018-09-26 08:24:34,937 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "MonadicInvariant01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:24:34" (1/1) ... [2018-09-26 08:24:34,943 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-26 08:24:34,943 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-26 08:24:34,944 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-26 08:24:34,946 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 08:24:34,947 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 08:24:34,948 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 08:24:34,948 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 08:24:34,959 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "MonadicInvariant01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:24:34" (1/1) ... [2018-09-26 08:24:34,960 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "MonadicInvariant01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:24:34" (1/1) ... [2018-09-26 08:24:34,960 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "MonadicInvariant01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:24:34" (1/1) ... [2018-09-26 08:24:34,961 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "MonadicInvariant01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:24:34" (1/1) ... [2018-09-26 08:24:34,964 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "MonadicInvariant01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:24:34" (1/1) ... [2018-09-26 08:24:34,971 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "MonadicInvariant01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:24:34" (1/1) ... [2018-09-26 08:24:34,972 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "MonadicInvariant01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:24:34" (1/1) ... [2018-09-26 08:24:34,973 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 08:24:34,973 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 08:24:34,974 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 08:24:34,974 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 08:24:34,975 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "MonadicInvariant01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:24:34" (1/1) ... [2018-09-26 08:24:35,069 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-09-26 08:24:35,070 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-26 08:24:35,070 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-26 08:24:35,208 INFO L343 CfgBuilder]: Using library mode [2018-09-26 08:24:35,209 INFO L202 PluginConnector]: Adding new model MonadicInvariant01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:24:35 BoogieIcfgContainer [2018-09-26 08:24:35,209 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 08:24:35,210 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 08:24:35,210 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 08:24:35,214 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 08:24:35,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "MonadicInvariant01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:24:34" (1/2) ... [2018-09-26 08:24:35,215 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3893b400 and model type MonadicInvariant01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 08:24:35, skipping insertion in model container [2018-09-26 08:24:35,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "MonadicInvariant01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:24:35" (2/2) ... [2018-09-26 08:24:35,218 INFO L112 eAbstractionObserver]: Analyzing ICFG MonadicInvariant01.bpl [2018-09-26 08:24:35,228 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-09-26 08:24:35,239 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 08:24:35,291 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 08:24:35,292 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 08:24:35,293 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 08:24:35,293 INFO L383 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-09-26 08:24:35,293 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 08:24:35,293 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 08:24:35,293 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 08:24:35,294 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 08:24:35,294 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 08:24:35,311 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2018-09-26 08:24:35,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-09-26 08:24:35,322 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:35,323 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-09-26 08:24:35,324 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:35,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:35,334 INFO L82 PathProgramCache]: Analyzing trace with hash 29920, now seen corresponding path program 1 times [2018-09-26 08:24:35,340 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:35,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:35,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:35,406 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:24:35,406 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-09-26 08:24:35,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:24:35,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:24:35,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:24:35,428 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2018-09-26 08:24:35,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:35,457 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-09-26 08:24:35,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:24:35,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-09-26 08:24:35,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:35,473 INFO L225 Difference]: With dead ends: 9 [2018-09-26 08:24:35,474 INFO L226 Difference]: Without dead ends: 6 [2018-09-26 08:24:35,481 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:24:35,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-09-26 08:24:35,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-09-26 08:24:35,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-09-26 08:24:35,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-09-26 08:24:35,522 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 3 [2018-09-26 08:24:35,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:35,523 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-09-26 08:24:35,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:24:35,523 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-09-26 08:24:35,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-26 08:24:35,524 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:35,524 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-09-26 08:24:35,525 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:35,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:35,526 INFO L82 PathProgramCache]: Analyzing trace with hash 28754210, now seen corresponding path program 1 times [2018-09-26 08:24:35,527 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:35,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:35,562 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:35,562 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:35,562 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [2] total 2 [2018-09-26 08:24:35,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 08:24:35,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 08:24:35,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:24:35,566 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 4 states. [2018-09-26 08:24:35,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:35,605 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-09-26 08:24:35,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 08:24:35,606 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2018-09-26 08:24:35,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:35,613 INFO L225 Difference]: With dead ends: 9 [2018-09-26 08:24:35,613 INFO L226 Difference]: Without dead ends: 8 [2018-09-26 08:24:35,614 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:24:35,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-09-26 08:24:35,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-09-26 08:24:35,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-09-26 08:24:35,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-09-26 08:24:35,621 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 5 [2018-09-26 08:24:35,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:35,621 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-09-26 08:24:35,621 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 08:24:35,622 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-09-26 08:24:35,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 08:24:35,622 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:35,622 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1] [2018-09-26 08:24:35,622 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:35,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:35,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1862993124, now seen corresponding path program 2 times [2018-09-26 08:24:35,623 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:35,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:35,657 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:35,657 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:35,658 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-09-26 08:24:35,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 08:24:35,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 08:24:35,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:24:35,659 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 5 states. [2018-09-26 08:24:35,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:35,679 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-09-26 08:24:35,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 08:24:35,679 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2018-09-26 08:24:35,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:35,680 INFO L225 Difference]: With dead ends: 11 [2018-09-26 08:24:35,680 INFO L226 Difference]: Without dead ends: 10 [2018-09-26 08:24:35,681 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:24:35,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-09-26 08:24:35,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-09-26 08:24:35,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-09-26 08:24:35,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-09-26 08:24:35,685 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 7 [2018-09-26 08:24:35,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:35,685 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-09-26 08:24:35,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 08:24:35,685 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-09-26 08:24:35,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-26 08:24:35,686 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:35,686 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1] [2018-09-26 08:24:35,687 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:35,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:35,687 INFO L82 PathProgramCache]: Analyzing trace with hash -664969178, now seen corresponding path program 3 times [2018-09-26 08:24:35,687 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:35,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:35,728 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:35,728 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:35,729 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-09-26 08:24:35,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:24:35,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:24:35,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:24:35,730 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 6 states. [2018-09-26 08:24:35,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:35,760 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-09-26 08:24:35,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 08:24:35,760 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2018-09-26 08:24:35,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:35,761 INFO L225 Difference]: With dead ends: 13 [2018-09-26 08:24:35,761 INFO L226 Difference]: Without dead ends: 12 [2018-09-26 08:24:35,762 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:24:35,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-09-26 08:24:35,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-09-26 08:24:35,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-09-26 08:24:35,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-09-26 08:24:35,766 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2018-09-26 08:24:35,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:35,767 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-09-26 08:24:35,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:24:35,767 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-09-26 08:24:35,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-26 08:24:35,768 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:35,768 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1] [2018-09-26 08:24:35,768 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:35,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:35,769 INFO L82 PathProgramCache]: Analyzing trace with hash 914748136, now seen corresponding path program 4 times [2018-09-26 08:24:35,769 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:35,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:35,845 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:35,845 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:35,845 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-09-26 08:24:35,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:24:35,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:24:35,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:24:35,847 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 7 states. [2018-09-26 08:24:35,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:35,869 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-09-26 08:24:35,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-26 08:24:35,870 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2018-09-26 08:24:35,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:35,870 INFO L225 Difference]: With dead ends: 15 [2018-09-26 08:24:35,871 INFO L226 Difference]: Without dead ends: 14 [2018-09-26 08:24:35,871 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:24:35,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-09-26 08:24:35,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-09-26 08:24:35,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-09-26 08:24:35,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-09-26 08:24:35,876 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2018-09-26 08:24:35,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:35,876 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-09-26 08:24:35,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:24:35,877 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-09-26 08:24:35,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 08:24:35,877 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:35,878 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1] [2018-09-26 08:24:35,878 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:35,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:35,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1395335894, now seen corresponding path program 5 times [2018-09-26 08:24:35,878 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:35,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:35,953 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:35,956 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:35,956 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:24:35,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:24:35,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:24:35,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:24:35,958 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 8 states. [2018-09-26 08:24:36,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:36,009 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-09-26 08:24:36,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-26 08:24:36,009 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2018-09-26 08:24:36,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:36,010 INFO L225 Difference]: With dead ends: 17 [2018-09-26 08:24:36,010 INFO L226 Difference]: Without dead ends: 16 [2018-09-26 08:24:36,011 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:24:36,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-09-26 08:24:36,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-09-26 08:24:36,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-09-26 08:24:36,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-09-26 08:24:36,017 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2018-09-26 08:24:36,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:36,017 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-09-26 08:24:36,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:24:36,018 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-09-26 08:24:36,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 08:24:36,018 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:36,018 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1] [2018-09-26 08:24:36,019 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:36,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:36,019 INFO L82 PathProgramCache]: Analyzing trace with hash -887996692, now seen corresponding path program 6 times [2018-09-26 08:24:36,019 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:36,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:36,087 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:36,087 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:36,089 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:24:36,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:24:36,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:24:36,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:24:36,091 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 9 states. [2018-09-26 08:24:36,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:36,138 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-09-26 08:24:36,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 08:24:36,138 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2018-09-26 08:24:36,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:36,139 INFO L225 Difference]: With dead ends: 19 [2018-09-26 08:24:36,139 INFO L226 Difference]: Without dead ends: 18 [2018-09-26 08:24:36,140 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:24:36,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-09-26 08:24:36,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-09-26 08:24:36,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-09-26 08:24:36,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-09-26 08:24:36,146 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 15 [2018-09-26 08:24:36,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:36,146 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-09-26 08:24:36,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:24:36,146 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-09-26 08:24:36,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-26 08:24:36,147 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:36,147 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1] [2018-09-26 08:24:36,148 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:36,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:36,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1333671982, now seen corresponding path program 7 times [2018-09-26 08:24:36,148 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:36,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:36,220 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:36,221 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:36,221 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:24:36,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:24:36,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:24:36,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:24:36,223 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 10 states. [2018-09-26 08:24:36,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:36,251 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-09-26 08:24:36,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:24:36,252 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2018-09-26 08:24:36,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:36,253 INFO L225 Difference]: With dead ends: 21 [2018-09-26 08:24:36,253 INFO L226 Difference]: Without dead ends: 20 [2018-09-26 08:24:36,254 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:24:36,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-09-26 08:24:36,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-09-26 08:24:36,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-09-26 08:24:36,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-09-26 08:24:36,260 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 17 [2018-09-26 08:24:36,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:36,260 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-09-26 08:24:36,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:24:36,261 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-09-26 08:24:36,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-26 08:24:36,261 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:36,262 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 1, 1] [2018-09-26 08:24:36,262 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:36,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:36,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1758521584, now seen corresponding path program 8 times [2018-09-26 08:24:36,263 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:36,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:36,312 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:36,313 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:36,313 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:24:36,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:24:36,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:24:36,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:24:36,314 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 11 states. [2018-09-26 08:24:36,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:36,335 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-09-26 08:24:36,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:24:36,336 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-09-26 08:24:36,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:36,337 INFO L225 Difference]: With dead ends: 23 [2018-09-26 08:24:36,337 INFO L226 Difference]: Without dead ends: 22 [2018-09-26 08:24:36,338 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:24:36,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-09-26 08:24:36,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-09-26 08:24:36,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-09-26 08:24:36,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-09-26 08:24:36,343 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2018-09-26 08:24:36,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:36,344 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-09-26 08:24:36,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:24:36,344 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-09-26 08:24:36,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-26 08:24:36,345 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:36,345 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 1, 1] [2018-09-26 08:24:36,346 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:36,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:36,346 INFO L82 PathProgramCache]: Analyzing trace with hash 2017095986, now seen corresponding path program 9 times [2018-09-26 08:24:36,346 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:36,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:36,401 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:36,402 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:36,402 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:24:36,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:24:36,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:24:36,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:24:36,404 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 12 states. [2018-09-26 08:24:36,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:36,431 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-09-26 08:24:36,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 08:24:36,431 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-09-26 08:24:36,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:36,432 INFO L225 Difference]: With dead ends: 25 [2018-09-26 08:24:36,433 INFO L226 Difference]: Without dead ends: 24 [2018-09-26 08:24:36,433 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:24:36,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-09-26 08:24:36,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-09-26 08:24:36,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-09-26 08:24:36,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-09-26 08:24:36,445 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 21 [2018-09-26 08:24:36,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:36,448 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-09-26 08:24:36,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:24:36,448 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-09-26 08:24:36,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-09-26 08:24:36,449 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:36,449 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 1, 1] [2018-09-26 08:24:36,450 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:36,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:36,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1398993140, now seen corresponding path program 10 times [2018-09-26 08:24:36,451 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:36,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:36,552 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:36,552 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:36,552 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:24:36,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 08:24:36,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 08:24:36,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:24:36,555 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 13 states. [2018-09-26 08:24:36,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:36,591 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-09-26 08:24:36,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:24:36,595 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2018-09-26 08:24:36,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:36,596 INFO L225 Difference]: With dead ends: 27 [2018-09-26 08:24:36,596 INFO L226 Difference]: Without dead ends: 26 [2018-09-26 08:24:36,597 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:24:36,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-09-26 08:24:36,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-09-26 08:24:36,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-09-26 08:24:36,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-09-26 08:24:36,609 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 23 [2018-09-26 08:24:36,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:36,610 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-09-26 08:24:36,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 08:24:36,610 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-09-26 08:24:36,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-26 08:24:36,611 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:36,611 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 1, 1] [2018-09-26 08:24:36,611 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:36,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:36,612 INFO L82 PathProgramCache]: Analyzing trace with hash 107644982, now seen corresponding path program 11 times [2018-09-26 08:24:36,612 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:36,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:36,684 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:36,685 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:36,685 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-09-26 08:24:36,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 08:24:36,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 08:24:36,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:24:36,688 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 14 states. [2018-09-26 08:24:36,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:36,708 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-09-26 08:24:36,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 08:24:36,709 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2018-09-26 08:24:36,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:36,710 INFO L225 Difference]: With dead ends: 29 [2018-09-26 08:24:36,710 INFO L226 Difference]: Without dead ends: 28 [2018-09-26 08:24:36,711 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:24:36,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-09-26 08:24:36,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-09-26 08:24:36,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-09-26 08:24:36,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-09-26 08:24:36,716 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 25 [2018-09-26 08:24:36,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:36,717 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-09-26 08:24:36,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 08:24:36,717 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-09-26 08:24:36,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-09-26 08:24:36,718 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:36,718 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 1, 1] [2018-09-26 08:24:36,719 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:36,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:36,719 INFO L82 PathProgramCache]: Analyzing trace with hash 367613688, now seen corresponding path program 12 times [2018-09-26 08:24:36,720 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:36,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:36,775 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:36,776 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:36,776 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-09-26 08:24:36,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-26 08:24:36,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-26 08:24:36,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:24:36,778 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 15 states. [2018-09-26 08:24:36,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:36,799 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-09-26 08:24:36,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:24:36,800 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2018-09-26 08:24:36,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:36,800 INFO L225 Difference]: With dead ends: 31 [2018-09-26 08:24:36,801 INFO L226 Difference]: Without dead ends: 30 [2018-09-26 08:24:36,801 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:24:36,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-09-26 08:24:36,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-09-26 08:24:36,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-09-26 08:24:36,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-09-26 08:24:36,807 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 27 [2018-09-26 08:24:36,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:36,807 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-09-26 08:24:36,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-26 08:24:36,808 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-09-26 08:24:36,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-09-26 08:24:36,808 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:36,809 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 1, 1] [2018-09-26 08:24:36,809 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:36,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:36,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1089436986, now seen corresponding path program 13 times [2018-09-26 08:24:36,810 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:36,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:36,877 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:36,878 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:36,878 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-09-26 08:24:36,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 08:24:36,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 08:24:36,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:24:36,879 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 16 states. [2018-09-26 08:24:36,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:36,904 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-09-26 08:24:36,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-26 08:24:36,905 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 29 [2018-09-26 08:24:36,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:36,905 INFO L225 Difference]: With dead ends: 33 [2018-09-26 08:24:36,906 INFO L226 Difference]: Without dead ends: 32 [2018-09-26 08:24:36,906 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:24:36,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-09-26 08:24:36,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-09-26 08:24:36,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-09-26 08:24:36,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-09-26 08:24:36,912 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 29 [2018-09-26 08:24:36,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:36,912 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-09-26 08:24:36,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 08:24:36,913 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-09-26 08:24:36,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-09-26 08:24:36,913 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:36,914 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 1, 1] [2018-09-26 08:24:36,914 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:36,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:36,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1023075588, now seen corresponding path program 14 times [2018-09-26 08:24:36,914 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:36,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:36,986 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:36,986 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:36,986 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-09-26 08:24:36,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-26 08:24:36,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-26 08:24:36,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:24:36,988 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 17 states. [2018-09-26 08:24:37,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:37,021 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-09-26 08:24:37,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 08:24:37,021 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 31 [2018-09-26 08:24:37,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:37,022 INFO L225 Difference]: With dead ends: 35 [2018-09-26 08:24:37,022 INFO L226 Difference]: Without dead ends: 34 [2018-09-26 08:24:37,023 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:24:37,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-09-26 08:24:37,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-09-26 08:24:37,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-09-26 08:24:37,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-09-26 08:24:37,033 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 31 [2018-09-26 08:24:37,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:37,033 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-09-26 08:24:37,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-26 08:24:37,034 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-09-26 08:24:37,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-09-26 08:24:37,035 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:37,035 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 1, 1] [2018-09-26 08:24:37,035 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:37,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:37,036 INFO L82 PathProgramCache]: Analyzing trace with hash 371871806, now seen corresponding path program 15 times [2018-09-26 08:24:37,036 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:37,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:37,135 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:37,135 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:37,137 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-09-26 08:24:37,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-26 08:24:37,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-26 08:24:37,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:24:37,139 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 18 states. [2018-09-26 08:24:37,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:37,166 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-09-26 08:24:37,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 08:24:37,167 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 33 [2018-09-26 08:24:37,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:37,168 INFO L225 Difference]: With dead ends: 37 [2018-09-26 08:24:37,168 INFO L226 Difference]: Without dead ends: 36 [2018-09-26 08:24:37,169 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:24:37,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-09-26 08:24:37,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-09-26 08:24:37,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-09-26 08:24:37,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-09-26 08:24:37,183 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 33 [2018-09-26 08:24:37,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:37,183 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-09-26 08:24:37,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-26 08:24:37,185 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-09-26 08:24:37,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-09-26 08:24:37,185 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:37,186 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 1, 1] [2018-09-26 08:24:37,186 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:37,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:37,187 INFO L82 PathProgramCache]: Analyzing trace with hash 886521088, now seen corresponding path program 16 times [2018-09-26 08:24:37,187 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:37,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:37,272 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:37,272 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:37,273 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-09-26 08:24:37,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-26 08:24:37,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-26 08:24:37,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:24:37,274 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 19 states. [2018-09-26 08:24:37,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:37,307 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-09-26 08:24:37,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-26 08:24:37,307 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 35 [2018-09-26 08:24:37,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:37,308 INFO L225 Difference]: With dead ends: 39 [2018-09-26 08:24:37,308 INFO L226 Difference]: Without dead ends: 38 [2018-09-26 08:24:37,309 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:24:37,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-09-26 08:24:37,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-09-26 08:24:37,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-09-26 08:24:37,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-09-26 08:24:37,319 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 35 [2018-09-26 08:24:37,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:37,320 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-09-26 08:24:37,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-26 08:24:37,320 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-09-26 08:24:37,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-09-26 08:24:37,322 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:37,322 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 1, 1] [2018-09-26 08:24:37,323 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:37,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:37,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1543242050, now seen corresponding path program 17 times [2018-09-26 08:24:37,323 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:37,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:37,415 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:37,416 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:37,416 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-09-26 08:24:37,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-26 08:24:37,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-26 08:24:37,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:24:37,418 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 20 states. [2018-09-26 08:24:37,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:37,459 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-09-26 08:24:37,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-26 08:24:37,459 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 37 [2018-09-26 08:24:37,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:37,461 INFO L225 Difference]: With dead ends: 41 [2018-09-26 08:24:37,461 INFO L226 Difference]: Without dead ends: 40 [2018-09-26 08:24:37,463 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:24:37,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-09-26 08:24:37,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-09-26 08:24:37,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-09-26 08:24:37,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-09-26 08:24:37,472 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 37 [2018-09-26 08:24:37,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:37,472 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-09-26 08:24:37,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-26 08:24:37,473 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-09-26 08:24:37,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-09-26 08:24:37,473 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:37,474 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 1, 1] [2018-09-26 08:24:37,474 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:37,474 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:37,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1291894020, now seen corresponding path program 18 times [2018-09-26 08:24:37,477 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:37,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:37,592 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:37,592 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:37,593 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-09-26 08:24:37,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-26 08:24:37,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-26 08:24:37,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:24:37,594 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 21 states. [2018-09-26 08:24:37,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:37,618 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-09-26 08:24:37,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 08:24:37,619 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 39 [2018-09-26 08:24:37,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:37,620 INFO L225 Difference]: With dead ends: 43 [2018-09-26 08:24:37,620 INFO L226 Difference]: Without dead ends: 42 [2018-09-26 08:24:37,621 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:24:37,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-09-26 08:24:37,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-09-26 08:24:37,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-09-26 08:24:37,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-09-26 08:24:37,626 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 39 [2018-09-26 08:24:37,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:37,627 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-09-26 08:24:37,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-26 08:24:37,627 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-09-26 08:24:37,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-09-26 08:24:37,628 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:37,628 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 1, 1] [2018-09-26 08:24:37,628 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:37,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:37,629 INFO L82 PathProgramCache]: Analyzing trace with hash 264605766, now seen corresponding path program 19 times [2018-09-26 08:24:37,629 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:37,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:37,734 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:37,735 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:37,735 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-09-26 08:24:37,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-26 08:24:37,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-26 08:24:37,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:24:37,737 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 22 states. [2018-09-26 08:24:37,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:37,762 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-09-26 08:24:37,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-26 08:24:37,762 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 41 [2018-09-26 08:24:37,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:37,763 INFO L225 Difference]: With dead ends: 45 [2018-09-26 08:24:37,763 INFO L226 Difference]: Without dead ends: 44 [2018-09-26 08:24:37,764 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:24:37,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-09-26 08:24:37,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-09-26 08:24:37,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-09-26 08:24:37,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-09-26 08:24:37,769 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 41 [2018-09-26 08:24:37,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:37,769 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-09-26 08:24:37,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-26 08:24:37,769 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-09-26 08:24:37,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-09-26 08:24:37,770 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:37,770 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 1, 1] [2018-09-26 08:24:37,771 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:37,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:37,771 INFO L82 PathProgramCache]: Analyzing trace with hash 883071752, now seen corresponding path program 20 times [2018-09-26 08:24:37,771 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:37,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:37,894 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:37,895 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:37,895 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-09-26 08:24:37,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-09-26 08:24:37,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-09-26 08:24:37,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:24:37,896 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 23 states. [2018-09-26 08:24:37,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:37,925 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-09-26 08:24:37,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 08:24:37,925 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 43 [2018-09-26 08:24:37,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:37,926 INFO L225 Difference]: With dead ends: 47 [2018-09-26 08:24:37,926 INFO L226 Difference]: Without dead ends: 46 [2018-09-26 08:24:37,927 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:24:37,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-09-26 08:24:37,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-09-26 08:24:37,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-09-26 08:24:37,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-09-26 08:24:37,932 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 43 [2018-09-26 08:24:37,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:37,933 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-09-26 08:24:37,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-09-26 08:24:37,933 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-09-26 08:24:37,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-09-26 08:24:37,934 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:37,934 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 1, 1] [2018-09-26 08:24:37,934 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:37,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:37,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1771569846, now seen corresponding path program 21 times [2018-09-26 08:24:37,935 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:37,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:38,049 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:38,050 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:38,050 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-09-26 08:24:38,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-26 08:24:38,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-26 08:24:38,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:24:38,052 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 24 states. [2018-09-26 08:24:38,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:38,077 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-09-26 08:24:38,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 08:24:38,078 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 45 [2018-09-26 08:24:38,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:38,078 INFO L225 Difference]: With dead ends: 49 [2018-09-26 08:24:38,078 INFO L226 Difference]: Without dead ends: 48 [2018-09-26 08:24:38,079 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:24:38,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-09-26 08:24:38,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-09-26 08:24:38,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-09-26 08:24:38,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-09-26 08:24:38,084 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 45 [2018-09-26 08:24:38,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:38,085 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-09-26 08:24:38,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-26 08:24:38,085 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-09-26 08:24:38,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-09-26 08:24:38,086 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:38,086 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 1, 1] [2018-09-26 08:24:38,086 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:38,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:38,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1671571700, now seen corresponding path program 22 times [2018-09-26 08:24:38,087 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:38,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:38,215 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:38,215 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:38,215 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-09-26 08:24:38,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-09-26 08:24:38,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-09-26 08:24:38,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:24:38,217 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 25 states. [2018-09-26 08:24:38,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:38,243 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-09-26 08:24:38,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-26 08:24:38,243 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 47 [2018-09-26 08:24:38,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:38,244 INFO L225 Difference]: With dead ends: 51 [2018-09-26 08:24:38,244 INFO L226 Difference]: Without dead ends: 50 [2018-09-26 08:24:38,245 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:24:38,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-09-26 08:24:38,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-09-26 08:24:38,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-09-26 08:24:38,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-09-26 08:24:38,251 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 47 [2018-09-26 08:24:38,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:38,251 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-09-26 08:24:38,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-09-26 08:24:38,251 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-09-26 08:24:38,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-09-26 08:24:38,252 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:38,252 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 1, 1] [2018-09-26 08:24:38,253 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:38,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:38,253 INFO L82 PathProgramCache]: Analyzing trace with hash -62633906, now seen corresponding path program 23 times [2018-09-26 08:24:38,253 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:38,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:38,400 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:38,401 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:38,401 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-09-26 08:24:38,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-09-26 08:24:38,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-09-26 08:24:38,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:24:38,404 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 26 states. [2018-09-26 08:24:38,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:38,436 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-09-26 08:24:38,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-26 08:24:38,437 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 49 [2018-09-26 08:24:38,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:38,437 INFO L225 Difference]: With dead ends: 53 [2018-09-26 08:24:38,438 INFO L226 Difference]: Without dead ends: 52 [2018-09-26 08:24:38,438 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:24:38,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-09-26 08:24:38,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-09-26 08:24:38,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-09-26 08:24:38,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-09-26 08:24:38,447 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 49 [2018-09-26 08:24:38,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:38,448 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-09-26 08:24:38,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-09-26 08:24:38,448 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-09-26 08:24:38,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-09-26 08:24:38,449 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:38,449 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 1, 1] [2018-09-26 08:24:38,449 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:38,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:38,454 INFO L82 PathProgramCache]: Analyzing trace with hash -61640432, now seen corresponding path program 24 times [2018-09-26 08:24:38,454 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:38,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:38,593 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:38,593 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:38,593 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-09-26 08:24:38,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-09-26 08:24:38,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-09-26 08:24:38,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:24:38,595 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 27 states. [2018-09-26 08:24:38,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:38,625 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-09-26 08:24:38,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-26 08:24:38,625 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 51 [2018-09-26 08:24:38,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:38,626 INFO L225 Difference]: With dead ends: 55 [2018-09-26 08:24:38,626 INFO L226 Difference]: Without dead ends: 54 [2018-09-26 08:24:38,627 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:24:38,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-09-26 08:24:38,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-09-26 08:24:38,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-09-26 08:24:38,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-09-26 08:24:38,633 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 51 [2018-09-26 08:24:38,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:38,635 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-09-26 08:24:38,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-09-26 08:24:38,636 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-09-26 08:24:38,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-09-26 08:24:38,636 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:38,637 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 1, 1] [2018-09-26 08:24:38,637 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:38,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:38,637 INFO L82 PathProgramCache]: Analyzing trace with hash 893088082, now seen corresponding path program 25 times [2018-09-26 08:24:38,638 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:38,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:38,800 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:38,800 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:38,801 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-09-26 08:24:38,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-09-26 08:24:38,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-09-26 08:24:38,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:24:38,802 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 28 states. [2018-09-26 08:24:38,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:38,830 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-09-26 08:24:38,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-26 08:24:38,830 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 53 [2018-09-26 08:24:38,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:38,831 INFO L225 Difference]: With dead ends: 57 [2018-09-26 08:24:38,831 INFO L226 Difference]: Without dead ends: 56 [2018-09-26 08:24:38,832 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:24:38,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-09-26 08:24:38,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-09-26 08:24:38,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-09-26 08:24:38,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-09-26 08:24:38,848 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 53 [2018-09-26 08:24:38,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:38,848 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-09-26 08:24:38,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-09-26 08:24:38,848 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-09-26 08:24:38,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-09-26 08:24:38,849 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:38,849 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 1, 1] [2018-09-26 08:24:38,851 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:38,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:38,852 INFO L82 PathProgramCache]: Analyzing trace with hash -735811308, now seen corresponding path program 26 times [2018-09-26 08:24:38,852 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:38,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:39,012 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:39,012 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:39,013 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-09-26 08:24:39,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-09-26 08:24:39,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-09-26 08:24:39,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:24:39,014 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 29 states. [2018-09-26 08:24:39,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:39,047 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-09-26 08:24:39,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-26 08:24:39,048 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 55 [2018-09-26 08:24:39,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:39,049 INFO L225 Difference]: With dead ends: 59 [2018-09-26 08:24:39,049 INFO L226 Difference]: Without dead ends: 58 [2018-09-26 08:24:39,050 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:24:39,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-09-26 08:24:39,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-09-26 08:24:39,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-09-26 08:24:39,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-09-26 08:24:39,083 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 55 [2018-09-26 08:24:39,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:39,083 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-09-26 08:24:39,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-09-26 08:24:39,084 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-09-26 08:24:39,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-09-26 08:24:39,084 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:39,084 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 1, 1] [2018-09-26 08:24:39,088 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:39,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:39,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1554937942, now seen corresponding path program 27 times [2018-09-26 08:24:39,105 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:39,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:39,262 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:39,263 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:39,263 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-09-26 08:24:39,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-09-26 08:24:39,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-09-26 08:24:39,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:24:39,264 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 30 states. [2018-09-26 08:24:39,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:39,291 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-09-26 08:24:39,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-26 08:24:39,292 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 57 [2018-09-26 08:24:39,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:39,292 INFO L225 Difference]: With dead ends: 61 [2018-09-26 08:24:39,292 INFO L226 Difference]: Without dead ends: 60 [2018-09-26 08:24:39,293 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:24:39,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-09-26 08:24:39,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-09-26 08:24:39,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-09-26 08:24:39,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-09-26 08:24:39,297 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 57 [2018-09-26 08:24:39,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:39,297 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-09-26 08:24:39,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-09-26 08:24:39,297 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-09-26 08:24:39,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-09-26 08:24:39,298 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:39,298 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 1, 1] [2018-09-26 08:24:39,298 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:39,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:39,299 INFO L82 PathProgramCache]: Analyzing trace with hash -353255656, now seen corresponding path program 28 times [2018-09-26 08:24:39,299 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:39,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:39,436 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:39,437 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:39,437 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-09-26 08:24:39,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-09-26 08:24:39,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-09-26 08:24:39,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:24:39,438 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 31 states. [2018-09-26 08:24:39,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:39,469 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-09-26 08:24:39,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-26 08:24:39,470 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 59 [2018-09-26 08:24:39,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:39,470 INFO L225 Difference]: With dead ends: 63 [2018-09-26 08:24:39,470 INFO L226 Difference]: Without dead ends: 62 [2018-09-26 08:24:39,471 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:24:39,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-09-26 08:24:39,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-09-26 08:24:39,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-09-26 08:24:39,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-09-26 08:24:39,475 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 59 [2018-09-26 08:24:39,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:39,475 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-09-26 08:24:39,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-09-26 08:24:39,476 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-09-26 08:24:39,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-09-26 08:24:39,476 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:39,476 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 1, 1] [2018-09-26 08:24:39,477 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:39,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:39,477 INFO L82 PathProgramCache]: Analyzing trace with hash -176267942, now seen corresponding path program 29 times [2018-09-26 08:24:39,477 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:39,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:39,623 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:39,624 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:39,624 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-09-26 08:24:39,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-09-26 08:24:39,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-09-26 08:24:39,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:24:39,625 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 32 states. [2018-09-26 08:24:39,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:39,656 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-09-26 08:24:39,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-26 08:24:39,656 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 61 [2018-09-26 08:24:39,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:39,657 INFO L225 Difference]: With dead ends: 65 [2018-09-26 08:24:39,657 INFO L226 Difference]: Without dead ends: 64 [2018-09-26 08:24:39,658 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:24:39,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-09-26 08:24:39,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-09-26 08:24:39,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-09-26 08:24:39,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-09-26 08:24:39,661 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 61 [2018-09-26 08:24:39,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:39,662 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-09-26 08:24:39,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-09-26 08:24:39,662 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-09-26 08:24:39,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-09-26 08:24:39,662 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:39,663 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 1, 1] [2018-09-26 08:24:39,663 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:39,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:39,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1889766628, now seen corresponding path program 30 times [2018-09-26 08:24:39,663 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:39,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:39,815 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:39,816 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:39,816 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-09-26 08:24:39,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-09-26 08:24:39,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-09-26 08:24:39,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:24:39,818 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 33 states. [2018-09-26 08:24:39,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:39,850 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-09-26 08:24:39,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-26 08:24:39,850 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 63 [2018-09-26 08:24:39,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:39,852 INFO L225 Difference]: With dead ends: 67 [2018-09-26 08:24:39,852 INFO L226 Difference]: Without dead ends: 66 [2018-09-26 08:24:39,853 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:24:39,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-09-26 08:24:39,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-09-26 08:24:39,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-09-26 08:24:39,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-09-26 08:24:39,856 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 63 [2018-09-26 08:24:39,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:39,856 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-09-26 08:24:39,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-09-26 08:24:39,856 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-09-26 08:24:39,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-09-26 08:24:39,857 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:39,857 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 1, 1] [2018-09-26 08:24:39,857 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:39,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:39,858 INFO L82 PathProgramCache]: Analyzing trace with hash 705437790, now seen corresponding path program 31 times [2018-09-26 08:24:39,858 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:39,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:40,041 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:40,041 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:40,041 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-09-26 08:24:40,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-09-26 08:24:40,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-09-26 08:24:40,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:24:40,044 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 34 states. [2018-09-26 08:24:40,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:40,073 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-09-26 08:24:40,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-26 08:24:40,073 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 65 [2018-09-26 08:24:40,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:40,074 INFO L225 Difference]: With dead ends: 69 [2018-09-26 08:24:40,074 INFO L226 Difference]: Without dead ends: 68 [2018-09-26 08:24:40,075 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:24:40,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-09-26 08:24:40,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-09-26 08:24:40,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-09-26 08:24:40,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-09-26 08:24:40,080 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 65 [2018-09-26 08:24:40,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:40,080 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-09-26 08:24:40,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-09-26 08:24:40,080 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-09-26 08:24:40,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-09-26 08:24:40,081 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:40,082 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 1, 1] [2018-09-26 08:24:40,082 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:40,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:40,083 INFO L82 PathProgramCache]: Analyzing trace with hash -679115488, now seen corresponding path program 32 times [2018-09-26 08:24:40,083 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:40,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:40,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:40,255 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:40,255 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-09-26 08:24:40,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-09-26 08:24:40,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-09-26 08:24:40,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:24:40,260 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 35 states. [2018-09-26 08:24:40,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:40,295 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-09-26 08:24:40,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-09-26 08:24:40,295 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 67 [2018-09-26 08:24:40,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:40,296 INFO L225 Difference]: With dead ends: 71 [2018-09-26 08:24:40,296 INFO L226 Difference]: Without dead ends: 70 [2018-09-26 08:24:40,297 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:24:40,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-09-26 08:24:40,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-09-26 08:24:40,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-09-26 08:24:40,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-09-26 08:24:40,301 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 67 [2018-09-26 08:24:40,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:40,301 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-09-26 08:24:40,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-09-26 08:24:40,302 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-09-26 08:24:40,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-09-26 08:24:40,302 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:40,302 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 1, 1] [2018-09-26 08:24:40,302 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:40,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:40,303 INFO L82 PathProgramCache]: Analyzing trace with hash 205046114, now seen corresponding path program 33 times [2018-09-26 08:24:40,303 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:40,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:40,482 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:40,483 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:40,483 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-09-26 08:24:40,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-09-26 08:24:40,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-09-26 08:24:40,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 08:24:40,485 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 36 states. [2018-09-26 08:24:40,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:40,525 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-09-26 08:24:40,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-26 08:24:40,525 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 69 [2018-09-26 08:24:40,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:40,526 INFO L225 Difference]: With dead ends: 73 [2018-09-26 08:24:40,526 INFO L226 Difference]: Without dead ends: 72 [2018-09-26 08:24:40,527 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 08:24:40,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-09-26 08:24:40,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-09-26 08:24:40,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-09-26 08:24:40,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-09-26 08:24:40,531 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 69 [2018-09-26 08:24:40,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:40,531 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-09-26 08:24:40,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-09-26 08:24:40,532 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-09-26 08:24:40,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-09-26 08:24:40,532 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:40,532 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 1, 1] [2018-09-26 08:24:40,533 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:40,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:40,533 INFO L82 PathProgramCache]: Analyzing trace with hash -519178972, now seen corresponding path program 34 times [2018-09-26 08:24:40,533 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:40,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:40,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:40,711 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:40,711 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-09-26 08:24:40,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-09-26 08:24:40,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-09-26 08:24:40,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 08:24:40,713 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 37 states. [2018-09-26 08:24:40,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:40,743 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-09-26 08:24:40,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-26 08:24:40,743 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 71 [2018-09-26 08:24:40,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:40,744 INFO L225 Difference]: With dead ends: 75 [2018-09-26 08:24:40,744 INFO L226 Difference]: Without dead ends: 74 [2018-09-26 08:24:40,745 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 08:24:40,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-09-26 08:24:40,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-09-26 08:24:40,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-09-26 08:24:40,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-09-26 08:24:40,748 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 71 [2018-09-26 08:24:40,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:40,749 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-09-26 08:24:40,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-09-26 08:24:40,749 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-09-26 08:24:40,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-09-26 08:24:40,750 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:40,750 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 1, 1] [2018-09-26 08:24:40,750 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:40,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:40,750 INFO L82 PathProgramCache]: Analyzing trace with hash -714784666, now seen corresponding path program 35 times [2018-09-26 08:24:40,751 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:40,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:40,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:40,923 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:40,923 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-09-26 08:24:40,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-09-26 08:24:40,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-09-26 08:24:40,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:24:40,925 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 38 states. [2018-09-26 08:24:40,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:40,957 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-09-26 08:24:40,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-26 08:24:40,957 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 73 [2018-09-26 08:24:40,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:40,958 INFO L225 Difference]: With dead ends: 77 [2018-09-26 08:24:40,958 INFO L226 Difference]: Without dead ends: 76 [2018-09-26 08:24:40,959 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:24:40,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-09-26 08:24:40,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-09-26 08:24:40,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-09-26 08:24:40,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-09-26 08:24:40,963 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 73 [2018-09-26 08:24:40,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:40,963 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-09-26 08:24:40,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-09-26 08:24:40,963 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-09-26 08:24:40,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-09-26 08:24:40,964 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:40,964 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 1, 1] [2018-09-26 08:24:40,965 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:40,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:40,965 INFO L82 PathProgramCache]: Analyzing trace with hash 286704424, now seen corresponding path program 36 times [2018-09-26 08:24:40,965 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:40,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:41,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:41,152 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:41,152 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-09-26 08:24:41,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-09-26 08:24:41,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-09-26 08:24:41,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:24:41,154 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 39 states. [2018-09-26 08:24:41,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:41,198 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-09-26 08:24:41,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-26 08:24:41,198 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 75 [2018-09-26 08:24:41,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:41,199 INFO L225 Difference]: With dead ends: 79 [2018-09-26 08:24:41,199 INFO L226 Difference]: Without dead ends: 78 [2018-09-26 08:24:41,200 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:24:41,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-09-26 08:24:41,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-09-26 08:24:41,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-09-26 08:24:41,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-09-26 08:24:41,205 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 75 [2018-09-26 08:24:41,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:41,206 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-09-26 08:24:41,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-09-26 08:24:41,206 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-09-26 08:24:41,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-09-26 08:24:41,207 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:41,207 INFO L375 BasicCegarLoop]: trace histogram [38, 37, 1, 1] [2018-09-26 08:24:41,207 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:41,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:41,208 INFO L82 PathProgramCache]: Analyzing trace with hash 645045610, now seen corresponding path program 37 times [2018-09-26 08:24:41,208 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:41,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:41,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:41,433 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:41,433 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-09-26 08:24:41,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-09-26 08:24:41,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-09-26 08:24:41,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 08:24:41,435 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 40 states. [2018-09-26 08:24:41,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:41,473 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-09-26 08:24:41,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-26 08:24:41,473 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 77 [2018-09-26 08:24:41,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:41,474 INFO L225 Difference]: With dead ends: 81 [2018-09-26 08:24:41,474 INFO L226 Difference]: Without dead ends: 80 [2018-09-26 08:24:41,476 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 08:24:41,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-09-26 08:24:41,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-09-26 08:24:41,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-09-26 08:24:41,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-09-26 08:24:41,481 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 77 [2018-09-26 08:24:41,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:41,481 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-09-26 08:24:41,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-09-26 08:24:41,481 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-09-26 08:24:41,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-09-26 08:24:41,482 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:41,482 INFO L375 BasicCegarLoop]: trace histogram [39, 38, 1, 1] [2018-09-26 08:24:41,482 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:41,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:41,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1413541676, now seen corresponding path program 38 times [2018-09-26 08:24:41,483 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:41,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:41,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:41,734 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:41,734 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-09-26 08:24:41,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-09-26 08:24:41,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-09-26 08:24:41,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-09-26 08:24:41,736 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 41 states. [2018-09-26 08:24:41,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:41,777 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-09-26 08:24:41,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-26 08:24:41,778 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 79 [2018-09-26 08:24:41,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:41,778 INFO L225 Difference]: With dead ends: 83 [2018-09-26 08:24:41,778 INFO L226 Difference]: Without dead ends: 82 [2018-09-26 08:24:41,779 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-09-26 08:24:41,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-09-26 08:24:41,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-09-26 08:24:41,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-09-26 08:24:41,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-09-26 08:24:41,785 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 79 [2018-09-26 08:24:41,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:41,786 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-09-26 08:24:41,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-09-26 08:24:41,786 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-09-26 08:24:41,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-09-26 08:24:41,787 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:41,787 INFO L375 BasicCegarLoop]: trace histogram [40, 39, 1, 1] [2018-09-26 08:24:41,787 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:41,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:41,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1203886190, now seen corresponding path program 39 times [2018-09-26 08:24:41,788 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:41,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:42,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:42,005 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:42,006 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-09-26 08:24:42,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-09-26 08:24:42,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-09-26 08:24:42,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 08:24:42,007 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 42 states. [2018-09-26 08:24:42,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:42,052 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-09-26 08:24:42,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-09-26 08:24:42,052 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 81 [2018-09-26 08:24:42,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:42,053 INFO L225 Difference]: With dead ends: 85 [2018-09-26 08:24:42,053 INFO L226 Difference]: Without dead ends: 84 [2018-09-26 08:24:42,054 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 08:24:42,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-09-26 08:24:42,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-09-26 08:24:42,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-09-26 08:24:42,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-09-26 08:24:42,058 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 81 [2018-09-26 08:24:42,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:42,058 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-09-26 08:24:42,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-09-26 08:24:42,059 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-09-26 08:24:42,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-09-26 08:24:42,059 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:42,059 INFO L375 BasicCegarLoop]: trace histogram [41, 40, 1, 1] [2018-09-26 08:24:42,060 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:42,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:42,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1588427056, now seen corresponding path program 40 times [2018-09-26 08:24:42,060 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:42,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:42,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:42,279 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:42,279 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-09-26 08:24:42,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-09-26 08:24:42,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-09-26 08:24:42,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-09-26 08:24:42,281 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 43 states. [2018-09-26 08:24:42,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:42,327 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-09-26 08:24:42,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-26 08:24:42,327 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 83 [2018-09-26 08:24:42,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:42,328 INFO L225 Difference]: With dead ends: 87 [2018-09-26 08:24:42,328 INFO L226 Difference]: Without dead ends: 86 [2018-09-26 08:24:42,329 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-09-26 08:24:42,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-09-26 08:24:42,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-09-26 08:24:42,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-09-26 08:24:42,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-09-26 08:24:42,333 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 83 [2018-09-26 08:24:42,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:42,334 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-09-26 08:24:42,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-09-26 08:24:42,334 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-09-26 08:24:42,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-09-26 08:24:42,335 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:42,335 INFO L375 BasicCegarLoop]: trace histogram [42, 41, 1, 1] [2018-09-26 08:24:42,335 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:42,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:42,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1765011826, now seen corresponding path program 41 times [2018-09-26 08:24:42,336 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:42,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:42,537 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:42,538 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:42,538 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-09-26 08:24:42,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-09-26 08:24:42,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-09-26 08:24:42,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 08:24:42,540 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 44 states. [2018-09-26 08:24:42,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:42,583 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-09-26 08:24:42,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-09-26 08:24:42,583 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 85 [2018-09-26 08:24:42,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:42,584 INFO L225 Difference]: With dead ends: 89 [2018-09-26 08:24:42,584 INFO L226 Difference]: Without dead ends: 88 [2018-09-26 08:24:42,586 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 08:24:42,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-09-26 08:24:42,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-09-26 08:24:42,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-09-26 08:24:42,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-09-26 08:24:42,590 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 85 [2018-09-26 08:24:42,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:42,590 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-09-26 08:24:42,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-09-26 08:24:42,590 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-09-26 08:24:42,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-09-26 08:24:42,591 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:42,591 INFO L375 BasicCegarLoop]: trace histogram [43, 42, 1, 1] [2018-09-26 08:24:42,591 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:42,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:42,592 INFO L82 PathProgramCache]: Analyzing trace with hash -335716044, now seen corresponding path program 42 times [2018-09-26 08:24:42,592 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:42,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:42,811 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:42,812 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:42,812 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-09-26 08:24:42,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-09-26 08:24:42,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-09-26 08:24:42,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-09-26 08:24:42,816 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 45 states. [2018-09-26 08:24:42,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:42,866 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-09-26 08:24:42,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-09-26 08:24:42,866 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 87 [2018-09-26 08:24:42,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:42,867 INFO L225 Difference]: With dead ends: 91 [2018-09-26 08:24:42,867 INFO L226 Difference]: Without dead ends: 90 [2018-09-26 08:24:42,871 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-09-26 08:24:42,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-09-26 08:24:42,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-09-26 08:24:42,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-09-26 08:24:42,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-09-26 08:24:42,880 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 87 [2018-09-26 08:24:42,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:42,881 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-09-26 08:24:42,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-09-26 08:24:42,881 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-09-26 08:24:42,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-09-26 08:24:42,882 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:42,882 INFO L375 BasicCegarLoop]: trace histogram [44, 43, 1, 1] [2018-09-26 08:24:42,883 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:42,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:42,883 INFO L82 PathProgramCache]: Analyzing trace with hash -500569994, now seen corresponding path program 43 times [2018-09-26 08:24:42,883 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:42,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:43,097 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:43,097 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:43,097 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-09-26 08:24:43,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-09-26 08:24:43,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-09-26 08:24:43,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 08:24:43,101 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 46 states. [2018-09-26 08:24:43,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:43,140 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-09-26 08:24:43,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-09-26 08:24:43,140 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 89 [2018-09-26 08:24:43,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:43,141 INFO L225 Difference]: With dead ends: 93 [2018-09-26 08:24:43,141 INFO L226 Difference]: Without dead ends: 92 [2018-09-26 08:24:43,143 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 08:24:43,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-09-26 08:24:43,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-09-26 08:24:43,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-09-26 08:24:43,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-09-26 08:24:43,148 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 89 [2018-09-26 08:24:43,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:43,149 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-09-26 08:24:43,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-09-26 08:24:43,149 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-09-26 08:24:43,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-09-26 08:24:43,150 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:43,150 INFO L375 BasicCegarLoop]: trace histogram [45, 44, 1, 1] [2018-09-26 08:24:43,150 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:43,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:43,150 INFO L82 PathProgramCache]: Analyzing trace with hash -11425992, now seen corresponding path program 44 times [2018-09-26 08:24:43,150 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:43,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:43,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:43,368 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:43,368 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-09-26 08:24:43,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-09-26 08:24:43,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-09-26 08:24:43,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-09-26 08:24:43,370 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 47 states. [2018-09-26 08:24:43,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:43,423 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-09-26 08:24:43,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-09-26 08:24:43,423 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 91 [2018-09-26 08:24:43,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:43,424 INFO L225 Difference]: With dead ends: 95 [2018-09-26 08:24:43,424 INFO L226 Difference]: Without dead ends: 94 [2018-09-26 08:24:43,425 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-09-26 08:24:43,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-09-26 08:24:43,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-09-26 08:24:43,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-09-26 08:24:43,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-09-26 08:24:43,430 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 91 [2018-09-26 08:24:43,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:43,430 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-09-26 08:24:43,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-09-26 08:24:43,430 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-09-26 08:24:43,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-09-26 08:24:43,431 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:43,431 INFO L375 BasicCegarLoop]: trace histogram [46, 45, 1, 1] [2018-09-26 08:24:43,432 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:43,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:43,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1904524666, now seen corresponding path program 45 times [2018-09-26 08:24:43,432 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:43,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:43,684 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:43,684 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:43,684 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-09-26 08:24:43,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-09-26 08:24:43,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-09-26 08:24:43,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-09-26 08:24:43,686 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 48 states. [2018-09-26 08:24:43,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:43,734 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-09-26 08:24:43,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-26 08:24:43,734 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 93 [2018-09-26 08:24:43,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:43,735 INFO L225 Difference]: With dead ends: 97 [2018-09-26 08:24:43,735 INFO L226 Difference]: Without dead ends: 96 [2018-09-26 08:24:43,736 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-09-26 08:24:43,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-09-26 08:24:43,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-09-26 08:24:43,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-09-26 08:24:43,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-09-26 08:24:43,744 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 93 [2018-09-26 08:24:43,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:43,744 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-09-26 08:24:43,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-09-26 08:24:43,744 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-09-26 08:24:43,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-09-26 08:24:43,745 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:43,746 INFO L375 BasicCegarLoop]: trace histogram [47, 46, 1, 1] [2018-09-26 08:24:43,746 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:43,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:43,746 INFO L82 PathProgramCache]: Analyzing trace with hash 592137020, now seen corresponding path program 46 times [2018-09-26 08:24:43,746 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:43,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:44,083 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:44,083 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:44,084 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-09-26 08:24:44,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-09-26 08:24:44,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-09-26 08:24:44,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-09-26 08:24:44,086 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 49 states. [2018-09-26 08:24:44,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:44,134 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-09-26 08:24:44,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-09-26 08:24:44,134 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 95 [2018-09-26 08:24:44,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:44,135 INFO L225 Difference]: With dead ends: 99 [2018-09-26 08:24:44,135 INFO L226 Difference]: Without dead ends: 98 [2018-09-26 08:24:44,136 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-09-26 08:24:44,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-09-26 08:24:44,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-09-26 08:24:44,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-09-26 08:24:44,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-09-26 08:24:44,142 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 95 [2018-09-26 08:24:44,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:44,143 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-09-26 08:24:44,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-09-26 08:24:44,143 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-09-26 08:24:44,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-09-26 08:24:44,144 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:44,144 INFO L375 BasicCegarLoop]: trace histogram [48, 47, 1, 1] [2018-09-26 08:24:44,144 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:44,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:44,145 INFO L82 PathProgramCache]: Analyzing trace with hash 2107994238, now seen corresponding path program 47 times [2018-09-26 08:24:44,145 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:44,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:44,466 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:44,467 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:44,467 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-09-26 08:24:44,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-09-26 08:24:44,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-09-26 08:24:44,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 08:24:44,469 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 50 states. [2018-09-26 08:24:44,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:44,511 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-09-26 08:24:44,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-26 08:24:44,512 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 97 [2018-09-26 08:24:44,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:44,513 INFO L225 Difference]: With dead ends: 101 [2018-09-26 08:24:44,513 INFO L226 Difference]: Without dead ends: 100 [2018-09-26 08:24:44,514 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 08:24:44,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-09-26 08:24:44,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-09-26 08:24:44,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-09-26 08:24:44,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-09-26 08:24:44,522 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 97 [2018-09-26 08:24:44,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:44,522 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-09-26 08:24:44,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-09-26 08:24:44,522 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-09-26 08:24:44,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-09-26 08:24:44,523 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:44,523 INFO L375 BasicCegarLoop]: trace histogram [49, 48, 1, 1] [2018-09-26 08:24:44,524 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:44,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:44,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1442099904, now seen corresponding path program 48 times [2018-09-26 08:24:44,524 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:44,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:44,752 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:44,752 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:44,752 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-09-26 08:24:44,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-09-26 08:24:44,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-09-26 08:24:44,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-09-26 08:24:44,754 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 51 states. [2018-09-26 08:24:44,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:44,797 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-09-26 08:24:44,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-26 08:24:44,797 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 99 [2018-09-26 08:24:44,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:44,798 INFO L225 Difference]: With dead ends: 103 [2018-09-26 08:24:44,798 INFO L226 Difference]: Without dead ends: 102 [2018-09-26 08:24:44,799 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-09-26 08:24:44,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-09-26 08:24:44,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-09-26 08:24:44,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-09-26 08:24:44,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-09-26 08:24:44,805 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 99 [2018-09-26 08:24:44,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:44,805 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-09-26 08:24:44,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-09-26 08:24:44,806 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-09-26 08:24:44,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-09-26 08:24:44,807 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:44,807 INFO L375 BasicCegarLoop]: trace histogram [50, 49, 1, 1] [2018-09-26 08:24:44,807 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:44,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:44,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1416429954, now seen corresponding path program 49 times [2018-09-26 08:24:44,808 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:44,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:45,016 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:45,016 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:45,016 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-09-26 08:24:45,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-09-26 08:24:45,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-09-26 08:24:45,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 08:24:45,018 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 52 states. [2018-09-26 08:24:45,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:45,064 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-09-26 08:24:45,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-09-26 08:24:45,064 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 101 [2018-09-26 08:24:45,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:45,065 INFO L225 Difference]: With dead ends: 105 [2018-09-26 08:24:45,065 INFO L226 Difference]: Without dead ends: 104 [2018-09-26 08:24:45,066 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 08:24:45,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-09-26 08:24:45,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-09-26 08:24:45,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-09-26 08:24:45,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-09-26 08:24:45,071 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 101 [2018-09-26 08:24:45,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:45,071 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-09-26 08:24:45,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-09-26 08:24:45,071 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-09-26 08:24:45,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-09-26 08:24:45,072 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:45,072 INFO L375 BasicCegarLoop]: trace histogram [51, 50, 1, 1] [2018-09-26 08:24:45,073 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:45,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:45,073 INFO L82 PathProgramCache]: Analyzing trace with hash -315445948, now seen corresponding path program 50 times [2018-09-26 08:24:45,073 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:45,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:45,292 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:45,293 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:45,293 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-09-26 08:24:45,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-09-26 08:24:45,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-09-26 08:24:45,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-09-26 08:24:45,295 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 53 states. [2018-09-26 08:24:45,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:45,355 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-09-26 08:24:45,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-09-26 08:24:45,355 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 103 [2018-09-26 08:24:45,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:45,356 INFO L225 Difference]: With dead ends: 107 [2018-09-26 08:24:45,356 INFO L226 Difference]: Without dead ends: 106 [2018-09-26 08:24:45,357 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-09-26 08:24:45,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-09-26 08:24:45,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-09-26 08:24:45,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-09-26 08:24:45,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-09-26 08:24:45,365 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 103 [2018-09-26 08:24:45,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:45,366 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-09-26 08:24:45,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-09-26 08:24:45,366 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-09-26 08:24:45,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-09-26 08:24:45,368 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:45,368 INFO L375 BasicCegarLoop]: trace histogram [52, 51, 1, 1] [2018-09-26 08:24:45,369 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:45,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:45,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1799123078, now seen corresponding path program 51 times [2018-09-26 08:24:45,369 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:45,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:45,612 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:45,612 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:45,612 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-09-26 08:24:45,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-09-26 08:24:45,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-09-26 08:24:45,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 08:24:45,614 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 54 states. [2018-09-26 08:24:45,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:45,670 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-09-26 08:24:45,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-09-26 08:24:45,670 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 105 [2018-09-26 08:24:45,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:45,671 INFO L225 Difference]: With dead ends: 109 [2018-09-26 08:24:45,671 INFO L226 Difference]: Without dead ends: 108 [2018-09-26 08:24:45,672 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 08:24:45,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-09-26 08:24:45,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-09-26 08:24:45,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-09-26 08:24:45,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-09-26 08:24:45,679 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 105 [2018-09-26 08:24:45,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:45,679 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-09-26 08:24:45,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-09-26 08:24:45,679 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-09-26 08:24:45,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-09-26 08:24:45,680 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:45,681 INFO L375 BasicCegarLoop]: trace histogram [53, 52, 1, 1] [2018-09-26 08:24:45,681 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:45,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:45,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1914541240, now seen corresponding path program 52 times [2018-09-26 08:24:45,681 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:45,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:45,936 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:45,936 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:45,936 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-09-26 08:24:45,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-09-26 08:24:45,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-09-26 08:24:45,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-09-26 08:24:45,938 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 55 states. [2018-09-26 08:24:46,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:46,001 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-09-26 08:24:46,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-09-26 08:24:46,001 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 107 [2018-09-26 08:24:46,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:46,002 INFO L225 Difference]: With dead ends: 111 [2018-09-26 08:24:46,002 INFO L226 Difference]: Without dead ends: 110 [2018-09-26 08:24:46,003 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-09-26 08:24:46,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-09-26 08:24:46,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-09-26 08:24:46,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-09-26 08:24:46,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-09-26 08:24:46,008 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 107 [2018-09-26 08:24:46,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:46,012 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-09-26 08:24:46,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-09-26 08:24:46,012 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-09-26 08:24:46,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-09-26 08:24:46,013 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:46,013 INFO L375 BasicCegarLoop]: trace histogram [54, 53, 1, 1] [2018-09-26 08:24:46,013 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:46,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:46,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1628127862, now seen corresponding path program 53 times [2018-09-26 08:24:46,014 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:46,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:46,286 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:46,286 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:46,286 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-09-26 08:24:46,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-09-26 08:24:46,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-09-26 08:24:46,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 08:24:46,288 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 56 states. [2018-09-26 08:24:46,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:46,357 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-09-26 08:24:46,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-09-26 08:24:46,358 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 109 [2018-09-26 08:24:46,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:46,359 INFO L225 Difference]: With dead ends: 113 [2018-09-26 08:24:46,359 INFO L226 Difference]: Without dead ends: 112 [2018-09-26 08:24:46,359 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 08:24:46,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-09-26 08:24:46,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-09-26 08:24:46,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-09-26 08:24:46,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-09-26 08:24:46,365 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 109 [2018-09-26 08:24:46,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:46,365 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-09-26 08:24:46,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-09-26 08:24:46,365 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-09-26 08:24:46,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-09-26 08:24:46,367 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:46,367 INFO L375 BasicCegarLoop]: trace histogram [55, 54, 1, 1] [2018-09-26 08:24:46,367 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:46,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:46,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1262778548, now seen corresponding path program 54 times [2018-09-26 08:24:46,367 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:46,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:46,686 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:46,686 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:46,686 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-09-26 08:24:46,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-09-26 08:24:46,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-09-26 08:24:46,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-09-26 08:24:46,688 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 57 states. [2018-09-26 08:24:46,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:46,762 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-09-26 08:24:46,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-09-26 08:24:46,763 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 111 [2018-09-26 08:24:46,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:46,764 INFO L225 Difference]: With dead ends: 115 [2018-09-26 08:24:46,765 INFO L226 Difference]: Without dead ends: 114 [2018-09-26 08:24:46,765 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-09-26 08:24:46,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-09-26 08:24:46,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-09-26 08:24:46,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-09-26 08:24:46,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2018-09-26 08:24:46,772 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 111 [2018-09-26 08:24:46,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:46,773 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2018-09-26 08:24:46,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-09-26 08:24:46,773 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2018-09-26 08:24:46,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-09-26 08:24:46,775 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:46,775 INFO L375 BasicCegarLoop]: trace histogram [56, 55, 1, 1] [2018-09-26 08:24:46,775 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:46,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:46,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1945561230, now seen corresponding path program 55 times [2018-09-26 08:24:46,776 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:46,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:47,109 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:47,109 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:47,110 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-09-26 08:24:47,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-09-26 08:24:47,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-09-26 08:24:47,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 08:24:47,114 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 58 states. [2018-09-26 08:24:47,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:47,182 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-09-26 08:24:47,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-09-26 08:24:47,182 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 113 [2018-09-26 08:24:47,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:47,183 INFO L225 Difference]: With dead ends: 117 [2018-09-26 08:24:47,183 INFO L226 Difference]: Without dead ends: 116 [2018-09-26 08:24:47,184 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 08:24:47,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-09-26 08:24:47,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-09-26 08:24:47,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-09-26 08:24:47,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2018-09-26 08:24:47,189 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 113 [2018-09-26 08:24:47,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:47,189 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2018-09-26 08:24:47,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-09-26 08:24:47,189 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2018-09-26 08:24:47,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-09-26 08:24:47,190 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:47,190 INFO L375 BasicCegarLoop]: trace histogram [57, 56, 1, 1] [2018-09-26 08:24:47,191 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:47,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:47,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1373569360, now seen corresponding path program 56 times [2018-09-26 08:24:47,191 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:47,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:47,433 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:47,433 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:47,434 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-09-26 08:24:47,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-09-26 08:24:47,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-09-26 08:24:47,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-09-26 08:24:47,438 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 59 states. [2018-09-26 08:24:47,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:47,510 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-09-26 08:24:47,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-09-26 08:24:47,510 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 115 [2018-09-26 08:24:47,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:47,511 INFO L225 Difference]: With dead ends: 119 [2018-09-26 08:24:47,511 INFO L226 Difference]: Without dead ends: 118 [2018-09-26 08:24:47,512 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-09-26 08:24:47,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-09-26 08:24:47,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-09-26 08:24:47,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-09-26 08:24:47,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2018-09-26 08:24:47,517 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 115 [2018-09-26 08:24:47,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:47,517 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2018-09-26 08:24:47,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-09-26 08:24:47,518 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2018-09-26 08:24:47,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-09-26 08:24:47,519 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:47,519 INFO L375 BasicCegarLoop]: trace histogram [58, 57, 1, 1] [2018-09-26 08:24:47,519 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:47,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:47,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1445196178, now seen corresponding path program 57 times [2018-09-26 08:24:47,520 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:47,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:47,762 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:47,762 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:47,762 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-09-26 08:24:47,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-09-26 08:24:47,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-09-26 08:24:47,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-09-26 08:24:47,764 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 60 states. [2018-09-26 08:24:47,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:47,830 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-09-26 08:24:47,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-09-26 08:24:47,831 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 117 [2018-09-26 08:24:47,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:47,832 INFO L225 Difference]: With dead ends: 121 [2018-09-26 08:24:47,832 INFO L226 Difference]: Without dead ends: 120 [2018-09-26 08:24:47,833 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-09-26 08:24:47,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-09-26 08:24:47,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-09-26 08:24:47,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-09-26 08:24:47,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2018-09-26 08:24:47,837 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 117 [2018-09-26 08:24:47,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:47,838 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2018-09-26 08:24:47,838 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-09-26 08:24:47,838 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2018-09-26 08:24:47,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-09-26 08:24:47,839 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:47,839 INFO L375 BasicCegarLoop]: trace histogram [59, 58, 1, 1] [2018-09-26 08:24:47,839 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:47,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:47,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1559091540, now seen corresponding path program 58 times [2018-09-26 08:24:47,840 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:47,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:48,087 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:48,087 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:48,088 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-09-26 08:24:48,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-09-26 08:24:48,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-09-26 08:24:48,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-09-26 08:24:48,089 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 61 states. [2018-09-26 08:24:48,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:48,159 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-09-26 08:24:48,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-09-26 08:24:48,159 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 119 [2018-09-26 08:24:48,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:48,160 INFO L225 Difference]: With dead ends: 123 [2018-09-26 08:24:48,160 INFO L226 Difference]: Without dead ends: 122 [2018-09-26 08:24:48,161 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-09-26 08:24:48,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-09-26 08:24:48,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-09-26 08:24:48,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-09-26 08:24:48,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2018-09-26 08:24:48,166 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 119 [2018-09-26 08:24:48,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:48,166 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2018-09-26 08:24:48,167 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-09-26 08:24:48,167 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2018-09-26 08:24:48,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-09-26 08:24:48,168 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:48,168 INFO L375 BasicCegarLoop]: trace histogram [60, 59, 1, 1] [2018-09-26 08:24:48,168 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:48,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:48,168 INFO L82 PathProgramCache]: Analyzing trace with hash -656615274, now seen corresponding path program 59 times [2018-09-26 08:24:48,169 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:48,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:48,425 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:48,425 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:48,425 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-09-26 08:24:48,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-09-26 08:24:48,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-09-26 08:24:48,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 08:24:48,427 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 62 states. [2018-09-26 08:24:48,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:48,479 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2018-09-26 08:24:48,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-09-26 08:24:48,479 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 121 [2018-09-26 08:24:48,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:48,480 INFO L225 Difference]: With dead ends: 125 [2018-09-26 08:24:48,480 INFO L226 Difference]: Without dead ends: 124 [2018-09-26 08:24:48,481 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 08:24:48,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-09-26 08:24:48,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-09-26 08:24:48,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-09-26 08:24:48,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2018-09-26 08:24:48,486 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 121 [2018-09-26 08:24:48,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:48,487 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2018-09-26 08:24:48,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-09-26 08:24:48,487 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2018-09-26 08:24:48,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-09-26 08:24:48,488 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:48,488 INFO L375 BasicCegarLoop]: trace histogram [61, 60, 1, 1] [2018-09-26 08:24:48,488 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:48,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:48,489 INFO L82 PathProgramCache]: Analyzing trace with hash 352915288, now seen corresponding path program 60 times [2018-09-26 08:24:48,489 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:48,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:48,752 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:48,753 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:48,753 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-09-26 08:24:48,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-09-26 08:24:48,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-09-26 08:24:48,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-09-26 08:24:48,755 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 63 states. [2018-09-26 08:24:48,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:48,831 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-09-26 08:24:48,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-09-26 08:24:48,832 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 123 [2018-09-26 08:24:48,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:48,833 INFO L225 Difference]: With dead ends: 127 [2018-09-26 08:24:48,833 INFO L226 Difference]: Without dead ends: 126 [2018-09-26 08:24:48,833 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-09-26 08:24:48,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-09-26 08:24:48,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-09-26 08:24:48,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-09-26 08:24:48,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2018-09-26 08:24:48,840 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 123 [2018-09-26 08:24:48,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:48,840 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2018-09-26 08:24:48,840 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-09-26 08:24:48,840 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2018-09-26 08:24:48,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-09-26 08:24:48,841 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:48,841 INFO L375 BasicCegarLoop]: trace histogram [62, 61, 1, 1] [2018-09-26 08:24:48,842 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:48,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:48,842 INFO L82 PathProgramCache]: Analyzing trace with hash -150823526, now seen corresponding path program 61 times [2018-09-26 08:24:48,842 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:48,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:49,110 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:49,111 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:49,111 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-09-26 08:24:49,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-09-26 08:24:49,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-09-26 08:24:49,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 08:24:49,113 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 64 states. [2018-09-26 08:24:49,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:49,198 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-09-26 08:24:49,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-09-26 08:24:49,198 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 125 [2018-09-26 08:24:49,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:49,199 INFO L225 Difference]: With dead ends: 129 [2018-09-26 08:24:49,199 INFO L226 Difference]: Without dead ends: 128 [2018-09-26 08:24:49,200 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 08:24:49,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-09-26 08:24:49,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-09-26 08:24:49,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-09-26 08:24:49,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2018-09-26 08:24:49,205 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 125 [2018-09-26 08:24:49,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:49,206 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2018-09-26 08:24:49,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-09-26 08:24:49,206 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2018-09-26 08:24:49,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-09-26 08:24:49,207 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:49,207 INFO L375 BasicCegarLoop]: trace histogram [63, 62, 1, 1] [2018-09-26 08:24:49,207 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:49,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:49,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1087480668, now seen corresponding path program 62 times [2018-09-26 08:24:49,208 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:49,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:49,455 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:49,455 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:49,456 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-09-26 08:24:49,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-09-26 08:24:49,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-09-26 08:24:49,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-09-26 08:24:49,457 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 65 states. [2018-09-26 08:24:49,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:49,539 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-09-26 08:24:49,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-09-26 08:24:49,539 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 127 [2018-09-26 08:24:49,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:49,541 INFO L225 Difference]: With dead ends: 131 [2018-09-26 08:24:49,541 INFO L226 Difference]: Without dead ends: 130 [2018-09-26 08:24:49,541 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-09-26 08:24:49,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-09-26 08:24:49,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-09-26 08:24:49,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-09-26 08:24:49,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2018-09-26 08:24:49,546 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 127 [2018-09-26 08:24:49,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:49,547 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2018-09-26 08:24:49,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-09-26 08:24:49,547 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2018-09-26 08:24:49,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-09-26 08:24:49,548 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:49,548 INFO L375 BasicCegarLoop]: trace histogram [64, 63, 1, 1] [2018-09-26 08:24:49,548 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:49,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:49,549 INFO L82 PathProgramCache]: Analyzing trace with hash 1391870110, now seen corresponding path program 63 times [2018-09-26 08:24:49,549 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:49,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:49,820 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:49,821 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:49,821 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-09-26 08:24:49,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-09-26 08:24:49,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-09-26 08:24:49,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 08:24:49,823 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 66 states. [2018-09-26 08:24:49,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:49,880 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2018-09-26 08:24:49,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-09-26 08:24:49,880 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 129 [2018-09-26 08:24:49,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:49,881 INFO L225 Difference]: With dead ends: 133 [2018-09-26 08:24:49,881 INFO L226 Difference]: Without dead ends: 132 [2018-09-26 08:24:49,882 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 08:24:49,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-09-26 08:24:49,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-09-26 08:24:49,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-09-26 08:24:49,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2018-09-26 08:24:49,887 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 129 [2018-09-26 08:24:49,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:49,887 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2018-09-26 08:24:49,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-09-26 08:24:49,888 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2018-09-26 08:24:49,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-09-26 08:24:49,890 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:49,890 INFO L375 BasicCegarLoop]: trace histogram [65, 64, 1, 1] [2018-09-26 08:24:49,890 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:49,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:49,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1852347744, now seen corresponding path program 64 times [2018-09-26 08:24:49,891 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:49,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:50,176 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:50,177 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:50,177 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-09-26 08:24:50,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-09-26 08:24:50,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-09-26 08:24:50,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-09-26 08:24:50,179 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 67 states. [2018-09-26 08:24:50,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:50,257 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-09-26 08:24:50,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-09-26 08:24:50,257 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 131 [2018-09-26 08:24:50,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:50,258 INFO L225 Difference]: With dead ends: 135 [2018-09-26 08:24:50,258 INFO L226 Difference]: Without dead ends: 134 [2018-09-26 08:24:50,259 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-09-26 08:24:50,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-09-26 08:24:50,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-09-26 08:24:50,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-09-26 08:24:50,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 134 transitions. [2018-09-26 08:24:50,263 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 134 transitions. Word has length 131 [2018-09-26 08:24:50,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:50,264 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 134 transitions. [2018-09-26 08:24:50,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-09-26 08:24:50,264 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2018-09-26 08:24:50,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-09-26 08:24:50,267 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:50,267 INFO L375 BasicCegarLoop]: trace histogram [66, 65, 1, 1] [2018-09-26 08:24:50,267 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:50,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:50,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1989722530, now seen corresponding path program 65 times [2018-09-26 08:24:50,268 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:50,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:50,553 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:50,554 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:50,554 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-09-26 08:24:50,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-09-26 08:24:50,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-09-26 08:24:50,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 08:24:50,556 INFO L87 Difference]: Start difference. First operand 134 states and 134 transitions. Second operand 68 states. [2018-09-26 08:24:50,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:50,643 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2018-09-26 08:24:50,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-09-26 08:24:50,643 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 133 [2018-09-26 08:24:50,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:50,644 INFO L225 Difference]: With dead ends: 137 [2018-09-26 08:24:50,644 INFO L226 Difference]: Without dead ends: 136 [2018-09-26 08:24:50,645 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 08:24:50,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-09-26 08:24:50,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-09-26 08:24:50,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-09-26 08:24:50,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2018-09-26 08:24:50,649 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 133 [2018-09-26 08:24:50,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:50,649 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2018-09-26 08:24:50,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-09-26 08:24:50,650 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2018-09-26 08:24:50,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-09-26 08:24:50,650 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:50,650 INFO L375 BasicCegarLoop]: trace histogram [67, 66, 1, 1] [2018-09-26 08:24:50,651 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:50,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:50,651 INFO L82 PathProgramCache]: Analyzing trace with hash 862905700, now seen corresponding path program 66 times [2018-09-26 08:24:50,651 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:50,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:50,957 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:50,958 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:50,958 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-09-26 08:24:50,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-09-26 08:24:50,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-09-26 08:24:50,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-09-26 08:24:50,960 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 69 states. [2018-09-26 08:24:51,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:51,034 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-09-26 08:24:51,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-09-26 08:24:51,035 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 135 [2018-09-26 08:24:51,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:51,036 INFO L225 Difference]: With dead ends: 139 [2018-09-26 08:24:51,036 INFO L226 Difference]: Without dead ends: 138 [2018-09-26 08:24:51,036 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-09-26 08:24:51,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-09-26 08:24:51,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-09-26 08:24:51,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-09-26 08:24:51,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2018-09-26 08:24:51,041 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 135 [2018-09-26 08:24:51,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:51,041 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 138 transitions. [2018-09-26 08:24:51,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-09-26 08:24:51,042 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2018-09-26 08:24:51,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-09-26 08:24:51,042 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:51,042 INFO L375 BasicCegarLoop]: trace histogram [68, 67, 1, 1] [2018-09-26 08:24:51,043 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:51,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:51,043 INFO L82 PathProgramCache]: Analyzing trace with hash 323690662, now seen corresponding path program 67 times [2018-09-26 08:24:51,043 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:51,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:51,356 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:51,356 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:51,356 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-09-26 08:24:51,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-09-26 08:24:51,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-09-26 08:24:51,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 08:24:51,358 INFO L87 Difference]: Start difference. First operand 138 states and 138 transitions. Second operand 70 states. [2018-09-26 08:24:51,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:51,425 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-09-26 08:24:51,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-09-26 08:24:51,426 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 137 [2018-09-26 08:24:51,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:51,427 INFO L225 Difference]: With dead ends: 141 [2018-09-26 08:24:51,427 INFO L226 Difference]: Without dead ends: 140 [2018-09-26 08:24:51,428 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 08:24:51,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-09-26 08:24:51,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-09-26 08:24:51,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-09-26 08:24:51,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 140 transitions. [2018-09-26 08:24:51,433 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 140 transitions. Word has length 137 [2018-09-26 08:24:51,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:51,434 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 140 transitions. [2018-09-26 08:24:51,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-09-26 08:24:51,434 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 140 transitions. [2018-09-26 08:24:51,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-09-26 08:24:51,435 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:51,435 INFO L375 BasicCegarLoop]: trace histogram [69, 68, 1, 1] [2018-09-26 08:24:51,435 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:51,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:51,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1829081960, now seen corresponding path program 68 times [2018-09-26 08:24:51,436 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:51,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:51,882 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:51,882 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:51,882 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-09-26 08:24:51,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-09-26 08:24:51,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-09-26 08:24:51,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-09-26 08:24:51,884 INFO L87 Difference]: Start difference. First operand 140 states and 140 transitions. Second operand 71 states. [2018-09-26 08:24:51,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:51,948 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-09-26 08:24:51,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-09-26 08:24:51,948 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 139 [2018-09-26 08:24:51,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:51,949 INFO L225 Difference]: With dead ends: 143 [2018-09-26 08:24:51,949 INFO L226 Difference]: Without dead ends: 142 [2018-09-26 08:24:51,950 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-09-26 08:24:51,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-09-26 08:24:51,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-09-26 08:24:51,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-09-26 08:24:51,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2018-09-26 08:24:51,954 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 139 [2018-09-26 08:24:51,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:51,955 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2018-09-26 08:24:51,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-09-26 08:24:51,955 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2018-09-26 08:24:51,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-09-26 08:24:51,956 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:51,956 INFO L375 BasicCegarLoop]: trace histogram [70, 69, 1, 1] [2018-09-26 08:24:51,956 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:51,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:51,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1106140586, now seen corresponding path program 69 times [2018-09-26 08:24:51,957 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:51,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:52,283 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:52,284 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:52,284 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-09-26 08:24:52,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-09-26 08:24:52,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-09-26 08:24:52,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-09-26 08:24:52,286 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand 72 states. [2018-09-26 08:24:52,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:52,351 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2018-09-26 08:24:52,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-09-26 08:24:52,351 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 141 [2018-09-26 08:24:52,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:52,352 INFO L225 Difference]: With dead ends: 145 [2018-09-26 08:24:52,353 INFO L226 Difference]: Without dead ends: 144 [2018-09-26 08:24:52,353 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-09-26 08:24:52,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-09-26 08:24:52,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-09-26 08:24:52,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-09-26 08:24:52,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 144 transitions. [2018-09-26 08:24:52,359 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 144 transitions. Word has length 141 [2018-09-26 08:24:52,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:52,360 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 144 transitions. [2018-09-26 08:24:52,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-09-26 08:24:52,360 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 144 transitions. [2018-09-26 08:24:52,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-09-26 08:24:52,361 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:52,362 INFO L375 BasicCegarLoop]: trace histogram [71, 70, 1, 1] [2018-09-26 08:24:52,362 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:52,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:52,363 INFO L82 PathProgramCache]: Analyzing trace with hash 2144182124, now seen corresponding path program 70 times [2018-09-26 08:24:52,363 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:52,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:52,699 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:52,699 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:52,699 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-09-26 08:24:52,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-09-26 08:24:52,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-09-26 08:24:52,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-09-26 08:24:52,701 INFO L87 Difference]: Start difference. First operand 144 states and 144 transitions. Second operand 73 states. [2018-09-26 08:24:52,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:52,777 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-09-26 08:24:52,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-09-26 08:24:52,777 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 143 [2018-09-26 08:24:52,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:52,778 INFO L225 Difference]: With dead ends: 147 [2018-09-26 08:24:52,778 INFO L226 Difference]: Without dead ends: 146 [2018-09-26 08:24:52,779 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-09-26 08:24:52,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-09-26 08:24:52,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-09-26 08:24:52,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-09-26 08:24:52,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2018-09-26 08:24:52,783 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 143 [2018-09-26 08:24:52,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:52,784 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2018-09-26 08:24:52,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-09-26 08:24:52,784 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2018-09-26 08:24:52,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-09-26 08:24:52,785 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:52,785 INFO L375 BasicCegarLoop]: trace histogram [72, 71, 1, 1] [2018-09-26 08:24:52,785 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:52,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:52,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1025279826, now seen corresponding path program 71 times [2018-09-26 08:24:52,786 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:52,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:53,112 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:53,113 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:53,113 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-09-26 08:24:53,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-09-26 08:24:53,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-09-26 08:24:53,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 08:24:53,115 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 74 states. [2018-09-26 08:24:53,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:53,214 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2018-09-26 08:24:53,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-09-26 08:24:53,214 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 145 [2018-09-26 08:24:53,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:53,215 INFO L225 Difference]: With dead ends: 149 [2018-09-26 08:24:53,216 INFO L226 Difference]: Without dead ends: 148 [2018-09-26 08:24:53,216 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 08:24:53,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-09-26 08:24:53,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-09-26 08:24:53,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-09-26 08:24:53,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2018-09-26 08:24:53,221 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 145 [2018-09-26 08:24:53,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:53,221 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2018-09-26 08:24:53,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-09-26 08:24:53,221 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2018-09-26 08:24:53,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-09-26 08:24:53,222 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:53,222 INFO L375 BasicCegarLoop]: trace histogram [73, 72, 1, 1] [2018-09-26 08:24:53,223 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:53,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:53,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1746400912, now seen corresponding path program 72 times [2018-09-26 08:24:53,223 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:53,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:53,562 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:53,562 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:53,562 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-09-26 08:24:53,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-09-26 08:24:53,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-09-26 08:24:53,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-09-26 08:24:53,564 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 75 states. [2018-09-26 08:24:53,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:53,677 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-09-26 08:24:53,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-09-26 08:24:53,678 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 147 [2018-09-26 08:24:53,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:53,679 INFO L225 Difference]: With dead ends: 151 [2018-09-26 08:24:53,679 INFO L226 Difference]: Without dead ends: 150 [2018-09-26 08:24:53,680 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-09-26 08:24:53,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-09-26 08:24:53,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-09-26 08:24:53,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-09-26 08:24:53,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 150 transitions. [2018-09-26 08:24:53,684 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 150 transitions. Word has length 147 [2018-09-26 08:24:53,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:53,685 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 150 transitions. [2018-09-26 08:24:53,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-09-26 08:24:53,685 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 150 transitions. [2018-09-26 08:24:53,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-09-26 08:24:53,686 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:53,686 INFO L375 BasicCegarLoop]: trace histogram [74, 73, 1, 1] [2018-09-26 08:24:53,686 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:53,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:53,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1040937394, now seen corresponding path program 73 times [2018-09-26 08:24:53,687 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:53,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:53,991 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:53,991 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:53,991 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-09-26 08:24:53,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-09-26 08:24:53,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-09-26 08:24:53,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-09-26 08:24:53,993 INFO L87 Difference]: Start difference. First operand 150 states and 150 transitions. Second operand 76 states. [2018-09-26 08:24:54,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:54,095 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-09-26 08:24:54,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-09-26 08:24:54,095 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 149 [2018-09-26 08:24:54,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:54,096 INFO L225 Difference]: With dead ends: 153 [2018-09-26 08:24:54,096 INFO L226 Difference]: Without dead ends: 152 [2018-09-26 08:24:54,097 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-09-26 08:24:54,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-09-26 08:24:54,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-09-26 08:24:54,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-09-26 08:24:54,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2018-09-26 08:24:54,102 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 149 [2018-09-26 08:24:54,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:54,102 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2018-09-26 08:24:54,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-09-26 08:24:54,102 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2018-09-26 08:24:54,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-09-26 08:24:54,103 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:54,103 INFO L375 BasicCegarLoop]: trace histogram [75, 74, 1, 1] [2018-09-26 08:24:54,104 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:54,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:54,104 INFO L82 PathProgramCache]: Analyzing trace with hash -386543244, now seen corresponding path program 74 times [2018-09-26 08:24:54,104 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:54,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:54,492 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:54,492 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:54,493 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-09-26 08:24:54,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-09-26 08:24:54,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-09-26 08:24:54,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-09-26 08:24:54,495 INFO L87 Difference]: Start difference. First operand 152 states and 152 transitions. Second operand 77 states. [2018-09-26 08:24:54,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:54,587 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-09-26 08:24:54,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-09-26 08:24:54,587 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 151 [2018-09-26 08:24:54,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:54,588 INFO L225 Difference]: With dead ends: 155 [2018-09-26 08:24:54,588 INFO L226 Difference]: Without dead ends: 154 [2018-09-26 08:24:54,589 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-09-26 08:24:54,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-09-26 08:24:54,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-09-26 08:24:54,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-09-26 08:24:54,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 154 transitions. [2018-09-26 08:24:54,594 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 154 transitions. Word has length 151 [2018-09-26 08:24:54,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:54,595 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 154 transitions. [2018-09-26 08:24:54,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-09-26 08:24:54,595 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 154 transitions. [2018-09-26 08:24:54,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-09-26 08:24:54,595 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:54,596 INFO L375 BasicCegarLoop]: trace histogram [76, 75, 1, 1] [2018-09-26 08:24:54,596 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:54,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:54,596 INFO L82 PathProgramCache]: Analyzing trace with hash -2100868938, now seen corresponding path program 75 times [2018-09-26 08:24:54,596 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:54,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:54,976 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:54,976 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:54,976 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-09-26 08:24:54,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-09-26 08:24:54,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-09-26 08:24:54,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 08:24:54,978 INFO L87 Difference]: Start difference. First operand 154 states and 154 transitions. Second operand 78 states. [2018-09-26 08:24:55,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:55,077 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2018-09-26 08:24:55,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-09-26 08:24:55,077 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 153 [2018-09-26 08:24:55,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:55,079 INFO L225 Difference]: With dead ends: 157 [2018-09-26 08:24:55,079 INFO L226 Difference]: Without dead ends: 156 [2018-09-26 08:24:55,079 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 08:24:55,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-09-26 08:24:55,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-09-26 08:24:55,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-09-26 08:24:55,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2018-09-26 08:24:55,084 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 153 [2018-09-26 08:24:55,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:55,085 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2018-09-26 08:24:55,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-09-26 08:24:55,085 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2018-09-26 08:24:55,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-09-26 08:24:55,086 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:55,086 INFO L375 BasicCegarLoop]: trace histogram [77, 76, 1, 1] [2018-09-26 08:24:55,086 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:55,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:55,087 INFO L82 PathProgramCache]: Analyzing trace with hash -300419208, now seen corresponding path program 76 times [2018-09-26 08:24:55,087 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:55,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:55,352 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:55,353 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:55,353 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-09-26 08:24:55,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-09-26 08:24:55,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-09-26 08:24:55,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-09-26 08:24:55,356 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 79 states. [2018-09-26 08:24:55,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:55,416 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-09-26 08:24:55,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-09-26 08:24:55,416 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 155 [2018-09-26 08:24:55,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:55,417 INFO L225 Difference]: With dead ends: 159 [2018-09-26 08:24:55,417 INFO L226 Difference]: Without dead ends: 158 [2018-09-26 08:24:55,418 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-09-26 08:24:55,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-09-26 08:24:55,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2018-09-26 08:24:55,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-09-26 08:24:55,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 158 transitions. [2018-09-26 08:24:55,425 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 158 transitions. Word has length 155 [2018-09-26 08:24:55,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:55,426 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 158 transitions. [2018-09-26 08:24:55,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-09-26 08:24:55,426 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 158 transitions. [2018-09-26 08:24:55,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-09-26 08:24:55,427 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:55,427 INFO L375 BasicCegarLoop]: trace histogram [78, 77, 1, 1] [2018-09-26 08:24:55,427 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:55,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:55,428 INFO L82 PathProgramCache]: Analyzing trace with hash -940048966, now seen corresponding path program 77 times [2018-09-26 08:24:55,428 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:55,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:55,704 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:55,705 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:55,705 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-09-26 08:24:55,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-09-26 08:24:55,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-09-26 08:24:55,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 08:24:55,706 INFO L87 Difference]: Start difference. First operand 158 states and 158 transitions. Second operand 80 states. [2018-09-26 08:24:55,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:55,788 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2018-09-26 08:24:55,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-09-26 08:24:55,788 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 157 [2018-09-26 08:24:55,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:55,789 INFO L225 Difference]: With dead ends: 161 [2018-09-26 08:24:55,789 INFO L226 Difference]: Without dead ends: 160 [2018-09-26 08:24:55,790 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 08:24:55,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-09-26 08:24:55,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2018-09-26 08:24:55,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-09-26 08:24:55,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 160 transitions. [2018-09-26 08:24:55,795 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 160 transitions. Word has length 157 [2018-09-26 08:24:55,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:55,796 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 160 transitions. [2018-09-26 08:24:55,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-09-26 08:24:55,796 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 160 transitions. [2018-09-26 08:24:55,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-09-26 08:24:55,797 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:55,797 INFO L375 BasicCegarLoop]: trace histogram [79, 78, 1, 1] [2018-09-26 08:24:55,797 INFO L423 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:55,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:55,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1443923076, now seen corresponding path program 78 times [2018-09-26 08:24:55,798 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:55,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:56,048 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:56,049 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:56,049 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-09-26 08:24:56,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-09-26 08:24:56,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-09-26 08:24:56,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-09-26 08:24:56,051 INFO L87 Difference]: Start difference. First operand 160 states and 160 transitions. Second operand 81 states. [2018-09-26 08:24:56,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:56,169 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-09-26 08:24:56,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-09-26 08:24:56,169 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 159 [2018-09-26 08:24:56,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:56,170 INFO L225 Difference]: With dead ends: 163 [2018-09-26 08:24:56,170 INFO L226 Difference]: Without dead ends: 162 [2018-09-26 08:24:56,171 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-09-26 08:24:56,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-09-26 08:24:56,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-09-26 08:24:56,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-09-26 08:24:56,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 162 transitions. [2018-09-26 08:24:56,176 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 162 transitions. Word has length 159 [2018-09-26 08:24:56,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:56,176 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 162 transitions. [2018-09-26 08:24:56,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-09-26 08:24:56,176 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2018-09-26 08:24:56,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-09-26 08:24:56,177 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:56,177 INFO L375 BasicCegarLoop]: trace histogram [80, 79, 1, 1] [2018-09-26 08:24:56,177 INFO L423 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:56,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:56,177 INFO L82 PathProgramCache]: Analyzing trace with hash -335638338, now seen corresponding path program 79 times [2018-09-26 08:24:56,178 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:56,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:56,543 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:56,543 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:56,544 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-09-26 08:24:56,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-09-26 08:24:56,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-09-26 08:24:56,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 08:24:56,546 INFO L87 Difference]: Start difference. First operand 162 states and 162 transitions. Second operand 82 states. [2018-09-26 08:24:56,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:56,599 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2018-09-26 08:24:56,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-09-26 08:24:56,599 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 161 [2018-09-26 08:24:56,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:56,601 INFO L225 Difference]: With dead ends: 165 [2018-09-26 08:24:56,601 INFO L226 Difference]: Without dead ends: 164 [2018-09-26 08:24:56,602 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 08:24:56,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-09-26 08:24:56,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2018-09-26 08:24:56,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-09-26 08:24:56,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 164 transitions. [2018-09-26 08:24:56,609 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 164 transitions. Word has length 161 [2018-09-26 08:24:56,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:56,609 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 164 transitions. [2018-09-26 08:24:56,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-09-26 08:24:56,610 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 164 transitions. [2018-09-26 08:24:56,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-09-26 08:24:56,611 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:56,611 INFO L375 BasicCegarLoop]: trace histogram [81, 80, 1, 1] [2018-09-26 08:24:56,611 INFO L423 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:56,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:56,612 INFO L82 PathProgramCache]: Analyzing trace with hash -425894528, now seen corresponding path program 80 times [2018-09-26 08:24:56,612 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:56,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:56,902 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:56,902 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:56,902 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-09-26 08:24:56,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-09-26 08:24:56,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-09-26 08:24:56,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-09-26 08:24:56,904 INFO L87 Difference]: Start difference. First operand 164 states and 164 transitions. Second operand 83 states. [2018-09-26 08:24:57,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:57,020 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-09-26 08:24:57,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-09-26 08:24:57,020 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 163 [2018-09-26 08:24:57,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:57,022 INFO L225 Difference]: With dead ends: 167 [2018-09-26 08:24:57,022 INFO L226 Difference]: Without dead ends: 166 [2018-09-26 08:24:57,022 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-09-26 08:24:57,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-09-26 08:24:57,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-09-26 08:24:57,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-09-26 08:24:57,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2018-09-26 08:24:57,028 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 163 [2018-09-26 08:24:57,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:57,028 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2018-09-26 08:24:57,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-09-26 08:24:57,028 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2018-09-26 08:24:57,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-09-26 08:24:57,029 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:57,029 INFO L375 BasicCegarLoop]: trace histogram [82, 81, 1, 1] [2018-09-26 08:24:57,030 INFO L423 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:57,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:57,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1262747198, now seen corresponding path program 81 times [2018-09-26 08:24:57,030 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:57,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:57,293 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:57,293 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:57,293 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-09-26 08:24:57,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-09-26 08:24:57,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-09-26 08:24:57,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-09-26 08:24:57,295 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 84 states. [2018-09-26 08:24:57,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:57,396 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2018-09-26 08:24:57,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-09-26 08:24:57,396 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 165 [2018-09-26 08:24:57,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:57,397 INFO L225 Difference]: With dead ends: 169 [2018-09-26 08:24:57,397 INFO L226 Difference]: Without dead ends: 168 [2018-09-26 08:24:57,398 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-09-26 08:24:57,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-09-26 08:24:57,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2018-09-26 08:24:57,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-09-26 08:24:57,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 168 transitions. [2018-09-26 08:24:57,403 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 168 transitions. Word has length 165 [2018-09-26 08:24:57,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:57,403 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 168 transitions. [2018-09-26 08:24:57,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-09-26 08:24:57,403 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 168 transitions. [2018-09-26 08:24:57,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-09-26 08:24:57,404 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:57,404 INFO L375 BasicCegarLoop]: trace histogram [83, 82, 1, 1] [2018-09-26 08:24:57,405 INFO L423 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:57,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:57,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1975688580, now seen corresponding path program 82 times [2018-09-26 08:24:57,405 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:57,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:57,656 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:57,657 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:57,657 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-09-26 08:24:57,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-09-26 08:24:57,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-09-26 08:24:57,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-09-26 08:24:57,658 INFO L87 Difference]: Start difference. First operand 168 states and 168 transitions. Second operand 85 states. [2018-09-26 08:24:57,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:57,753 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-09-26 08:24:57,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-09-26 08:24:57,753 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 167 [2018-09-26 08:24:57,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:57,754 INFO L225 Difference]: With dead ends: 171 [2018-09-26 08:24:57,754 INFO L226 Difference]: Without dead ends: 170 [2018-09-26 08:24:57,755 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-09-26 08:24:57,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-09-26 08:24:57,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2018-09-26 08:24:57,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-09-26 08:24:57,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 170 transitions. [2018-09-26 08:24:57,760 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 170 transitions. Word has length 167 [2018-09-26 08:24:57,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:57,761 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 170 transitions. [2018-09-26 08:24:57,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-09-26 08:24:57,761 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 170 transitions. [2018-09-26 08:24:57,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-09-26 08:24:57,762 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:57,762 INFO L375 BasicCegarLoop]: trace histogram [84, 83, 1, 1] [2018-09-26 08:24:57,762 INFO L423 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:57,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:57,763 INFO L82 PathProgramCache]: Analyzing trace with hash 261181638, now seen corresponding path program 83 times [2018-09-26 08:24:57,763 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:57,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:58,029 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:58,029 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:58,029 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-09-26 08:24:58,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-09-26 08:24:58,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-09-26 08:24:58,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 08:24:58,031 INFO L87 Difference]: Start difference. First operand 170 states and 170 transitions. Second operand 86 states. [2018-09-26 08:24:58,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:58,130 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2018-09-26 08:24:58,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-09-26 08:24:58,131 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 169 [2018-09-26 08:24:58,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:58,132 INFO L225 Difference]: With dead ends: 173 [2018-09-26 08:24:58,132 INFO L226 Difference]: Without dead ends: 172 [2018-09-26 08:24:58,133 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 08:24:58,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-09-26 08:24:58,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2018-09-26 08:24:58,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-09-26 08:24:58,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2018-09-26 08:24:58,137 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 169 [2018-09-26 08:24:58,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:58,138 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 172 transitions. [2018-09-26 08:24:58,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-09-26 08:24:58,138 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 172 transitions. [2018-09-26 08:24:58,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-09-26 08:24:58,139 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:58,139 INFO L375 BasicCegarLoop]: trace histogram [85, 84, 1, 1] [2018-09-26 08:24:58,139 INFO L423 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:58,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:58,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1887452040, now seen corresponding path program 84 times [2018-09-26 08:24:58,140 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:58,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:58,468 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:58,468 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:58,468 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-09-26 08:24:58,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-09-26 08:24:58,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-09-26 08:24:58,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-09-26 08:24:58,470 INFO L87 Difference]: Start difference. First operand 172 states and 172 transitions. Second operand 87 states. [2018-09-26 08:24:58,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:58,575 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-09-26 08:24:58,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-09-26 08:24:58,575 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 171 [2018-09-26 08:24:58,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:58,577 INFO L225 Difference]: With dead ends: 175 [2018-09-26 08:24:58,577 INFO L226 Difference]: Without dead ends: 174 [2018-09-26 08:24:58,578 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-09-26 08:24:58,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-09-26 08:24:58,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2018-09-26 08:24:58,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-09-26 08:24:58,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 174 transitions. [2018-09-26 08:24:58,584 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 174 transitions. Word has length 171 [2018-09-26 08:24:58,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:58,584 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 174 transitions. [2018-09-26 08:24:58,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-09-26 08:24:58,584 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 174 transitions. [2018-09-26 08:24:58,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-09-26 08:24:58,585 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:58,585 INFO L375 BasicCegarLoop]: trace histogram [86, 85, 1, 1] [2018-09-26 08:24:58,586 INFO L423 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:58,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:58,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1365212618, now seen corresponding path program 85 times [2018-09-26 08:24:58,586 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:58,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:58,919 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:58,919 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:58,919 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-09-26 08:24:58,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-09-26 08:24:58,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-09-26 08:24:58,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-09-26 08:24:58,921 INFO L87 Difference]: Start difference. First operand 174 states and 174 transitions. Second operand 88 states. [2018-09-26 08:24:59,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:59,068 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2018-09-26 08:24:59,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-09-26 08:24:59,068 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 173 [2018-09-26 08:24:59,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:59,070 INFO L225 Difference]: With dead ends: 177 [2018-09-26 08:24:59,070 INFO L226 Difference]: Without dead ends: 176 [2018-09-26 08:24:59,071 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-09-26 08:24:59,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-09-26 08:24:59,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2018-09-26 08:24:59,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-09-26 08:24:59,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2018-09-26 08:24:59,079 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 173 [2018-09-26 08:24:59,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:59,079 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2018-09-26 08:24:59,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-09-26 08:24:59,080 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2018-09-26 08:24:59,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-09-26 08:24:59,081 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:59,082 INFO L375 BasicCegarLoop]: trace histogram [87, 86, 1, 1] [2018-09-26 08:24:59,082 INFO L423 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:59,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:59,082 INFO L82 PathProgramCache]: Analyzing trace with hash 2004301708, now seen corresponding path program 86 times [2018-09-26 08:24:59,082 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:59,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:59,445 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:59,445 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:59,445 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-09-26 08:24:59,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-09-26 08:24:59,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-09-26 08:24:59,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-09-26 08:24:59,447 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 89 states. [2018-09-26 08:24:59,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:59,535 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-09-26 08:24:59,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-09-26 08:24:59,535 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 175 [2018-09-26 08:24:59,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:59,536 INFO L225 Difference]: With dead ends: 179 [2018-09-26 08:24:59,537 INFO L226 Difference]: Without dead ends: 178 [2018-09-26 08:24:59,537 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-09-26 08:24:59,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-09-26 08:24:59,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2018-09-26 08:24:59,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-09-26 08:24:59,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 178 transitions. [2018-09-26 08:24:59,543 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 178 transitions. Word has length 175 [2018-09-26 08:24:59,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:59,543 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 178 transitions. [2018-09-26 08:24:59,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-09-26 08:24:59,544 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 178 transitions. [2018-09-26 08:24:59,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-09-26 08:24:59,545 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:59,545 INFO L375 BasicCegarLoop]: trace histogram [88, 87, 1, 1] [2018-09-26 08:24:59,545 INFO L423 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:59,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:59,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1988593870, now seen corresponding path program 87 times [2018-09-26 08:24:59,545 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:59,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:59,978 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:59,978 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:59,978 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-09-26 08:24:59,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-09-26 08:24:59,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-09-26 08:24:59,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-09-26 08:24:59,980 INFO L87 Difference]: Start difference. First operand 178 states and 178 transitions. Second operand 90 states. [2018-09-26 08:25:00,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:00,082 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2018-09-26 08:25:00,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-09-26 08:25:00,082 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 177 [2018-09-26 08:25:00,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:00,083 INFO L225 Difference]: With dead ends: 181 [2018-09-26 08:25:00,083 INFO L226 Difference]: Without dead ends: 180 [2018-09-26 08:25:00,083 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-09-26 08:25:00,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-09-26 08:25:00,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2018-09-26 08:25:00,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-09-26 08:25:00,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 180 transitions. [2018-09-26 08:25:00,088 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 180 transitions. Word has length 177 [2018-09-26 08:25:00,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:00,089 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 180 transitions. [2018-09-26 08:25:00,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-09-26 08:25:00,089 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 180 transitions. [2018-09-26 08:25:00,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-09-26 08:25:00,090 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:00,090 INFO L375 BasicCegarLoop]: trace histogram [89, 88, 1, 1] [2018-09-26 08:25:00,090 INFO L423 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:00,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:00,090 INFO L82 PathProgramCache]: Analyzing trace with hash -221736560, now seen corresponding path program 88 times [2018-09-26 08:25:00,090 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:00,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:00,408 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:00,409 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:00,409 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-09-26 08:25:00,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-09-26 08:25:00,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-09-26 08:25:00,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-09-26 08:25:00,411 INFO L87 Difference]: Start difference. First operand 180 states and 180 transitions. Second operand 91 states. [2018-09-26 08:25:00,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:00,541 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-09-26 08:25:00,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-09-26 08:25:00,542 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 179 [2018-09-26 08:25:00,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:00,543 INFO L225 Difference]: With dead ends: 183 [2018-09-26 08:25:00,543 INFO L226 Difference]: Without dead ends: 182 [2018-09-26 08:25:00,544 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-09-26 08:25:00,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-09-26 08:25:00,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-09-26 08:25:00,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-09-26 08:25:00,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 182 transitions. [2018-09-26 08:25:00,550 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 182 transitions. Word has length 179 [2018-09-26 08:25:00,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:00,550 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 182 transitions. [2018-09-26 08:25:00,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-09-26 08:25:00,550 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 182 transitions. [2018-09-26 08:25:00,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-09-26 08:25:00,551 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:00,551 INFO L375 BasicCegarLoop]: trace histogram [90, 89, 1, 1] [2018-09-26 08:25:00,552 INFO L423 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:00,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:00,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1659531730, now seen corresponding path program 89 times [2018-09-26 08:25:00,552 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:00,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:00,915 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:00,915 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:00,916 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-09-26 08:25:00,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-09-26 08:25:00,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-09-26 08:25:00,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-09-26 08:25:00,917 INFO L87 Difference]: Start difference. First operand 182 states and 182 transitions. Second operand 92 states. [2018-09-26 08:25:01,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:01,022 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2018-09-26 08:25:01,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-09-26 08:25:01,022 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 181 [2018-09-26 08:25:01,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:01,024 INFO L225 Difference]: With dead ends: 185 [2018-09-26 08:25:01,024 INFO L226 Difference]: Without dead ends: 184 [2018-09-26 08:25:01,025 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-09-26 08:25:01,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-09-26 08:25:01,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2018-09-26 08:25:01,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-09-26 08:25:01,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 184 transitions. [2018-09-26 08:25:01,031 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 184 transitions. Word has length 181 [2018-09-26 08:25:01,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:01,032 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 184 transitions. [2018-09-26 08:25:01,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-09-26 08:25:01,032 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 184 transitions. [2018-09-26 08:25:01,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-09-26 08:25:01,033 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:01,033 INFO L375 BasicCegarLoop]: trace histogram [91, 90, 1, 1] [2018-09-26 08:25:01,034 INFO L423 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:01,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:01,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1377126804, now seen corresponding path program 90 times [2018-09-26 08:25:01,034 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:01,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:01,739 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:01,739 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:01,739 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-09-26 08:25:01,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-09-26 08:25:01,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-09-26 08:25:01,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-09-26 08:25:01,741 INFO L87 Difference]: Start difference. First operand 184 states and 184 transitions. Second operand 93 states. [2018-09-26 08:25:01,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:01,887 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2018-09-26 08:25:01,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-09-26 08:25:01,887 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 183 [2018-09-26 08:25:01,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:01,888 INFO L225 Difference]: With dead ends: 187 [2018-09-26 08:25:01,888 INFO L226 Difference]: Without dead ends: 186 [2018-09-26 08:25:01,889 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-09-26 08:25:01,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-09-26 08:25:01,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2018-09-26 08:25:01,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-09-26 08:25:01,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2018-09-26 08:25:01,894 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 183 [2018-09-26 08:25:01,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:01,895 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2018-09-26 08:25:01,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-09-26 08:25:01,895 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2018-09-26 08:25:01,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-09-26 08:25:01,896 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:01,896 INFO L375 BasicCegarLoop]: trace histogram [92, 91, 1, 1] [2018-09-26 08:25:01,896 INFO L423 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:01,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:01,897 INFO L82 PathProgramCache]: Analyzing trace with hash 568932566, now seen corresponding path program 91 times [2018-09-26 08:25:01,897 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:01,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:02,232 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 8372 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:02,233 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:02,233 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-09-26 08:25:02,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-09-26 08:25:02,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-09-26 08:25:02,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-09-26 08:25:02,235 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand 94 states. [2018-09-26 08:25:02,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:02,308 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2018-09-26 08:25:02,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-09-26 08:25:02,309 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 185 [2018-09-26 08:25:02,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:02,309 INFO L225 Difference]: With dead ends: 189 [2018-09-26 08:25:02,309 INFO L226 Difference]: Without dead ends: 188 [2018-09-26 08:25:02,310 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-09-26 08:25:02,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-09-26 08:25:02,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2018-09-26 08:25:02,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-09-26 08:25:02,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 188 transitions. [2018-09-26 08:25:02,315 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 188 transitions. Word has length 185 [2018-09-26 08:25:02,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:02,316 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 188 transitions. [2018-09-26 08:25:02,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-09-26 08:25:02,316 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 188 transitions. [2018-09-26 08:25:02,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-09-26 08:25:02,317 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:02,317 INFO L375 BasicCegarLoop]: trace histogram [93, 92, 1, 1] [2018-09-26 08:25:02,317 INFO L423 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:02,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:02,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1283350424, now seen corresponding path program 92 times [2018-09-26 08:25:02,318 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:02,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:02,662 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 8556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:02,662 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:02,662 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-09-26 08:25:02,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-09-26 08:25:02,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-09-26 08:25:02,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-09-26 08:25:02,664 INFO L87 Difference]: Start difference. First operand 188 states and 188 transitions. Second operand 95 states. [2018-09-26 08:25:02,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:02,789 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-09-26 08:25:02,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-09-26 08:25:02,790 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 187 [2018-09-26 08:25:02,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:02,791 INFO L225 Difference]: With dead ends: 191 [2018-09-26 08:25:02,791 INFO L226 Difference]: Without dead ends: 190 [2018-09-26 08:25:02,791 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-09-26 08:25:02,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-09-26 08:25:02,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2018-09-26 08:25:02,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-09-26 08:25:02,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 190 transitions. [2018-09-26 08:25:02,796 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 190 transitions. Word has length 187 [2018-09-26 08:25:02,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:02,797 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 190 transitions. [2018-09-26 08:25:02,797 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-09-26 08:25:02,797 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 190 transitions. [2018-09-26 08:25:02,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-09-26 08:25:02,798 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:02,798 INFO L375 BasicCegarLoop]: trace histogram [94, 93, 1, 1] [2018-09-26 08:25:02,799 INFO L423 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:02,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:02,799 INFO L82 PathProgramCache]: Analyzing trace with hash 644144602, now seen corresponding path program 93 times [2018-09-26 08:25:02,799 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:02,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:03,201 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 8742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:03,201 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:03,201 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-09-26 08:25:03,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-09-26 08:25:03,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-09-26 08:25:03,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-09-26 08:25:03,203 INFO L87 Difference]: Start difference. First operand 190 states and 190 transitions. Second operand 96 states. [2018-09-26 08:25:03,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:03,354 INFO L93 Difference]: Finished difference Result 193 states and 193 transitions. [2018-09-26 08:25:03,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-09-26 08:25:03,354 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 189 [2018-09-26 08:25:03,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:03,355 INFO L225 Difference]: With dead ends: 193 [2018-09-26 08:25:03,355 INFO L226 Difference]: Without dead ends: 192 [2018-09-26 08:25:03,356 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-09-26 08:25:03,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-09-26 08:25:03,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2018-09-26 08:25:03,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-09-26 08:25:03,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 192 transitions. [2018-09-26 08:25:03,362 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 192 transitions. Word has length 189 [2018-09-26 08:25:03,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:03,362 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 192 transitions. [2018-09-26 08:25:03,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-09-26 08:25:03,362 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 192 transitions. [2018-09-26 08:25:03,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-09-26 08:25:03,363 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:03,364 INFO L375 BasicCegarLoop]: trace histogram [95, 94, 1, 1] [2018-09-26 08:25:03,364 INFO L423 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:03,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:03,364 INFO L82 PathProgramCache]: Analyzing trace with hash 547672988, now seen corresponding path program 94 times [2018-09-26 08:25:03,364 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:03,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:03,976 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:03,976 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:03,976 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-09-26 08:25:03,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-09-26 08:25:03,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-09-26 08:25:03,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-09-26 08:25:03,978 INFO L87 Difference]: Start difference. First operand 192 states and 192 transitions. Second operand 97 states. [2018-09-26 08:25:04,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:04,079 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-09-26 08:25:04,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-09-26 08:25:04,079 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 191 [2018-09-26 08:25:04,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:04,080 INFO L225 Difference]: With dead ends: 195 [2018-09-26 08:25:04,080 INFO L226 Difference]: Without dead ends: 194 [2018-09-26 08:25:04,080 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-09-26 08:25:04,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-09-26 08:25:04,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2018-09-26 08:25:04,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-09-26 08:25:04,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 194 transitions. [2018-09-26 08:25:04,086 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 194 transitions. Word has length 191 [2018-09-26 08:25:04,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:04,086 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 194 transitions. [2018-09-26 08:25:04,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-09-26 08:25:04,086 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 194 transitions. [2018-09-26 08:25:04,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-09-26 08:25:04,087 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:04,088 INFO L375 BasicCegarLoop]: trace histogram [96, 95, 1, 1] [2018-09-26 08:25:04,088 INFO L423 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:04,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:04,088 INFO L82 PathProgramCache]: Analyzing trace with hash -1967234850, now seen corresponding path program 95 times [2018-09-26 08:25:04,088 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:04,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:04,489 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 9120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:04,490 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:04,490 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-09-26 08:25:04,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-09-26 08:25:04,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-09-26 08:25:04,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 08:25:04,492 INFO L87 Difference]: Start difference. First operand 194 states and 194 transitions. Second operand 98 states. [2018-09-26 08:25:04,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:04,587 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2018-09-26 08:25:04,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-09-26 08:25:04,587 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 193 [2018-09-26 08:25:04,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:04,588 INFO L225 Difference]: With dead ends: 197 [2018-09-26 08:25:04,588 INFO L226 Difference]: Without dead ends: 196 [2018-09-26 08:25:04,589 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 08:25:04,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-09-26 08:25:04,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2018-09-26 08:25:04,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-09-26 08:25:04,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2018-09-26 08:25:04,595 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 193 [2018-09-26 08:25:04,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:04,595 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2018-09-26 08:25:04,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-09-26 08:25:04,595 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2018-09-26 08:25:04,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-09-26 08:25:04,596 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:04,596 INFO L375 BasicCegarLoop]: trace histogram [97, 96, 1, 1] [2018-09-26 08:25:04,597 INFO L423 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:04,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:04,597 INFO L82 PathProgramCache]: Analyzing trace with hash -727079520, now seen corresponding path program 96 times [2018-09-26 08:25:04,597 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:04,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:05,075 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 9312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:05,076 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:05,076 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-09-26 08:25:05,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-09-26 08:25:05,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-09-26 08:25:05,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-09-26 08:25:05,078 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 99 states. [2018-09-26 08:25:05,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:05,187 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2018-09-26 08:25:05,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-09-26 08:25:05,187 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 195 [2018-09-26 08:25:05,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:05,188 INFO L225 Difference]: With dead ends: 199 [2018-09-26 08:25:05,188 INFO L226 Difference]: Without dead ends: 198 [2018-09-26 08:25:05,189 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-09-26 08:25:05,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-09-26 08:25:05,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2018-09-26 08:25:05,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-09-26 08:25:05,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 198 transitions. [2018-09-26 08:25:05,195 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 198 transitions. Word has length 195 [2018-09-26 08:25:05,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:05,195 INFO L480 AbstractCegarLoop]: Abstraction has 198 states and 198 transitions. [2018-09-26 08:25:05,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-09-26 08:25:05,196 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 198 transitions. [2018-09-26 08:25:05,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-09-26 08:25:05,197 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:05,197 INFO L375 BasicCegarLoop]: trace histogram [98, 97, 1, 1] [2018-09-26 08:25:05,197 INFO L423 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:05,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:05,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1356251618, now seen corresponding path program 97 times [2018-09-26 08:25:05,198 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:05,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:05,582 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 9506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:05,582 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:05,582 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-09-26 08:25:05,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-09-26 08:25:05,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-09-26 08:25:05,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-09-26 08:25:05,584 INFO L87 Difference]: Start difference. First operand 198 states and 198 transitions. Second operand 100 states. [2018-09-26 08:25:05,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:05,668 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2018-09-26 08:25:05,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-09-26 08:25:05,668 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 197 [2018-09-26 08:25:05,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:05,669 INFO L225 Difference]: With dead ends: 201 [2018-09-26 08:25:05,669 INFO L226 Difference]: Without dead ends: 200 [2018-09-26 08:25:05,670 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-09-26 08:25:05,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-09-26 08:25:05,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2018-09-26 08:25:05,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-09-26 08:25:05,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 200 transitions. [2018-09-26 08:25:05,675 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 200 transitions. Word has length 197 [2018-09-26 08:25:05,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:05,676 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 200 transitions. [2018-09-26 08:25:05,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-09-26 08:25:05,676 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 200 transitions. [2018-09-26 08:25:05,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-09-26 08:25:05,677 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:05,677 INFO L375 BasicCegarLoop]: trace histogram [99, 98, 1, 1] [2018-09-26 08:25:05,677 INFO L423 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:05,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:05,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1982715300, now seen corresponding path program 98 times [2018-09-26 08:25:05,678 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:05,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:06,081 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 9702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:06,081 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:06,081 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-09-26 08:25:06,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-09-26 08:25:06,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-09-26 08:25:06,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-09-26 08:25:06,083 INFO L87 Difference]: Start difference. First operand 200 states and 200 transitions. Second operand 101 states. [2018-09-26 08:25:06,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:06,218 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2018-09-26 08:25:06,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-09-26 08:25:06,218 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 199 [2018-09-26 08:25:06,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:06,219 INFO L225 Difference]: With dead ends: 203 [2018-09-26 08:25:06,219 INFO L226 Difference]: Without dead ends: 202 [2018-09-26 08:25:06,220 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-09-26 08:25:06,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-09-26 08:25:06,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2018-09-26 08:25:06,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-09-26 08:25:06,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 202 transitions. [2018-09-26 08:25:06,225 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 202 transitions. Word has length 199 [2018-09-26 08:25:06,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:06,226 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 202 transitions. [2018-09-26 08:25:06,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-09-26 08:25:06,226 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 202 transitions. [2018-09-26 08:25:06,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-09-26 08:25:06,227 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:06,227 INFO L375 BasicCegarLoop]: trace histogram [100, 99, 1, 1] [2018-09-26 08:25:06,227 INFO L423 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:06,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:06,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1576075034, now seen corresponding path program 99 times [2018-09-26 08:25:06,228 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:06,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:06,668 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 9900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:06,668 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:06,668 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-09-26 08:25:06,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-09-26 08:25:06,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-09-26 08:25:06,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-09-26 08:25:06,670 INFO L87 Difference]: Start difference. First operand 202 states and 202 transitions. Second operand 102 states. [2018-09-26 08:25:06,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:06,757 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2018-09-26 08:25:06,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-09-26 08:25:06,757 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 201 [2018-09-26 08:25:06,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:06,758 INFO L225 Difference]: With dead ends: 205 [2018-09-26 08:25:06,759 INFO L226 Difference]: Without dead ends: 204 [2018-09-26 08:25:06,759 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-09-26 08:25:06,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-09-26 08:25:06,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2018-09-26 08:25:06,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-09-26 08:25:06,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 204 transitions. [2018-09-26 08:25:06,765 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 204 transitions. Word has length 201 [2018-09-26 08:25:06,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:06,766 INFO L480 AbstractCegarLoop]: Abstraction has 204 states and 204 transitions. [2018-09-26 08:25:06,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-09-26 08:25:06,766 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 204 transitions. [2018-09-26 08:25:06,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-09-26 08:25:06,767 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:06,767 INFO L375 BasicCegarLoop]: trace histogram [101, 100, 1, 1] [2018-09-26 08:25:06,768 INFO L423 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:06,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:06,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1515348904, now seen corresponding path program 100 times [2018-09-26 08:25:06,768 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:06,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:07,501 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 10100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:07,502 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:07,502 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-09-26 08:25:07,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-09-26 08:25:07,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-09-26 08:25:07,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-09-26 08:25:07,504 INFO L87 Difference]: Start difference. First operand 204 states and 204 transitions. Second operand 103 states. [2018-09-26 08:25:07,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:07,797 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2018-09-26 08:25:07,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-09-26 08:25:07,797 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 203 [2018-09-26 08:25:07,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:07,798 INFO L225 Difference]: With dead ends: 207 [2018-09-26 08:25:07,799 INFO L226 Difference]: Without dead ends: 206 [2018-09-26 08:25:07,799 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-09-26 08:25:07,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-09-26 08:25:07,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2018-09-26 08:25:07,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-09-26 08:25:07,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 206 transitions. [2018-09-26 08:25:07,805 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 206 transitions. Word has length 203 [2018-09-26 08:25:07,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:07,805 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 206 transitions. [2018-09-26 08:25:07,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-09-26 08:25:07,806 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 206 transitions. [2018-09-26 08:25:07,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-09-26 08:25:07,807 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:07,807 INFO L375 BasicCegarLoop]: trace histogram [102, 101, 1, 1] [2018-09-26 08:25:07,807 INFO L423 AbstractCegarLoop]: === Iteration 102 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:07,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:07,808 INFO L82 PathProgramCache]: Analyzing trace with hash 256384490, now seen corresponding path program 101 times [2018-09-26 08:25:07,808 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:07,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:08,337 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 10302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:08,337 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:08,337 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-09-26 08:25:08,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-09-26 08:25:08,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-09-26 08:25:08,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-09-26 08:25:08,340 INFO L87 Difference]: Start difference. First operand 206 states and 206 transitions. Second operand 104 states. [2018-09-26 08:25:08,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:08,519 INFO L93 Difference]: Finished difference Result 209 states and 209 transitions. [2018-09-26 08:25:08,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-09-26 08:25:08,519 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 205 [2018-09-26 08:25:08,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:08,520 INFO L225 Difference]: With dead ends: 209 [2018-09-26 08:25:08,520 INFO L226 Difference]: Without dead ends: 208 [2018-09-26 08:25:08,521 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-09-26 08:25:08,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-09-26 08:25:08,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2018-09-26 08:25:08,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-09-26 08:25:08,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 208 transitions. [2018-09-26 08:25:08,525 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 208 transitions. Word has length 205 [2018-09-26 08:25:08,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:08,526 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 208 transitions. [2018-09-26 08:25:08,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-09-26 08:25:08,526 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 208 transitions. [2018-09-26 08:25:08,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-09-26 08:25:08,526 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:08,527 INFO L375 BasicCegarLoop]: trace histogram [103, 102, 1, 1] [2018-09-26 08:25:08,527 INFO L423 AbstractCegarLoop]: === Iteration 103 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:08,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:08,527 INFO L82 PathProgramCache]: Analyzing trace with hash 1572360108, now seen corresponding path program 102 times [2018-09-26 08:25:08,527 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:08,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:08,932 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 10506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:08,933 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:08,933 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-09-26 08:25:08,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-09-26 08:25:08,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-09-26 08:25:08,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2018-09-26 08:25:08,935 INFO L87 Difference]: Start difference. First operand 208 states and 208 transitions. Second operand 105 states. [2018-09-26 08:25:09,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:09,118 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2018-09-26 08:25:09,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-09-26 08:25:09,118 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 207 [2018-09-26 08:25:09,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:09,119 INFO L225 Difference]: With dead ends: 211 [2018-09-26 08:25:09,120 INFO L226 Difference]: Without dead ends: 210 [2018-09-26 08:25:09,121 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2018-09-26 08:25:09,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-09-26 08:25:09,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2018-09-26 08:25:09,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-09-26 08:25:09,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 210 transitions. [2018-09-26 08:25:09,127 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 210 transitions. Word has length 207 [2018-09-26 08:25:09,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:09,128 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 210 transitions. [2018-09-26 08:25:09,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-09-26 08:25:09,128 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 210 transitions. [2018-09-26 08:25:09,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-09-26 08:25:09,129 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:09,129 INFO L375 BasicCegarLoop]: trace histogram [104, 103, 1, 1] [2018-09-26 08:25:09,130 INFO L423 AbstractCegarLoop]: === Iteration 104 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:09,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:09,130 INFO L82 PathProgramCache]: Analyzing trace with hash -790423314, now seen corresponding path program 103 times [2018-09-26 08:25:09,130 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:09,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:09,610 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 10712 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:09,610 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:09,610 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2018-09-26 08:25:09,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-09-26 08:25:09,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-09-26 08:25:09,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-09-26 08:25:09,612 INFO L87 Difference]: Start difference. First operand 210 states and 210 transitions. Second operand 106 states. [2018-09-26 08:25:09,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:09,811 INFO L93 Difference]: Finished difference Result 213 states and 213 transitions. [2018-09-26 08:25:09,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-09-26 08:25:09,811 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 209 [2018-09-26 08:25:09,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:09,812 INFO L225 Difference]: With dead ends: 213 [2018-09-26 08:25:09,813 INFO L226 Difference]: Without dead ends: 212 [2018-09-26 08:25:09,814 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-09-26 08:25:09,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-09-26 08:25:09,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2018-09-26 08:25:09,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-09-26 08:25:09,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 212 transitions. [2018-09-26 08:25:09,819 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 212 transitions. Word has length 209 [2018-09-26 08:25:09,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:09,819 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 212 transitions. [2018-09-26 08:25:09,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-09-26 08:25:09,820 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 212 transitions. [2018-09-26 08:25:09,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-09-26 08:25:09,821 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:09,821 INFO L375 BasicCegarLoop]: trace histogram [105, 104, 1, 1] [2018-09-26 08:25:09,821 INFO L423 AbstractCegarLoop]: === Iteration 105 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:09,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:09,821 INFO L82 PathProgramCache]: Analyzing trace with hash 612407728, now seen corresponding path program 104 times [2018-09-26 08:25:09,822 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:09,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:10,273 INFO L134 CoverageAnalysis]: Checked inductivity of 10920 backedges. 0 proven. 10920 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:10,273 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:10,273 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-09-26 08:25:10,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-09-26 08:25:10,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-09-26 08:25:10,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2018-09-26 08:25:10,276 INFO L87 Difference]: Start difference. First operand 212 states and 212 transitions. Second operand 107 states. [2018-09-26 08:25:10,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:10,485 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2018-09-26 08:25:10,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-09-26 08:25:10,485 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 211 [2018-09-26 08:25:10,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:10,486 INFO L225 Difference]: With dead ends: 215 [2018-09-26 08:25:10,486 INFO L226 Difference]: Without dead ends: 214 [2018-09-26 08:25:10,487 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2018-09-26 08:25:10,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-09-26 08:25:10,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2018-09-26 08:25:10,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-09-26 08:25:10,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 214 transitions. [2018-09-26 08:25:10,492 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 214 transitions. Word has length 211 [2018-09-26 08:25:10,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:10,492 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 214 transitions. [2018-09-26 08:25:10,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-09-26 08:25:10,492 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 214 transitions. [2018-09-26 08:25:10,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-09-26 08:25:10,493 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:10,493 INFO L375 BasicCegarLoop]: trace histogram [106, 105, 1, 1] [2018-09-26 08:25:10,494 INFO L423 AbstractCegarLoop]: === Iteration 106 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:10,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:10,494 INFO L82 PathProgramCache]: Analyzing trace with hash 113308146, now seen corresponding path program 105 times [2018-09-26 08:25:10,494 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:10,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:10,970 INFO L134 CoverageAnalysis]: Checked inductivity of 11130 backedges. 0 proven. 11130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:10,970 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:10,970 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2018-09-26 08:25:10,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-09-26 08:25:10,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-09-26 08:25:10,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-09-26 08:25:10,972 INFO L87 Difference]: Start difference. First operand 214 states and 214 transitions. Second operand 108 states. [2018-09-26 08:25:11,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:11,145 INFO L93 Difference]: Finished difference Result 217 states and 217 transitions. [2018-09-26 08:25:11,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-09-26 08:25:11,145 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 213 [2018-09-26 08:25:11,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:11,146 INFO L225 Difference]: With dead ends: 217 [2018-09-26 08:25:11,146 INFO L226 Difference]: Without dead ends: 216 [2018-09-26 08:25:11,147 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-09-26 08:25:11,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-09-26 08:25:11,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2018-09-26 08:25:11,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-09-26 08:25:11,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 216 transitions. [2018-09-26 08:25:11,150 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 216 transitions. Word has length 213 [2018-09-26 08:25:11,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:11,150 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 216 transitions. [2018-09-26 08:25:11,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-09-26 08:25:11,150 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 216 transitions. [2018-09-26 08:25:11,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-09-26 08:25:11,151 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:11,151 INFO L375 BasicCegarLoop]: trace histogram [107, 106, 1, 1] [2018-09-26 08:25:11,151 INFO L423 AbstractCegarLoop]: === Iteration 107 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:11,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:11,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1514946996, now seen corresponding path program 106 times [2018-09-26 08:25:11,152 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:11,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:11,628 INFO L134 CoverageAnalysis]: Checked inductivity of 11342 backedges. 0 proven. 11342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:11,629 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:11,629 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-09-26 08:25:11,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-09-26 08:25:11,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-09-26 08:25:11,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2018-09-26 08:25:11,630 INFO L87 Difference]: Start difference. First operand 216 states and 216 transitions. Second operand 109 states. [2018-09-26 08:25:11,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:11,728 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2018-09-26 08:25:11,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-09-26 08:25:11,728 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 215 [2018-09-26 08:25:11,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:11,729 INFO L225 Difference]: With dead ends: 219 [2018-09-26 08:25:11,729 INFO L226 Difference]: Without dead ends: 218 [2018-09-26 08:25:11,730 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2018-09-26 08:25:11,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-09-26 08:25:11,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2018-09-26 08:25:11,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-09-26 08:25:11,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 218 transitions. [2018-09-26 08:25:11,734 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 218 transitions. Word has length 215 [2018-09-26 08:25:11,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:11,735 INFO L480 AbstractCegarLoop]: Abstraction has 218 states and 218 transitions. [2018-09-26 08:25:11,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-09-26 08:25:11,735 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 218 transitions. [2018-09-26 08:25:11,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-09-26 08:25:11,735 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:11,735 INFO L375 BasicCegarLoop]: trace histogram [108, 107, 1, 1] [2018-09-26 08:25:11,736 INFO L423 AbstractCegarLoop]: === Iteration 108 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:11,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:11,736 INFO L82 PathProgramCache]: Analyzing trace with hash -129849098, now seen corresponding path program 107 times [2018-09-26 08:25:11,736 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:11,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:12,338 INFO L134 CoverageAnalysis]: Checked inductivity of 11556 backedges. 0 proven. 11556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:12,338 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:12,338 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2018-09-26 08:25:12,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-09-26 08:25:12,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-09-26 08:25:12,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-09-26 08:25:12,340 INFO L87 Difference]: Start difference. First operand 218 states and 218 transitions. Second operand 110 states. [2018-09-26 08:25:12,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:12,579 INFO L93 Difference]: Finished difference Result 221 states and 221 transitions. [2018-09-26 08:25:12,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-09-26 08:25:12,579 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 217 [2018-09-26 08:25:12,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:12,580 INFO L225 Difference]: With dead ends: 221 [2018-09-26 08:25:12,580 INFO L226 Difference]: Without dead ends: 220 [2018-09-26 08:25:12,581 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-09-26 08:25:12,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-09-26 08:25:12,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2018-09-26 08:25:12,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-09-26 08:25:12,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 220 transitions. [2018-09-26 08:25:12,586 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 220 transitions. Word has length 217 [2018-09-26 08:25:12,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:12,587 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 220 transitions. [2018-09-26 08:25:12,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-09-26 08:25:12,587 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 220 transitions. [2018-09-26 08:25:12,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-09-26 08:25:12,588 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:12,588 INFO L375 BasicCegarLoop]: trace histogram [109, 108, 1, 1] [2018-09-26 08:25:12,588 INFO L423 AbstractCegarLoop]: === Iteration 109 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:12,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:12,589 INFO L82 PathProgramCache]: Analyzing trace with hash -230930504, now seen corresponding path program 108 times [2018-09-26 08:25:12,589 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:12,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:13,097 INFO L134 CoverageAnalysis]: Checked inductivity of 11772 backedges. 0 proven. 11772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:13,098 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:13,098 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-09-26 08:25:13,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-09-26 08:25:13,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-09-26 08:25:13,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2018-09-26 08:25:13,100 INFO L87 Difference]: Start difference. First operand 220 states and 220 transitions. Second operand 111 states. [2018-09-26 08:25:13,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:13,301 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2018-09-26 08:25:13,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-09-26 08:25:13,301 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 219 [2018-09-26 08:25:13,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:13,302 INFO L225 Difference]: With dead ends: 223 [2018-09-26 08:25:13,302 INFO L226 Difference]: Without dead ends: 222 [2018-09-26 08:25:13,303 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2018-09-26 08:25:13,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-09-26 08:25:13,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2018-09-26 08:25:13,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-09-26 08:25:13,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 222 transitions. [2018-09-26 08:25:13,309 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 222 transitions. Word has length 219 [2018-09-26 08:25:13,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:13,309 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 222 transitions. [2018-09-26 08:25:13,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-09-26 08:25:13,309 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 222 transitions. [2018-09-26 08:25:13,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-09-26 08:25:13,310 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:13,311 INFO L375 BasicCegarLoop]: trace histogram [110, 109, 1, 1] [2018-09-26 08:25:13,311 INFO L423 AbstractCegarLoop]: === Iteration 110 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:13,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:13,311 INFO L82 PathProgramCache]: Analyzing trace with hash 1414086138, now seen corresponding path program 109 times [2018-09-26 08:25:13,311 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:13,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:14,003 INFO L134 CoverageAnalysis]: Checked inductivity of 11990 backedges. 0 proven. 11990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:14,003 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:14,004 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2018-09-26 08:25:14,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-09-26 08:25:14,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-09-26 08:25:14,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-09-26 08:25:14,005 INFO L87 Difference]: Start difference. First operand 222 states and 222 transitions. Second operand 112 states. [2018-09-26 08:25:14,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:14,156 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2018-09-26 08:25:14,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-09-26 08:25:14,156 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 221 [2018-09-26 08:25:14,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:14,157 INFO L225 Difference]: With dead ends: 225 [2018-09-26 08:25:14,157 INFO L226 Difference]: Without dead ends: 224 [2018-09-26 08:25:14,157 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-09-26 08:25:14,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-09-26 08:25:14,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2018-09-26 08:25:14,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-09-26 08:25:14,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 224 transitions. [2018-09-26 08:25:14,163 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 224 transitions. Word has length 221 [2018-09-26 08:25:14,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:14,163 INFO L480 AbstractCegarLoop]: Abstraction has 224 states and 224 transitions. [2018-09-26 08:25:14,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-09-26 08:25:14,163 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 224 transitions. [2018-09-26 08:25:14,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-09-26 08:25:14,164 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:14,164 INFO L375 BasicCegarLoop]: trace histogram [111, 110, 1, 1] [2018-09-26 08:25:14,165 INFO L423 AbstractCegarLoop]: === Iteration 111 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:14,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:14,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1727114172, now seen corresponding path program 110 times [2018-09-26 08:25:14,165 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:14,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:14,663 INFO L134 CoverageAnalysis]: Checked inductivity of 12210 backedges. 0 proven. 12210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:14,663 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:14,663 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-09-26 08:25:14,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-09-26 08:25:14,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-09-26 08:25:14,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2018-09-26 08:25:14,665 INFO L87 Difference]: Start difference. First operand 224 states and 224 transitions. Second operand 113 states. [2018-09-26 08:25:14,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:14,844 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2018-09-26 08:25:14,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-09-26 08:25:14,844 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 223 [2018-09-26 08:25:14,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:14,845 INFO L225 Difference]: With dead ends: 227 [2018-09-26 08:25:14,845 INFO L226 Difference]: Without dead ends: 226 [2018-09-26 08:25:14,846 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2018-09-26 08:25:14,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-09-26 08:25:14,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2018-09-26 08:25:14,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-09-26 08:25:14,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 226 transitions. [2018-09-26 08:25:14,851 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 226 transitions. Word has length 223 [2018-09-26 08:25:14,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:14,851 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 226 transitions. [2018-09-26 08:25:14,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-09-26 08:25:14,852 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 226 transitions. [2018-09-26 08:25:14,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-09-26 08:25:14,853 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:14,853 INFO L375 BasicCegarLoop]: trace histogram [112, 111, 1, 1] [2018-09-26 08:25:14,853 INFO L423 AbstractCegarLoop]: === Iteration 112 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:14,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:14,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1899344126, now seen corresponding path program 111 times [2018-09-26 08:25:14,853 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:14,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:15,362 INFO L134 CoverageAnalysis]: Checked inductivity of 12432 backedges. 0 proven. 12432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:15,362 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:15,362 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2018-09-26 08:25:15,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-09-26 08:25:15,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-09-26 08:25:15,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-09-26 08:25:15,364 INFO L87 Difference]: Start difference. First operand 226 states and 226 transitions. Second operand 114 states. [2018-09-26 08:25:15,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:15,525 INFO L93 Difference]: Finished difference Result 229 states and 229 transitions. [2018-09-26 08:25:15,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-09-26 08:25:15,525 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 225 [2018-09-26 08:25:15,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:15,525 INFO L225 Difference]: With dead ends: 229 [2018-09-26 08:25:15,526 INFO L226 Difference]: Without dead ends: 228 [2018-09-26 08:25:15,526 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-09-26 08:25:15,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-09-26 08:25:15,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2018-09-26 08:25:15,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-09-26 08:25:15,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 228 transitions. [2018-09-26 08:25:15,530 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 228 transitions. Word has length 225 [2018-09-26 08:25:15,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:15,530 INFO L480 AbstractCegarLoop]: Abstraction has 228 states and 228 transitions. [2018-09-26 08:25:15,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-09-26 08:25:15,530 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 228 transitions. [2018-09-26 08:25:15,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-09-26 08:25:15,531 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:15,531 INFO L375 BasicCegarLoop]: trace histogram [113, 112, 1, 1] [2018-09-26 08:25:15,531 INFO L423 AbstractCegarLoop]: === Iteration 113 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:15,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:15,531 INFO L82 PathProgramCache]: Analyzing trace with hash -91394624, now seen corresponding path program 112 times [2018-09-26 08:25:15,531 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:15,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:16,027 INFO L134 CoverageAnalysis]: Checked inductivity of 12656 backedges. 0 proven. 12656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:16,028 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:16,028 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-09-26 08:25:16,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-09-26 08:25:16,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-09-26 08:25:16,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2018-09-26 08:25:16,030 INFO L87 Difference]: Start difference. First operand 228 states and 228 transitions. Second operand 115 states. [2018-09-26 08:25:16,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:16,234 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2018-09-26 08:25:16,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-09-26 08:25:16,234 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 227 [2018-09-26 08:25:16,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:16,235 INFO L225 Difference]: With dead ends: 231 [2018-09-26 08:25:16,235 INFO L226 Difference]: Without dead ends: 230 [2018-09-26 08:25:16,236 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2018-09-26 08:25:16,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-09-26 08:25:16,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2018-09-26 08:25:16,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-09-26 08:25:16,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 230 transitions. [2018-09-26 08:25:16,241 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 230 transitions. Word has length 227 [2018-09-26 08:25:16,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:16,241 INFO L480 AbstractCegarLoop]: Abstraction has 230 states and 230 transitions. [2018-09-26 08:25:16,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-09-26 08:25:16,242 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 230 transitions. [2018-09-26 08:25:16,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-09-26 08:25:16,243 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:16,243 INFO L375 BasicCegarLoop]: trace histogram [114, 113, 1, 1] [2018-09-26 08:25:16,243 INFO L423 AbstractCegarLoop]: === Iteration 114 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:16,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:16,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1930886654, now seen corresponding path program 113 times [2018-09-26 08:25:16,243 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:16,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:16,869 INFO L134 CoverageAnalysis]: Checked inductivity of 12882 backedges. 0 proven. 12882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:16,869 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:16,869 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2018-09-26 08:25:16,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-09-26 08:25:16,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-09-26 08:25:16,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-09-26 08:25:16,871 INFO L87 Difference]: Start difference. First operand 230 states and 230 transitions. Second operand 116 states. [2018-09-26 08:25:17,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:17,048 INFO L93 Difference]: Finished difference Result 233 states and 233 transitions. [2018-09-26 08:25:17,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-09-26 08:25:17,048 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 229 [2018-09-26 08:25:17,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:17,049 INFO L225 Difference]: With dead ends: 233 [2018-09-26 08:25:17,049 INFO L226 Difference]: Without dead ends: 232 [2018-09-26 08:25:17,050 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-09-26 08:25:17,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-09-26 08:25:17,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2018-09-26 08:25:17,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-09-26 08:25:17,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 232 transitions. [2018-09-26 08:25:17,055 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 232 transitions. Word has length 229 [2018-09-26 08:25:17,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:17,055 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 232 transitions. [2018-09-26 08:25:17,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-09-26 08:25:17,056 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 232 transitions. [2018-09-26 08:25:17,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-09-26 08:25:17,057 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:17,057 INFO L375 BasicCegarLoop]: trace histogram [115, 114, 1, 1] [2018-09-26 08:25:17,057 INFO L423 AbstractCegarLoop]: === Iteration 115 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:17,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:17,057 INFO L82 PathProgramCache]: Analyzing trace with hash -156201532, now seen corresponding path program 114 times [2018-09-26 08:25:17,057 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:17,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:17,613 INFO L134 CoverageAnalysis]: Checked inductivity of 13110 backedges. 0 proven. 13110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:17,613 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:17,614 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-09-26 08:25:17,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-09-26 08:25:17,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-09-26 08:25:17,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2018-09-26 08:25:17,616 INFO L87 Difference]: Start difference. First operand 232 states and 232 transitions. Second operand 117 states. [2018-09-26 08:25:17,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:17,877 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2018-09-26 08:25:17,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-09-26 08:25:17,877 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 231 [2018-09-26 08:25:17,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:17,877 INFO L225 Difference]: With dead ends: 235 [2018-09-26 08:25:17,878 INFO L226 Difference]: Without dead ends: 234 [2018-09-26 08:25:17,878 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2018-09-26 08:25:17,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-09-26 08:25:17,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2018-09-26 08:25:17,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-09-26 08:25:17,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 234 transitions. [2018-09-26 08:25:17,882 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 234 transitions. Word has length 231 [2018-09-26 08:25:17,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:17,882 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 234 transitions. [2018-09-26 08:25:17,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-09-26 08:25:17,882 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 234 transitions. [2018-09-26 08:25:17,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-09-26 08:25:17,883 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:17,883 INFO L375 BasicCegarLoop]: trace histogram [116, 115, 1, 1] [2018-09-26 08:25:17,883 INFO L423 AbstractCegarLoop]: === Iteration 116 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:17,883 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:17,883 INFO L82 PathProgramCache]: Analyzing trace with hash 214184198, now seen corresponding path program 115 times [2018-09-26 08:25:17,883 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:17,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:18,528 INFO L134 CoverageAnalysis]: Checked inductivity of 13340 backedges. 0 proven. 13340 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:18,529 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:18,529 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2018-09-26 08:25:18,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-09-26 08:25:18,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-09-26 08:25:18,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-09-26 08:25:18,531 INFO L87 Difference]: Start difference. First operand 234 states and 234 transitions. Second operand 118 states. [2018-09-26 08:25:18,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:18,804 INFO L93 Difference]: Finished difference Result 237 states and 237 transitions. [2018-09-26 08:25:18,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-09-26 08:25:18,804 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 233 [2018-09-26 08:25:18,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:18,805 INFO L225 Difference]: With dead ends: 237 [2018-09-26 08:25:18,805 INFO L226 Difference]: Without dead ends: 236 [2018-09-26 08:25:18,806 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-09-26 08:25:18,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-09-26 08:25:18,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2018-09-26 08:25:18,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-09-26 08:25:18,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 236 transitions. [2018-09-26 08:25:18,809 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 236 transitions. Word has length 233 [2018-09-26 08:25:18,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:18,810 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 236 transitions. [2018-09-26 08:25:18,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-09-26 08:25:18,810 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 236 transitions. [2018-09-26 08:25:18,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-09-26 08:25:18,810 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:18,810 INFO L375 BasicCegarLoop]: trace histogram [117, 116, 1, 1] [2018-09-26 08:25:18,811 INFO L423 AbstractCegarLoop]: === Iteration 117 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:18,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:18,811 INFO L82 PathProgramCache]: Analyzing trace with hash -327414840, now seen corresponding path program 116 times [2018-09-26 08:25:18,811 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:18,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:19,392 INFO L134 CoverageAnalysis]: Checked inductivity of 13572 backedges. 0 proven. 13572 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:19,393 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:19,393 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-09-26 08:25:19,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-09-26 08:25:19,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-09-26 08:25:19,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2018-09-26 08:25:19,395 INFO L87 Difference]: Start difference. First operand 236 states and 236 transitions. Second operand 119 states. [2018-09-26 08:25:19,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:19,512 INFO L93 Difference]: Finished difference Result 239 states and 239 transitions. [2018-09-26 08:25:19,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-09-26 08:25:19,512 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 235 [2018-09-26 08:25:19,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:19,512 INFO L225 Difference]: With dead ends: 239 [2018-09-26 08:25:19,513 INFO L226 Difference]: Without dead ends: 238 [2018-09-26 08:25:19,513 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2018-09-26 08:25:19,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-09-26 08:25:19,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2018-09-26 08:25:19,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-09-26 08:25:19,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 238 transitions. [2018-09-26 08:25:19,517 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 238 transitions. Word has length 235 [2018-09-26 08:25:19,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:19,517 INFO L480 AbstractCegarLoop]: Abstraction has 238 states and 238 transitions. [2018-09-26 08:25:19,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-09-26 08:25:19,517 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 238 transitions. [2018-09-26 08:25:19,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-09-26 08:25:19,518 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:19,518 INFO L375 BasicCegarLoop]: trace histogram [118, 117, 1, 1] [2018-09-26 08:25:19,518 INFO L423 AbstractCegarLoop]: === Iteration 118 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:19,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:19,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1113047542, now seen corresponding path program 117 times [2018-09-26 08:25:19,518 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:19,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:20,102 INFO L134 CoverageAnalysis]: Checked inductivity of 13806 backedges. 0 proven. 13806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:20,103 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:20,103 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2018-09-26 08:25:20,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-09-26 08:25:20,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-09-26 08:25:20,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-09-26 08:25:20,105 INFO L87 Difference]: Start difference. First operand 238 states and 238 transitions. Second operand 120 states. [2018-09-26 08:25:20,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:20,317 INFO L93 Difference]: Finished difference Result 241 states and 241 transitions. [2018-09-26 08:25:20,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-09-26 08:25:20,318 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 237 [2018-09-26 08:25:20,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:20,318 INFO L225 Difference]: With dead ends: 241 [2018-09-26 08:25:20,319 INFO L226 Difference]: Without dead ends: 240 [2018-09-26 08:25:20,320 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-09-26 08:25:20,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-09-26 08:25:20,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2018-09-26 08:25:20,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-09-26 08:25:20,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 240 transitions. [2018-09-26 08:25:20,327 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 240 transitions. Word has length 237 [2018-09-26 08:25:20,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:20,327 INFO L480 AbstractCegarLoop]: Abstraction has 240 states and 240 transitions. [2018-09-26 08:25:20,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-09-26 08:25:20,328 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 240 transitions. [2018-09-26 08:25:20,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-09-26 08:25:20,329 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:20,329 INFO L375 BasicCegarLoop]: trace histogram [119, 118, 1, 1] [2018-09-26 08:25:20,330 INFO L423 AbstractCegarLoop]: === Iteration 119 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:20,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:20,330 INFO L82 PathProgramCache]: Analyzing trace with hash -191830068, now seen corresponding path program 118 times [2018-09-26 08:25:20,330 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:20,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:21,079 INFO L134 CoverageAnalysis]: Checked inductivity of 14042 backedges. 0 proven. 14042 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:21,080 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:21,080 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-09-26 08:25:21,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-09-26 08:25:21,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-09-26 08:25:21,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7260, Invalid=7260, Unknown=0, NotChecked=0, Total=14520 [2018-09-26 08:25:21,082 INFO L87 Difference]: Start difference. First operand 240 states and 240 transitions. Second operand 121 states. [2018-09-26 08:25:21,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:21,372 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2018-09-26 08:25:21,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-09-26 08:25:21,372 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 239 [2018-09-26 08:25:21,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:21,373 INFO L225 Difference]: With dead ends: 243 [2018-09-26 08:25:21,373 INFO L226 Difference]: Without dead ends: 242 [2018-09-26 08:25:21,375 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=7260, Invalid=7260, Unknown=0, NotChecked=0, Total=14520 [2018-09-26 08:25:21,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-09-26 08:25:21,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2018-09-26 08:25:21,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-09-26 08:25:21,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 242 transitions. [2018-09-26 08:25:21,380 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 242 transitions. Word has length 239 [2018-09-26 08:25:21,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:21,381 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 242 transitions. [2018-09-26 08:25:21,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-09-26 08:25:21,381 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 242 transitions. [2018-09-26 08:25:21,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-09-26 08:25:21,382 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:21,382 INFO L375 BasicCegarLoop]: trace histogram [120, 119, 1, 1] [2018-09-26 08:25:21,382 INFO L423 AbstractCegarLoop]: === Iteration 120 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:21,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:21,382 INFO L82 PathProgramCache]: Analyzing trace with hash 334899470, now seen corresponding path program 119 times [2018-09-26 08:25:21,383 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:21,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:21,982 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 14280 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:21,983 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:21,983 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [120] total 120 [2018-09-26 08:25:21,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-09-26 08:25:21,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-09-26 08:25:21,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-09-26 08:25:21,985 INFO L87 Difference]: Start difference. First operand 242 states and 242 transitions. Second operand 122 states. [2018-09-26 08:25:22,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:22,223 INFO L93 Difference]: Finished difference Result 245 states and 245 transitions. [2018-09-26 08:25:22,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-09-26 08:25:22,223 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 241 [2018-09-26 08:25:22,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:22,224 INFO L225 Difference]: With dead ends: 245 [2018-09-26 08:25:22,224 INFO L226 Difference]: Without dead ends: 244 [2018-09-26 08:25:22,224 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-09-26 08:25:22,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-09-26 08:25:22,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2018-09-26 08:25:22,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-09-26 08:25:22,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 244 transitions. [2018-09-26 08:25:22,228 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 244 transitions. Word has length 241 [2018-09-26 08:25:22,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:22,228 INFO L480 AbstractCegarLoop]: Abstraction has 244 states and 244 transitions. [2018-09-26 08:25:22,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-09-26 08:25:22,228 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 244 transitions. [2018-09-26 08:25:22,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-09-26 08:25:22,229 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:22,229 INFO L375 BasicCegarLoop]: trace histogram [121, 120, 1, 1] [2018-09-26 08:25:22,229 INFO L423 AbstractCegarLoop]: === Iteration 121 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:22,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:22,229 INFO L82 PathProgramCache]: Analyzing trace with hash -284155440, now seen corresponding path program 120 times [2018-09-26 08:25:22,230 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:22,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:22,811 INFO L134 CoverageAnalysis]: Checked inductivity of 14520 backedges. 0 proven. 14520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:22,811 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:22,811 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-09-26 08:25:22,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-09-26 08:25:22,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-09-26 08:25:22,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7503, Invalid=7503, Unknown=0, NotChecked=0, Total=15006 [2018-09-26 08:25:22,813 INFO L87 Difference]: Start difference. First operand 244 states and 244 transitions. Second operand 123 states. [2018-09-26 08:25:22,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:22,963 INFO L93 Difference]: Finished difference Result 247 states and 247 transitions. [2018-09-26 08:25:22,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-09-26 08:25:22,963 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 243 [2018-09-26 08:25:22,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:22,964 INFO L225 Difference]: With dead ends: 247 [2018-09-26 08:25:22,964 INFO L226 Difference]: Without dead ends: 246 [2018-09-26 08:25:22,965 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=7503, Invalid=7503, Unknown=0, NotChecked=0, Total=15006 [2018-09-26 08:25:22,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-09-26 08:25:22,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2018-09-26 08:25:22,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-09-26 08:25:22,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 246 transitions. [2018-09-26 08:25:22,970 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 246 transitions. Word has length 243 [2018-09-26 08:25:22,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:22,971 INFO L480 AbstractCegarLoop]: Abstraction has 246 states and 246 transitions. [2018-09-26 08:25:22,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-09-26 08:25:22,971 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 246 transitions. [2018-09-26 08:25:22,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-09-26 08:25:22,972 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:22,972 INFO L375 BasicCegarLoop]: trace histogram [122, 121, 1, 1] [2018-09-26 08:25:22,972 INFO L423 AbstractCegarLoop]: === Iteration 122 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:22,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:22,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1804530194, now seen corresponding path program 121 times [2018-09-26 08:25:22,972 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:23,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:23,563 INFO L134 CoverageAnalysis]: Checked inductivity of 14762 backedges. 0 proven. 14762 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:23,563 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:23,563 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [122] total 122 [2018-09-26 08:25:23,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-09-26 08:25:23,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-09-26 08:25:23,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-09-26 08:25:23,565 INFO L87 Difference]: Start difference. First operand 246 states and 246 transitions. Second operand 124 states. [2018-09-26 08:25:23,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:23,884 INFO L93 Difference]: Finished difference Result 249 states and 249 transitions. [2018-09-26 08:25:23,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2018-09-26 08:25:23,884 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 245 [2018-09-26 08:25:23,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:23,885 INFO L225 Difference]: With dead ends: 249 [2018-09-26 08:25:23,885 INFO L226 Difference]: Without dead ends: 248 [2018-09-26 08:25:23,886 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-09-26 08:25:23,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-09-26 08:25:23,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2018-09-26 08:25:23,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-09-26 08:25:23,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 248 transitions. [2018-09-26 08:25:23,891 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 248 transitions. Word has length 245 [2018-09-26 08:25:23,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:23,891 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 248 transitions. [2018-09-26 08:25:23,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-09-26 08:25:23,891 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 248 transitions. [2018-09-26 08:25:23,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-09-26 08:25:23,892 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:23,892 INFO L375 BasicCegarLoop]: trace histogram [123, 122, 1, 1] [2018-09-26 08:25:23,893 INFO L423 AbstractCegarLoop]: === Iteration 123 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:23,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:23,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1013270060, now seen corresponding path program 122 times [2018-09-26 08:25:23,893 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:23,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:24,620 INFO L134 CoverageAnalysis]: Checked inductivity of 15006 backedges. 0 proven. 15006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:24,620 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:24,620 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-09-26 08:25:24,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-09-26 08:25:24,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-09-26 08:25:24,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7750, Invalid=7750, Unknown=0, NotChecked=0, Total=15500 [2018-09-26 08:25:24,622 INFO L87 Difference]: Start difference. First operand 248 states and 248 transitions. Second operand 125 states. [2018-09-26 08:25:24,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:24,895 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2018-09-26 08:25:24,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-09-26 08:25:24,895 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 247 [2018-09-26 08:25:24,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:24,896 INFO L225 Difference]: With dead ends: 251 [2018-09-26 08:25:24,896 INFO L226 Difference]: Without dead ends: 250 [2018-09-26 08:25:24,897 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=7750, Invalid=7750, Unknown=0, NotChecked=0, Total=15500 [2018-09-26 08:25:24,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-09-26 08:25:24,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 250. [2018-09-26 08:25:24,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-09-26 08:25:24,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 250 transitions. [2018-09-26 08:25:24,902 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 250 transitions. Word has length 247 [2018-09-26 08:25:24,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:24,902 INFO L480 AbstractCegarLoop]: Abstraction has 250 states and 250 transitions. [2018-09-26 08:25:24,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-09-26 08:25:24,902 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 250 transitions. [2018-09-26 08:25:24,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-09-26 08:25:24,903 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:24,903 INFO L375 BasicCegarLoop]: trace histogram [124, 123, 1, 1] [2018-09-26 08:25:24,904 INFO L423 AbstractCegarLoop]: === Iteration 124 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:24,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:24,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1205049622, now seen corresponding path program 123 times [2018-09-26 08:25:24,904 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:24,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:25,484 INFO L134 CoverageAnalysis]: Checked inductivity of 15252 backedges. 0 proven. 15252 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:25,484 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:25,484 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [124] total 124 [2018-09-26 08:25:25,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-09-26 08:25:25,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-09-26 08:25:25,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-09-26 08:25:25,487 INFO L87 Difference]: Start difference. First operand 250 states and 250 transitions. Second operand 126 states. [2018-09-26 08:25:25,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:25,621 INFO L93 Difference]: Finished difference Result 253 states and 253 transitions. [2018-09-26 08:25:25,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-09-26 08:25:25,621 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 249 [2018-09-26 08:25:25,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:25,622 INFO L225 Difference]: With dead ends: 253 [2018-09-26 08:25:25,622 INFO L226 Difference]: Without dead ends: 252 [2018-09-26 08:25:25,623 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-09-26 08:25:25,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-09-26 08:25:25,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2018-09-26 08:25:25,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-09-26 08:25:25,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 252 transitions. [2018-09-26 08:25:25,627 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 252 transitions. Word has length 249 [2018-09-26 08:25:25,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:25,627 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 252 transitions. [2018-09-26 08:25:25,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-09-26 08:25:25,627 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 252 transitions. [2018-09-26 08:25:25,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2018-09-26 08:25:25,628 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:25,628 INFO L375 BasicCegarLoop]: trace histogram [125, 124, 1, 1] [2018-09-26 08:25:25,629 INFO L423 AbstractCegarLoop]: === Iteration 125 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:25,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:25,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1588482088, now seen corresponding path program 124 times [2018-09-26 08:25:25,629 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:25,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:26,230 INFO L134 CoverageAnalysis]: Checked inductivity of 15500 backedges. 0 proven. 15500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:26,230 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:26,231 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-09-26 08:25:26,231 INFO L459 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-09-26 08:25:26,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-09-26 08:25:26,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8001, Invalid=8001, Unknown=0, NotChecked=0, Total=16002 [2018-09-26 08:25:26,233 INFO L87 Difference]: Start difference. First operand 252 states and 252 transitions. Second operand 127 states. [2018-09-26 08:25:26,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:26,505 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2018-09-26 08:25:26,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-09-26 08:25:26,505 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 251 [2018-09-26 08:25:26,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:26,506 INFO L225 Difference]: With dead ends: 255 [2018-09-26 08:25:26,506 INFO L226 Difference]: Without dead ends: 254 [2018-09-26 08:25:26,507 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=8001, Invalid=8001, Unknown=0, NotChecked=0, Total=16002 [2018-09-26 08:25:26,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-09-26 08:25:26,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2018-09-26 08:25:26,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-09-26 08:25:26,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 254 transitions. [2018-09-26 08:25:26,512 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 254 transitions. Word has length 251 [2018-09-26 08:25:26,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:26,512 INFO L480 AbstractCegarLoop]: Abstraction has 254 states and 254 transitions. [2018-09-26 08:25:26,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-09-26 08:25:26,512 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 254 transitions. [2018-09-26 08:25:26,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-09-26 08:25:26,513 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:26,513 INFO L375 BasicCegarLoop]: trace histogram [126, 125, 1, 1] [2018-09-26 08:25:26,514 INFO L423 AbstractCegarLoop]: === Iteration 126 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:26,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:26,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1817895398, now seen corresponding path program 125 times [2018-09-26 08:25:26,514 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:26,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:27,132 INFO L134 CoverageAnalysis]: Checked inductivity of 15750 backedges. 0 proven. 15750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:27,133 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:27,133 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [126] total 126 [2018-09-26 08:25:27,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-09-26 08:25:27,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-09-26 08:25:27,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-09-26 08:25:27,135 INFO L87 Difference]: Start difference. First operand 254 states and 254 transitions. Second operand 128 states. [2018-09-26 08:25:27,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:27,268 INFO L93 Difference]: Finished difference Result 257 states and 257 transitions. [2018-09-26 08:25:27,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-09-26 08:25:27,268 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 253 [2018-09-26 08:25:27,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:27,269 INFO L225 Difference]: With dead ends: 257 [2018-09-26 08:25:27,269 INFO L226 Difference]: Without dead ends: 256 [2018-09-26 08:25:27,271 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-09-26 08:25:27,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-09-26 08:25:27,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2018-09-26 08:25:27,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-09-26 08:25:27,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 256 transitions. [2018-09-26 08:25:27,276 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 256 transitions. Word has length 253 [2018-09-26 08:25:27,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:27,276 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 256 transitions. [2018-09-26 08:25:27,276 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-09-26 08:25:27,277 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 256 transitions. [2018-09-26 08:25:27,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-09-26 08:25:27,278 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:27,278 INFO L375 BasicCegarLoop]: trace histogram [127, 126, 1, 1] [2018-09-26 08:25:27,278 INFO L423 AbstractCegarLoop]: === Iteration 127 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:27,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:27,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1054213084, now seen corresponding path program 126 times [2018-09-26 08:25:27,278 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:27,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:28,113 INFO L134 CoverageAnalysis]: Checked inductivity of 16002 backedges. 0 proven. 16002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:28,113 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:28,113 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-09-26 08:25:28,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-09-26 08:25:28,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-09-26 08:25:28,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8256, Invalid=8256, Unknown=0, NotChecked=0, Total=16512 [2018-09-26 08:25:28,115 INFO L87 Difference]: Start difference. First operand 256 states and 256 transitions. Second operand 129 states. [2018-09-26 08:25:28,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:28,405 INFO L93 Difference]: Finished difference Result 259 states and 259 transitions. [2018-09-26 08:25:28,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-09-26 08:25:28,406 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 255 [2018-09-26 08:25:28,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:28,407 INFO L225 Difference]: With dead ends: 259 [2018-09-26 08:25:28,407 INFO L226 Difference]: Without dead ends: 258 [2018-09-26 08:25:28,407 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=8256, Invalid=8256, Unknown=0, NotChecked=0, Total=16512 [2018-09-26 08:25:28,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-09-26 08:25:28,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2018-09-26 08:25:28,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-09-26 08:25:28,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 258 transitions. [2018-09-26 08:25:28,412 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 258 transitions. Word has length 255 [2018-09-26 08:25:28,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:28,413 INFO L480 AbstractCegarLoop]: Abstraction has 258 states and 258 transitions. [2018-09-26 08:25:28,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-09-26 08:25:28,413 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 258 transitions. [2018-09-26 08:25:28,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-09-26 08:25:28,414 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:28,414 INFO L375 BasicCegarLoop]: trace histogram [128, 127, 1, 1] [2018-09-26 08:25:28,414 INFO L423 AbstractCegarLoop]: === Iteration 128 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:28,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:28,415 INFO L82 PathProgramCache]: Analyzing trace with hash -513507042, now seen corresponding path program 127 times [2018-09-26 08:25:28,415 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:28,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:29,086 INFO L134 CoverageAnalysis]: Checked inductivity of 16256 backedges. 0 proven. 16256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:29,086 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:29,086 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [128] total 128 [2018-09-26 08:25:29,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-09-26 08:25:29,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-09-26 08:25:29,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-09-26 08:25:29,090 INFO L87 Difference]: Start difference. First operand 258 states and 258 transitions. Second operand 130 states. [2018-09-26 08:25:29,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:29,221 INFO L93 Difference]: Finished difference Result 261 states and 261 transitions. [2018-09-26 08:25:29,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-09-26 08:25:29,221 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 257 [2018-09-26 08:25:29,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:29,222 INFO L225 Difference]: With dead ends: 261 [2018-09-26 08:25:29,222 INFO L226 Difference]: Without dead ends: 260 [2018-09-26 08:25:29,223 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-09-26 08:25:29,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-09-26 08:25:29,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2018-09-26 08:25:29,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-09-26 08:25:29,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 260 transitions. [2018-09-26 08:25:29,228 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 260 transitions. Word has length 257 [2018-09-26 08:25:29,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:29,228 INFO L480 AbstractCegarLoop]: Abstraction has 260 states and 260 transitions. [2018-09-26 08:25:29,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-09-26 08:25:29,228 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 260 transitions. [2018-09-26 08:25:29,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-09-26 08:25:29,229 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:29,229 INFO L375 BasicCegarLoop]: trace histogram [129, 128, 1, 1] [2018-09-26 08:25:29,230 INFO L423 AbstractCegarLoop]: === Iteration 129 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:29,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:29,230 INFO L82 PathProgramCache]: Analyzing trace with hash 440972768, now seen corresponding path program 128 times [2018-09-26 08:25:29,230 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:29,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:29,865 INFO L134 CoverageAnalysis]: Checked inductivity of 16512 backedges. 0 proven. 16512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:29,865 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:29,865 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-09-26 08:25:29,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-09-26 08:25:29,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-09-26 08:25:29,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8515, Invalid=8515, Unknown=0, NotChecked=0, Total=17030 [2018-09-26 08:25:29,868 INFO L87 Difference]: Start difference. First operand 260 states and 260 transitions. Second operand 131 states. [2018-09-26 08:25:30,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:30,185 INFO L93 Difference]: Finished difference Result 263 states and 263 transitions. [2018-09-26 08:25:30,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-09-26 08:25:30,185 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 259 [2018-09-26 08:25:30,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:30,186 INFO L225 Difference]: With dead ends: 263 [2018-09-26 08:25:30,186 INFO L226 Difference]: Without dead ends: 262 [2018-09-26 08:25:30,187 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=8515, Invalid=8515, Unknown=0, NotChecked=0, Total=17030 [2018-09-26 08:25:30,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-09-26 08:25:30,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 262. [2018-09-26 08:25:30,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2018-09-26 08:25:30,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 262 transitions. [2018-09-26 08:25:30,191 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 262 transitions. Word has length 259 [2018-09-26 08:25:30,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:30,191 INFO L480 AbstractCegarLoop]: Abstraction has 262 states and 262 transitions. [2018-09-26 08:25:30,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-09-26 08:25:30,192 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 262 transitions. [2018-09-26 08:25:30,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-09-26 08:25:30,193 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:30,193 INFO L375 BasicCegarLoop]: trace histogram [130, 129, 1, 1] [2018-09-26 08:25:30,193 INFO L423 AbstractCegarLoop]: === Iteration 130 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:30,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:30,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1426931166, now seen corresponding path program 129 times [2018-09-26 08:25:30,193 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:30,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:30,873 INFO L134 CoverageAnalysis]: Checked inductivity of 16770 backedges. 0 proven. 16770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:30,874 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:30,874 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [130] total 130 [2018-09-26 08:25:30,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-09-26 08:25:30,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-09-26 08:25:30,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-09-26 08:25:30,876 INFO L87 Difference]: Start difference. First operand 262 states and 262 transitions. Second operand 132 states. [2018-09-26 08:25:31,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:31,210 INFO L93 Difference]: Finished difference Result 265 states and 265 transitions. [2018-09-26 08:25:31,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-09-26 08:25:31,210 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 261 [2018-09-26 08:25:31,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:31,210 INFO L225 Difference]: With dead ends: 265 [2018-09-26 08:25:31,211 INFO L226 Difference]: Without dead ends: 264 [2018-09-26 08:25:31,212 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-09-26 08:25:31,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-09-26 08:25:31,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2018-09-26 08:25:31,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-09-26 08:25:31,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 264 transitions. [2018-09-26 08:25:31,215 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 264 transitions. Word has length 261 [2018-09-26 08:25:31,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:31,216 INFO L480 AbstractCegarLoop]: Abstraction has 264 states and 264 transitions. [2018-09-26 08:25:31,216 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-09-26 08:25:31,216 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 264 transitions. [2018-09-26 08:25:31,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-09-26 08:25:31,216 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:31,216 INFO L375 BasicCegarLoop]: trace histogram [131, 130, 1, 1] [2018-09-26 08:25:31,217 INFO L423 AbstractCegarLoop]: === Iteration 131 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:31,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:31,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1186282012, now seen corresponding path program 130 times [2018-09-26 08:25:31,217 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:31,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:31,947 INFO L134 CoverageAnalysis]: Checked inductivity of 17030 backedges. 0 proven. 17030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:31,947 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:31,947 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-09-26 08:25:31,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-09-26 08:25:31,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-09-26 08:25:31,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8778, Invalid=8778, Unknown=0, NotChecked=0, Total=17556 [2018-09-26 08:25:31,949 INFO L87 Difference]: Start difference. First operand 264 states and 264 transitions. Second operand 133 states. [2018-09-26 08:25:32,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:32,219 INFO L93 Difference]: Finished difference Result 267 states and 267 transitions. [2018-09-26 08:25:32,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-09-26 08:25:32,219 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 263 [2018-09-26 08:25:32,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:32,219 INFO L225 Difference]: With dead ends: 267 [2018-09-26 08:25:32,220 INFO L226 Difference]: Without dead ends: 266 [2018-09-26 08:25:32,220 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=8778, Invalid=8778, Unknown=0, NotChecked=0, Total=17556 [2018-09-26 08:25:32,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-09-26 08:25:32,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2018-09-26 08:25:32,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-09-26 08:25:32,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 266 transitions. [2018-09-26 08:25:32,223 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 266 transitions. Word has length 263 [2018-09-26 08:25:32,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:32,224 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 266 transitions. [2018-09-26 08:25:32,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-09-26 08:25:32,224 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 266 transitions. [2018-09-26 08:25:32,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-09-26 08:25:32,224 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:32,225 INFO L375 BasicCegarLoop]: trace histogram [132, 131, 1, 1] [2018-09-26 08:25:32,225 INFO L423 AbstractCegarLoop]: === Iteration 132 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:32,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:32,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1850679002, now seen corresponding path program 131 times [2018-09-26 08:25:32,225 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:32,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:32,874 INFO L134 CoverageAnalysis]: Checked inductivity of 17292 backedges. 0 proven. 17292 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:32,875 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:32,875 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [132] total 132 [2018-09-26 08:25:32,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-09-26 08:25:32,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-09-26 08:25:32,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-09-26 08:25:32,877 INFO L87 Difference]: Start difference. First operand 266 states and 266 transitions. Second operand 134 states. [2018-09-26 08:25:33,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:33,223 INFO L93 Difference]: Finished difference Result 269 states and 269 transitions. [2018-09-26 08:25:33,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-09-26 08:25:33,223 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 265 [2018-09-26 08:25:33,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:33,224 INFO L225 Difference]: With dead ends: 269 [2018-09-26 08:25:33,224 INFO L226 Difference]: Without dead ends: 268 [2018-09-26 08:25:33,225 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-09-26 08:25:33,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-09-26 08:25:33,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2018-09-26 08:25:33,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2018-09-26 08:25:33,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 268 transitions. [2018-09-26 08:25:33,229 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 268 transitions. Word has length 265 [2018-09-26 08:25:33,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:33,229 INFO L480 AbstractCegarLoop]: Abstraction has 268 states and 268 transitions. [2018-09-26 08:25:33,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-09-26 08:25:33,229 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 268 transitions. [2018-09-26 08:25:33,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-09-26 08:25:33,230 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:33,230 INFO L375 BasicCegarLoop]: trace histogram [133, 132, 1, 1] [2018-09-26 08:25:33,230 INFO L423 AbstractCegarLoop]: === Iteration 133 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:33,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:33,231 INFO L82 PathProgramCache]: Analyzing trace with hash -386059288, now seen corresponding path program 132 times [2018-09-26 08:25:33,231 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:33,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:33,906 INFO L134 CoverageAnalysis]: Checked inductivity of 17556 backedges. 0 proven. 17556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:33,906 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:33,906 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-09-26 08:25:33,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-09-26 08:25:33,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-09-26 08:25:33,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9045, Invalid=9045, Unknown=0, NotChecked=0, Total=18090 [2018-09-26 08:25:33,908 INFO L87 Difference]: Start difference. First operand 268 states and 268 transitions. Second operand 135 states. [2018-09-26 08:25:34,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:34,325 INFO L93 Difference]: Finished difference Result 271 states and 271 transitions. [2018-09-26 08:25:34,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-09-26 08:25:34,326 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 267 [2018-09-26 08:25:34,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:34,326 INFO L225 Difference]: With dead ends: 271 [2018-09-26 08:25:34,326 INFO L226 Difference]: Without dead ends: 270 [2018-09-26 08:25:34,327 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9045, Invalid=9045, Unknown=0, NotChecked=0, Total=18090 [2018-09-26 08:25:34,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-09-26 08:25:34,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 270. [2018-09-26 08:25:34,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-09-26 08:25:34,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 270 transitions. [2018-09-26 08:25:34,331 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 270 transitions. Word has length 267 [2018-09-26 08:25:34,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:34,331 INFO L480 AbstractCegarLoop]: Abstraction has 270 states and 270 transitions. [2018-09-26 08:25:34,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-09-26 08:25:34,331 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 270 transitions. [2018-09-26 08:25:34,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-09-26 08:25:34,332 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:34,332 INFO L375 BasicCegarLoop]: trace histogram [134, 133, 1, 1] [2018-09-26 08:25:34,332 INFO L423 AbstractCegarLoop]: === Iteration 134 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:34,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:34,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1635787222, now seen corresponding path program 133 times [2018-09-26 08:25:34,332 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:34,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:35,043 INFO L134 CoverageAnalysis]: Checked inductivity of 17822 backedges. 0 proven. 17822 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:35,043 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:35,043 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [134] total 134 [2018-09-26 08:25:35,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-09-26 08:25:35,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-09-26 08:25:35,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-09-26 08:25:35,047 INFO L87 Difference]: Start difference. First operand 270 states and 270 transitions. Second operand 136 states. [2018-09-26 08:25:35,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:35,212 INFO L93 Difference]: Finished difference Result 273 states and 273 transitions. [2018-09-26 08:25:35,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2018-09-26 08:25:35,212 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 269 [2018-09-26 08:25:35,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:35,213 INFO L225 Difference]: With dead ends: 273 [2018-09-26 08:25:35,213 INFO L226 Difference]: Without dead ends: 272 [2018-09-26 08:25:35,214 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-09-26 08:25:35,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-09-26 08:25:35,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2018-09-26 08:25:35,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-09-26 08:25:35,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 272 transitions. [2018-09-26 08:25:35,217 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 272 transitions. Word has length 269 [2018-09-26 08:25:35,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:35,218 INFO L480 AbstractCegarLoop]: Abstraction has 272 states and 272 transitions. [2018-09-26 08:25:35,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-09-26 08:25:35,218 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 272 transitions. [2018-09-26 08:25:35,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-09-26 08:25:35,218 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:35,219 INFO L375 BasicCegarLoop]: trace histogram [135, 134, 1, 1] [2018-09-26 08:25:35,219 INFO L423 AbstractCegarLoop]: === Iteration 135 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:35,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:35,219 INFO L82 PathProgramCache]: Analyzing trace with hash -33488916, now seen corresponding path program 134 times [2018-09-26 08:25:35,219 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:35,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:35,911 INFO L134 CoverageAnalysis]: Checked inductivity of 18090 backedges. 0 proven. 18090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:35,911 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:35,911 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-09-26 08:25:35,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-09-26 08:25:35,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-09-26 08:25:35,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9316, Invalid=9316, Unknown=0, NotChecked=0, Total=18632 [2018-09-26 08:25:35,913 INFO L87 Difference]: Start difference. First operand 272 states and 272 transitions. Second operand 137 states. [2018-09-26 08:25:36,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:36,282 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2018-09-26 08:25:36,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2018-09-26 08:25:36,282 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 271 [2018-09-26 08:25:36,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:36,283 INFO L225 Difference]: With dead ends: 275 [2018-09-26 08:25:36,283 INFO L226 Difference]: Without dead ends: 274 [2018-09-26 08:25:36,284 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9316, Invalid=9316, Unknown=0, NotChecked=0, Total=18632 [2018-09-26 08:25:36,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-09-26 08:25:36,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 274. [2018-09-26 08:25:36,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-09-26 08:25:36,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 274 transitions. [2018-09-26 08:25:36,290 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 274 transitions. Word has length 271 [2018-09-26 08:25:36,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:36,290 INFO L480 AbstractCegarLoop]: Abstraction has 274 states and 274 transitions. [2018-09-26 08:25:36,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-09-26 08:25:36,291 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 274 transitions. [2018-09-26 08:25:36,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2018-09-26 08:25:36,292 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:36,292 INFO L375 BasicCegarLoop]: trace histogram [136, 135, 1, 1] [2018-09-26 08:25:36,292 INFO L423 AbstractCegarLoop]: === Iteration 136 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:36,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:36,292 INFO L82 PathProgramCache]: Analyzing trace with hash -2118076114, now seen corresponding path program 135 times [2018-09-26 08:25:36,293 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:36,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:37,069 INFO L134 CoverageAnalysis]: Checked inductivity of 18360 backedges. 0 proven. 18360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:37,070 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:37,070 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [136] total 136 [2018-09-26 08:25:37,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-09-26 08:25:37,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-09-26 08:25:37,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-09-26 08:25:37,072 INFO L87 Difference]: Start difference. First operand 274 states and 274 transitions. Second operand 138 states. [2018-09-26 08:25:37,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:37,467 INFO L93 Difference]: Finished difference Result 277 states and 277 transitions. [2018-09-26 08:25:37,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-09-26 08:25:37,467 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 273 [2018-09-26 08:25:37,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:37,467 INFO L225 Difference]: With dead ends: 277 [2018-09-26 08:25:37,468 INFO L226 Difference]: Without dead ends: 276 [2018-09-26 08:25:37,468 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-09-26 08:25:37,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-09-26 08:25:37,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2018-09-26 08:25:37,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-09-26 08:25:37,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 276 transitions. [2018-09-26 08:25:37,472 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 276 transitions. Word has length 273 [2018-09-26 08:25:37,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:37,472 INFO L480 AbstractCegarLoop]: Abstraction has 276 states and 276 transitions. [2018-09-26 08:25:37,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-09-26 08:25:37,472 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 276 transitions. [2018-09-26 08:25:37,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-09-26 08:25:37,473 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:37,473 INFO L375 BasicCegarLoop]: trace histogram [137, 136, 1, 1] [2018-09-26 08:25:37,473 INFO L423 AbstractCegarLoop]: === Iteration 137 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:37,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:37,473 INFO L82 PathProgramCache]: Analyzing trace with hash 343353840, now seen corresponding path program 136 times [2018-09-26 08:25:37,473 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:37,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:38,176 INFO L134 CoverageAnalysis]: Checked inductivity of 18632 backedges. 0 proven. 18632 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:38,177 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:38,177 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2018-09-26 08:25:38,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 139 states [2018-09-26 08:25:38,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2018-09-26 08:25:38,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9591, Invalid=9591, Unknown=0, NotChecked=0, Total=19182 [2018-09-26 08:25:38,180 INFO L87 Difference]: Start difference. First operand 276 states and 276 transitions. Second operand 139 states. [2018-09-26 08:25:38,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:38,608 INFO L93 Difference]: Finished difference Result 279 states and 279 transitions. [2018-09-26 08:25:38,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2018-09-26 08:25:38,608 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 275 [2018-09-26 08:25:38,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:38,609 INFO L225 Difference]: With dead ends: 279 [2018-09-26 08:25:38,609 INFO L226 Difference]: Without dead ends: 278 [2018-09-26 08:25:38,610 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9591, Invalid=9591, Unknown=0, NotChecked=0, Total=19182 [2018-09-26 08:25:38,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-09-26 08:25:38,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2018-09-26 08:25:38,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-09-26 08:25:38,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 278 transitions. [2018-09-26 08:25:38,616 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 278 transitions. Word has length 275 [2018-09-26 08:25:38,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:38,616 INFO L480 AbstractCegarLoop]: Abstraction has 278 states and 278 transitions. [2018-09-26 08:25:38,616 INFO L481 AbstractCegarLoop]: Interpolant automaton has 139 states. [2018-09-26 08:25:38,616 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 278 transitions. [2018-09-26 08:25:38,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-09-26 08:25:38,617 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:38,618 INFO L375 BasicCegarLoop]: trace histogram [138, 137, 1, 1] [2018-09-26 08:25:38,618 INFO L423 AbstractCegarLoop]: === Iteration 138 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:38,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:38,618 INFO L82 PathProgramCache]: Analyzing trace with hash -749440462, now seen corresponding path program 137 times [2018-09-26 08:25:38,618 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:38,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:39,487 INFO L134 CoverageAnalysis]: Checked inductivity of 18906 backedges. 0 proven. 18906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:39,487 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:39,488 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [138] total 138 [2018-09-26 08:25:39,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-09-26 08:25:39,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-09-26 08:25:39,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-09-26 08:25:39,490 INFO L87 Difference]: Start difference. First operand 278 states and 278 transitions. Second operand 140 states. [2018-09-26 08:25:39,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:39,987 INFO L93 Difference]: Finished difference Result 281 states and 281 transitions. [2018-09-26 08:25:39,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2018-09-26 08:25:39,987 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 277 [2018-09-26 08:25:39,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:39,988 INFO L225 Difference]: With dead ends: 281 [2018-09-26 08:25:39,988 INFO L226 Difference]: Without dead ends: 280 [2018-09-26 08:25:39,989 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-09-26 08:25:39,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-09-26 08:25:39,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 280. [2018-09-26 08:25:39,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 280 states. [2018-09-26 08:25:39,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 280 transitions. [2018-09-26 08:25:39,992 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 280 transitions. Word has length 277 [2018-09-26 08:25:39,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:39,992 INFO L480 AbstractCegarLoop]: Abstraction has 280 states and 280 transitions. [2018-09-26 08:25:39,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-09-26 08:25:39,992 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 280 transitions. [2018-09-26 08:25:39,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-09-26 08:25:39,993 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:39,993 INFO L375 BasicCegarLoop]: trace histogram [139, 138, 1, 1] [2018-09-26 08:25:39,993 INFO L423 AbstractCegarLoop]: === Iteration 139 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:39,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:39,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1342222836, now seen corresponding path program 138 times [2018-09-26 08:25:39,994 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:40,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:40,739 INFO L134 CoverageAnalysis]: Checked inductivity of 19182 backedges. 0 proven. 19182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:40,740 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:40,740 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2018-09-26 08:25:40,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 141 states [2018-09-26 08:25:40,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2018-09-26 08:25:40,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9870, Invalid=9870, Unknown=0, NotChecked=0, Total=19740 [2018-09-26 08:25:40,742 INFO L87 Difference]: Start difference. First operand 280 states and 280 transitions. Second operand 141 states. [2018-09-26 08:25:41,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:41,246 INFO L93 Difference]: Finished difference Result 283 states and 283 transitions. [2018-09-26 08:25:41,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-09-26 08:25:41,246 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 279 [2018-09-26 08:25:41,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:41,247 INFO L225 Difference]: With dead ends: 283 [2018-09-26 08:25:41,247 INFO L226 Difference]: Without dead ends: 282 [2018-09-26 08:25:41,248 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=9870, Invalid=9870, Unknown=0, NotChecked=0, Total=19740 [2018-09-26 08:25:41,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-09-26 08:25:41,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2018-09-26 08:25:41,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-09-26 08:25:41,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 282 transitions. [2018-09-26 08:25:41,251 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 282 transitions. Word has length 279 [2018-09-26 08:25:41,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:41,252 INFO L480 AbstractCegarLoop]: Abstraction has 282 states and 282 transitions. [2018-09-26 08:25:41,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 141 states. [2018-09-26 08:25:41,252 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 282 transitions. [2018-09-26 08:25:41,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2018-09-26 08:25:41,253 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:41,253 INFO L375 BasicCegarLoop]: trace histogram [140, 139, 1, 1] [2018-09-26 08:25:41,253 INFO L423 AbstractCegarLoop]: === Iteration 140 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:41,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:41,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1385957686, now seen corresponding path program 139 times [2018-09-26 08:25:41,253 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:41,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:42,001 INFO L134 CoverageAnalysis]: Checked inductivity of 19460 backedges. 0 proven. 19460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:42,001 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:42,002 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [140] total 140 [2018-09-26 08:25:42,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-09-26 08:25:42,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-09-26 08:25:42,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-09-26 08:25:42,005 INFO L87 Difference]: Start difference. First operand 282 states and 282 transitions. Second operand 142 states. [2018-09-26 08:25:42,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:42,588 INFO L93 Difference]: Finished difference Result 285 states and 285 transitions. [2018-09-26 08:25:42,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2018-09-26 08:25:42,588 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 281 [2018-09-26 08:25:42,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:42,589 INFO L225 Difference]: With dead ends: 285 [2018-09-26 08:25:42,589 INFO L226 Difference]: Without dead ends: 284 [2018-09-26 08:25:42,590 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-09-26 08:25:42,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-09-26 08:25:42,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 284. [2018-09-26 08:25:42,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-09-26 08:25:42,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 284 transitions. [2018-09-26 08:25:42,594 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 284 transitions. Word has length 281 [2018-09-26 08:25:42,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:42,594 INFO L480 AbstractCegarLoop]: Abstraction has 284 states and 284 transitions. [2018-09-26 08:25:42,594 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-09-26 08:25:42,594 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 284 transitions. [2018-09-26 08:25:42,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2018-09-26 08:25:42,595 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:42,595 INFO L375 BasicCegarLoop]: trace histogram [141, 140, 1, 1] [2018-09-26 08:25:42,595 INFO L423 AbstractCegarLoop]: === Iteration 141 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:42,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:42,595 INFO L82 PathProgramCache]: Analyzing trace with hash 465475576, now seen corresponding path program 140 times [2018-09-26 08:25:42,595 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:42,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:43,392 INFO L134 CoverageAnalysis]: Checked inductivity of 19740 backedges. 0 proven. 19740 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:43,392 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:43,392 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141] total 141 [2018-09-26 08:25:43,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 143 states [2018-09-26 08:25:43,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2018-09-26 08:25:43,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10153, Invalid=10153, Unknown=0, NotChecked=0, Total=20306 [2018-09-26 08:25:43,395 INFO L87 Difference]: Start difference. First operand 284 states and 284 transitions. Second operand 143 states. [2018-09-26 08:25:43,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:43,942 INFO L93 Difference]: Finished difference Result 287 states and 287 transitions. [2018-09-26 08:25:43,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-09-26 08:25:43,943 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 283 [2018-09-26 08:25:43,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:43,943 INFO L225 Difference]: With dead ends: 287 [2018-09-26 08:25:43,944 INFO L226 Difference]: Without dead ends: 286 [2018-09-26 08:25:43,945 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=10153, Invalid=10153, Unknown=0, NotChecked=0, Total=20306 [2018-09-26 08:25:43,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-09-26 08:25:43,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2018-09-26 08:25:43,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-09-26 08:25:43,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 286 transitions. [2018-09-26 08:25:43,949 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 286 transitions. Word has length 283 [2018-09-26 08:25:43,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:43,949 INFO L480 AbstractCegarLoop]: Abstraction has 286 states and 286 transitions. [2018-09-26 08:25:43,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 143 states. [2018-09-26 08:25:43,949 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 286 transitions. [2018-09-26 08:25:43,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-09-26 08:25:43,950 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:43,950 INFO L375 BasicCegarLoop]: trace histogram [142, 141, 1, 1] [2018-09-26 08:25:43,950 INFO L423 AbstractCegarLoop]: === Iteration 142 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:43,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:43,951 INFO L82 PathProgramCache]: Analyzing trace with hash 645430842, now seen corresponding path program 141 times [2018-09-26 08:25:43,951 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:44,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:44,709 INFO L134 CoverageAnalysis]: Checked inductivity of 20022 backedges. 0 proven. 20022 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:44,709 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:44,709 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [142] total 142 [2018-09-26 08:25:44,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2018-09-26 08:25:44,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2018-09-26 08:25:44,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-09-26 08:25:44,712 INFO L87 Difference]: Start difference. First operand 286 states and 286 transitions. Second operand 144 states. [2018-09-26 08:25:45,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:45,269 INFO L93 Difference]: Finished difference Result 289 states and 289 transitions. [2018-09-26 08:25:45,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-09-26 08:25:45,269 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 285 [2018-09-26 08:25:45,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:45,270 INFO L225 Difference]: With dead ends: 289 [2018-09-26 08:25:45,270 INFO L226 Difference]: Without dead ends: 288 [2018-09-26 08:25:45,271 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-09-26 08:25:45,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-09-26 08:25:45,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2018-09-26 08:25:45,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-09-26 08:25:45,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 288 transitions. [2018-09-26 08:25:45,275 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 288 transitions. Word has length 285 [2018-09-26 08:25:45,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:45,275 INFO L480 AbstractCegarLoop]: Abstraction has 288 states and 288 transitions. [2018-09-26 08:25:45,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2018-09-26 08:25:45,275 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 288 transitions. [2018-09-26 08:25:45,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-09-26 08:25:45,276 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:45,276 INFO L375 BasicCegarLoop]: trace histogram [143, 142, 1, 1] [2018-09-26 08:25:45,276 INFO L423 AbstractCegarLoop]: === Iteration 143 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:45,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:45,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1783749628, now seen corresponding path program 142 times [2018-09-26 08:25:45,276 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:45,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:46,090 INFO L134 CoverageAnalysis]: Checked inductivity of 20306 backedges. 0 proven. 20306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:46,090 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:46,091 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143] total 143 [2018-09-26 08:25:46,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 145 states [2018-09-26 08:25:46,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2018-09-26 08:25:46,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10440, Invalid=10440, Unknown=0, NotChecked=0, Total=20880 [2018-09-26 08:25:46,093 INFO L87 Difference]: Start difference. First operand 288 states and 288 transitions. Second operand 145 states. [2018-09-26 08:25:46,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:46,671 INFO L93 Difference]: Finished difference Result 291 states and 291 transitions. [2018-09-26 08:25:46,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2018-09-26 08:25:46,672 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 287 [2018-09-26 08:25:46,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:46,672 INFO L225 Difference]: With dead ends: 291 [2018-09-26 08:25:46,672 INFO L226 Difference]: Without dead ends: 290 [2018-09-26 08:25:46,674 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=10440, Invalid=10440, Unknown=0, NotChecked=0, Total=20880 [2018-09-26 08:25:46,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-09-26 08:25:46,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 290. [2018-09-26 08:25:46,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-09-26 08:25:46,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 290 transitions. [2018-09-26 08:25:46,680 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 290 transitions. Word has length 287 [2018-09-26 08:25:46,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:46,681 INFO L480 AbstractCegarLoop]: Abstraction has 290 states and 290 transitions. [2018-09-26 08:25:46,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 145 states. [2018-09-26 08:25:46,681 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 290 transitions. [2018-09-26 08:25:46,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-09-26 08:25:46,682 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:46,682 INFO L375 BasicCegarLoop]: trace histogram [144, 143, 1, 1] [2018-09-26 08:25:46,682 INFO L423 AbstractCegarLoop]: === Iteration 144 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:46,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:46,683 INFO L82 PathProgramCache]: Analyzing trace with hash 491442494, now seen corresponding path program 143 times [2018-09-26 08:25:46,683 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:46,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:47,566 INFO L134 CoverageAnalysis]: Checked inductivity of 20592 backedges. 0 proven. 20592 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:47,566 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:47,567 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [144] total 144 [2018-09-26 08:25:47,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2018-09-26 08:25:47,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2018-09-26 08:25:47,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-09-26 08:25:47,569 INFO L87 Difference]: Start difference. First operand 290 states and 290 transitions. Second operand 146 states. [2018-09-26 08:25:48,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:48,090 INFO L93 Difference]: Finished difference Result 293 states and 293 transitions. [2018-09-26 08:25:48,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-09-26 08:25:48,090 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 289 [2018-09-26 08:25:48,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:48,090 INFO L225 Difference]: With dead ends: 293 [2018-09-26 08:25:48,090 INFO L226 Difference]: Without dead ends: 292 [2018-09-26 08:25:48,091 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-09-26 08:25:48,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-09-26 08:25:48,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 292. [2018-09-26 08:25:48,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-09-26 08:25:48,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 292 transitions. [2018-09-26 08:25:48,095 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 292 transitions. Word has length 289 [2018-09-26 08:25:48,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:48,095 INFO L480 AbstractCegarLoop]: Abstraction has 292 states and 292 transitions. [2018-09-26 08:25:48,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2018-09-26 08:25:48,096 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 292 transitions. [2018-09-26 08:25:48,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2018-09-26 08:25:48,096 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:48,096 INFO L375 BasicCegarLoop]: trace histogram [145, 144, 1, 1] [2018-09-26 08:25:48,096 INFO L423 AbstractCegarLoop]: === Iteration 145 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:48,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:48,097 INFO L82 PathProgramCache]: Analyzing trace with hash -170164736, now seen corresponding path program 144 times [2018-09-26 08:25:48,097 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:48,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:48,904 INFO L134 CoverageAnalysis]: Checked inductivity of 20880 backedges. 0 proven. 20880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:48,905 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:48,905 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145] total 145 [2018-09-26 08:25:48,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 147 states [2018-09-26 08:25:48,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2018-09-26 08:25:48,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10731, Invalid=10731, Unknown=0, NotChecked=0, Total=21462 [2018-09-26 08:25:48,907 INFO L87 Difference]: Start difference. First operand 292 states and 292 transitions. Second operand 147 states. [2018-09-26 08:25:49,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:49,432 INFO L93 Difference]: Finished difference Result 295 states and 295 transitions. [2018-09-26 08:25:49,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-09-26 08:25:49,432 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 291 [2018-09-26 08:25:49,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:49,433 INFO L225 Difference]: With dead ends: 295 [2018-09-26 08:25:49,433 INFO L226 Difference]: Without dead ends: 294 [2018-09-26 08:25:49,434 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=10731, Invalid=10731, Unknown=0, NotChecked=0, Total=21462 [2018-09-26 08:25:49,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-09-26 08:25:49,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2018-09-26 08:25:49,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-09-26 08:25:49,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 294 transitions. [2018-09-26 08:25:49,437 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 294 transitions. Word has length 291 [2018-09-26 08:25:49,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:49,438 INFO L480 AbstractCegarLoop]: Abstraction has 294 states and 294 transitions. [2018-09-26 08:25:49,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 147 states. [2018-09-26 08:25:49,438 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 294 transitions. [2018-09-26 08:25:49,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2018-09-26 08:25:49,438 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:49,439 INFO L375 BasicCegarLoop]: trace histogram [146, 145, 1, 1] [2018-09-26 08:25:49,439 INFO L423 AbstractCegarLoop]: === Iteration 146 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:49,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:49,439 INFO L82 PathProgramCache]: Analyzing trace with hash -319552958, now seen corresponding path program 145 times [2018-09-26 08:25:49,439 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:49,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:50,263 INFO L134 CoverageAnalysis]: Checked inductivity of 21170 backedges. 0 proven. 21170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:50,263 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:50,263 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [146] total 146 [2018-09-26 08:25:50,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-09-26 08:25:50,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-09-26 08:25:50,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-09-26 08:25:50,266 INFO L87 Difference]: Start difference. First operand 294 states and 294 transitions. Second operand 148 states. [2018-09-26 08:25:50,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:50,714 INFO L93 Difference]: Finished difference Result 297 states and 297 transitions. [2018-09-26 08:25:50,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2018-09-26 08:25:50,715 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 293 [2018-09-26 08:25:50,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:50,715 INFO L225 Difference]: With dead ends: 297 [2018-09-26 08:25:50,715 INFO L226 Difference]: Without dead ends: 296 [2018-09-26 08:25:50,717 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-09-26 08:25:50,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-09-26 08:25:50,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2018-09-26 08:25:50,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-09-26 08:25:50,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 296 transitions. [2018-09-26 08:25:50,720 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 296 transitions. Word has length 293 [2018-09-26 08:25:50,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:50,721 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 296 transitions. [2018-09-26 08:25:50,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2018-09-26 08:25:50,721 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 296 transitions. [2018-09-26 08:25:50,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2018-09-26 08:25:50,722 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:50,722 INFO L375 BasicCegarLoop]: trace histogram [147, 146, 1, 1] [2018-09-26 08:25:50,722 INFO L423 AbstractCegarLoop]: === Iteration 147 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:50,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:50,722 INFO L82 PathProgramCache]: Analyzing trace with hash 2147253764, now seen corresponding path program 146 times [2018-09-26 08:25:50,722 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:50,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:51,551 INFO L134 CoverageAnalysis]: Checked inductivity of 21462 backedges. 0 proven. 21462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:51,551 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:51,551 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147] total 147 [2018-09-26 08:25:51,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 149 states [2018-09-26 08:25:51,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2018-09-26 08:25:51,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11026, Invalid=11026, Unknown=0, NotChecked=0, Total=22052 [2018-09-26 08:25:51,554 INFO L87 Difference]: Start difference. First operand 296 states and 296 transitions. Second operand 149 states. [2018-09-26 08:25:51,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:51,792 INFO L93 Difference]: Finished difference Result 299 states and 299 transitions. [2018-09-26 08:25:51,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2018-09-26 08:25:51,792 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 295 [2018-09-26 08:25:51,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:51,793 INFO L225 Difference]: With dead ends: 299 [2018-09-26 08:25:51,793 INFO L226 Difference]: Without dead ends: 298 [2018-09-26 08:25:51,794 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=11026, Invalid=11026, Unknown=0, NotChecked=0, Total=22052 [2018-09-26 08:25:51,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-09-26 08:25:51,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2018-09-26 08:25:51,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2018-09-26 08:25:51,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 298 transitions. [2018-09-26 08:25:51,801 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 298 transitions. Word has length 295 [2018-09-26 08:25:51,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:51,801 INFO L480 AbstractCegarLoop]: Abstraction has 298 states and 298 transitions. [2018-09-26 08:25:51,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 149 states. [2018-09-26 08:25:51,801 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 298 transitions. [2018-09-26 08:25:51,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-09-26 08:25:51,802 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:51,803 INFO L375 BasicCegarLoop]: trace histogram [148, 147, 1, 1] [2018-09-26 08:25:51,803 INFO L423 AbstractCegarLoop]: === Iteration 148 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:51,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:51,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1926566214, now seen corresponding path program 147 times [2018-09-26 08:25:51,803 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:51,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:52,654 INFO L134 CoverageAnalysis]: Checked inductivity of 21756 backedges. 0 proven. 21756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:52,655 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:52,655 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [148] total 148 [2018-09-26 08:25:52,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2018-09-26 08:25:52,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2018-09-26 08:25:52,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-09-26 08:25:52,657 INFO L87 Difference]: Start difference. First operand 298 states and 298 transitions. Second operand 150 states. [2018-09-26 08:25:53,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:53,404 INFO L93 Difference]: Finished difference Result 301 states and 301 transitions. [2018-09-26 08:25:53,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-09-26 08:25:53,404 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 297 [2018-09-26 08:25:53,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:53,405 INFO L225 Difference]: With dead ends: 301 [2018-09-26 08:25:53,405 INFO L226 Difference]: Without dead ends: 300 [2018-09-26 08:25:53,406 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-09-26 08:25:53,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-09-26 08:25:53,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2018-09-26 08:25:53,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-09-26 08:25:53,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 300 transitions. [2018-09-26 08:25:53,410 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 300 transitions. Word has length 297 [2018-09-26 08:25:53,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:53,410 INFO L480 AbstractCegarLoop]: Abstraction has 300 states and 300 transitions. [2018-09-26 08:25:53,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2018-09-26 08:25:53,410 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 300 transitions. [2018-09-26 08:25:53,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2018-09-26 08:25:53,411 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:53,411 INFO L375 BasicCegarLoop]: trace histogram [149, 148, 1, 1] [2018-09-26 08:25:53,411 INFO L423 AbstractCegarLoop]: === Iteration 149 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:53,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:53,411 INFO L82 PathProgramCache]: Analyzing trace with hash 299228168, now seen corresponding path program 148 times [2018-09-26 08:25:53,411 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:53,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:54,321 INFO L134 CoverageAnalysis]: Checked inductivity of 22052 backedges. 0 proven. 22052 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:54,321 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:54,321 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [149] total 149 [2018-09-26 08:25:54,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 151 states [2018-09-26 08:25:54,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 151 interpolants. [2018-09-26 08:25:54,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11325, Invalid=11325, Unknown=0, NotChecked=0, Total=22650 [2018-09-26 08:25:54,324 INFO L87 Difference]: Start difference. First operand 300 states and 300 transitions. Second operand 151 states. [2018-09-26 08:25:54,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:54,946 INFO L93 Difference]: Finished difference Result 303 states and 303 transitions. [2018-09-26 08:25:54,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2018-09-26 08:25:54,946 INFO L78 Accepts]: Start accepts. Automaton has 151 states. Word has length 299 [2018-09-26 08:25:54,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:54,947 INFO L225 Difference]: With dead ends: 303 [2018-09-26 08:25:54,947 INFO L226 Difference]: Without dead ends: 302 [2018-09-26 08:25:54,949 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=11325, Invalid=11325, Unknown=0, NotChecked=0, Total=22650 [2018-09-26 08:25:54,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-09-26 08:25:54,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2018-09-26 08:25:54,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-09-26 08:25:54,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 302 transitions. [2018-09-26 08:25:54,953 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 302 transitions. Word has length 299 [2018-09-26 08:25:54,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:54,954 INFO L480 AbstractCegarLoop]: Abstraction has 302 states and 302 transitions. [2018-09-26 08:25:54,954 INFO L481 AbstractCegarLoop]: Interpolant automaton has 151 states. [2018-09-26 08:25:54,954 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 302 transitions. [2018-09-26 08:25:54,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-09-26 08:25:54,955 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:54,955 INFO L375 BasicCegarLoop]: trace histogram [150, 149, 1, 1] [2018-09-26 08:25:54,955 INFO L423 AbstractCegarLoop]: === Iteration 150 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:54,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:54,955 INFO L82 PathProgramCache]: Analyzing trace with hash -204538294, now seen corresponding path program 149 times [2018-09-26 08:25:54,955 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:55,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:55,876 INFO L134 CoverageAnalysis]: Checked inductivity of 22350 backedges. 0 proven. 22350 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:55,876 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:55,876 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [150] total 150 [2018-09-26 08:25:55,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2018-09-26 08:25:55,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2018-09-26 08:25:55,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-09-26 08:25:55,879 INFO L87 Difference]: Start difference. First operand 302 states and 302 transitions. Second operand 152 states. [2018-09-26 08:25:56,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:56,210 INFO L93 Difference]: Finished difference Result 305 states and 305 transitions. [2018-09-26 08:25:56,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-09-26 08:25:56,210 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 301 [2018-09-26 08:25:56,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:56,211 INFO L225 Difference]: With dead ends: 305 [2018-09-26 08:25:56,211 INFO L226 Difference]: Without dead ends: 304 [2018-09-26 08:25:56,213 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-09-26 08:25:56,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-09-26 08:25:56,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2018-09-26 08:25:56,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-09-26 08:25:56,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 304 transitions. [2018-09-26 08:25:56,217 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 304 transitions. Word has length 301 [2018-09-26 08:25:56,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:56,217 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 304 transitions. [2018-09-26 08:25:56,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2018-09-26 08:25:56,217 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 304 transitions. [2018-09-26 08:25:56,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-09-26 08:25:56,218 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:56,218 INFO L375 BasicCegarLoop]: trace histogram [151, 150, 1, 1] [2018-09-26 08:25:56,218 INFO L423 AbstractCegarLoop]: === Iteration 151 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:56,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:56,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1007196172, now seen corresponding path program 150 times [2018-09-26 08:25:56,219 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:56,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:57,107 INFO L134 CoverageAnalysis]: Checked inductivity of 22650 backedges. 0 proven. 22650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:57,107 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:57,108 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [151] total 151 [2018-09-26 08:25:57,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 153 states [2018-09-26 08:25:57,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 153 interpolants. [2018-09-26 08:25:57,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11628, Invalid=11628, Unknown=0, NotChecked=0, Total=23256 [2018-09-26 08:25:57,111 INFO L87 Difference]: Start difference. First operand 304 states and 304 transitions. Second operand 153 states. [2018-09-26 08:25:57,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:57,753 INFO L93 Difference]: Finished difference Result 307 states and 307 transitions. [2018-09-26 08:25:57,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2018-09-26 08:25:57,753 INFO L78 Accepts]: Start accepts. Automaton has 153 states. Word has length 303 [2018-09-26 08:25:57,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:57,753 INFO L225 Difference]: With dead ends: 307 [2018-09-26 08:25:57,754 INFO L226 Difference]: Without dead ends: 306 [2018-09-26 08:25:57,755 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=11628, Invalid=11628, Unknown=0, NotChecked=0, Total=23256 [2018-09-26 08:25:57,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-09-26 08:25:57,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2018-09-26 08:25:57,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-09-26 08:25:57,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 306 transitions. [2018-09-26 08:25:57,759 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 306 transitions. Word has length 303 [2018-09-26 08:25:57,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:57,759 INFO L480 AbstractCegarLoop]: Abstraction has 306 states and 306 transitions. [2018-09-26 08:25:57,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 153 states. [2018-09-26 08:25:57,759 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 306 transitions. [2018-09-26 08:25:57,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2018-09-26 08:25:57,760 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:57,760 INFO L375 BasicCegarLoop]: trace histogram [152, 151, 1, 1] [2018-09-26 08:25:57,760 INFO L423 AbstractCegarLoop]: === Iteration 152 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:57,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:57,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1547880782, now seen corresponding path program 151 times [2018-09-26 08:25:57,760 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:57,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:58,675 INFO L134 CoverageAnalysis]: Checked inductivity of 22952 backedges. 0 proven. 22952 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:58,676 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:58,676 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [152] total 152 [2018-09-26 08:25:58,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2018-09-26 08:25:58,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2018-09-26 08:25:58,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-09-26 08:25:58,679 INFO L87 Difference]: Start difference. First operand 306 states and 306 transitions. Second operand 154 states. [2018-09-26 08:25:59,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:59,425 INFO L93 Difference]: Finished difference Result 309 states and 309 transitions. [2018-09-26 08:25:59,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2018-09-26 08:25:59,425 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 305 [2018-09-26 08:25:59,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:59,426 INFO L225 Difference]: With dead ends: 309 [2018-09-26 08:25:59,426 INFO L226 Difference]: Without dead ends: 308 [2018-09-26 08:25:59,428 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-09-26 08:25:59,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-09-26 08:25:59,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2018-09-26 08:25:59,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-09-26 08:25:59,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 308 transitions. [2018-09-26 08:25:59,435 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 308 transitions. Word has length 305 [2018-09-26 08:25:59,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:59,435 INFO L480 AbstractCegarLoop]: Abstraction has 308 states and 308 transitions. [2018-09-26 08:25:59,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2018-09-26 08:25:59,436 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 308 transitions. [2018-09-26 08:25:59,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-09-26 08:25:59,437 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:59,437 INFO L375 BasicCegarLoop]: trace histogram [153, 152, 1, 1] [2018-09-26 08:25:59,437 INFO L423 AbstractCegarLoop]: === Iteration 153 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:59,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:59,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1454748176, now seen corresponding path program 152 times [2018-09-26 08:25:59,438 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:59,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:00,472 INFO L134 CoverageAnalysis]: Checked inductivity of 23256 backedges. 0 proven. 23256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:00,472 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:00,472 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [153] total 153 [2018-09-26 08:26:00,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 155 states [2018-09-26 08:26:00,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2018-09-26 08:26:00,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11935, Invalid=11935, Unknown=0, NotChecked=0, Total=23870 [2018-09-26 08:26:00,476 INFO L87 Difference]: Start difference. First operand 308 states and 308 transitions. Second operand 155 states. [2018-09-26 08:26:00,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:00,797 INFO L93 Difference]: Finished difference Result 311 states and 311 transitions. [2018-09-26 08:26:00,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2018-09-26 08:26:00,797 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 307 [2018-09-26 08:26:00,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:00,798 INFO L225 Difference]: With dead ends: 311 [2018-09-26 08:26:00,798 INFO L226 Difference]: Without dead ends: 310 [2018-09-26 08:26:00,799 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=11935, Invalid=11935, Unknown=0, NotChecked=0, Total=23870 [2018-09-26 08:26:00,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-09-26 08:26:00,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2018-09-26 08:26:00,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2018-09-26 08:26:00,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 310 transitions. [2018-09-26 08:26:00,803 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 310 transitions. Word has length 307 [2018-09-26 08:26:00,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:00,804 INFO L480 AbstractCegarLoop]: Abstraction has 310 states and 310 transitions. [2018-09-26 08:26:00,804 INFO L481 AbstractCegarLoop]: Interpolant automaton has 155 states. [2018-09-26 08:26:00,804 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 310 transitions. [2018-09-26 08:26:00,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2018-09-26 08:26:00,804 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:00,805 INFO L375 BasicCegarLoop]: trace histogram [154, 153, 1, 1] [2018-09-26 08:26:00,805 INFO L423 AbstractCegarLoop]: === Iteration 154 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:00,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:00,805 INFO L82 PathProgramCache]: Analyzing trace with hash -2146340270, now seen corresponding path program 153 times [2018-09-26 08:26:00,805 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:00,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:01,775 INFO L134 CoverageAnalysis]: Checked inductivity of 23562 backedges. 0 proven. 23562 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:01,776 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:01,776 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [154] total 154 [2018-09-26 08:26:01,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 156 states [2018-09-26 08:26:01,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2018-09-26 08:26:01,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-09-26 08:26:01,780 INFO L87 Difference]: Start difference. First operand 310 states and 310 transitions. Second operand 156 states. [2018-09-26 08:26:02,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:02,542 INFO L93 Difference]: Finished difference Result 313 states and 313 transitions. [2018-09-26 08:26:02,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2018-09-26 08:26:02,542 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 309 [2018-09-26 08:26:02,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:02,543 INFO L225 Difference]: With dead ends: 313 [2018-09-26 08:26:02,543 INFO L226 Difference]: Without dead ends: 312 [2018-09-26 08:26:02,545 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-09-26 08:26:02,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2018-09-26 08:26:02,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2018-09-26 08:26:02,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2018-09-26 08:26:02,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 312 transitions. [2018-09-26 08:26:02,551 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 312 transitions. Word has length 309 [2018-09-26 08:26:02,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:02,552 INFO L480 AbstractCegarLoop]: Abstraction has 312 states and 312 transitions. [2018-09-26 08:26:02,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 156 states. [2018-09-26 08:26:02,552 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 312 transitions. [2018-09-26 08:26:02,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2018-09-26 08:26:02,553 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:02,554 INFO L375 BasicCegarLoop]: trace histogram [155, 154, 1, 1] [2018-09-26 08:26:02,554 INFO L423 AbstractCegarLoop]: === Iteration 155 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:02,554 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:02,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1048696300, now seen corresponding path program 154 times [2018-09-26 08:26:02,554 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:02,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:03,630 INFO L134 CoverageAnalysis]: Checked inductivity of 23870 backedges. 0 proven. 23870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:03,630 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:03,631 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [155] total 155 [2018-09-26 08:26:03,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 157 states [2018-09-26 08:26:03,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 157 interpolants. [2018-09-26 08:26:03,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12246, Invalid=12246, Unknown=0, NotChecked=0, Total=24492 [2018-09-26 08:26:03,634 INFO L87 Difference]: Start difference. First operand 312 states and 312 transitions. Second operand 157 states. [2018-09-26 08:26:03,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:03,914 INFO L93 Difference]: Finished difference Result 315 states and 315 transitions. [2018-09-26 08:26:03,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2018-09-26 08:26:03,914 INFO L78 Accepts]: Start accepts. Automaton has 157 states. Word has length 311 [2018-09-26 08:26:03,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:03,915 INFO L225 Difference]: With dead ends: 315 [2018-09-26 08:26:03,915 INFO L226 Difference]: Without dead ends: 314 [2018-09-26 08:26:03,916 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=12246, Invalid=12246, Unknown=0, NotChecked=0, Total=24492 [2018-09-26 08:26:03,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-09-26 08:26:03,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2018-09-26 08:26:03,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2018-09-26 08:26:03,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 314 transitions. [2018-09-26 08:26:03,921 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 314 transitions. Word has length 311 [2018-09-26 08:26:03,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:03,921 INFO L480 AbstractCegarLoop]: Abstraction has 314 states and 314 transitions. [2018-09-26 08:26:03,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has 157 states. [2018-09-26 08:26:03,921 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 314 transitions. [2018-09-26 08:26:03,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-09-26 08:26:03,922 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:03,922 INFO L375 BasicCegarLoop]: trace histogram [156, 155, 1, 1] [2018-09-26 08:26:03,922 INFO L423 AbstractCegarLoop]: === Iteration 156 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:03,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:03,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1520171350, now seen corresponding path program 155 times [2018-09-26 08:26:03,923 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:04,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:05,038 INFO L134 CoverageAnalysis]: Checked inductivity of 24180 backedges. 0 proven. 24180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:05,039 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:05,039 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [156] total 156 [2018-09-26 08:26:05,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 158 states [2018-09-26 08:26:05,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2018-09-26 08:26:05,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-09-26 08:26:05,041 INFO L87 Difference]: Start difference. First operand 314 states and 314 transitions. Second operand 158 states. [2018-09-26 08:26:05,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:05,760 INFO L93 Difference]: Finished difference Result 317 states and 317 transitions. [2018-09-26 08:26:05,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2018-09-26 08:26:05,760 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 313 [2018-09-26 08:26:05,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:05,761 INFO L225 Difference]: With dead ends: 317 [2018-09-26 08:26:05,761 INFO L226 Difference]: Without dead ends: 316 [2018-09-26 08:26:05,762 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-09-26 08:26:05,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-09-26 08:26:05,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2018-09-26 08:26:05,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-09-26 08:26:05,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 316 transitions. [2018-09-26 08:26:05,768 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 316 transitions. Word has length 313 [2018-09-26 08:26:05,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:05,768 INFO L480 AbstractCegarLoop]: Abstraction has 316 states and 316 transitions. [2018-09-26 08:26:05,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 158 states. [2018-09-26 08:26:05,768 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 316 transitions. [2018-09-26 08:26:05,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2018-09-26 08:26:05,770 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:05,770 INFO L375 BasicCegarLoop]: trace histogram [157, 156, 1, 1] [2018-09-26 08:26:05,770 INFO L423 AbstractCegarLoop]: === Iteration 157 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:05,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:05,771 INFO L82 PathProgramCache]: Analyzing trace with hash 595787800, now seen corresponding path program 156 times [2018-09-26 08:26:05,771 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:05,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:06,865 INFO L134 CoverageAnalysis]: Checked inductivity of 24492 backedges. 0 proven. 24492 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:06,866 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:06,866 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [157] total 157 [2018-09-26 08:26:06,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 159 states [2018-09-26 08:26:06,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 159 interpolants. [2018-09-26 08:26:06,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12561, Invalid=12561, Unknown=0, NotChecked=0, Total=25122 [2018-09-26 08:26:06,869 INFO L87 Difference]: Start difference. First operand 316 states and 316 transitions. Second operand 159 states. [2018-09-26 08:26:07,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:07,293 INFO L93 Difference]: Finished difference Result 319 states and 319 transitions. [2018-09-26 08:26:07,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2018-09-26 08:26:07,294 INFO L78 Accepts]: Start accepts. Automaton has 159 states. Word has length 315 [2018-09-26 08:26:07,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:07,294 INFO L225 Difference]: With dead ends: 319 [2018-09-26 08:26:07,294 INFO L226 Difference]: Without dead ends: 318 [2018-09-26 08:26:07,296 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=12561, Invalid=12561, Unknown=0, NotChecked=0, Total=25122 [2018-09-26 08:26:07,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-09-26 08:26:07,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2018-09-26 08:26:07,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-09-26 08:26:07,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 318 transitions. [2018-09-26 08:26:07,300 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 318 transitions. Word has length 315 [2018-09-26 08:26:07,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:07,300 INFO L480 AbstractCegarLoop]: Abstraction has 318 states and 318 transitions. [2018-09-26 08:26:07,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 159 states. [2018-09-26 08:26:07,300 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 318 transitions. [2018-09-26 08:26:07,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-09-26 08:26:07,301 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:07,301 INFO L375 BasicCegarLoop]: trace histogram [158, 157, 1, 1] [2018-09-26 08:26:07,301 INFO L423 AbstractCegarLoop]: === Iteration 158 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:07,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:07,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1321426522, now seen corresponding path program 157 times [2018-09-26 08:26:07,302 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:07,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:08,364 INFO L134 CoverageAnalysis]: Checked inductivity of 24806 backedges. 0 proven. 24806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:08,365 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:08,365 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [158] total 158 [2018-09-26 08:26:08,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2018-09-26 08:26:08,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2018-09-26 08:26:08,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-09-26 08:26:08,368 INFO L87 Difference]: Start difference. First operand 318 states and 318 transitions. Second operand 160 states. [2018-09-26 08:26:09,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:09,200 INFO L93 Difference]: Finished difference Result 321 states and 321 transitions. [2018-09-26 08:26:09,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2018-09-26 08:26:09,200 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 317 [2018-09-26 08:26:09,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:09,201 INFO L225 Difference]: With dead ends: 321 [2018-09-26 08:26:09,201 INFO L226 Difference]: Without dead ends: 320 [2018-09-26 08:26:09,202 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-09-26 08:26:09,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-09-26 08:26:09,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2018-09-26 08:26:09,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-09-26 08:26:09,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 320 transitions. [2018-09-26 08:26:09,206 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 320 transitions. Word has length 317 [2018-09-26 08:26:09,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:09,207 INFO L480 AbstractCegarLoop]: Abstraction has 320 states and 320 transitions. [2018-09-26 08:26:09,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2018-09-26 08:26:09,207 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 320 transitions. [2018-09-26 08:26:09,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2018-09-26 08:26:09,208 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:09,208 INFO L375 BasicCegarLoop]: trace histogram [159, 158, 1, 1] [2018-09-26 08:26:09,208 INFO L423 AbstractCegarLoop]: === Iteration 159 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:09,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:09,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1419430884, now seen corresponding path program 158 times [2018-09-26 08:26:09,208 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:09,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:10,252 INFO L134 CoverageAnalysis]: Checked inductivity of 25122 backedges. 0 proven. 25122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:10,252 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:10,253 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [159] total 159 [2018-09-26 08:26:10,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 161 states [2018-09-26 08:26:10,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 161 interpolants. [2018-09-26 08:26:10,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12880, Invalid=12880, Unknown=0, NotChecked=0, Total=25760 [2018-09-26 08:26:10,255 INFO L87 Difference]: Start difference. First operand 320 states and 320 transitions. Second operand 161 states. [2018-09-26 08:26:11,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:11,171 INFO L93 Difference]: Finished difference Result 323 states and 323 transitions. [2018-09-26 08:26:11,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2018-09-26 08:26:11,171 INFO L78 Accepts]: Start accepts. Automaton has 161 states. Word has length 319 [2018-09-26 08:26:11,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:11,172 INFO L225 Difference]: With dead ends: 323 [2018-09-26 08:26:11,172 INFO L226 Difference]: Without dead ends: 322 [2018-09-26 08:26:11,173 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=12880, Invalid=12880, Unknown=0, NotChecked=0, Total=25760 [2018-09-26 08:26:11,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-09-26 08:26:11,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 322. [2018-09-26 08:26:11,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 322 states. [2018-09-26 08:26:11,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 322 transitions. [2018-09-26 08:26:11,177 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 322 transitions. Word has length 319 [2018-09-26 08:26:11,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:11,177 INFO L480 AbstractCegarLoop]: Abstraction has 322 states and 322 transitions. [2018-09-26 08:26:11,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 161 states. [2018-09-26 08:26:11,177 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 322 transitions. [2018-09-26 08:26:11,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2018-09-26 08:26:11,178 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:11,178 INFO L375 BasicCegarLoop]: trace histogram [160, 159, 1, 1] [2018-09-26 08:26:11,178 INFO L423 AbstractCegarLoop]: === Iteration 160 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:11,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:11,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1726521694, now seen corresponding path program 159 times [2018-09-26 08:26:11,178 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:11,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:12,224 INFO L134 CoverageAnalysis]: Checked inductivity of 25440 backedges. 0 proven. 25440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:12,225 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:12,225 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [160] total 160 [2018-09-26 08:26:12,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 162 states [2018-09-26 08:26:12,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2018-09-26 08:26:12,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-09-26 08:26:12,229 INFO L87 Difference]: Start difference. First operand 322 states and 322 transitions. Second operand 162 states. [2018-09-26 08:26:12,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:12,541 INFO L93 Difference]: Finished difference Result 325 states and 325 transitions. [2018-09-26 08:26:12,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2018-09-26 08:26:12,541 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 321 [2018-09-26 08:26:12,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:12,542 INFO L225 Difference]: With dead ends: 325 [2018-09-26 08:26:12,542 INFO L226 Difference]: Without dead ends: 324 [2018-09-26 08:26:12,544 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-09-26 08:26:12,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-09-26 08:26:12,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2018-09-26 08:26:12,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2018-09-26 08:26:12,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 324 transitions. [2018-09-26 08:26:12,548 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 324 transitions. Word has length 321 [2018-09-26 08:26:12,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:12,549 INFO L480 AbstractCegarLoop]: Abstraction has 324 states and 324 transitions. [2018-09-26 08:26:12,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 162 states. [2018-09-26 08:26:12,549 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 324 transitions. [2018-09-26 08:26:12,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2018-09-26 08:26:12,550 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:12,550 INFO L375 BasicCegarLoop]: trace histogram [161, 160, 1, 1] [2018-09-26 08:26:12,550 INFO L423 AbstractCegarLoop]: === Iteration 161 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:12,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:12,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1329972768, now seen corresponding path program 160 times [2018-09-26 08:26:12,550 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:12,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:13,664 INFO L134 CoverageAnalysis]: Checked inductivity of 25760 backedges. 0 proven. 25760 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:13,665 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:13,665 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [161] total 161 [2018-09-26 08:26:13,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 163 states [2018-09-26 08:26:13,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 163 interpolants. [2018-09-26 08:26:13,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13203, Invalid=13203, Unknown=0, NotChecked=0, Total=26406 [2018-09-26 08:26:13,669 INFO L87 Difference]: Start difference. First operand 324 states and 324 transitions. Second operand 163 states. [2018-09-26 08:26:14,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:14,637 INFO L93 Difference]: Finished difference Result 327 states and 327 transitions. [2018-09-26 08:26:14,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2018-09-26 08:26:14,637 INFO L78 Accepts]: Start accepts. Automaton has 163 states. Word has length 323 [2018-09-26 08:26:14,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:14,638 INFO L225 Difference]: With dead ends: 327 [2018-09-26 08:26:14,638 INFO L226 Difference]: Without dead ends: 326 [2018-09-26 08:26:14,639 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=13203, Invalid=13203, Unknown=0, NotChecked=0, Total=26406 [2018-09-26 08:26:14,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-09-26 08:26:14,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 326. [2018-09-26 08:26:14,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-09-26 08:26:14,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 326 transitions. [2018-09-26 08:26:14,643 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 326 transitions. Word has length 323 [2018-09-26 08:26:14,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:14,643 INFO L480 AbstractCegarLoop]: Abstraction has 326 states and 326 transitions. [2018-09-26 08:26:14,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 163 states. [2018-09-26 08:26:14,643 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 326 transitions. [2018-09-26 08:26:14,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2018-09-26 08:26:14,644 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:14,644 INFO L375 BasicCegarLoop]: trace histogram [162, 161, 1, 1] [2018-09-26 08:26:14,644 INFO L423 AbstractCegarLoop]: === Iteration 162 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:14,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:14,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1796423070, now seen corresponding path program 161 times [2018-09-26 08:26:14,645 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:14,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:15,790 INFO L134 CoverageAnalysis]: Checked inductivity of 26082 backedges. 0 proven. 26082 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:15,791 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:15,791 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [162] total 162 [2018-09-26 08:26:15,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 164 states [2018-09-26 08:26:15,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2018-09-26 08:26:15,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-09-26 08:26:15,795 INFO L87 Difference]: Start difference. First operand 326 states and 326 transitions. Second operand 164 states. [2018-09-26 08:26:16,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:16,885 INFO L93 Difference]: Finished difference Result 329 states and 329 transitions. [2018-09-26 08:26:16,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2018-09-26 08:26:16,885 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 325 [2018-09-26 08:26:16,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:16,886 INFO L225 Difference]: With dead ends: 329 [2018-09-26 08:26:16,886 INFO L226 Difference]: Without dead ends: 328 [2018-09-26 08:26:16,887 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-09-26 08:26:16,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-09-26 08:26:16,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2018-09-26 08:26:16,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-09-26 08:26:16,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 328 transitions. [2018-09-26 08:26:16,891 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 328 transitions. Word has length 325 [2018-09-26 08:26:16,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:16,892 INFO L480 AbstractCegarLoop]: Abstraction has 328 states and 328 transitions. [2018-09-26 08:26:16,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 164 states. [2018-09-26 08:26:16,892 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 328 transitions. [2018-09-26 08:26:16,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-09-26 08:26:16,893 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:16,893 INFO L375 BasicCegarLoop]: trace histogram [163, 162, 1, 1] [2018-09-26 08:26:16,893 INFO L423 AbstractCegarLoop]: === Iteration 163 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:16,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:16,893 INFO L82 PathProgramCache]: Analyzing trace with hash 214283812, now seen corresponding path program 162 times [2018-09-26 08:26:16,893 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:17,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:18,069 INFO L134 CoverageAnalysis]: Checked inductivity of 26406 backedges. 0 proven. 26406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:18,069 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:18,069 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [163] total 163 [2018-09-26 08:26:18,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 165 states [2018-09-26 08:26:18,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 165 interpolants. [2018-09-26 08:26:18,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13530, Invalid=13530, Unknown=0, NotChecked=0, Total=27060 [2018-09-26 08:26:18,073 INFO L87 Difference]: Start difference. First operand 328 states and 328 transitions. Second operand 165 states. [2018-09-26 08:26:18,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:18,838 INFO L93 Difference]: Finished difference Result 331 states and 331 transitions. [2018-09-26 08:26:18,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2018-09-26 08:26:18,839 INFO L78 Accepts]: Start accepts. Automaton has 165 states. Word has length 327 [2018-09-26 08:26:18,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:18,839 INFO L225 Difference]: With dead ends: 331 [2018-09-26 08:26:18,839 INFO L226 Difference]: Without dead ends: 330 [2018-09-26 08:26:18,841 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=13530, Invalid=13530, Unknown=0, NotChecked=0, Total=27060 [2018-09-26 08:26:18,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-09-26 08:26:18,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 330. [2018-09-26 08:26:18,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-09-26 08:26:18,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 330 transitions. [2018-09-26 08:26:18,845 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 330 transitions. Word has length 327 [2018-09-26 08:26:18,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:18,845 INFO L480 AbstractCegarLoop]: Abstraction has 330 states and 330 transitions. [2018-09-26 08:26:18,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 165 states. [2018-09-26 08:26:18,845 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 330 transitions. [2018-09-26 08:26:18,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2018-09-26 08:26:18,846 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:18,846 INFO L375 BasicCegarLoop]: trace histogram [164, 163, 1, 1] [2018-09-26 08:26:18,847 INFO L423 AbstractCegarLoop]: === Iteration 164 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:18,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:18,847 INFO L82 PathProgramCache]: Analyzing trace with hash -231685786, now seen corresponding path program 163 times [2018-09-26 08:26:18,847 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:18,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:20,021 INFO L134 CoverageAnalysis]: Checked inductivity of 26732 backedges. 0 proven. 26732 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:20,021 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:20,022 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [164] total 164 [2018-09-26 08:26:20,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2018-09-26 08:26:20,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2018-09-26 08:26:20,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-09-26 08:26:20,026 INFO L87 Difference]: Start difference. First operand 330 states and 330 transitions. Second operand 166 states. [2018-09-26 08:26:20,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:20,384 INFO L93 Difference]: Finished difference Result 333 states and 333 transitions. [2018-09-26 08:26:20,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2018-09-26 08:26:20,384 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 329 [2018-09-26 08:26:20,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:20,385 INFO L225 Difference]: With dead ends: 333 [2018-09-26 08:26:20,385 INFO L226 Difference]: Without dead ends: 332 [2018-09-26 08:26:20,386 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-09-26 08:26:20,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-09-26 08:26:20,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2018-09-26 08:26:20,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-09-26 08:26:20,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 332 transitions. [2018-09-26 08:26:20,392 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 332 transitions. Word has length 329 [2018-09-26 08:26:20,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:20,392 INFO L480 AbstractCegarLoop]: Abstraction has 332 states and 332 transitions. [2018-09-26 08:26:20,392 INFO L481 AbstractCegarLoop]: Interpolant automaton has 166 states. [2018-09-26 08:26:20,392 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 332 transitions. [2018-09-26 08:26:20,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2018-09-26 08:26:20,394 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:20,394 INFO L375 BasicCegarLoop]: trace histogram [165, 164, 1, 1] [2018-09-26 08:26:20,394 INFO L423 AbstractCegarLoop]: === Iteration 165 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:20,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:20,395 INFO L82 PathProgramCache]: Analyzing trace with hash 688260136, now seen corresponding path program 164 times [2018-09-26 08:26:20,395 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:20,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:21,592 INFO L134 CoverageAnalysis]: Checked inductivity of 27060 backedges. 0 proven. 27060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:21,593 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:21,593 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [165] total 165 [2018-09-26 08:26:21,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 167 states [2018-09-26 08:26:21,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 167 interpolants. [2018-09-26 08:26:21,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13861, Invalid=13861, Unknown=0, NotChecked=0, Total=27722 [2018-09-26 08:26:21,596 INFO L87 Difference]: Start difference. First operand 332 states and 332 transitions. Second operand 167 states. [2018-09-26 08:26:22,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:22,049 INFO L93 Difference]: Finished difference Result 335 states and 335 transitions. [2018-09-26 08:26:22,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2018-09-26 08:26:22,049 INFO L78 Accepts]: Start accepts. Automaton has 167 states. Word has length 331 [2018-09-26 08:26:22,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:22,049 INFO L225 Difference]: With dead ends: 335 [2018-09-26 08:26:22,050 INFO L226 Difference]: Without dead ends: 334 [2018-09-26 08:26:22,051 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=13861, Invalid=13861, Unknown=0, NotChecked=0, Total=27722 [2018-09-26 08:26:22,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-09-26 08:26:22,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 334. [2018-09-26 08:26:22,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-09-26 08:26:22,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 334 transitions. [2018-09-26 08:26:22,055 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 334 transitions. Word has length 331 [2018-09-26 08:26:22,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:22,055 INFO L480 AbstractCegarLoop]: Abstraction has 334 states and 334 transitions. [2018-09-26 08:26:22,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 167 states. [2018-09-26 08:26:22,056 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 334 transitions. [2018-09-26 08:26:22,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2018-09-26 08:26:22,056 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:22,057 INFO L375 BasicCegarLoop]: trace histogram [166, 165, 1, 1] [2018-09-26 08:26:22,057 INFO L423 AbstractCegarLoop]: === Iteration 166 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:22,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:22,057 INFO L82 PathProgramCache]: Analyzing trace with hash -6971798, now seen corresponding path program 165 times [2018-09-26 08:26:22,057 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:22,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:23,213 INFO L134 CoverageAnalysis]: Checked inductivity of 27390 backedges. 0 proven. 27390 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:23,214 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:23,214 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [166] total 166 [2018-09-26 08:26:23,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 168 states [2018-09-26 08:26:23,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2018-09-26 08:26:23,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-09-26 08:26:23,216 INFO L87 Difference]: Start difference. First operand 334 states and 334 transitions. Second operand 168 states. [2018-09-26 08:26:23,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:23,934 INFO L93 Difference]: Finished difference Result 337 states and 337 transitions. [2018-09-26 08:26:23,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2018-09-26 08:26:23,934 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 333 [2018-09-26 08:26:23,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:23,935 INFO L225 Difference]: With dead ends: 337 [2018-09-26 08:26:23,935 INFO L226 Difference]: Without dead ends: 336 [2018-09-26 08:26:23,935 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-09-26 08:26:23,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2018-09-26 08:26:23,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 336. [2018-09-26 08:26:23,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2018-09-26 08:26:23,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 336 transitions. [2018-09-26 08:26:23,939 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 336 transitions. Word has length 333 [2018-09-26 08:26:23,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:23,939 INFO L480 AbstractCegarLoop]: Abstraction has 336 states and 336 transitions. [2018-09-26 08:26:23,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 168 states. [2018-09-26 08:26:23,940 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 336 transitions. [2018-09-26 08:26:23,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2018-09-26 08:26:23,940 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:23,941 INFO L375 BasicCegarLoop]: trace histogram [167, 166, 1, 1] [2018-09-26 08:26:23,941 INFO L423 AbstractCegarLoop]: === Iteration 167 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:23,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:23,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1890037804, now seen corresponding path program 166 times [2018-09-26 08:26:23,941 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:24,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:25,084 INFO L134 CoverageAnalysis]: Checked inductivity of 27722 backedges. 0 proven. 27722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:25,084 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:25,085 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [167] total 167 [2018-09-26 08:26:25,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 169 states [2018-09-26 08:26:25,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 169 interpolants. [2018-09-26 08:26:25,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14196, Invalid=14196, Unknown=0, NotChecked=0, Total=28392 [2018-09-26 08:26:25,088 INFO L87 Difference]: Start difference. First operand 336 states and 336 transitions. Second operand 169 states. [2018-09-26 08:26:26,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:26,084 INFO L93 Difference]: Finished difference Result 339 states and 339 transitions. [2018-09-26 08:26:26,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2018-09-26 08:26:26,084 INFO L78 Accepts]: Start accepts. Automaton has 169 states. Word has length 335 [2018-09-26 08:26:26,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:26,085 INFO L225 Difference]: With dead ends: 339 [2018-09-26 08:26:26,085 INFO L226 Difference]: Without dead ends: 338 [2018-09-26 08:26:26,087 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=14196, Invalid=14196, Unknown=0, NotChecked=0, Total=28392 [2018-09-26 08:26:26,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-09-26 08:26:26,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2018-09-26 08:26:26,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-09-26 08:26:26,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 338 transitions. [2018-09-26 08:26:26,092 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 338 transitions. Word has length 335 [2018-09-26 08:26:26,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:26,092 INFO L480 AbstractCegarLoop]: Abstraction has 338 states and 338 transitions. [2018-09-26 08:26:26,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 169 states. [2018-09-26 08:26:26,092 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 338 transitions. [2018-09-26 08:26:26,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2018-09-26 08:26:26,093 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:26,093 INFO L375 BasicCegarLoop]: trace histogram [168, 167, 1, 1] [2018-09-26 08:26:26,093 INFO L423 AbstractCegarLoop]: === Iteration 168 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:26,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:26,094 INFO L82 PathProgramCache]: Analyzing trace with hash -444835474, now seen corresponding path program 167 times [2018-09-26 08:26:26,094 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:26,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:27,251 INFO L134 CoverageAnalysis]: Checked inductivity of 28056 backedges. 0 proven. 28056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:27,251 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:27,252 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [168] total 168 [2018-09-26 08:26:27,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 170 states [2018-09-26 08:26:27,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2018-09-26 08:26:27,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-09-26 08:26:27,255 INFO L87 Difference]: Start difference. First operand 338 states and 338 transitions. Second operand 170 states. [2018-09-26 08:26:28,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:28,261 INFO L93 Difference]: Finished difference Result 341 states and 341 transitions. [2018-09-26 08:26:28,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2018-09-26 08:26:28,262 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 337 [2018-09-26 08:26:28,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:28,262 INFO L225 Difference]: With dead ends: 341 [2018-09-26 08:26:28,262 INFO L226 Difference]: Without dead ends: 340 [2018-09-26 08:26:28,264 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-09-26 08:26:28,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-09-26 08:26:28,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 340. [2018-09-26 08:26:28,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2018-09-26 08:26:28,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 340 transitions. [2018-09-26 08:26:28,268 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 340 transitions. Word has length 337 [2018-09-26 08:26:28,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:28,268 INFO L480 AbstractCegarLoop]: Abstraction has 340 states and 340 transitions. [2018-09-26 08:26:28,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 170 states. [2018-09-26 08:26:28,268 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 340 transitions. [2018-09-26 08:26:28,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2018-09-26 08:26:28,269 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:28,269 INFO L375 BasicCegarLoop]: trace histogram [169, 168, 1, 1] [2018-09-26 08:26:28,269 INFO L423 AbstractCegarLoop]: === Iteration 169 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:28,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:28,270 INFO L82 PathProgramCache]: Analyzing trace with hash 2009840176, now seen corresponding path program 168 times [2018-09-26 08:26:28,270 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:28,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:29,432 INFO L134 CoverageAnalysis]: Checked inductivity of 28392 backedges. 0 proven. 28392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:29,432 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:29,433 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [169] total 169 [2018-09-26 08:26:29,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 171 states [2018-09-26 08:26:29,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 171 interpolants. [2018-09-26 08:26:29,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14535, Invalid=14535, Unknown=0, NotChecked=0, Total=29070 [2018-09-26 08:26:29,437 INFO L87 Difference]: Start difference. First operand 340 states and 340 transitions. Second operand 171 states. [2018-09-26 08:26:30,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:30,506 INFO L93 Difference]: Finished difference Result 343 states and 343 transitions. [2018-09-26 08:26:30,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2018-09-26 08:26:30,507 INFO L78 Accepts]: Start accepts. Automaton has 171 states. Word has length 339 [2018-09-26 08:26:30,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:30,507 INFO L225 Difference]: With dead ends: 343 [2018-09-26 08:26:30,507 INFO L226 Difference]: Without dead ends: 342 [2018-09-26 08:26:30,509 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=14535, Invalid=14535, Unknown=0, NotChecked=0, Total=29070 [2018-09-26 08:26:30,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-09-26 08:26:30,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2018-09-26 08:26:30,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2018-09-26 08:26:30,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 342 transitions. [2018-09-26 08:26:30,514 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 342 transitions. Word has length 339 [2018-09-26 08:26:30,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:30,514 INFO L480 AbstractCegarLoop]: Abstraction has 342 states and 342 transitions. [2018-09-26 08:26:30,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 171 states. [2018-09-26 08:26:30,514 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 342 transitions. [2018-09-26 08:26:30,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2018-09-26 08:26:30,515 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:30,515 INFO L375 BasicCegarLoop]: trace histogram [170, 169, 1, 1] [2018-09-26 08:26:30,515 INFO L423 AbstractCegarLoop]: === Iteration 170 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:30,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:30,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1278872974, now seen corresponding path program 169 times [2018-09-26 08:26:30,516 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:30,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:31,681 INFO L134 CoverageAnalysis]: Checked inductivity of 28730 backedges. 0 proven. 28730 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:31,682 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:31,682 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [170] total 170 [2018-09-26 08:26:31,682 INFO L459 AbstractCegarLoop]: Interpolant automaton has 172 states [2018-09-26 08:26:31,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2018-09-26 08:26:31,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-09-26 08:26:31,686 INFO L87 Difference]: Start difference. First operand 342 states and 342 transitions. Second operand 172 states. [2018-09-26 08:26:32,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:32,706 INFO L93 Difference]: Finished difference Result 345 states and 345 transitions. [2018-09-26 08:26:32,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2018-09-26 08:26:32,707 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 341 [2018-09-26 08:26:32,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:32,707 INFO L225 Difference]: With dead ends: 345 [2018-09-26 08:26:32,707 INFO L226 Difference]: Without dead ends: 344 [2018-09-26 08:26:32,709 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-09-26 08:26:32,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-09-26 08:26:32,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2018-09-26 08:26:32,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2018-09-26 08:26:32,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 344 transitions. [2018-09-26 08:26:32,713 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 344 transitions. Word has length 341 [2018-09-26 08:26:32,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:32,713 INFO L480 AbstractCegarLoop]: Abstraction has 344 states and 344 transitions. [2018-09-26 08:26:32,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 172 states. [2018-09-26 08:26:32,714 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 344 transitions. [2018-09-26 08:26:32,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2018-09-26 08:26:32,714 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:32,715 INFO L375 BasicCegarLoop]: trace histogram [171, 170, 1, 1] [2018-09-26 08:26:32,715 INFO L423 AbstractCegarLoop]: === Iteration 171 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:32,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:32,715 INFO L82 PathProgramCache]: Analyzing trace with hash -636280268, now seen corresponding path program 170 times [2018-09-26 08:26:32,715 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:32,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:33,931 INFO L134 CoverageAnalysis]: Checked inductivity of 29070 backedges. 0 proven. 29070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:33,931 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:33,931 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [171] total 171 [2018-09-26 08:26:33,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 173 states [2018-09-26 08:26:33,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 173 interpolants. [2018-09-26 08:26:33,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14878, Invalid=14878, Unknown=0, NotChecked=0, Total=29756 [2018-09-26 08:26:33,935 INFO L87 Difference]: Start difference. First operand 344 states and 344 transitions. Second operand 173 states. [2018-09-26 08:26:34,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:34,980 INFO L93 Difference]: Finished difference Result 347 states and 347 transitions. [2018-09-26 08:26:34,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2018-09-26 08:26:34,980 INFO L78 Accepts]: Start accepts. Automaton has 173 states. Word has length 343 [2018-09-26 08:26:34,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:34,981 INFO L225 Difference]: With dead ends: 347 [2018-09-26 08:26:34,981 INFO L226 Difference]: Without dead ends: 346 [2018-09-26 08:26:34,983 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=14878, Invalid=14878, Unknown=0, NotChecked=0, Total=29756 [2018-09-26 08:26:34,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-09-26 08:26:34,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2018-09-26 08:26:34,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-09-26 08:26:34,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 346 transitions. [2018-09-26 08:26:34,989 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 346 transitions. Word has length 343 [2018-09-26 08:26:34,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:34,989 INFO L480 AbstractCegarLoop]: Abstraction has 346 states and 346 transitions. [2018-09-26 08:26:34,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 173 states. [2018-09-26 08:26:34,990 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 346 transitions. [2018-09-26 08:26:34,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2018-09-26 08:26:34,990 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:34,991 INFO L375 BasicCegarLoop]: trace histogram [172, 171, 1, 1] [2018-09-26 08:26:34,991 INFO L423 AbstractCegarLoop]: === Iteration 172 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:34,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:34,991 INFO L82 PathProgramCache]: Analyzing trace with hash -1579980426, now seen corresponding path program 171 times [2018-09-26 08:26:34,991 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:35,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:36,211 INFO L134 CoverageAnalysis]: Checked inductivity of 29412 backedges. 0 proven. 29412 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:36,211 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:36,211 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [172] total 172 [2018-09-26 08:26:36,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 174 states [2018-09-26 08:26:36,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2018-09-26 08:26:36,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-09-26 08:26:36,215 INFO L87 Difference]: Start difference. First operand 346 states and 346 transitions. Second operand 174 states. [2018-09-26 08:26:36,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:36,961 INFO L93 Difference]: Finished difference Result 349 states and 349 transitions. [2018-09-26 08:26:36,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2018-09-26 08:26:36,962 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 345 [2018-09-26 08:26:36,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:36,962 INFO L225 Difference]: With dead ends: 349 [2018-09-26 08:26:36,962 INFO L226 Difference]: Without dead ends: 348 [2018-09-26 08:26:36,964 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-09-26 08:26:36,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2018-09-26 08:26:36,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348. [2018-09-26 08:26:36,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-09-26 08:26:36,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 348 transitions. [2018-09-26 08:26:36,970 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 348 transitions. Word has length 345 [2018-09-26 08:26:36,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:36,971 INFO L480 AbstractCegarLoop]: Abstraction has 348 states and 348 transitions. [2018-09-26 08:26:36,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 174 states. [2018-09-26 08:26:36,971 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 348 transitions. [2018-09-26 08:26:36,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2018-09-26 08:26:36,972 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:36,973 INFO L375 BasicCegarLoop]: trace histogram [173, 172, 1, 1] [2018-09-26 08:26:36,973 INFO L423 AbstractCegarLoop]: === Iteration 173 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:36,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:36,973 INFO L82 PathProgramCache]: Analyzing trace with hash 2057234488, now seen corresponding path program 172 times [2018-09-26 08:26:36,973 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:37,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:38,246 INFO L134 CoverageAnalysis]: Checked inductivity of 29756 backedges. 0 proven. 29756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:38,246 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:38,247 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [173] total 173 [2018-09-26 08:26:38,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 175 states [2018-09-26 08:26:38,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 175 interpolants. [2018-09-26 08:26:38,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15225, Invalid=15225, Unknown=0, NotChecked=0, Total=30450 [2018-09-26 08:26:38,249 INFO L87 Difference]: Start difference. First operand 348 states and 348 transitions. Second operand 175 states. [2018-09-26 08:26:38,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:38,647 INFO L93 Difference]: Finished difference Result 351 states and 351 transitions. [2018-09-26 08:26:38,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2018-09-26 08:26:38,648 INFO L78 Accepts]: Start accepts. Automaton has 175 states. Word has length 347 [2018-09-26 08:26:38,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:38,649 INFO L225 Difference]: With dead ends: 351 [2018-09-26 08:26:38,649 INFO L226 Difference]: Without dead ends: 350 [2018-09-26 08:26:38,650 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=15225, Invalid=15225, Unknown=0, NotChecked=0, Total=30450 [2018-09-26 08:26:38,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-09-26 08:26:38,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 350. [2018-09-26 08:26:38,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-09-26 08:26:38,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 350 transitions. [2018-09-26 08:26:38,656 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 350 transitions. Word has length 347 [2018-09-26 08:26:38,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:38,656 INFO L480 AbstractCegarLoop]: Abstraction has 350 states and 350 transitions. [2018-09-26 08:26:38,656 INFO L481 AbstractCegarLoop]: Interpolant automaton has 175 states. [2018-09-26 08:26:38,656 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 350 transitions. [2018-09-26 08:26:38,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2018-09-26 08:26:38,657 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:38,657 INFO L375 BasicCegarLoop]: trace histogram [174, 173, 1, 1] [2018-09-26 08:26:38,657 INFO L423 AbstractCegarLoop]: === Iteration 174 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:38,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:38,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1317387898, now seen corresponding path program 173 times [2018-09-26 08:26:38,657 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:38,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:39,850 INFO L134 CoverageAnalysis]: Checked inductivity of 30102 backedges. 0 proven. 30102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:39,850 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:39,850 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [174] total 174 [2018-09-26 08:26:39,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 176 states [2018-09-26 08:26:39,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2018-09-26 08:26:39,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-09-26 08:26:39,854 INFO L87 Difference]: Start difference. First operand 350 states and 350 transitions. Second operand 176 states. [2018-09-26 08:26:40,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:40,310 INFO L93 Difference]: Finished difference Result 353 states and 353 transitions. [2018-09-26 08:26:40,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2018-09-26 08:26:40,310 INFO L78 Accepts]: Start accepts. Automaton has 176 states. Word has length 349 [2018-09-26 08:26:40,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:40,310 INFO L225 Difference]: With dead ends: 353 [2018-09-26 08:26:40,311 INFO L226 Difference]: Without dead ends: 352 [2018-09-26 08:26:40,312 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-09-26 08:26:40,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2018-09-26 08:26:40,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 352. [2018-09-26 08:26:40,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2018-09-26 08:26:40,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 352 transitions. [2018-09-26 08:26:40,317 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 352 transitions. Word has length 349 [2018-09-26 08:26:40,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:40,317 INFO L480 AbstractCegarLoop]: Abstraction has 352 states and 352 transitions. [2018-09-26 08:26:40,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 176 states. [2018-09-26 08:26:40,317 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 352 transitions. [2018-09-26 08:26:40,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2018-09-26 08:26:40,318 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:40,318 INFO L375 BasicCegarLoop]: trace histogram [175, 174, 1, 1] [2018-09-26 08:26:40,318 INFO L423 AbstractCegarLoop]: === Iteration 175 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:40,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:40,319 INFO L82 PathProgramCache]: Analyzing trace with hash -1005581252, now seen corresponding path program 174 times [2018-09-26 08:26:40,319 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:40,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:41,562 INFO L134 CoverageAnalysis]: Checked inductivity of 30450 backedges. 0 proven. 30450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:41,563 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:41,563 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [175] total 175 [2018-09-26 08:26:41,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 177 states [2018-09-26 08:26:41,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 177 interpolants. [2018-09-26 08:26:41,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15576, Invalid=15576, Unknown=0, NotChecked=0, Total=31152 [2018-09-26 08:26:41,565 INFO L87 Difference]: Start difference. First operand 352 states and 352 transitions. Second operand 177 states. [2018-09-26 08:26:42,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:42,569 INFO L93 Difference]: Finished difference Result 355 states and 355 transitions. [2018-09-26 08:26:42,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2018-09-26 08:26:42,569 INFO L78 Accepts]: Start accepts. Automaton has 177 states. Word has length 351 [2018-09-26 08:26:42,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:42,570 INFO L225 Difference]: With dead ends: 355 [2018-09-26 08:26:42,570 INFO L226 Difference]: Without dead ends: 354 [2018-09-26 08:26:42,571 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=15576, Invalid=15576, Unknown=0, NotChecked=0, Total=31152 [2018-09-26 08:26:42,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-09-26 08:26:42,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 354. [2018-09-26 08:26:42,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-09-26 08:26:42,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 354 transitions. [2018-09-26 08:26:42,575 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 354 transitions. Word has length 351 [2018-09-26 08:26:42,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:42,575 INFO L480 AbstractCegarLoop]: Abstraction has 354 states and 354 transitions. [2018-09-26 08:26:42,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 177 states. [2018-09-26 08:26:42,575 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 354 transitions. [2018-09-26 08:26:42,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2018-09-26 08:26:42,576 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:42,576 INFO L375 BasicCegarLoop]: trace histogram [176, 175, 1, 1] [2018-09-26 08:26:42,576 INFO L423 AbstractCegarLoop]: === Iteration 176 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:42,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:42,576 INFO L82 PathProgramCache]: Analyzing trace with hash 4059518, now seen corresponding path program 175 times [2018-09-26 08:26:42,576 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:42,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:43,812 INFO L134 CoverageAnalysis]: Checked inductivity of 30800 backedges. 0 proven. 30800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:43,813 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:43,813 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [176] total 176 [2018-09-26 08:26:43,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 178 states [2018-09-26 08:26:43,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2018-09-26 08:26:43,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-09-26 08:26:43,818 INFO L87 Difference]: Start difference. First operand 354 states and 354 transitions. Second operand 178 states. [2018-09-26 08:26:45,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:45,177 INFO L93 Difference]: Finished difference Result 357 states and 357 transitions. [2018-09-26 08:26:45,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2018-09-26 08:26:45,177 INFO L78 Accepts]: Start accepts. Automaton has 178 states. Word has length 353 [2018-09-26 08:26:45,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:45,178 INFO L225 Difference]: With dead ends: 357 [2018-09-26 08:26:45,178 INFO L226 Difference]: Without dead ends: 356 [2018-09-26 08:26:45,180 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-09-26 08:26:45,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-09-26 08:26:45,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2018-09-26 08:26:45,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-09-26 08:26:45,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 356 transitions. [2018-09-26 08:26:45,184 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 356 transitions. Word has length 353 [2018-09-26 08:26:45,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:45,185 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 356 transitions. [2018-09-26 08:26:45,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 178 states. [2018-09-26 08:26:45,185 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 356 transitions. [2018-09-26 08:26:45,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2018-09-26 08:26:45,186 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:45,186 INFO L375 BasicCegarLoop]: trace histogram [177, 176, 1, 1] [2018-09-26 08:26:45,186 INFO L423 AbstractCegarLoop]: === Iteration 177 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:45,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:45,186 INFO L82 PathProgramCache]: Analyzing trace with hash -393769408, now seen corresponding path program 176 times [2018-09-26 08:26:45,186 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:45,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:46,499 INFO L134 CoverageAnalysis]: Checked inductivity of 31152 backedges. 0 proven. 31152 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:46,499 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:46,499 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [177] total 177 [2018-09-26 08:26:46,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 179 states [2018-09-26 08:26:46,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 179 interpolants. [2018-09-26 08:26:46,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15931, Invalid=15931, Unknown=0, NotChecked=0, Total=31862 [2018-09-26 08:26:46,501 INFO L87 Difference]: Start difference. First operand 356 states and 356 transitions. Second operand 179 states. [2018-09-26 08:26:47,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:47,285 INFO L93 Difference]: Finished difference Result 359 states and 359 transitions. [2018-09-26 08:26:47,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 179 states. [2018-09-26 08:26:47,285 INFO L78 Accepts]: Start accepts. Automaton has 179 states. Word has length 355 [2018-09-26 08:26:47,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:47,286 INFO L225 Difference]: With dead ends: 359 [2018-09-26 08:26:47,286 INFO L226 Difference]: Without dead ends: 358 [2018-09-26 08:26:47,287 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=15931, Invalid=15931, Unknown=0, NotChecked=0, Total=31862 [2018-09-26 08:26:47,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-09-26 08:26:47,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 358. [2018-09-26 08:26:47,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2018-09-26 08:26:47,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 358 transitions. [2018-09-26 08:26:47,291 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 358 transitions. Word has length 355 [2018-09-26 08:26:47,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:47,291 INFO L480 AbstractCegarLoop]: Abstraction has 358 states and 358 transitions. [2018-09-26 08:26:47,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 179 states. [2018-09-26 08:26:47,292 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 358 transitions. [2018-09-26 08:26:47,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2018-09-26 08:26:47,293 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:47,293 INFO L375 BasicCegarLoop]: trace histogram [178, 177, 1, 1] [2018-09-26 08:26:47,293 INFO L423 AbstractCegarLoop]: === Iteration 178 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:47,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:47,293 INFO L82 PathProgramCache]: Analyzing trace with hash -455277950, now seen corresponding path program 177 times [2018-09-26 08:26:47,293 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:47,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:48,652 INFO L134 CoverageAnalysis]: Checked inductivity of 31506 backedges. 0 proven. 31506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:48,652 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:48,653 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [178] total 178 [2018-09-26 08:26:48,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 180 states [2018-09-26 08:26:48,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 180 interpolants. [2018-09-26 08:26:48,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-09-26 08:26:48,657 INFO L87 Difference]: Start difference. First operand 358 states and 358 transitions. Second operand 180 states. [2018-09-26 08:26:49,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:49,227 INFO L93 Difference]: Finished difference Result 361 states and 361 transitions. [2018-09-26 08:26:49,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2018-09-26 08:26:49,227 INFO L78 Accepts]: Start accepts. Automaton has 180 states. Word has length 357 [2018-09-26 08:26:49,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:49,228 INFO L225 Difference]: With dead ends: 361 [2018-09-26 08:26:49,228 INFO L226 Difference]: Without dead ends: 360 [2018-09-26 08:26:49,231 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-09-26 08:26:49,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2018-09-26 08:26:49,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2018-09-26 08:26:49,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2018-09-26 08:26:49,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 360 transitions. [2018-09-26 08:26:49,236 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 360 transitions. Word has length 357 [2018-09-26 08:26:49,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:49,236 INFO L480 AbstractCegarLoop]: Abstraction has 360 states and 360 transitions. [2018-09-26 08:26:49,236 INFO L481 AbstractCegarLoop]: Interpolant automaton has 180 states. [2018-09-26 08:26:49,236 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 360 transitions. [2018-09-26 08:26:49,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2018-09-26 08:26:49,237 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:49,237 INFO L375 BasicCegarLoop]: trace histogram [179, 178, 1, 1] [2018-09-26 08:26:49,237 INFO L423 AbstractCegarLoop]: === Iteration 179 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:49,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:49,237 INFO L82 PathProgramCache]: Analyzing trace with hash 564555332, now seen corresponding path program 178 times [2018-09-26 08:26:49,237 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:49,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:50,674 INFO L134 CoverageAnalysis]: Checked inductivity of 31862 backedges. 0 proven. 31862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:50,674 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:50,674 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [179] total 179 [2018-09-26 08:26:50,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 181 states [2018-09-26 08:26:50,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 181 interpolants. [2018-09-26 08:26:50,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16290, Invalid=16290, Unknown=0, NotChecked=0, Total=32580 [2018-09-26 08:26:50,676 INFO L87 Difference]: Start difference. First operand 360 states and 360 transitions. Second operand 181 states. [2018-09-26 08:26:52,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:52,106 INFO L93 Difference]: Finished difference Result 363 states and 363 transitions. [2018-09-26 08:26:52,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 181 states. [2018-09-26 08:26:52,106 INFO L78 Accepts]: Start accepts. Automaton has 181 states. Word has length 359 [2018-09-26 08:26:52,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:52,106 INFO L225 Difference]: With dead ends: 363 [2018-09-26 08:26:52,107 INFO L226 Difference]: Without dead ends: 362 [2018-09-26 08:26:52,107 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=16290, Invalid=16290, Unknown=0, NotChecked=0, Total=32580 [2018-09-26 08:26:52,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2018-09-26 08:26:52,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 362. [2018-09-26 08:26:52,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2018-09-26 08:26:52,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 362 transitions. [2018-09-26 08:26:52,112 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 362 transitions. Word has length 359 [2018-09-26 08:26:52,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:52,112 INFO L480 AbstractCegarLoop]: Abstraction has 362 states and 362 transitions. [2018-09-26 08:26:52,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 181 states. [2018-09-26 08:26:52,112 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 362 transitions. [2018-09-26 08:26:52,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2018-09-26 08:26:52,113 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:52,113 INFO L375 BasicCegarLoop]: trace histogram [180, 179, 1, 1] [2018-09-26 08:26:52,113 INFO L423 AbstractCegarLoop]: === Iteration 180 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:52,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:52,114 INFO L82 PathProgramCache]: Analyzing trace with hash 1371795846, now seen corresponding path program 179 times [2018-09-26 08:26:52,114 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:52,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:53,456 INFO L134 CoverageAnalysis]: Checked inductivity of 32220 backedges. 0 proven. 32220 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:53,457 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:53,457 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [180] total 180 [2018-09-26 08:26:53,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 182 states [2018-09-26 08:26:53,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 182 interpolants. [2018-09-26 08:26:53,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-09-26 08:26:53,460 INFO L87 Difference]: Start difference. First operand 362 states and 362 transitions. Second operand 182 states. [2018-09-26 08:26:54,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:54,304 INFO L93 Difference]: Finished difference Result 365 states and 365 transitions. [2018-09-26 08:26:54,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2018-09-26 08:26:54,304 INFO L78 Accepts]: Start accepts. Automaton has 182 states. Word has length 361 [2018-09-26 08:26:54,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:54,305 INFO L225 Difference]: With dead ends: 365 [2018-09-26 08:26:54,305 INFO L226 Difference]: Without dead ends: 364 [2018-09-26 08:26:54,307 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-09-26 08:26:54,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2018-09-26 08:26:54,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 364. [2018-09-26 08:26:54,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-09-26 08:26:54,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 364 transitions. [2018-09-26 08:26:54,311 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 364 transitions. Word has length 361 [2018-09-26 08:26:54,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:54,312 INFO L480 AbstractCegarLoop]: Abstraction has 364 states and 364 transitions. [2018-09-26 08:26:54,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 182 states. [2018-09-26 08:26:54,312 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 364 transitions. [2018-09-26 08:26:54,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2018-09-26 08:26:54,313 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:54,313 INFO L375 BasicCegarLoop]: trace histogram [181, 180, 1, 1] [2018-09-26 08:26:54,313 INFO L423 AbstractCegarLoop]: === Iteration 181 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:54,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:54,313 INFO L82 PathProgramCache]: Analyzing trace with hash -259150776, now seen corresponding path program 180 times [2018-09-26 08:26:54,313 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:54,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:55,761 INFO L134 CoverageAnalysis]: Checked inductivity of 32580 backedges. 0 proven. 32580 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:55,761 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:55,761 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [181] total 181 [2018-09-26 08:26:55,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 183 states [2018-09-26 08:26:55,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 183 interpolants. [2018-09-26 08:26:55,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16653, Invalid=16653, Unknown=0, NotChecked=0, Total=33306 [2018-09-26 08:26:55,763 INFO L87 Difference]: Start difference. First operand 364 states and 364 transitions. Second operand 183 states. [2018-09-26 08:26:56,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:56,618 INFO L93 Difference]: Finished difference Result 367 states and 367 transitions. [2018-09-26 08:26:56,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2018-09-26 08:26:56,618 INFO L78 Accepts]: Start accepts. Automaton has 183 states. Word has length 363 [2018-09-26 08:26:56,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:56,619 INFO L225 Difference]: With dead ends: 367 [2018-09-26 08:26:56,619 INFO L226 Difference]: Without dead ends: 366 [2018-09-26 08:26:56,620 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=16653, Invalid=16653, Unknown=0, NotChecked=0, Total=33306 [2018-09-26 08:26:56,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2018-09-26 08:26:56,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 366. [2018-09-26 08:26:56,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-09-26 08:26:56,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 366 transitions. [2018-09-26 08:26:56,625 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 366 transitions. Word has length 363 [2018-09-26 08:26:56,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:56,625 INFO L480 AbstractCegarLoop]: Abstraction has 366 states and 366 transitions. [2018-09-26 08:26:56,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 183 states. [2018-09-26 08:26:56,625 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 366 transitions. [2018-09-26 08:26:56,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2018-09-26 08:26:56,626 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:56,627 INFO L375 BasicCegarLoop]: trace histogram [182, 181, 1, 1] [2018-09-26 08:26:56,627 INFO L423 AbstractCegarLoop]: === Iteration 182 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:56,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:56,627 INFO L82 PathProgramCache]: Analyzing trace with hash 64208522, now seen corresponding path program 181 times [2018-09-26 08:26:56,627 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:56,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:57,976 INFO L134 CoverageAnalysis]: Checked inductivity of 32942 backedges. 0 proven. 32942 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:57,977 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:57,977 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [182] total 182 [2018-09-26 08:26:57,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 184 states [2018-09-26 08:26:57,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 184 interpolants. [2018-09-26 08:26:57,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-09-26 08:26:57,981 INFO L87 Difference]: Start difference. First operand 366 states and 366 transitions. Second operand 184 states. [2018-09-26 08:26:59,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:59,330 INFO L93 Difference]: Finished difference Result 369 states and 369 transitions. [2018-09-26 08:26:59,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2018-09-26 08:26:59,331 INFO L78 Accepts]: Start accepts. Automaton has 184 states. Word has length 365 [2018-09-26 08:26:59,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:59,331 INFO L225 Difference]: With dead ends: 369 [2018-09-26 08:26:59,331 INFO L226 Difference]: Without dead ends: 368 [2018-09-26 08:26:59,333 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-09-26 08:26:59,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-09-26 08:26:59,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2018-09-26 08:26:59,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-09-26 08:26:59,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 368 transitions. [2018-09-26 08:26:59,337 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 368 transitions. Word has length 365 [2018-09-26 08:26:59,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:59,338 INFO L480 AbstractCegarLoop]: Abstraction has 368 states and 368 transitions. [2018-09-26 08:26:59,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 184 states. [2018-09-26 08:26:59,338 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 368 transitions. [2018-09-26 08:26:59,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2018-09-26 08:26:59,339 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:59,339 INFO L375 BasicCegarLoop]: trace histogram [183, 182, 1, 1] [2018-09-26 08:26:59,339 INFO L423 AbstractCegarLoop]: === Iteration 183 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:59,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:59,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1574848588, now seen corresponding path program 182 times [2018-09-26 08:26:59,339 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:59,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:00,765 INFO L134 CoverageAnalysis]: Checked inductivity of 33306 backedges. 0 proven. 33306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:00,765 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:00,765 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [183] total 183 [2018-09-26 08:27:00,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 185 states [2018-09-26 08:27:00,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 185 interpolants. [2018-09-26 08:27:00,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17020, Invalid=17020, Unknown=0, NotChecked=0, Total=34040 [2018-09-26 08:27:00,768 INFO L87 Difference]: Start difference. First operand 368 states and 368 transitions. Second operand 185 states. [2018-09-26 08:27:01,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:01,376 INFO L93 Difference]: Finished difference Result 371 states and 371 transitions. [2018-09-26 08:27:01,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2018-09-26 08:27:01,376 INFO L78 Accepts]: Start accepts. Automaton has 185 states. Word has length 367 [2018-09-26 08:27:01,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:01,377 INFO L225 Difference]: With dead ends: 371 [2018-09-26 08:27:01,377 INFO L226 Difference]: Without dead ends: 370 [2018-09-26 08:27:01,377 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=17020, Invalid=17020, Unknown=0, NotChecked=0, Total=34040 [2018-09-26 08:27:01,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2018-09-26 08:27:01,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 370. [2018-09-26 08:27:01,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2018-09-26 08:27:01,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 370 transitions. [2018-09-26 08:27:01,382 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 370 transitions. Word has length 367 [2018-09-26 08:27:01,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:01,382 INFO L480 AbstractCegarLoop]: Abstraction has 370 states and 370 transitions. [2018-09-26 08:27:01,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 185 states. [2018-09-26 08:27:01,382 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 370 transitions. [2018-09-26 08:27:01,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2018-09-26 08:27:01,383 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:01,383 INFO L375 BasicCegarLoop]: trace histogram [184, 183, 1, 1] [2018-09-26 08:27:01,384 INFO L423 AbstractCegarLoop]: === Iteration 184 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:01,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:01,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1601005966, now seen corresponding path program 183 times [2018-09-26 08:27:01,384 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:01,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:02,719 INFO L134 CoverageAnalysis]: Checked inductivity of 33672 backedges. 0 proven. 33672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:02,719 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:02,719 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [184] total 184 [2018-09-26 08:27:02,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 186 states [2018-09-26 08:27:02,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 186 interpolants. [2018-09-26 08:27:02,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-09-26 08:27:02,723 INFO L87 Difference]: Start difference. First operand 370 states and 370 transitions. Second operand 186 states. [2018-09-26 08:27:04,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:04,141 INFO L93 Difference]: Finished difference Result 373 states and 373 transitions. [2018-09-26 08:27:04,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 186 states. [2018-09-26 08:27:04,141 INFO L78 Accepts]: Start accepts. Automaton has 186 states. Word has length 369 [2018-09-26 08:27:04,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:04,142 INFO L225 Difference]: With dead ends: 373 [2018-09-26 08:27:04,142 INFO L226 Difference]: Without dead ends: 372 [2018-09-26 08:27:04,144 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-09-26 08:27:04,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2018-09-26 08:27:04,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2018-09-26 08:27:04,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2018-09-26 08:27:04,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 372 transitions. [2018-09-26 08:27:04,148 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 372 transitions. Word has length 369 [2018-09-26 08:27:04,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:04,148 INFO L480 AbstractCegarLoop]: Abstraction has 372 states and 372 transitions. [2018-09-26 08:27:04,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 186 states. [2018-09-26 08:27:04,148 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 372 transitions. [2018-09-26 08:27:04,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2018-09-26 08:27:04,149 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:04,150 INFO L375 BasicCegarLoop]: trace histogram [185, 184, 1, 1] [2018-09-26 08:27:04,150 INFO L423 AbstractCegarLoop]: === Iteration 185 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:04,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:04,150 INFO L82 PathProgramCache]: Analyzing trace with hash 968442448, now seen corresponding path program 184 times [2018-09-26 08:27:04,150 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:04,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:05,567 INFO L134 CoverageAnalysis]: Checked inductivity of 34040 backedges. 0 proven. 34040 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:05,567 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:05,567 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [185] total 185 [2018-09-26 08:27:05,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 187 states [2018-09-26 08:27:05,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 187 interpolants. [2018-09-26 08:27:05,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17391, Invalid=17391, Unknown=0, NotChecked=0, Total=34782 [2018-09-26 08:27:05,570 INFO L87 Difference]: Start difference. First operand 372 states and 372 transitions. Second operand 187 states. [2018-09-26 08:27:06,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:06,418 INFO L93 Difference]: Finished difference Result 375 states and 375 transitions. [2018-09-26 08:27:06,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 187 states. [2018-09-26 08:27:06,418 INFO L78 Accepts]: Start accepts. Automaton has 187 states. Word has length 371 [2018-09-26 08:27:06,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:06,419 INFO L225 Difference]: With dead ends: 375 [2018-09-26 08:27:06,419 INFO L226 Difference]: Without dead ends: 374 [2018-09-26 08:27:06,420 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=17391, Invalid=17391, Unknown=0, NotChecked=0, Total=34782 [2018-09-26 08:27:06,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2018-09-26 08:27:06,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 374. [2018-09-26 08:27:06,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-09-26 08:27:06,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 374 transitions. [2018-09-26 08:27:06,424 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 374 transitions. Word has length 371 [2018-09-26 08:27:06,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:06,424 INFO L480 AbstractCegarLoop]: Abstraction has 374 states and 374 transitions. [2018-09-26 08:27:06,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 187 states. [2018-09-26 08:27:06,424 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 374 transitions. [2018-09-26 08:27:06,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2018-09-26 08:27:06,425 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:06,425 INFO L375 BasicCegarLoop]: trace histogram [186, 185, 1, 1] [2018-09-26 08:27:06,425 INFO L423 AbstractCegarLoop]: === Iteration 186 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:06,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:06,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1334709614, now seen corresponding path program 185 times [2018-09-26 08:27:06,426 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:06,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:07,800 INFO L134 CoverageAnalysis]: Checked inductivity of 34410 backedges. 0 proven. 34410 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:07,800 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:07,800 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [186] total 186 [2018-09-26 08:27:07,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 188 states [2018-09-26 08:27:07,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 188 interpolants. [2018-09-26 08:27:07,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-09-26 08:27:07,804 INFO L87 Difference]: Start difference. First operand 374 states and 374 transitions. Second operand 188 states. [2018-09-26 08:27:08,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:08,775 INFO L93 Difference]: Finished difference Result 377 states and 377 transitions. [2018-09-26 08:27:08,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 188 states. [2018-09-26 08:27:08,775 INFO L78 Accepts]: Start accepts. Automaton has 188 states. Word has length 373 [2018-09-26 08:27:08,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:08,776 INFO L225 Difference]: With dead ends: 377 [2018-09-26 08:27:08,776 INFO L226 Difference]: Without dead ends: 376 [2018-09-26 08:27:08,779 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-09-26 08:27:08,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2018-09-26 08:27:08,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 376. [2018-09-26 08:27:08,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2018-09-26 08:27:08,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 376 transitions. [2018-09-26 08:27:08,783 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 376 transitions. Word has length 373 [2018-09-26 08:27:08,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:08,784 INFO L480 AbstractCegarLoop]: Abstraction has 376 states and 376 transitions. [2018-09-26 08:27:08,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 188 states. [2018-09-26 08:27:08,784 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 376 transitions. [2018-09-26 08:27:08,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2018-09-26 08:27:08,785 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:08,785 INFO L375 BasicCegarLoop]: trace histogram [187, 186, 1, 1] [2018-09-26 08:27:08,785 INFO L423 AbstractCegarLoop]: === Iteration 187 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:08,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:08,785 INFO L82 PathProgramCache]: Analyzing trace with hash 1539283540, now seen corresponding path program 186 times [2018-09-26 08:27:08,785 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:08,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:10,193 INFO L134 CoverageAnalysis]: Checked inductivity of 34782 backedges. 0 proven. 34782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:10,193 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:10,193 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [187] total 187 [2018-09-26 08:27:10,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 189 states [2018-09-26 08:27:10,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 189 interpolants. [2018-09-26 08:27:10,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17766, Invalid=17766, Unknown=0, NotChecked=0, Total=35532 [2018-09-26 08:27:10,196 INFO L87 Difference]: Start difference. First operand 376 states and 376 transitions. Second operand 189 states. [2018-09-26 08:27:11,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:11,806 INFO L93 Difference]: Finished difference Result 379 states and 379 transitions. [2018-09-26 08:27:11,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 189 states. [2018-09-26 08:27:11,807 INFO L78 Accepts]: Start accepts. Automaton has 189 states. Word has length 375 [2018-09-26 08:27:11,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:11,807 INFO L225 Difference]: With dead ends: 379 [2018-09-26 08:27:11,807 INFO L226 Difference]: Without dead ends: 378 [2018-09-26 08:27:11,808 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=17766, Invalid=17766, Unknown=0, NotChecked=0, Total=35532 [2018-09-26 08:27:11,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2018-09-26 08:27:11,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 378. [2018-09-26 08:27:11,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2018-09-26 08:27:11,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 378 transitions. [2018-09-26 08:27:11,813 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 378 transitions. Word has length 375 [2018-09-26 08:27:11,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:11,813 INFO L480 AbstractCegarLoop]: Abstraction has 378 states and 378 transitions. [2018-09-26 08:27:11,813 INFO L481 AbstractCegarLoop]: Interpolant automaton has 189 states. [2018-09-26 08:27:11,813 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 378 transitions. [2018-09-26 08:27:11,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2018-09-26 08:27:11,814 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:11,814 INFO L375 BasicCegarLoop]: trace histogram [188, 187, 1, 1] [2018-09-26 08:27:11,814 INFO L423 AbstractCegarLoop]: === Iteration 188 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:11,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:11,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1782733206, now seen corresponding path program 187 times [2018-09-26 08:27:11,815 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:11,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:13,216 INFO L134 CoverageAnalysis]: Checked inductivity of 35156 backedges. 0 proven. 35156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:13,216 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:13,216 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [188] total 188 [2018-09-26 08:27:13,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 190 states [2018-09-26 08:27:13,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 190 interpolants. [2018-09-26 08:27:13,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-09-26 08:27:13,221 INFO L87 Difference]: Start difference. First operand 378 states and 378 transitions. Second operand 190 states. [2018-09-26 08:27:13,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:13,712 INFO L93 Difference]: Finished difference Result 381 states and 381 transitions. [2018-09-26 08:27:13,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2018-09-26 08:27:13,712 INFO L78 Accepts]: Start accepts. Automaton has 190 states. Word has length 377 [2018-09-26 08:27:13,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:13,712 INFO L225 Difference]: With dead ends: 381 [2018-09-26 08:27:13,713 INFO L226 Difference]: Without dead ends: 380 [2018-09-26 08:27:13,714 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-09-26 08:27:13,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-09-26 08:27:13,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 380. [2018-09-26 08:27:13,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-09-26 08:27:13,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 380 transitions. [2018-09-26 08:27:13,719 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 380 transitions. Word has length 377 [2018-09-26 08:27:13,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:13,719 INFO L480 AbstractCegarLoop]: Abstraction has 380 states and 380 transitions. [2018-09-26 08:27:13,719 INFO L481 AbstractCegarLoop]: Interpolant automaton has 190 states. [2018-09-26 08:27:13,719 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 380 transitions. [2018-09-26 08:27:13,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2018-09-26 08:27:13,721 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:13,721 INFO L375 BasicCegarLoop]: trace histogram [189, 188, 1, 1] [2018-09-26 08:27:13,721 INFO L423 AbstractCegarLoop]: === Iteration 189 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:13,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:13,722 INFO L82 PathProgramCache]: Analyzing trace with hash -485339048, now seen corresponding path program 188 times [2018-09-26 08:27:13,722 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:13,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:15,160 INFO L134 CoverageAnalysis]: Checked inductivity of 35532 backedges. 0 proven. 35532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:15,160 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:15,161 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [189] total 189 [2018-09-26 08:27:15,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 191 states [2018-09-26 08:27:15,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 191 interpolants. [2018-09-26 08:27:15,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18145, Invalid=18145, Unknown=0, NotChecked=0, Total=36290 [2018-09-26 08:27:15,164 INFO L87 Difference]: Start difference. First operand 380 states and 380 transitions. Second operand 191 states. [2018-09-26 08:27:16,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:16,335 INFO L93 Difference]: Finished difference Result 383 states and 383 transitions. [2018-09-26 08:27:16,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 191 states. [2018-09-26 08:27:16,335 INFO L78 Accepts]: Start accepts. Automaton has 191 states. Word has length 379 [2018-09-26 08:27:16,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:16,336 INFO L225 Difference]: With dead ends: 383 [2018-09-26 08:27:16,336 INFO L226 Difference]: Without dead ends: 382 [2018-09-26 08:27:16,337 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=18145, Invalid=18145, Unknown=0, NotChecked=0, Total=36290 [2018-09-26 08:27:16,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-09-26 08:27:16,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2018-09-26 08:27:16,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2018-09-26 08:27:16,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 382 transitions. [2018-09-26 08:27:16,342 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 382 transitions. Word has length 379 [2018-09-26 08:27:16,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:16,342 INFO L480 AbstractCegarLoop]: Abstraction has 382 states and 382 transitions. [2018-09-26 08:27:16,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 191 states. [2018-09-26 08:27:16,342 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 382 transitions. [2018-09-26 08:27:16,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2018-09-26 08:27:16,343 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:16,343 INFO L375 BasicCegarLoop]: trace histogram [190, 189, 1, 1] [2018-09-26 08:27:16,344 INFO L423 AbstractCegarLoop]: === Iteration 190 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:16,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:16,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1740611226, now seen corresponding path program 189 times [2018-09-26 08:27:16,344 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:16,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:17,794 INFO L134 CoverageAnalysis]: Checked inductivity of 35910 backedges. 0 proven. 35910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:17,794 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:17,794 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [190] total 190 [2018-09-26 08:27:17,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 192 states [2018-09-26 08:27:17,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2018-09-26 08:27:17,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-09-26 08:27:17,798 INFO L87 Difference]: Start difference. First operand 382 states and 382 transitions. Second operand 192 states. [2018-09-26 08:27:19,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:19,501 INFO L93 Difference]: Finished difference Result 385 states and 385 transitions. [2018-09-26 08:27:19,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2018-09-26 08:27:19,501 INFO L78 Accepts]: Start accepts. Automaton has 192 states. Word has length 381 [2018-09-26 08:27:19,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:19,501 INFO L225 Difference]: With dead ends: 385 [2018-09-26 08:27:19,501 INFO L226 Difference]: Without dead ends: 384 [2018-09-26 08:27:19,503 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-09-26 08:27:19,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2018-09-26 08:27:19,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2018-09-26 08:27:19,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2018-09-26 08:27:19,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 384 transitions. [2018-09-26 08:27:19,509 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 384 transitions. Word has length 381 [2018-09-26 08:27:19,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:19,509 INFO L480 AbstractCegarLoop]: Abstraction has 384 states and 384 transitions. [2018-09-26 08:27:19,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 192 states. [2018-09-26 08:27:19,509 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 384 transitions. [2018-09-26 08:27:19,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2018-09-26 08:27:19,510 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:19,510 INFO L375 BasicCegarLoop]: trace histogram [191, 190, 1, 1] [2018-09-26 08:27:19,511 INFO L423 AbstractCegarLoop]: === Iteration 191 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:19,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:19,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1985111132, now seen corresponding path program 190 times [2018-09-26 08:27:19,511 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:19,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:20,909 INFO L134 CoverageAnalysis]: Checked inductivity of 36290 backedges. 0 proven. 36290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:20,909 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:20,910 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [191] total 191 [2018-09-26 08:27:20,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 193 states [2018-09-26 08:27:20,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 193 interpolants. [2018-09-26 08:27:20,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18528, Invalid=18528, Unknown=0, NotChecked=0, Total=37056 [2018-09-26 08:27:20,915 INFO L87 Difference]: Start difference. First operand 384 states and 384 transitions. Second operand 193 states. [2018-09-26 08:27:22,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:22,041 INFO L93 Difference]: Finished difference Result 387 states and 387 transitions. [2018-09-26 08:27:22,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 193 states. [2018-09-26 08:27:22,041 INFO L78 Accepts]: Start accepts. Automaton has 193 states. Word has length 383 [2018-09-26 08:27:22,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:22,042 INFO L225 Difference]: With dead ends: 387 [2018-09-26 08:27:22,042 INFO L226 Difference]: Without dead ends: 386 [2018-09-26 08:27:22,044 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=18528, Invalid=18528, Unknown=0, NotChecked=0, Total=37056 [2018-09-26 08:27:22,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-09-26 08:27:22,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2018-09-26 08:27:22,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2018-09-26 08:27:22,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 386 transitions. [2018-09-26 08:27:22,048 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 386 transitions. Word has length 383 [2018-09-26 08:27:22,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:22,049 INFO L480 AbstractCegarLoop]: Abstraction has 386 states and 386 transitions. [2018-09-26 08:27:22,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 193 states. [2018-09-26 08:27:22,049 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 386 transitions. [2018-09-26 08:27:22,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2018-09-26 08:27:22,051 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:22,051 INFO L375 BasicCegarLoop]: trace histogram [192, 191, 1, 1] [2018-09-26 08:27:22,051 INFO L423 AbstractCegarLoop]: === Iteration 192 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:22,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:22,051 INFO L82 PathProgramCache]: Analyzing trace with hash 726319518, now seen corresponding path program 191 times [2018-09-26 08:27:22,051 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:22,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:23,642 INFO L134 CoverageAnalysis]: Checked inductivity of 36672 backedges. 0 proven. 36672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:23,642 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:23,643 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [192] total 192 [2018-09-26 08:27:23,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 194 states [2018-09-26 08:27:23,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 194 interpolants. [2018-09-26 08:27:23,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-09-26 08:27:23,646 INFO L87 Difference]: Start difference. First operand 386 states and 386 transitions. Second operand 194 states. [2018-09-26 08:27:24,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:24,113 INFO L93 Difference]: Finished difference Result 389 states and 389 transitions. [2018-09-26 08:27:24,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 194 states. [2018-09-26 08:27:24,114 INFO L78 Accepts]: Start accepts. Automaton has 194 states. Word has length 385 [2018-09-26 08:27:24,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:24,114 INFO L225 Difference]: With dead ends: 389 [2018-09-26 08:27:24,114 INFO L226 Difference]: Without dead ends: 388 [2018-09-26 08:27:24,115 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-09-26 08:27:24,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-09-26 08:27:24,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 388. [2018-09-26 08:27:24,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2018-09-26 08:27:24,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 388 transitions. [2018-09-26 08:27:24,120 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 388 transitions. Word has length 385 [2018-09-26 08:27:24,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:24,121 INFO L480 AbstractCegarLoop]: Abstraction has 388 states and 388 transitions. [2018-09-26 08:27:24,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 194 states. [2018-09-26 08:27:24,121 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 388 transitions. [2018-09-26 08:27:24,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2018-09-26 08:27:24,122 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:24,123 INFO L375 BasicCegarLoop]: trace histogram [193, 192, 1, 1] [2018-09-26 08:27:24,123 INFO L423 AbstractCegarLoop]: === Iteration 193 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:24,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:24,123 INFO L82 PathProgramCache]: Analyzing trace with hash -2086611360, now seen corresponding path program 192 times [2018-09-26 08:27:24,123 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:24,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:25,675 INFO L134 CoverageAnalysis]: Checked inductivity of 37056 backedges. 0 proven. 37056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:25,676 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:25,676 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [193] total 193 [2018-09-26 08:27:25,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 195 states [2018-09-26 08:27:25,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 195 interpolants. [2018-09-26 08:27:25,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18915, Invalid=18915, Unknown=0, NotChecked=0, Total=37830 [2018-09-26 08:27:25,681 INFO L87 Difference]: Start difference. First operand 388 states and 388 transitions. Second operand 195 states. [2018-09-26 08:27:26,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:26,513 INFO L93 Difference]: Finished difference Result 391 states and 391 transitions. [2018-09-26 08:27:26,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2018-09-26 08:27:26,513 INFO L78 Accepts]: Start accepts. Automaton has 195 states. Word has length 387 [2018-09-26 08:27:26,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:26,514 INFO L225 Difference]: With dead ends: 391 [2018-09-26 08:27:26,514 INFO L226 Difference]: Without dead ends: 390 [2018-09-26 08:27:26,516 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=18915, Invalid=18915, Unknown=0, NotChecked=0, Total=37830 [2018-09-26 08:27:26,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2018-09-26 08:27:26,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 390. [2018-09-26 08:27:26,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2018-09-26 08:27:26,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 390 transitions. [2018-09-26 08:27:26,521 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 390 transitions. Word has length 387 [2018-09-26 08:27:26,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:26,521 INFO L480 AbstractCegarLoop]: Abstraction has 390 states and 390 transitions. [2018-09-26 08:27:26,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 195 states. [2018-09-26 08:27:26,521 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 390 transitions. [2018-09-26 08:27:26,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2018-09-26 08:27:26,522 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:26,522 INFO L375 BasicCegarLoop]: trace histogram [194, 193, 1, 1] [2018-09-26 08:27:26,523 INFO L423 AbstractCegarLoop]: === Iteration 194 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:26,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:26,523 INFO L82 PathProgramCache]: Analyzing trace with hash 516211362, now seen corresponding path program 193 times [2018-09-26 08:27:26,523 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:26,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:28,099 INFO L134 CoverageAnalysis]: Checked inductivity of 37442 backedges. 0 proven. 37442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:28,100 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:28,100 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [194] total 194 [2018-09-26 08:27:28,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 196 states [2018-09-26 08:27:28,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 196 interpolants. [2018-09-26 08:27:28,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-09-26 08:27:28,103 INFO L87 Difference]: Start difference. First operand 390 states and 390 transitions. Second operand 196 states. [2018-09-26 08:27:29,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:29,443 INFO L93 Difference]: Finished difference Result 393 states and 393 transitions. [2018-09-26 08:27:29,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 196 states. [2018-09-26 08:27:29,443 INFO L78 Accepts]: Start accepts. Automaton has 196 states. Word has length 389 [2018-09-26 08:27:29,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:29,444 INFO L225 Difference]: With dead ends: 393 [2018-09-26 08:27:29,444 INFO L226 Difference]: Without dead ends: 392 [2018-09-26 08:27:29,445 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-09-26 08:27:29,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2018-09-26 08:27:29,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2018-09-26 08:27:29,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-09-26 08:27:29,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 392 transitions. [2018-09-26 08:27:29,449 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 392 transitions. Word has length 389 [2018-09-26 08:27:29,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:29,450 INFO L480 AbstractCegarLoop]: Abstraction has 392 states and 392 transitions. [2018-09-26 08:27:29,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 196 states. [2018-09-26 08:27:29,450 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 392 transitions. [2018-09-26 08:27:29,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2018-09-26 08:27:29,451 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:29,451 INFO L375 BasicCegarLoop]: trace histogram [195, 194, 1, 1] [2018-09-26 08:27:29,451 INFO L423 AbstractCegarLoop]: === Iteration 195 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:29,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:29,451 INFO L82 PathProgramCache]: Analyzing trace with hash -2137086364, now seen corresponding path program 194 times [2018-09-26 08:27:29,451 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:29,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:30,996 INFO L134 CoverageAnalysis]: Checked inductivity of 37830 backedges. 0 proven. 37830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:30,996 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:30,996 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [195] total 195 [2018-09-26 08:27:30,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 197 states [2018-09-26 08:27:31,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 197 interpolants. [2018-09-26 08:27:31,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19306, Invalid=19306, Unknown=0, NotChecked=0, Total=38612 [2018-09-26 08:27:31,001 INFO L87 Difference]: Start difference. First operand 392 states and 392 transitions. Second operand 197 states. [2018-09-26 08:27:32,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:32,876 INFO L93 Difference]: Finished difference Result 395 states and 395 transitions. [2018-09-26 08:27:32,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 197 states. [2018-09-26 08:27:32,876 INFO L78 Accepts]: Start accepts. Automaton has 197 states. Word has length 391 [2018-09-26 08:27:32,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:32,877 INFO L225 Difference]: With dead ends: 395 [2018-09-26 08:27:32,877 INFO L226 Difference]: Without dead ends: 394 [2018-09-26 08:27:32,879 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=19306, Invalid=19306, Unknown=0, NotChecked=0, Total=38612 [2018-09-26 08:27:32,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2018-09-26 08:27:32,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2018-09-26 08:27:32,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 394 states. [2018-09-26 08:27:32,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 394 transitions. [2018-09-26 08:27:32,884 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 394 transitions. Word has length 391 [2018-09-26 08:27:32,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:32,884 INFO L480 AbstractCegarLoop]: Abstraction has 394 states and 394 transitions. [2018-09-26 08:27:32,884 INFO L481 AbstractCegarLoop]: Interpolant automaton has 197 states. [2018-09-26 08:27:32,885 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 394 transitions. [2018-09-26 08:27:32,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2018-09-26 08:27:32,886 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:32,886 INFO L375 BasicCegarLoop]: trace histogram [196, 195, 1, 1] [2018-09-26 08:27:32,886 INFO L423 AbstractCegarLoop]: === Iteration 196 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:32,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:32,886 INFO L82 PathProgramCache]: Analyzing trace with hash -745627226, now seen corresponding path program 195 times [2018-09-26 08:27:32,886 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:33,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:34,503 INFO L134 CoverageAnalysis]: Checked inductivity of 38220 backedges. 0 proven. 38220 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:34,503 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:34,503 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [196] total 196 [2018-09-26 08:27:34,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 198 states [2018-09-26 08:27:34,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 198 interpolants. [2018-09-26 08:27:34,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-09-26 08:27:34,508 INFO L87 Difference]: Start difference. First operand 394 states and 394 transitions. Second operand 198 states. [2018-09-26 08:27:36,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:36,490 INFO L93 Difference]: Finished difference Result 397 states and 397 transitions. [2018-09-26 08:27:36,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 198 states. [2018-09-26 08:27:36,490 INFO L78 Accepts]: Start accepts. Automaton has 198 states. Word has length 393 [2018-09-26 08:27:36,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:36,491 INFO L225 Difference]: With dead ends: 397 [2018-09-26 08:27:36,491 INFO L226 Difference]: Without dead ends: 396 [2018-09-26 08:27:36,493 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-09-26 08:27:36,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2018-09-26 08:27:36,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2018-09-26 08:27:36,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-09-26 08:27:36,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 396 transitions. [2018-09-26 08:27:36,497 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 396 transitions. Word has length 393 [2018-09-26 08:27:36,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:36,498 INFO L480 AbstractCegarLoop]: Abstraction has 396 states and 396 transitions. [2018-09-26 08:27:36,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 198 states. [2018-09-26 08:27:36,498 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 396 transitions. [2018-09-26 08:27:36,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2018-09-26 08:27:36,499 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:36,499 INFO L375 BasicCegarLoop]: trace histogram [197, 196, 1, 1] [2018-09-26 08:27:36,499 INFO L423 AbstractCegarLoop]: === Iteration 197 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:36,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:36,499 INFO L82 PathProgramCache]: Analyzing trace with hash 711775336, now seen corresponding path program 196 times [2018-09-26 08:27:36,499 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:36,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:38,104 INFO L134 CoverageAnalysis]: Checked inductivity of 38612 backedges. 0 proven. 38612 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:38,104 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:38,104 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [197] total 197 [2018-09-26 08:27:38,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 199 states [2018-09-26 08:27:38,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 199 interpolants. [2018-09-26 08:27:38,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19701, Invalid=19701, Unknown=0, NotChecked=0, Total=39402 [2018-09-26 08:27:38,107 INFO L87 Difference]: Start difference. First operand 396 states and 396 transitions. Second operand 199 states. [2018-09-26 08:27:39,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:39,967 INFO L93 Difference]: Finished difference Result 399 states and 399 transitions. [2018-09-26 08:27:39,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 199 states. [2018-09-26 08:27:39,967 INFO L78 Accepts]: Start accepts. Automaton has 199 states. Word has length 395 [2018-09-26 08:27:39,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:39,968 INFO L225 Difference]: With dead ends: 399 [2018-09-26 08:27:39,968 INFO L226 Difference]: Without dead ends: 398 [2018-09-26 08:27:39,969 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=19701, Invalid=19701, Unknown=0, NotChecked=0, Total=39402 [2018-09-26 08:27:39,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-09-26 08:27:39,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 398. [2018-09-26 08:27:39,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2018-09-26 08:27:39,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 398 transitions. [2018-09-26 08:27:39,974 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 398 transitions. Word has length 395 [2018-09-26 08:27:39,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:39,974 INFO L480 AbstractCegarLoop]: Abstraction has 398 states and 398 transitions. [2018-09-26 08:27:39,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 199 states. [2018-09-26 08:27:39,974 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 398 transitions. [2018-09-26 08:27:39,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2018-09-26 08:27:39,975 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:39,975 INFO L375 BasicCegarLoop]: trace histogram [198, 197, 1, 1] [2018-09-26 08:27:39,975 INFO L423 AbstractCegarLoop]: === Iteration 198 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:39,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:39,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1116298922, now seen corresponding path program 197 times [2018-09-26 08:27:39,976 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:40,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:41,671 INFO L134 CoverageAnalysis]: Checked inductivity of 39006 backedges. 0 proven. 39006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:41,672 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:41,672 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [198] total 198 [2018-09-26 08:27:41,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 200 states [2018-09-26 08:27:41,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 200 interpolants. [2018-09-26 08:27:41,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-09-26 08:27:41,677 INFO L87 Difference]: Start difference. First operand 398 states and 398 transitions. Second operand 200 states. [2018-09-26 08:27:44,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:44,290 INFO L93 Difference]: Finished difference Result 401 states and 401 transitions. [2018-09-26 08:27:44,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2018-09-26 08:27:44,290 INFO L78 Accepts]: Start accepts. Automaton has 200 states. Word has length 397 [2018-09-26 08:27:44,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:44,291 INFO L225 Difference]: With dead ends: 401 [2018-09-26 08:27:44,291 INFO L226 Difference]: Without dead ends: 400 [2018-09-26 08:27:44,293 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-09-26 08:27:44,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2018-09-26 08:27:44,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 400. [2018-09-26 08:27:44,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 400 states. [2018-09-26 08:27:44,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 400 transitions. [2018-09-26 08:27:44,298 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 400 transitions. Word has length 397 [2018-09-26 08:27:44,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:44,298 INFO L480 AbstractCegarLoop]: Abstraction has 400 states and 400 transitions. [2018-09-26 08:27:44,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 200 states. [2018-09-26 08:27:44,298 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 400 transitions. [2018-09-26 08:27:44,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2018-09-26 08:27:44,299 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:44,299 INFO L375 BasicCegarLoop]: trace histogram [199, 198, 1, 1] [2018-09-26 08:27:44,299 INFO L423 AbstractCegarLoop]: === Iteration 199 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:44,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:44,300 INFO L82 PathProgramCache]: Analyzing trace with hash -978558868, now seen corresponding path program 198 times [2018-09-26 08:27:44,300 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:44,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:46,060 INFO L134 CoverageAnalysis]: Checked inductivity of 39402 backedges. 0 proven. 39402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:46,060 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:46,060 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [199] total 199 [2018-09-26 08:27:46,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 201 states [2018-09-26 08:27:46,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 201 interpolants. [2018-09-26 08:27:46,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20100, Invalid=20100, Unknown=0, NotChecked=0, Total=40200 [2018-09-26 08:27:46,064 INFO L87 Difference]: Start difference. First operand 400 states and 400 transitions. Second operand 201 states. [2018-09-26 08:27:48,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:48,082 INFO L93 Difference]: Finished difference Result 403 states and 403 transitions. [2018-09-26 08:27:48,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2018-09-26 08:27:48,082 INFO L78 Accepts]: Start accepts. Automaton has 201 states. Word has length 399 [2018-09-26 08:27:48,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:48,082 INFO L225 Difference]: With dead ends: 403 [2018-09-26 08:27:48,083 INFO L226 Difference]: Without dead ends: 402 [2018-09-26 08:27:48,084 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=20100, Invalid=20100, Unknown=0, NotChecked=0, Total=40200 [2018-09-26 08:27:48,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-09-26 08:27:48,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 402. [2018-09-26 08:27:48,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2018-09-26 08:27:48,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 402 transitions. [2018-09-26 08:27:48,088 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 402 transitions. Word has length 399 [2018-09-26 08:27:48,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:48,089 INFO L480 AbstractCegarLoop]: Abstraction has 402 states and 402 transitions. [2018-09-26 08:27:48,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 201 states. [2018-09-26 08:27:48,089 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 402 transitions. [2018-09-26 08:27:48,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2018-09-26 08:27:48,090 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:48,090 INFO L375 BasicCegarLoop]: trace histogram [200, 199, 1, 1] [2018-09-26 08:27:48,090 INFO L423 AbstractCegarLoop]: === Iteration 200 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:48,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:48,090 INFO L82 PathProgramCache]: Analyzing trace with hash 202766766, now seen corresponding path program 199 times [2018-09-26 08:27:48,090 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:48,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:49,727 INFO L134 CoverageAnalysis]: Checked inductivity of 39800 backedges. 0 proven. 39800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:49,727 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:49,728 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [200] total 200 [2018-09-26 08:27:49,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 202 states [2018-09-26 08:27:49,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 202 interpolants. [2018-09-26 08:27:49,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-09-26 08:27:49,732 INFO L87 Difference]: Start difference. First operand 402 states and 402 transitions. Second operand 202 states. [2018-09-26 08:27:51,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:51,370 INFO L93 Difference]: Finished difference Result 405 states and 405 transitions. [2018-09-26 08:27:51,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2018-09-26 08:27:51,370 INFO L78 Accepts]: Start accepts. Automaton has 202 states. Word has length 401 [2018-09-26 08:27:51,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:51,370 INFO L225 Difference]: With dead ends: 405 [2018-09-26 08:27:51,370 INFO L226 Difference]: Without dead ends: 404 [2018-09-26 08:27:51,371 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-09-26 08:27:51,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2018-09-26 08:27:51,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 404. [2018-09-26 08:27:51,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2018-09-26 08:27:51,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 404 transitions. [2018-09-26 08:27:51,376 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 404 transitions. Word has length 401 [2018-09-26 08:27:51,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:51,376 INFO L480 AbstractCegarLoop]: Abstraction has 404 states and 404 transitions. [2018-09-26 08:27:51,376 INFO L481 AbstractCegarLoop]: Interpolant automaton has 202 states. [2018-09-26 08:27:51,376 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 404 transitions. [2018-09-26 08:27:51,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2018-09-26 08:27:51,377 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:51,378 INFO L375 BasicCegarLoop]: trace histogram [201, 200, 1, 1] [2018-09-26 08:27:51,378 INFO L423 AbstractCegarLoop]: === Iteration 201 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:51,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:51,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1585334896, now seen corresponding path program 200 times [2018-09-26 08:27:51,378 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:51,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:53,065 INFO L134 CoverageAnalysis]: Checked inductivity of 40200 backedges. 0 proven. 40200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:53,065 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:53,066 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [201] total 201 [2018-09-26 08:27:53,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 203 states [2018-09-26 08:27:53,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 203 interpolants. [2018-09-26 08:27:53,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20503, Invalid=20503, Unknown=0, NotChecked=0, Total=41006 [2018-09-26 08:27:53,071 INFO L87 Difference]: Start difference. First operand 404 states and 404 transitions. Second operand 203 states. [2018-09-26 08:27:54,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:54,617 INFO L93 Difference]: Finished difference Result 407 states and 407 transitions. [2018-09-26 08:27:54,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 203 states. [2018-09-26 08:27:54,617 INFO L78 Accepts]: Start accepts. Automaton has 203 states. Word has length 403 [2018-09-26 08:27:54,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:54,618 INFO L225 Difference]: With dead ends: 407 [2018-09-26 08:27:54,618 INFO L226 Difference]: Without dead ends: 406 [2018-09-26 08:27:54,620 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=20503, Invalid=20503, Unknown=0, NotChecked=0, Total=41006 [2018-09-26 08:27:54,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2018-09-26 08:27:54,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 406. [2018-09-26 08:27:54,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2018-09-26 08:27:54,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 406 transitions. [2018-09-26 08:27:54,624 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 406 transitions. Word has length 403 [2018-09-26 08:27:54,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:54,625 INFO L480 AbstractCegarLoop]: Abstraction has 406 states and 406 transitions. [2018-09-26 08:27:54,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 203 states. [2018-09-26 08:27:54,625 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 406 transitions. [2018-09-26 08:27:54,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2018-09-26 08:27:54,626 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:54,626 INFO L375 BasicCegarLoop]: trace histogram [202, 201, 1, 1] [2018-09-26 08:27:54,626 INFO L423 AbstractCegarLoop]: === Iteration 202 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:54,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:54,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1206553934, now seen corresponding path program 201 times [2018-09-26 08:27:54,627 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:54,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:56,315 INFO L134 CoverageAnalysis]: Checked inductivity of 40602 backedges. 0 proven. 40602 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:56,315 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:56,315 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [202] total 202 [2018-09-26 08:27:56,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 204 states [2018-09-26 08:27:56,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 204 interpolants. [2018-09-26 08:27:56,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-09-26 08:27:56,320 INFO L87 Difference]: Start difference. First operand 406 states and 406 transitions. Second operand 204 states. [2018-09-26 08:27:57,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:57,019 INFO L93 Difference]: Finished difference Result 409 states and 409 transitions. [2018-09-26 08:27:57,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 204 states. [2018-09-26 08:27:57,020 INFO L78 Accepts]: Start accepts. Automaton has 204 states. Word has length 405 [2018-09-26 08:27:57,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:57,021 INFO L225 Difference]: With dead ends: 409 [2018-09-26 08:27:57,021 INFO L226 Difference]: Without dead ends: 408 [2018-09-26 08:27:57,023 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-09-26 08:27:57,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2018-09-26 08:27:57,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 408. [2018-09-26 08:27:57,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2018-09-26 08:27:57,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 408 transitions. [2018-09-26 08:27:57,030 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 408 transitions. Word has length 405 [2018-09-26 08:27:57,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:57,030 INFO L480 AbstractCegarLoop]: Abstraction has 408 states and 408 transitions. [2018-09-26 08:27:57,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 204 states. [2018-09-26 08:27:57,031 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 408 transitions. [2018-09-26 08:27:57,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2018-09-26 08:27:57,032 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:57,033 INFO L375 BasicCegarLoop]: trace histogram [203, 202, 1, 1] [2018-09-26 08:27:57,033 INFO L423 AbstractCegarLoop]: === Iteration 203 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:57,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:57,033 INFO L82 PathProgramCache]: Analyzing trace with hash 142840436, now seen corresponding path program 202 times [2018-09-26 08:27:57,033 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:57,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:58,774 INFO L134 CoverageAnalysis]: Checked inductivity of 41006 backedges. 0 proven. 41006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:58,774 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:58,774 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [203] total 203 [2018-09-26 08:27:58,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 205 states [2018-09-26 08:27:58,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 205 interpolants. [2018-09-26 08:27:58,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20910, Invalid=20910, Unknown=0, NotChecked=0, Total=41820 [2018-09-26 08:27:58,777 INFO L87 Difference]: Start difference. First operand 408 states and 408 transitions. Second operand 205 states. [2018-09-26 08:27:59,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:59,660 INFO L93 Difference]: Finished difference Result 411 states and 411 transitions. [2018-09-26 08:27:59,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 205 states. [2018-09-26 08:27:59,660 INFO L78 Accepts]: Start accepts. Automaton has 205 states. Word has length 407 [2018-09-26 08:27:59,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:59,661 INFO L225 Difference]: With dead ends: 411 [2018-09-26 08:27:59,661 INFO L226 Difference]: Without dead ends: 410 [2018-09-26 08:27:59,662 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=20910, Invalid=20910, Unknown=0, NotChecked=0, Total=41820 [2018-09-26 08:27:59,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2018-09-26 08:27:59,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 410. [2018-09-26 08:27:59,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-09-26 08:27:59,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 410 transitions. [2018-09-26 08:27:59,666 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 410 transitions. Word has length 407 [2018-09-26 08:27:59,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:59,667 INFO L480 AbstractCegarLoop]: Abstraction has 410 states and 410 transitions. [2018-09-26 08:27:59,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 205 states. [2018-09-26 08:27:59,667 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 410 transitions. [2018-09-26 08:27:59,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2018-09-26 08:27:59,668 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:59,668 INFO L375 BasicCegarLoop]: trace histogram [204, 203, 1, 1] [2018-09-26 08:27:59,668 INFO L423 AbstractCegarLoop]: === Iteration 204 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:59,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:59,668 INFO L82 PathProgramCache]: Analyzing trace with hash -169293386, now seen corresponding path program 203 times [2018-09-26 08:27:59,668 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:59,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:01,448 INFO L134 CoverageAnalysis]: Checked inductivity of 41412 backedges. 0 proven. 41412 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:01,448 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:01,449 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [204] total 204 [2018-09-26 08:28:01,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 206 states [2018-09-26 08:28:01,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 206 interpolants. [2018-09-26 08:28:01,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-09-26 08:28:01,454 INFO L87 Difference]: Start difference. First operand 410 states and 410 transitions. Second operand 206 states. [2018-09-26 08:28:03,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:03,225 INFO L93 Difference]: Finished difference Result 413 states and 413 transitions. [2018-09-26 08:28:03,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 206 states. [2018-09-26 08:28:03,225 INFO L78 Accepts]: Start accepts. Automaton has 206 states. Word has length 409 [2018-09-26 08:28:03,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:03,226 INFO L225 Difference]: With dead ends: 413 [2018-09-26 08:28:03,226 INFO L226 Difference]: Without dead ends: 412 [2018-09-26 08:28:03,228 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-09-26 08:28:03,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2018-09-26 08:28:03,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 412. [2018-09-26 08:28:03,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 412 states. [2018-09-26 08:28:03,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 412 transitions. [2018-09-26 08:28:03,234 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 412 transitions. Word has length 409 [2018-09-26 08:28:03,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:03,235 INFO L480 AbstractCegarLoop]: Abstraction has 412 states and 412 transitions. [2018-09-26 08:28:03,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 206 states. [2018-09-26 08:28:03,235 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 412 transitions. [2018-09-26 08:28:03,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 412 [2018-09-26 08:28:03,236 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:03,236 INFO L375 BasicCegarLoop]: trace histogram [205, 204, 1, 1] [2018-09-26 08:28:03,236 INFO L423 AbstractCegarLoop]: === Iteration 205 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:03,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:03,236 INFO L82 PathProgramCache]: Analyzing trace with hash 517814392, now seen corresponding path program 204 times [2018-09-26 08:28:03,236 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:03,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:04,991 INFO L134 CoverageAnalysis]: Checked inductivity of 41820 backedges. 0 proven. 41820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:04,992 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:04,992 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [205] total 205 [2018-09-26 08:28:04,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 207 states [2018-09-26 08:28:04,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 207 interpolants. [2018-09-26 08:28:04,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21321, Invalid=21321, Unknown=0, NotChecked=0, Total=42642 [2018-09-26 08:28:04,997 INFO L87 Difference]: Start difference. First operand 412 states and 412 transitions. Second operand 207 states. [2018-09-26 08:28:07,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:07,323 INFO L93 Difference]: Finished difference Result 415 states and 415 transitions. [2018-09-26 08:28:07,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 207 states. [2018-09-26 08:28:07,323 INFO L78 Accepts]: Start accepts. Automaton has 207 states. Word has length 411 [2018-09-26 08:28:07,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:07,324 INFO L225 Difference]: With dead ends: 415 [2018-09-26 08:28:07,324 INFO L226 Difference]: Without dead ends: 414 [2018-09-26 08:28:07,326 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=21321, Invalid=21321, Unknown=0, NotChecked=0, Total=42642 [2018-09-26 08:28:07,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2018-09-26 08:28:07,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 414. [2018-09-26 08:28:07,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2018-09-26 08:28:07,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 414 transitions. [2018-09-26 08:28:07,331 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 414 transitions. Word has length 411 [2018-09-26 08:28:07,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:07,331 INFO L480 AbstractCegarLoop]: Abstraction has 414 states and 414 transitions. [2018-09-26 08:28:07,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 207 states. [2018-09-26 08:28:07,331 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 414 transitions. [2018-09-26 08:28:07,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2018-09-26 08:28:07,332 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:07,332 INFO L375 BasicCegarLoop]: trace histogram [206, 205, 1, 1] [2018-09-26 08:28:07,332 INFO L423 AbstractCegarLoop]: === Iteration 206 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:07,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:07,333 INFO L82 PathProgramCache]: Analyzing trace with hash -596574534, now seen corresponding path program 205 times [2018-09-26 08:28:07,333 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:07,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:09,151 INFO L134 CoverageAnalysis]: Checked inductivity of 42230 backedges. 0 proven. 42230 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:09,151 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:09,152 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [206] total 206 [2018-09-26 08:28:09,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 208 states [2018-09-26 08:28:09,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 208 interpolants. [2018-09-26 08:28:09,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-09-26 08:28:09,155 INFO L87 Difference]: Start difference. First operand 414 states and 414 transitions. Second operand 208 states. [2018-09-26 08:28:10,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:10,431 INFO L93 Difference]: Finished difference Result 417 states and 417 transitions. [2018-09-26 08:28:10,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 208 states. [2018-09-26 08:28:10,431 INFO L78 Accepts]: Start accepts. Automaton has 208 states. Word has length 413 [2018-09-26 08:28:10,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:10,432 INFO L225 Difference]: With dead ends: 417 [2018-09-26 08:28:10,432 INFO L226 Difference]: Without dead ends: 416 [2018-09-26 08:28:10,433 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-09-26 08:28:10,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2018-09-26 08:28:10,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2018-09-26 08:28:10,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2018-09-26 08:28:10,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 416 transitions. [2018-09-26 08:28:10,438 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 416 transitions. Word has length 413 [2018-09-26 08:28:10,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:10,438 INFO L480 AbstractCegarLoop]: Abstraction has 416 states and 416 transitions. [2018-09-26 08:28:10,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 208 states. [2018-09-26 08:28:10,438 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 416 transitions. [2018-09-26 08:28:10,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2018-09-26 08:28:10,439 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:10,439 INFO L375 BasicCegarLoop]: trace histogram [207, 206, 1, 1] [2018-09-26 08:28:10,440 INFO L423 AbstractCegarLoop]: === Iteration 207 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:10,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:10,440 INFO L82 PathProgramCache]: Analyzing trace with hash -2077475716, now seen corresponding path program 206 times [2018-09-26 08:28:10,440 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:10,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:12,303 INFO L134 CoverageAnalysis]: Checked inductivity of 42642 backedges. 0 proven. 42642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:12,304 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:12,304 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [207] total 207 [2018-09-26 08:28:12,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 209 states [2018-09-26 08:28:12,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 209 interpolants. [2018-09-26 08:28:12,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21736, Invalid=21736, Unknown=0, NotChecked=0, Total=43472 [2018-09-26 08:28:12,309 INFO L87 Difference]: Start difference. First operand 416 states and 416 transitions. Second operand 209 states. [2018-09-26 08:28:13,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:13,379 INFO L93 Difference]: Finished difference Result 419 states and 419 transitions. [2018-09-26 08:28:13,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 209 states. [2018-09-26 08:28:13,380 INFO L78 Accepts]: Start accepts. Automaton has 209 states. Word has length 415 [2018-09-26 08:28:13,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:13,380 INFO L225 Difference]: With dead ends: 419 [2018-09-26 08:28:13,380 INFO L226 Difference]: Without dead ends: 418 [2018-09-26 08:28:13,382 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=21736, Invalid=21736, Unknown=0, NotChecked=0, Total=43472 [2018-09-26 08:28:13,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2018-09-26 08:28:13,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2018-09-26 08:28:13,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2018-09-26 08:28:13,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 418 transitions. [2018-09-26 08:28:13,387 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 418 transitions. Word has length 415 [2018-09-26 08:28:13,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:13,387 INFO L480 AbstractCegarLoop]: Abstraction has 418 states and 418 transitions. [2018-09-26 08:28:13,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 209 states. [2018-09-26 08:28:13,387 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 418 transitions. [2018-09-26 08:28:13,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2018-09-26 08:28:13,389 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:13,389 INFO L375 BasicCegarLoop]: trace histogram [208, 207, 1, 1] [2018-09-26 08:28:13,389 INFO L423 AbstractCegarLoop]: === Iteration 208 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:13,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:13,389 INFO L82 PathProgramCache]: Analyzing trace with hash 705630654, now seen corresponding path program 207 times [2018-09-26 08:28:13,389 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:13,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:15,224 INFO L134 CoverageAnalysis]: Checked inductivity of 43056 backedges. 0 proven. 43056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:15,224 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:15,225 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [208] total 208 [2018-09-26 08:28:15,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 210 states [2018-09-26 08:28:15,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 210 interpolants. [2018-09-26 08:28:15,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2018-09-26 08:28:15,230 INFO L87 Difference]: Start difference. First operand 418 states and 418 transitions. Second operand 210 states. [2018-09-26 08:28:17,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:17,741 INFO L93 Difference]: Finished difference Result 421 states and 421 transitions. [2018-09-26 08:28:17,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 210 states. [2018-09-26 08:28:17,741 INFO L78 Accepts]: Start accepts. Automaton has 210 states. Word has length 417 [2018-09-26 08:28:17,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:17,742 INFO L225 Difference]: With dead ends: 421 [2018-09-26 08:28:17,742 INFO L226 Difference]: Without dead ends: 420 [2018-09-26 08:28:17,744 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2018-09-26 08:28:17,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2018-09-26 08:28:17,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2018-09-26 08:28:17,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2018-09-26 08:28:17,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 420 transitions. [2018-09-26 08:28:17,749 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 420 transitions. Word has length 417 [2018-09-26 08:28:17,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:17,749 INFO L480 AbstractCegarLoop]: Abstraction has 420 states and 420 transitions. [2018-09-26 08:28:17,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 210 states. [2018-09-26 08:28:17,750 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 420 transitions. [2018-09-26 08:28:17,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2018-09-26 08:28:17,751 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:17,751 INFO L375 BasicCegarLoop]: trace histogram [209, 208, 1, 1] [2018-09-26 08:28:17,751 INFO L423 AbstractCegarLoop]: === Iteration 209 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:17,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:17,751 INFO L82 PathProgramCache]: Analyzing trace with hash -493773184, now seen corresponding path program 208 times [2018-09-26 08:28:17,751 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:18,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:19,640 INFO L134 CoverageAnalysis]: Checked inductivity of 43472 backedges. 0 proven. 43472 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:19,640 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:19,640 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [209] total 209 [2018-09-26 08:28:19,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 211 states [2018-09-26 08:28:19,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 211 interpolants. [2018-09-26 08:28:19,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22155, Invalid=22155, Unknown=0, NotChecked=0, Total=44310 [2018-09-26 08:28:19,643 INFO L87 Difference]: Start difference. First operand 420 states and 420 transitions. Second operand 211 states. [2018-09-26 08:28:20,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:20,881 INFO L93 Difference]: Finished difference Result 423 states and 423 transitions. [2018-09-26 08:28:20,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 211 states. [2018-09-26 08:28:20,882 INFO L78 Accepts]: Start accepts. Automaton has 211 states. Word has length 419 [2018-09-26 08:28:20,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:20,882 INFO L225 Difference]: With dead ends: 423 [2018-09-26 08:28:20,882 INFO L226 Difference]: Without dead ends: 422 [2018-09-26 08:28:20,884 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=22155, Invalid=22155, Unknown=0, NotChecked=0, Total=44310 [2018-09-26 08:28:20,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2018-09-26 08:28:20,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 422. [2018-09-26 08:28:20,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-09-26 08:28:20,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 422 transitions. [2018-09-26 08:28:20,888 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 422 transitions. Word has length 419 [2018-09-26 08:28:20,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:20,889 INFO L480 AbstractCegarLoop]: Abstraction has 422 states and 422 transitions. [2018-09-26 08:28:20,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 211 states. [2018-09-26 08:28:20,889 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 422 transitions. [2018-09-26 08:28:20,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2018-09-26 08:28:20,890 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:20,890 INFO L375 BasicCegarLoop]: trace histogram [210, 209, 1, 1] [2018-09-26 08:28:20,890 INFO L423 AbstractCegarLoop]: === Iteration 210 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:20,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:20,890 INFO L82 PathProgramCache]: Analyzing trace with hash -2069626174, now seen corresponding path program 209 times [2018-09-26 08:28:20,891 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:21,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:22,739 INFO L134 CoverageAnalysis]: Checked inductivity of 43890 backedges. 0 proven. 43890 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:22,740 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:22,740 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [210] total 210 [2018-09-26 08:28:22,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 212 states [2018-09-26 08:28:22,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 212 interpolants. [2018-09-26 08:28:22,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2018-09-26 08:28:22,745 INFO L87 Difference]: Start difference. First operand 422 states and 422 transitions. Second operand 212 states. [2018-09-26 08:28:24,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:24,839 INFO L93 Difference]: Finished difference Result 425 states and 425 transitions. [2018-09-26 08:28:24,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 212 states. [2018-09-26 08:28:24,839 INFO L78 Accepts]: Start accepts. Automaton has 212 states. Word has length 421 [2018-09-26 08:28:24,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:24,840 INFO L225 Difference]: With dead ends: 425 [2018-09-26 08:28:24,840 INFO L226 Difference]: Without dead ends: 424 [2018-09-26 08:28:24,842 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2018-09-26 08:28:24,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2018-09-26 08:28:24,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 424. [2018-09-26 08:28:24,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-09-26 08:28:24,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 424 transitions. [2018-09-26 08:28:24,847 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 424 transitions. Word has length 421 [2018-09-26 08:28:24,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:24,847 INFO L480 AbstractCegarLoop]: Abstraction has 424 states and 424 transitions. [2018-09-26 08:28:24,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 212 states. [2018-09-26 08:28:24,848 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 424 transitions. [2018-09-26 08:28:24,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2018-09-26 08:28:24,849 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:24,849 INFO L375 BasicCegarLoop]: trace histogram [211, 210, 1, 1] [2018-09-26 08:28:24,849 INFO L423 AbstractCegarLoop]: === Iteration 211 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:24,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:24,849 INFO L82 PathProgramCache]: Analyzing trace with hash -340894076, now seen corresponding path program 210 times [2018-09-26 08:28:24,849 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:25,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:26,784 INFO L134 CoverageAnalysis]: Checked inductivity of 44310 backedges. 0 proven. 44310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:26,784 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:26,785 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [211] total 211 [2018-09-26 08:28:26,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 213 states [2018-09-26 08:28:26,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 213 interpolants. [2018-09-26 08:28:26,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22578, Invalid=22578, Unknown=0, NotChecked=0, Total=45156 [2018-09-26 08:28:26,790 INFO L87 Difference]: Start difference. First operand 424 states and 424 transitions. Second operand 213 states. [2018-09-26 08:28:28,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:28,260 INFO L93 Difference]: Finished difference Result 427 states and 427 transitions. [2018-09-26 08:28:28,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 213 states. [2018-09-26 08:28:28,261 INFO L78 Accepts]: Start accepts. Automaton has 213 states. Word has length 423 [2018-09-26 08:28:28,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:28,261 INFO L225 Difference]: With dead ends: 427 [2018-09-26 08:28:28,261 INFO L226 Difference]: Without dead ends: 426 [2018-09-26 08:28:28,264 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=22578, Invalid=22578, Unknown=0, NotChecked=0, Total=45156 [2018-09-26 08:28:28,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2018-09-26 08:28:28,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2018-09-26 08:28:28,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2018-09-26 08:28:28,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 426 transitions. [2018-09-26 08:28:28,270 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 426 transitions. Word has length 423 [2018-09-26 08:28:28,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:28,270 INFO L480 AbstractCegarLoop]: Abstraction has 426 states and 426 transitions. [2018-09-26 08:28:28,270 INFO L481 AbstractCegarLoop]: Interpolant automaton has 213 states. [2018-09-26 08:28:28,270 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 426 transitions. [2018-09-26 08:28:28,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2018-09-26 08:28:28,272 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:28,272 INFO L375 BasicCegarLoop]: trace histogram [212, 211, 1, 1] [2018-09-26 08:28:28,272 INFO L423 AbstractCegarLoop]: === Iteration 212 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:28,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:28,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1181691450, now seen corresponding path program 211 times [2018-09-26 08:28:28,272 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:28,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:30,361 INFO L134 CoverageAnalysis]: Checked inductivity of 44732 backedges. 0 proven. 44732 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:30,362 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:30,362 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [212] total 212 [2018-09-26 08:28:30,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 214 states [2018-09-26 08:28:30,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 214 interpolants. [2018-09-26 08:28:30,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2018-09-26 08:28:30,366 INFO L87 Difference]: Start difference. First operand 426 states and 426 transitions. Second operand 214 states. [2018-09-26 08:28:32,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:32,344 INFO L93 Difference]: Finished difference Result 429 states and 429 transitions. [2018-09-26 08:28:32,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 214 states. [2018-09-26 08:28:32,344 INFO L78 Accepts]: Start accepts. Automaton has 214 states. Word has length 425 [2018-09-26 08:28:32,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:32,345 INFO L225 Difference]: With dead ends: 429 [2018-09-26 08:28:32,345 INFO L226 Difference]: Without dead ends: 428 [2018-09-26 08:28:32,346 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2018-09-26 08:28:32,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2018-09-26 08:28:32,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 428. [2018-09-26 08:28:32,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-09-26 08:28:32,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 428 transitions. [2018-09-26 08:28:32,351 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 428 transitions. Word has length 425 [2018-09-26 08:28:32,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:32,351 INFO L480 AbstractCegarLoop]: Abstraction has 428 states and 428 transitions. [2018-09-26 08:28:32,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 214 states. [2018-09-26 08:28:32,351 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 428 transitions. [2018-09-26 08:28:32,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2018-09-26 08:28:32,352 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:32,353 INFO L375 BasicCegarLoop]: trace histogram [213, 212, 1, 1] [2018-09-26 08:28:32,353 INFO L423 AbstractCegarLoop]: === Iteration 213 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:32,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:32,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1734116216, now seen corresponding path program 212 times [2018-09-26 08:28:32,353 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:32,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:34,366 INFO L134 CoverageAnalysis]: Checked inductivity of 45156 backedges. 0 proven. 45156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:34,367 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:34,367 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [213] total 213 [2018-09-26 08:28:34,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 215 states [2018-09-26 08:28:34,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 215 interpolants. [2018-09-26 08:28:34,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23005, Invalid=23005, Unknown=0, NotChecked=0, Total=46010 [2018-09-26 08:28:34,369 INFO L87 Difference]: Start difference. First operand 428 states and 428 transitions. Second operand 215 states. [2018-09-26 08:28:36,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:36,216 INFO L93 Difference]: Finished difference Result 431 states and 431 transitions. [2018-09-26 08:28:36,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 215 states. [2018-09-26 08:28:36,216 INFO L78 Accepts]: Start accepts. Automaton has 215 states. Word has length 427 [2018-09-26 08:28:36,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:36,217 INFO L225 Difference]: With dead ends: 431 [2018-09-26 08:28:36,217 INFO L226 Difference]: Without dead ends: 430 [2018-09-26 08:28:36,218 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=23005, Invalid=23005, Unknown=0, NotChecked=0, Total=46010 [2018-09-26 08:28:36,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2018-09-26 08:28:36,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 430. [2018-09-26 08:28:36,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2018-09-26 08:28:36,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 430 transitions. [2018-09-26 08:28:36,223 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 430 transitions. Word has length 427 [2018-09-26 08:28:36,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:36,224 INFO L480 AbstractCegarLoop]: Abstraction has 430 states and 430 transitions. [2018-09-26 08:28:36,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 215 states. [2018-09-26 08:28:36,224 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 430 transitions. [2018-09-26 08:28:36,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2018-09-26 08:28:36,225 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:36,225 INFO L375 BasicCegarLoop]: trace histogram [214, 213, 1, 1] [2018-09-26 08:28:36,225 INFO L423 AbstractCegarLoop]: === Iteration 214 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:36,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:36,226 INFO L82 PathProgramCache]: Analyzing trace with hash -38371638, now seen corresponding path program 213 times [2018-09-26 08:28:36,226 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:36,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:38,365 INFO L134 CoverageAnalysis]: Checked inductivity of 45582 backedges. 0 proven. 45582 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:38,365 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:38,366 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [214] total 214 [2018-09-26 08:28:38,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 216 states [2018-09-26 08:28:38,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 216 interpolants. [2018-09-26 08:28:38,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2018-09-26 08:28:38,372 INFO L87 Difference]: Start difference. First operand 430 states and 430 transitions. Second operand 216 states. [2018-09-26 08:28:41,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:41,665 INFO L93 Difference]: Finished difference Result 433 states and 433 transitions. [2018-09-26 08:28:41,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 216 states. [2018-09-26 08:28:41,665 INFO L78 Accepts]: Start accepts. Automaton has 216 states. Word has length 429 [2018-09-26 08:28:41,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:41,666 INFO L225 Difference]: With dead ends: 433 [2018-09-26 08:28:41,666 INFO L226 Difference]: Without dead ends: 432 [2018-09-26 08:28:41,669 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2018-09-26 08:28:41,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2018-09-26 08:28:41,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 432. [2018-09-26 08:28:41,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2018-09-26 08:28:41,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 432 transitions. [2018-09-26 08:28:41,675 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 432 transitions. Word has length 429 [2018-09-26 08:28:41,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:41,675 INFO L480 AbstractCegarLoop]: Abstraction has 432 states and 432 transitions. [2018-09-26 08:28:41,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 216 states. [2018-09-26 08:28:41,675 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 432 transitions. [2018-09-26 08:28:41,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2018-09-26 08:28:41,676 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:41,676 INFO L375 BasicCegarLoop]: trace histogram [215, 214, 1, 1] [2018-09-26 08:28:41,677 INFO L423 AbstractCegarLoop]: === Iteration 215 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:41,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:41,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1779562636, now seen corresponding path program 214 times [2018-09-26 08:28:41,677 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:41,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:43,845 INFO L134 CoverageAnalysis]: Checked inductivity of 46010 backedges. 0 proven. 46010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:43,846 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:43,846 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [215] total 215 [2018-09-26 08:28:43,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 217 states [2018-09-26 08:28:43,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 217 interpolants. [2018-09-26 08:28:43,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23436, Invalid=23436, Unknown=0, NotChecked=0, Total=46872 [2018-09-26 08:28:43,851 INFO L87 Difference]: Start difference. First operand 432 states and 432 transitions. Second operand 217 states. [2018-09-26 08:28:44,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:44,602 INFO L93 Difference]: Finished difference Result 435 states and 435 transitions. [2018-09-26 08:28:44,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 217 states. [2018-09-26 08:28:44,602 INFO L78 Accepts]: Start accepts. Automaton has 217 states. Word has length 431 [2018-09-26 08:28:44,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:44,602 INFO L225 Difference]: With dead ends: 435 [2018-09-26 08:28:44,603 INFO L226 Difference]: Without dead ends: 434 [2018-09-26 08:28:44,605 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=23436, Invalid=23436, Unknown=0, NotChecked=0, Total=46872 [2018-09-26 08:28:44,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-09-26 08:28:44,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2018-09-26 08:28:44,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-09-26 08:28:44,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 434 transitions. [2018-09-26 08:28:44,610 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 434 transitions. Word has length 431 [2018-09-26 08:28:44,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:44,610 INFO L480 AbstractCegarLoop]: Abstraction has 434 states and 434 transitions. [2018-09-26 08:28:44,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 217 states. [2018-09-26 08:28:44,610 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 434 transitions. [2018-09-26 08:28:44,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2018-09-26 08:28:44,611 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:44,611 INFO L375 BasicCegarLoop]: trace histogram [216, 215, 1, 1] [2018-09-26 08:28:44,612 INFO L423 AbstractCegarLoop]: === Iteration 216 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:44,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:44,612 INFO L82 PathProgramCache]: Analyzing trace with hash 762710478, now seen corresponding path program 215 times [2018-09-26 08:28:44,612 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:44,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:46,577 INFO L134 CoverageAnalysis]: Checked inductivity of 46440 backedges. 0 proven. 46440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:46,577 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:46,577 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [216] total 216 [2018-09-26 08:28:46,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 218 states [2018-09-26 08:28:46,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 218 interpolants. [2018-09-26 08:28:46,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2018-09-26 08:28:46,581 INFO L87 Difference]: Start difference. First operand 434 states and 434 transitions. Second operand 218 states. [2018-09-26 08:28:49,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:49,427 INFO L93 Difference]: Finished difference Result 437 states and 437 transitions. [2018-09-26 08:28:49,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 218 states. [2018-09-26 08:28:49,427 INFO L78 Accepts]: Start accepts. Automaton has 218 states. Word has length 433 [2018-09-26 08:28:49,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:49,428 INFO L225 Difference]: With dead ends: 437 [2018-09-26 08:28:49,428 INFO L226 Difference]: Without dead ends: 436 [2018-09-26 08:28:49,430 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2018-09-26 08:28:49,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2018-09-26 08:28:49,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 436. [2018-09-26 08:28:49,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2018-09-26 08:28:49,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 436 transitions. [2018-09-26 08:28:49,435 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 436 transitions. Word has length 433 [2018-09-26 08:28:49,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:49,435 INFO L480 AbstractCegarLoop]: Abstraction has 436 states and 436 transitions. [2018-09-26 08:28:49,435 INFO L481 AbstractCegarLoop]: Interpolant automaton has 218 states. [2018-09-26 08:28:49,435 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 436 transitions. [2018-09-26 08:28:49,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 436 [2018-09-26 08:28:49,436 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:49,436 INFO L375 BasicCegarLoop]: trace histogram [217, 216, 1, 1] [2018-09-26 08:28:49,437 INFO L423 AbstractCegarLoop]: === Iteration 217 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:49,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:49,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1474637168, now seen corresponding path program 216 times [2018-09-26 08:28:49,437 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:49,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:51,539 INFO L134 CoverageAnalysis]: Checked inductivity of 46872 backedges. 0 proven. 46872 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:51,540 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:51,540 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [217] total 217 [2018-09-26 08:28:51,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 219 states [2018-09-26 08:28:51,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 219 interpolants. [2018-09-26 08:28:51,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23871, Invalid=23871, Unknown=0, NotChecked=0, Total=47742 [2018-09-26 08:28:51,544 INFO L87 Difference]: Start difference. First operand 436 states and 436 transitions. Second operand 219 states. [2018-09-26 08:28:53,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:53,832 INFO L93 Difference]: Finished difference Result 439 states and 439 transitions. [2018-09-26 08:28:53,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 219 states. [2018-09-26 08:28:53,832 INFO L78 Accepts]: Start accepts. Automaton has 219 states. Word has length 435 [2018-09-26 08:28:53,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:53,833 INFO L225 Difference]: With dead ends: 439 [2018-09-26 08:28:53,833 INFO L226 Difference]: Without dead ends: 438 [2018-09-26 08:28:53,834 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=23871, Invalid=23871, Unknown=0, NotChecked=0, Total=47742 [2018-09-26 08:28:53,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2018-09-26 08:28:53,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 438. [2018-09-26 08:28:53,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2018-09-26 08:28:53,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 438 transitions. [2018-09-26 08:28:53,839 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 438 transitions. Word has length 435 [2018-09-26 08:28:53,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:53,839 INFO L480 AbstractCegarLoop]: Abstraction has 438 states and 438 transitions. [2018-09-26 08:28:53,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has 219 states. [2018-09-26 08:28:53,839 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 438 transitions. [2018-09-26 08:28:53,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2018-09-26 08:28:53,841 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:53,841 INFO L375 BasicCegarLoop]: trace histogram [218, 217, 1, 1] [2018-09-26 08:28:53,841 INFO L423 AbstractCegarLoop]: === Iteration 218 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:53,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:53,841 INFO L82 PathProgramCache]: Analyzing trace with hash 212890322, now seen corresponding path program 217 times [2018-09-26 08:28:53,841 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:54,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:55,898 INFO L134 CoverageAnalysis]: Checked inductivity of 47306 backedges. 0 proven. 47306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:55,898 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:55,899 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [218] total 218 [2018-09-26 08:28:55,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 220 states [2018-09-26 08:28:55,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 220 interpolants. [2018-09-26 08:28:55,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2018-09-26 08:28:55,904 INFO L87 Difference]: Start difference. First operand 438 states and 438 transitions. Second operand 220 states. [2018-09-26 08:28:57,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:57,436 INFO L93 Difference]: Finished difference Result 441 states and 441 transitions. [2018-09-26 08:28:57,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 220 states. [2018-09-26 08:28:57,436 INFO L78 Accepts]: Start accepts. Automaton has 220 states. Word has length 437 [2018-09-26 08:28:57,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:57,437 INFO L225 Difference]: With dead ends: 441 [2018-09-26 08:28:57,437 INFO L226 Difference]: Without dead ends: 440 [2018-09-26 08:28:57,439 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2018-09-26 08:28:57,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2018-09-26 08:28:57,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2018-09-26 08:28:57,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2018-09-26 08:28:57,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 440 transitions. [2018-09-26 08:28:57,444 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 440 transitions. Word has length 437 [2018-09-26 08:28:57,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:57,444 INFO L480 AbstractCegarLoop]: Abstraction has 440 states and 440 transitions. [2018-09-26 08:28:57,444 INFO L481 AbstractCegarLoop]: Interpolant automaton has 220 states. [2018-09-26 08:28:57,444 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 440 transitions. [2018-09-26 08:28:57,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2018-09-26 08:28:57,445 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:57,445 INFO L375 BasicCegarLoop]: trace histogram [219, 218, 1, 1] [2018-09-26 08:28:57,446 INFO L423 AbstractCegarLoop]: === Iteration 219 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:57,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:57,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1570829676, now seen corresponding path program 218 times [2018-09-26 08:28:57,446 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:57,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2018-09-26 08:28:58,098 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-26 08:28:58,102 WARN L206 ceAbstractionStarter]: Timeout [2018-09-26 08:28:58,103 INFO L202 PluginConnector]: Adding new model MonadicInvariant01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 08:28:58 BoogieIcfgContainer [2018-09-26 08:28:58,103 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 08:28:58,105 INFO L168 Benchmark]: Toolchain (without parser) took 263208.42 ms. Allocated memory was 1.5 GB in the beginning and 3.4 GB in the end (delta: 1.9 GB). Free memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: -1.6 GB). Peak memory consumption was 320.1 MB. Max. memory is 7.1 GB. [2018-09-26 08:28:58,106 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 08:28:58,106 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.30 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 08:28:58,107 INFO L168 Benchmark]: Boogie Preprocessor took 25.67 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-26 08:28:58,107 INFO L168 Benchmark]: RCFGBuilder took 235.77 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-09-26 08:28:58,107 INFO L168 Benchmark]: TraceAbstraction took 262892.96 ms. Allocated memory was 1.5 GB in the beginning and 3.4 GB in the end (delta: 1.9 GB). Free memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: -1.6 GB). Peak memory consumption was 309.6 MB. Max. memory is 7.1 GB. [2018-09-26 08:28:58,109 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 47.30 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.67 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 235.77 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 262892.96 ms. Allocated memory was 1.5 GB in the beginning and 3.4 GB in the end (delta: 1.9 GB). Free memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: -1.6 GB). Peak memory consumption was 309.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 25]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 25). Cancelled while BasicCegarLoop was analyzing trace of length 440 with TraceHistMax 219, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 70 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. TIMEOUT Result, 262.8s OverallTime, 219 OverallIterations, 219 TraceHistogramMax, 103.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 437 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 59407 SolverSat, 443 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 23871 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23871 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 113.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=440occurred in iteration=218, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 218 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 17.2s SatisfiabilityAnalysisTime, 124.4s InterpolantComputationTime, 47960 NumberOfCodeBlocks, 47960 NumberOfCodeBlocksAsserted, 218 NumberOfCheckSat, 47742 ConstructedInterpolants, 0 QuantifiedInterpolants, 69544180 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 218 InterpolantComputations, 1 PerfectInterpolantSequences, 0/3453338 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/MonadicInvariant01.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_08-28-58-118.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/MonadicInvariant01.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_08-28-58-118.csv Completed graceful shutdown