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/Octopussy.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ff8eab6 [2018-09-26 08:24:40,725 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 08:24:40,727 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 08:24:40,739 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 08:24:40,740 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 08:24:40,741 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 08:24:40,742 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 08:24:40,744 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 08:24:40,746 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 08:24:40,747 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 08:24:40,748 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 08:24:40,748 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 08:24:40,749 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 08:24:40,750 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 08:24:40,751 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 08:24:40,752 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 08:24:40,755 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 08:24:40,758 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 08:24:40,763 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 08:24:40,765 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 08:24:40,766 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 08:24:40,767 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 08:24:40,769 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 08:24:40,769 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 08:24:40,770 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 08:24:40,770 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 08:24:40,771 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 08:24:40,772 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 08:24:40,773 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 08:24:40,774 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 08:24:40,774 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 08:24:40,775 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 08:24:40,775 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 08:24:40,775 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 08:24:40,776 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 08:24:40,777 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 08:24:40,777 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:40,785 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 08:24:40,786 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 08:24:40,787 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 08:24:40,787 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-09-26 08:24:40,788 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 08:24:40,788 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-09-26 08:24:40,788 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-09-26 08:24:40,788 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 08:24:40,835 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 08:24:40,850 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 08:24:40,860 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 08:24:40,861 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 08:24:40,862 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 08:24:40,863 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Octopussy.bpl [2018-09-26 08:24:40,863 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Octopussy.bpl' [2018-09-26 08:24:40,920 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 08:24:40,924 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 08:24:40,926 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 08:24:40,927 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 08:24:40,927 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 08:24:40,948 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "Octopussy.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:24:40" (1/1) ... [2018-09-26 08:24:40,963 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "Octopussy.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:24:40" (1/1) ... [2018-09-26 08:24:40,968 WARN L165 Inliner]: Program contained no entry procedure! [2018-09-26 08:24:40,969 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-09-26 08:24:40,969 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-09-26 08:24:40,971 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 08:24:40,972 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 08:24:40,972 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 08:24:40,973 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 08:24:40,986 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "Octopussy.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:24:40" (1/1) ... [2018-09-26 08:24:40,986 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "Octopussy.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:24:40" (1/1) ... [2018-09-26 08:24:40,987 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "Octopussy.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:24:40" (1/1) ... [2018-09-26 08:24:40,987 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "Octopussy.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:24:40" (1/1) ... [2018-09-26 08:24:40,989 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "Octopussy.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:24:40" (1/1) ... [2018-09-26 08:24:40,996 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "Octopussy.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:24:40" (1/1) ... [2018-09-26 08:24:40,996 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "Octopussy.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:24:40" (1/1) ... [2018-09-26 08:24:40,998 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 08:24:40,998 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 08:24:40,998 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 08:24:40,999 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 08:24:41,001 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Octopussy.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:24:40" (1/1) ... [2018-09-26 08:24:41,092 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-09-26 08:24:41,092 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-26 08:24:41,093 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-26 08:24:41,227 INFO L343 CfgBuilder]: Using library mode [2018-09-26 08:24:41,228 INFO L202 PluginConnector]: Adding new model Octopussy.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:24:41 BoogieIcfgContainer [2018-09-26 08:24:41,228 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 08:24:41,231 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 08:24:41,231 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 08:24:41,236 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 08:24:41,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Octopussy.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:24:40" (1/2) ... [2018-09-26 08:24:41,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a2ae447 and model type Octopussy.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 08:24:41, skipping insertion in model container [2018-09-26 08:24:41,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Octopussy.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:24:41" (2/2) ... [2018-09-26 08:24:41,241 INFO L112 eAbstractionObserver]: Analyzing ICFG Octopussy.bpl [2018-09-26 08:24:41,251 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-09-26 08:24:41,264 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 08:24:41,320 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 08:24:41,321 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 08:24:41,321 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 08:24:41,321 INFO L383 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-09-26 08:24:41,322 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 08:24:41,322 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 08:24:41,322 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 08:24:41,322 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 08:24:41,323 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 08:24:41,342 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-09-26 08:24:41,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-09-26 08:24:41,354 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:41,355 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-09-26 08:24:41,356 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:41,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:41,366 INFO L82 PathProgramCache]: Analyzing trace with hash 30048, now seen corresponding path program 1 times [2018-09-26 08:24:41,376 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:41,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:41,458 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:41,462 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:24:41,463 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 08:24:41,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:24:41,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:24:41,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:24:41,486 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-09-26 08:24:41,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:41,512 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-09-26 08:24:41,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:24:41,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-09-26 08:24:41,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:41,525 INFO L225 Difference]: With dead ends: 13 [2018-09-26 08:24:41,526 INFO L226 Difference]: Without dead ends: 5 [2018-09-26 08:24:41,529 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:41,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-09-26 08:24:41,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-09-26 08:24:41,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-09-26 08:24:41,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-09-26 08:24:41,588 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-09-26 08:24:41,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:41,589 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-09-26 08:24:41,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:24:41,589 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-09-26 08:24:41,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-26 08:24:41,590 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:41,590 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-09-26 08:24:41,590 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:41,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:41,591 INFO L82 PathProgramCache]: Analyzing trace with hash 927622, now seen corresponding path program 1 times [2018-09-26 08:24:41,592 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:41,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:41,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:41,616 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:41,617 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-09-26 08:24:41,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 08:24:41,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 08:24:41,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:24:41,621 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2018-09-26 08:24:41,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:41,635 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-09-26 08:24:41,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 08:24:41,636 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-09-26 08:24:41,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:41,637 INFO L225 Difference]: With dead ends: 8 [2018-09-26 08:24:41,637 INFO L226 Difference]: Without dead ends: 6 [2018-09-26 08:24:41,638 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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:41,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-09-26 08:24:41,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-09-26 08:24:41,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-09-26 08:24:41,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-09-26 08:24:41,641 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-09-26 08:24:41,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:41,641 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-09-26 08:24:41,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 08:24:41,642 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-09-26 08:24:41,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-09-26 08:24:41,642 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:41,643 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-09-26 08:24:41,643 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:41,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:41,643 INFO L82 PathProgramCache]: Analyzing trace with hash 28752416, now seen corresponding path program 2 times [2018-09-26 08:24:41,644 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:41,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:41,672 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:41,673 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:41,673 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-09-26 08:24:41,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 08:24:41,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 08:24:41,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:24:41,674 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2018-09-26 08:24:41,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:41,687 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-09-26 08:24:41,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 08:24:41,688 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-09-26 08:24:41,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:41,688 INFO L225 Difference]: With dead ends: 9 [2018-09-26 08:24:41,688 INFO L226 Difference]: Without dead ends: 7 [2018-09-26 08:24:41,690 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:41,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-09-26 08:24:41,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-09-26 08:24:41,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-09-26 08:24:41,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-09-26 08:24:41,694 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-09-26 08:24:41,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:41,695 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-09-26 08:24:41,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 08:24:41,695 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-09-26 08:24:41,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:24:41,696 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:41,697 INFO L375 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-09-26 08:24:41,697 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:41,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:41,697 INFO L82 PathProgramCache]: Analyzing trace with hash 891321030, now seen corresponding path program 3 times [2018-09-26 08:24:41,698 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:41,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:41,754 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:41,754 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:41,755 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-09-26 08:24:41,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:24:41,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:24:41,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:24:41,756 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-09-26 08:24:41,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:41,772 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-09-26 08:24:41,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 08:24:41,773 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-09-26 08:24:41,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:41,774 INFO L225 Difference]: With dead ends: 10 [2018-09-26 08:24:41,774 INFO L226 Difference]: Without dead ends: 8 [2018-09-26 08:24:41,777 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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:41,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-09-26 08:24:41,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-09-26 08:24:41,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-09-26 08:24:41,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-09-26 08:24:41,782 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-09-26 08:24:41,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:41,785 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-09-26 08:24:41,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:24:41,785 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-09-26 08:24:41,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-09-26 08:24:41,786 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:41,786 INFO L375 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-09-26 08:24:41,786 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:41,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:41,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144288, now seen corresponding path program 4 times [2018-09-26 08:24:41,787 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:41,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:41,850 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:41,850 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:41,850 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:24:41,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:24:41,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:24:41,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:24:41,852 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2018-09-26 08:24:41,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:41,865 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-09-26 08:24:41,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-26 08:24:41,866 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-09-26 08:24:41,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:41,868 INFO L225 Difference]: With dead ends: 11 [2018-09-26 08:24:41,868 INFO L226 Difference]: Without dead ends: 9 [2018-09-26 08:24:41,869 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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:41,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-09-26 08:24:41,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-09-26 08:24:41,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-09-26 08:24:41,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-09-26 08:24:41,873 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-09-26 08:24:41,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:41,873 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-09-26 08:24:41,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:24:41,874 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-09-26 08:24:41,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 08:24:41,874 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:41,875 INFO L375 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-09-26 08:24:41,875 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:41,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:41,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894214, now seen corresponding path program 5 times [2018-09-26 08:24:41,878 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:41,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:41,965 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:41,966 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:41,966 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:24:41,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:24:41,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:24:41,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:24:41,967 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2018-09-26 08:24:41,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:41,988 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-09-26 08:24:41,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-26 08:24:41,989 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-09-26 08:24:41,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:41,989 INFO L225 Difference]: With dead ends: 12 [2018-09-26 08:24:41,990 INFO L226 Difference]: Without dead ends: 10 [2018-09-26 08:24:41,990 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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:41,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-09-26 08:24:41,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-09-26 08:24:41,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-09-26 08:24:41,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-09-26 08:24:41,996 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-09-26 08:24:41,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:41,996 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-09-26 08:24:41,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:24:41,996 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-09-26 08:24:41,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-09-26 08:24:41,997 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:41,997 INFO L375 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-09-26 08:24:41,997 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:41,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:41,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141920, now seen corresponding path program 6 times [2018-09-26 08:24:41,998 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:42,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:42,065 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:42,065 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:42,065 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:24:42,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:24:42,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:24:42,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:24:42,067 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2018-09-26 08:24:42,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:42,081 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-09-26 08:24:42,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 08:24:42,081 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-09-26 08:24:42,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:42,082 INFO L225 Difference]: With dead ends: 13 [2018-09-26 08:24:42,082 INFO L226 Difference]: Without dead ends: 11 [2018-09-26 08:24:42,083 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 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:42,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-09-26 08:24:42,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-09-26 08:24:42,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-09-26 08:24:42,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-09-26 08:24:42,086 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-09-26 08:24:42,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:42,086 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-09-26 08:24:42,086 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:24:42,087 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-09-26 08:24:42,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 08:24:42,087 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:42,087 INFO L375 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-09-26 08:24:42,088 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:42,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:42,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820806, now seen corresponding path program 7 times [2018-09-26 08:24:42,088 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:42,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:42,130 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:42,130 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:42,130 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:24:42,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:24:42,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:24:42,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:24:42,132 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2018-09-26 08:24:42,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:42,144 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-09-26 08:24:42,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:24:42,145 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-09-26 08:24:42,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:42,145 INFO L225 Difference]: With dead ends: 14 [2018-09-26 08:24:42,146 INFO L226 Difference]: Without dead ends: 12 [2018-09-26 08:24:42,146 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 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:42,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-09-26 08:24:42,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-09-26 08:24:42,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-09-26 08:24:42,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-09-26 08:24:42,150 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-09-26 08:24:42,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:42,150 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-09-26 08:24:42,150 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:24:42,151 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-09-26 08:24:42,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-09-26 08:24:42,151 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:42,151 INFO L375 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-09-26 08:24:42,151 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:42,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:42,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166432, now seen corresponding path program 8 times [2018-09-26 08:24:42,152 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:42,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:42,196 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:42,197 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:42,197 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:24:42,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:24:42,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:24:42,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:24:42,198 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2018-09-26 08:24:42,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:42,211 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-09-26 08:24:42,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:24:42,212 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-09-26 08:24:42,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:42,212 INFO L225 Difference]: With dead ends: 15 [2018-09-26 08:24:42,212 INFO L226 Difference]: Without dead ends: 13 [2018-09-26 08:24:42,213 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 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:42,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-09-26 08:24:42,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-09-26 08:24:42,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-09-26 08:24:42,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-09-26 08:24:42,217 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-09-26 08:24:42,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:42,217 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-09-26 08:24:42,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:24:42,218 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-09-26 08:24:42,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:24:42,218 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:42,218 INFO L375 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-09-26 08:24:42,219 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:42,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:42,219 INFO L82 PathProgramCache]: Analyzing trace with hash -562523002, now seen corresponding path program 9 times [2018-09-26 08:24:42,219 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:42,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:42,265 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:42,266 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:42,266 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:24:42,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:24:42,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:24:42,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:24:42,267 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2018-09-26 08:24:42,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:42,281 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-09-26 08:24:42,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 08:24:42,282 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-09-26 08:24:42,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:42,282 INFO L225 Difference]: With dead ends: 16 [2018-09-26 08:24:42,283 INFO L226 Difference]: Without dead ends: 14 [2018-09-26 08:24:42,283 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 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:42,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-09-26 08:24:42,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-09-26 08:24:42,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-09-26 08:24:42,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-09-26 08:24:42,287 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-09-26 08:24:42,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:42,288 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-09-26 08:24:42,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:24:42,288 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-09-26 08:24:42,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-09-26 08:24:42,289 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:42,289 INFO L375 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2018-09-26 08:24:42,289 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:42,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:42,290 INFO L82 PathProgramCache]: Analyzing trace with hash -258347744, now seen corresponding path program 10 times [2018-09-26 08:24:42,290 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:42,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:42,337 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:42,338 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:42,338 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-09-26 08:24:42,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 08:24:42,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 08:24:42,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:24:42,340 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2018-09-26 08:24:42,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:42,352 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-09-26 08:24:42,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:24:42,352 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-09-26 08:24:42,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:42,353 INFO L225 Difference]: With dead ends: 17 [2018-09-26 08:24:42,353 INFO L226 Difference]: Without dead ends: 15 [2018-09-26 08:24:42,354 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 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:42,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-09-26 08:24:42,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-09-26 08:24:42,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-09-26 08:24:42,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-09-26 08:24:42,358 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-09-26 08:24:42,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:42,359 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-09-26 08:24:42,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 08:24:42,359 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-09-26 08:24:42,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-26 08:24:42,360 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:42,360 INFO L375 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-09-26 08:24:42,360 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:42,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:42,361 INFO L82 PathProgramCache]: Analyzing trace with hash 581150662, now seen corresponding path program 11 times [2018-09-26 08:24:42,361 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:42,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:42,411 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:42,412 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:42,412 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-09-26 08:24:42,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 08:24:42,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 08:24:42,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:24:42,413 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2018-09-26 08:24:42,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:42,428 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-09-26 08:24:42,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 08:24:42,428 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-09-26 08:24:42,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:42,429 INFO L225 Difference]: With dead ends: 18 [2018-09-26 08:24:42,429 INFO L226 Difference]: Without dead ends: 16 [2018-09-26 08:24:42,430 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 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:42,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-09-26 08:24:42,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-09-26 08:24:42,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-09-26 08:24:42,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-09-26 08:24:42,434 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-09-26 08:24:42,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:42,434 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-09-26 08:24:42,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 08:24:42,435 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-09-26 08:24:42,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-09-26 08:24:42,435 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:42,435 INFO L375 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2018-09-26 08:24:42,436 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:42,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:42,436 INFO L82 PathProgramCache]: Analyzing trace with hash 835797472, now seen corresponding path program 12 times [2018-09-26 08:24:42,436 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:42,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:42,489 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:42,489 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:42,489 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-09-26 08:24:42,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-26 08:24:42,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-26 08:24:42,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:24:42,491 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2018-09-26 08:24:42,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:42,506 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-09-26 08:24:42,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:24:42,506 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-09-26 08:24:42,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:42,513 INFO L225 Difference]: With dead ends: 19 [2018-09-26 08:24:42,513 INFO L226 Difference]: Without dead ends: 17 [2018-09-26 08:24:42,514 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 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:42,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-09-26 08:24:42,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-09-26 08:24:42,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-09-26 08:24:42,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-09-26 08:24:42,518 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-09-26 08:24:42,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:42,518 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-09-26 08:24:42,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-26 08:24:42,519 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-09-26 08:24:42,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:24:42,519 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:42,519 INFO L375 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2018-09-26 08:24:42,520 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:42,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:42,520 INFO L82 PathProgramCache]: Analyzing trace with hash 139913990, now seen corresponding path program 13 times [2018-09-26 08:24:42,522 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:42,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:42,618 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:42,618 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:42,619 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-09-26 08:24:42,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 08:24:42,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 08:24:42,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:24:42,620 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2018-09-26 08:24:42,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:42,641 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-09-26 08:24:42,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-26 08:24:42,642 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2018-09-26 08:24:42,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:42,643 INFO L225 Difference]: With dead ends: 20 [2018-09-26 08:24:42,643 INFO L226 Difference]: Without dead ends: 18 [2018-09-26 08:24:42,644 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 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:42,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-09-26 08:24:42,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-09-26 08:24:42,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-09-26 08:24:42,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-09-26 08:24:42,651 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-09-26 08:24:42,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:42,652 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-09-26 08:24:42,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 08:24:42,652 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-09-26 08:24:42,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-09-26 08:24:42,653 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:42,653 INFO L375 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2018-09-26 08:24:42,653 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:42,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:42,654 INFO L82 PathProgramCache]: Analyzing trace with hash 42362528, now seen corresponding path program 14 times [2018-09-26 08:24:42,654 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:42,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:42,740 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:42,740 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:42,740 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-09-26 08:24:42,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-26 08:24:42,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-26 08:24:42,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:24:42,742 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2018-09-26 08:24:42,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:42,762 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-09-26 08:24:42,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 08:24:42,763 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2018-09-26 08:24:42,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:42,764 INFO L225 Difference]: With dead ends: 21 [2018-09-26 08:24:42,764 INFO L226 Difference]: Without dead ends: 19 [2018-09-26 08:24:42,765 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 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:42,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-09-26 08:24:42,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-09-26 08:24:42,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-09-26 08:24:42,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-09-26 08:24:42,769 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-09-26 08:24:42,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:42,770 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-09-26 08:24:42,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-26 08:24:42,770 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-09-26 08:24:42,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:24:42,771 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:42,771 INFO L375 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2018-09-26 08:24:42,772 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:42,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:42,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234502, now seen corresponding path program 15 times [2018-09-26 08:24:42,772 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:42,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:42,840 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:42,841 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:42,841 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-09-26 08:24:42,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-26 08:24:42,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-26 08:24:42,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:24:42,843 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2018-09-26 08:24:42,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:42,860 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-09-26 08:24:42,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 08:24:42,861 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-09-26 08:24:42,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:42,862 INFO L225 Difference]: With dead ends: 22 [2018-09-26 08:24:42,862 INFO L226 Difference]: Without dead ends: 20 [2018-09-26 08:24:42,863 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 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:42,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-09-26 08:24:42,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-09-26 08:24:42,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-09-26 08:24:42,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-09-26 08:24:42,871 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-09-26 08:24:42,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:42,872 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-09-26 08:24:42,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-26 08:24:42,872 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-09-26 08:24:42,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-26 08:24:42,875 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:42,875 INFO L375 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2018-09-26 08:24:42,875 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:42,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:42,877 INFO L82 PathProgramCache]: Analyzing trace with hash 2055560032, now seen corresponding path program 16 times [2018-09-26 08:24:42,877 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:42,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:42,935 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:42,935 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:42,936 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-09-26 08:24:42,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-26 08:24:42,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-26 08:24:42,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:24:42,939 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2018-09-26 08:24:42,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:42,960 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-09-26 08:24:42,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-26 08:24:42,960 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2018-09-26 08:24:42,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:42,961 INFO L225 Difference]: With dead ends: 23 [2018-09-26 08:24:42,961 INFO L226 Difference]: Without dead ends: 21 [2018-09-26 08:24:42,962 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 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:42,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-09-26 08:24:42,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-09-26 08:24:42,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-09-26 08:24:42,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-09-26 08:24:42,972 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-09-26 08:24:42,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:42,976 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-09-26 08:24:42,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-26 08:24:42,976 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-09-26 08:24:42,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:24:42,977 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:42,977 INFO L375 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2018-09-26 08:24:42,977 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:42,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:42,978 INFO L82 PathProgramCache]: Analyzing trace with hash -702152314, now seen corresponding path program 17 times [2018-09-26 08:24:42,978 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:42,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:43,036 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:43,037 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:43,039 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-09-26 08:24:43,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-26 08:24:43,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-26 08:24:43,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:24:43,041 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2018-09-26 08:24:43,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:43,055 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-09-26 08:24:43,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-26 08:24:43,055 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2018-09-26 08:24:43,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:43,056 INFO L225 Difference]: With dead ends: 24 [2018-09-26 08:24:43,056 INFO L226 Difference]: Without dead ends: 22 [2018-09-26 08:24:43,057 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 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:43,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-09-26 08:24:43,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-09-26 08:24:43,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-09-26 08:24:43,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-09-26 08:24:43,063 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-09-26 08:24:43,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:43,064 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-09-26 08:24:43,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-26 08:24:43,064 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-09-26 08:24:43,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-26 08:24:43,067 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:43,067 INFO L375 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2018-09-26 08:24:43,067 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:43,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:43,068 INFO L82 PathProgramCache]: Analyzing trace with hash -291889120, now seen corresponding path program 18 times [2018-09-26 08:24:43,068 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:43,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:43,157 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:43,157 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:43,157 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-09-26 08:24:43,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-26 08:24:43,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-26 08:24:43,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:24:43,159 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2018-09-26 08:24:43,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:43,174 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-09-26 08:24:43,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 08:24:43,175 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2018-09-26 08:24:43,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:43,176 INFO L225 Difference]: With dead ends: 25 [2018-09-26 08:24:43,176 INFO L226 Difference]: Without dead ends: 23 [2018-09-26 08:24:43,180 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 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:43,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-09-26 08:24:43,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-09-26 08:24:43,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-09-26 08:24:43,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-09-26 08:24:43,189 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-09-26 08:24:43,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:43,189 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-09-26 08:24:43,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-26 08:24:43,190 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-09-26 08:24:43,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-26 08:24:43,190 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:43,191 INFO L375 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2018-09-26 08:24:43,191 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:43,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:43,193 INFO L82 PathProgramCache]: Analyzing trace with hash -458631994, now seen corresponding path program 19 times [2018-09-26 08:24:43,193 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:43,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:43,271 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:43,272 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:43,272 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-09-26 08:24:43,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-26 08:24:43,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-26 08:24:43,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:24:43,273 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2018-09-26 08:24:43,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:43,287 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-09-26 08:24:43,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-26 08:24:43,288 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2018-09-26 08:24:43,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:43,288 INFO L225 Difference]: With dead ends: 26 [2018-09-26 08:24:43,288 INFO L226 Difference]: Without dead ends: 24 [2018-09-26 08:24:43,289 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 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:43,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-09-26 08:24:43,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-09-26 08:24:43,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-09-26 08:24:43,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-09-26 08:24:43,296 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-09-26 08:24:43,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:43,296 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-09-26 08:24:43,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-26 08:24:43,297 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-09-26 08:24:43,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-09-26 08:24:43,297 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:43,297 INFO L375 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2018-09-26 08:24:43,298 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:43,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:43,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1332693792, now seen corresponding path program 20 times [2018-09-26 08:24:43,300 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:43,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:43,379 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:43,380 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:43,380 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-09-26 08:24:43,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-09-26 08:24:43,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-09-26 08:24:43,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:24:43,383 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2018-09-26 08:24:43,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:43,406 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-09-26 08:24:43,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 08:24:43,406 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2018-09-26 08:24:43,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:43,408 INFO L225 Difference]: With dead ends: 27 [2018-09-26 08:24:43,408 INFO L226 Difference]: Without dead ends: 25 [2018-09-26 08:24:43,408 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 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:43,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-09-26 08:24:43,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-09-26 08:24:43,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-09-26 08:24:43,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-09-26 08:24:43,414 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-09-26 08:24:43,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:43,421 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-09-26 08:24:43,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-09-26 08:24:43,421 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-09-26 08:24:43,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-26 08:24:43,422 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:43,422 INFO L375 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2018-09-26 08:24:43,422 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:43,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:43,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1636161542, now seen corresponding path program 21 times [2018-09-26 08:24:43,423 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:43,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:43,508 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:43,509 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:43,509 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-09-26 08:24:43,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-26 08:24:43,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-26 08:24:43,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:24:43,511 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2018-09-26 08:24:43,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:43,532 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-09-26 08:24:43,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 08:24:43,533 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2018-09-26 08:24:43,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:43,534 INFO L225 Difference]: With dead ends: 28 [2018-09-26 08:24:43,534 INFO L226 Difference]: Without dead ends: 26 [2018-09-26 08:24:43,534 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 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:43,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-09-26 08:24:43,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-09-26 08:24:43,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-09-26 08:24:43,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-09-26 08:24:43,542 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-09-26 08:24:43,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:43,542 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-09-26 08:24:43,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-26 08:24:43,543 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-09-26 08:24:43,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-09-26 08:24:43,544 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:43,545 INFO L375 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2018-09-26 08:24:43,545 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:43,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:43,545 INFO L82 PathProgramCache]: Analyzing trace with hash -818603616, now seen corresponding path program 22 times [2018-09-26 08:24:43,545 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:43,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:43,656 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:43,656 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:43,657 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-09-26 08:24:43,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-09-26 08:24:43,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-09-26 08:24:43,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:24:43,658 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2018-09-26 08:24:43,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:43,680 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-09-26 08:24:43,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-26 08:24:43,681 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2018-09-26 08:24:43,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:43,681 INFO L225 Difference]: With dead ends: 29 [2018-09-26 08:24:43,681 INFO L226 Difference]: Without dead ends: 27 [2018-09-26 08:24:43,682 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 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:43,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-09-26 08:24:43,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-09-26 08:24:43,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-09-26 08:24:43,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-09-26 08:24:43,687 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-09-26 08:24:43,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:43,688 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-09-26 08:24:43,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-09-26 08:24:43,688 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-09-26 08:24:43,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-09-26 08:24:43,691 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:43,692 INFO L375 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2018-09-26 08:24:43,692 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:43,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:43,692 INFO L82 PathProgramCache]: Analyzing trace with hash 393087814, now seen corresponding path program 23 times [2018-09-26 08:24:43,693 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:43,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:43,796 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:43,797 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:43,797 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-09-26 08:24:43,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-09-26 08:24:43,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-09-26 08:24:43,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:24:43,802 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2018-09-26 08:24:43,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:43,821 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-09-26 08:24:43,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-26 08:24:43,821 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2018-09-26 08:24:43,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:43,822 INFO L225 Difference]: With dead ends: 30 [2018-09-26 08:24:43,822 INFO L226 Difference]: Without dead ends: 28 [2018-09-26 08:24:43,826 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:24:43,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-09-26 08:24:43,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-09-26 08:24:43,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-09-26 08:24:43,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-09-26 08:24:43,832 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-09-26 08:24:43,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:43,833 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-09-26 08:24:43,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-09-26 08:24:43,833 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-09-26 08:24:43,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-09-26 08:24:43,835 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:43,835 INFO L375 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2018-09-26 08:24:43,835 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:43,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:43,837 INFO L82 PathProgramCache]: Analyzing trace with hash -699183520, now seen corresponding path program 24 times [2018-09-26 08:24:43,837 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:43,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:43,944 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:43,946 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:43,946 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-09-26 08:24:43,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-09-26 08:24:43,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-09-26 08:24:43,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:24:43,948 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2018-09-26 08:24:43,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:43,963 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-09-26 08:24:43,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-26 08:24:43,964 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2018-09-26 08:24:43,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:43,965 INFO L225 Difference]: With dead ends: 31 [2018-09-26 08:24:43,965 INFO L226 Difference]: Without dead ends: 29 [2018-09-26 08:24:43,966 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 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:43,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-09-26 08:24:43,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-09-26 08:24:43,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-09-26 08:24:43,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-09-26 08:24:43,971 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-09-26 08:24:43,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:43,972 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-09-26 08:24:43,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-09-26 08:24:43,972 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-09-26 08:24:43,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-26 08:24:43,973 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:43,973 INFO L375 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2018-09-26 08:24:43,973 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:43,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:43,973 INFO L82 PathProgramCache]: Analyzing trace with hash -199856506, now seen corresponding path program 25 times [2018-09-26 08:24:43,974 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:43,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:44,076 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:44,077 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:44,077 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-09-26 08:24:44,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-09-26 08:24:44,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-09-26 08:24:44,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:24:44,081 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2018-09-26 08:24:44,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:44,100 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-09-26 08:24:44,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-26 08:24:44,100 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2018-09-26 08:24:44,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:44,101 INFO L225 Difference]: With dead ends: 32 [2018-09-26 08:24:44,101 INFO L226 Difference]: Without dead ends: 30 [2018-09-26 08:24:44,106 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:24:44,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-09-26 08:24:44,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-09-26 08:24:44,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-09-26 08:24:44,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-09-26 08:24:44,111 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-09-26 08:24:44,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:44,112 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-09-26 08:24:44,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-09-26 08:24:44,112 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-09-26 08:24:44,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-09-26 08:24:44,113 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:44,113 INFO L375 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2018-09-26 08:24:44,113 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:44,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:44,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1900588256, now seen corresponding path program 26 times [2018-09-26 08:24:44,114 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:44,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:44,239 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:44,240 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:44,240 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-09-26 08:24:44,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-09-26 08:24:44,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-09-26 08:24:44,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:24:44,242 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2018-09-26 08:24:44,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:44,265 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-09-26 08:24:44,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-26 08:24:44,265 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2018-09-26 08:24:44,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:44,266 INFO L225 Difference]: With dead ends: 33 [2018-09-26 08:24:44,267 INFO L226 Difference]: Without dead ends: 31 [2018-09-26 08:24:44,269 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:24:44,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-09-26 08:24:44,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-09-26 08:24:44,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-09-26 08:24:44,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-09-26 08:24:44,274 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-09-26 08:24:44,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:44,274 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-09-26 08:24:44,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-09-26 08:24:44,275 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-09-26 08:24:44,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-26 08:24:44,276 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:44,276 INFO L375 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2018-09-26 08:24:44,276 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:44,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:44,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1211302342, now seen corresponding path program 27 times [2018-09-26 08:24:44,278 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:44,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:44,410 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:44,410 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:44,411 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-09-26 08:24:44,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-09-26 08:24:44,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-09-26 08:24:44,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:24:44,413 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2018-09-26 08:24:44,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:44,433 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-09-26 08:24:44,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-26 08:24:44,433 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2018-09-26 08:24:44,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:44,434 INFO L225 Difference]: With dead ends: 34 [2018-09-26 08:24:44,434 INFO L226 Difference]: Without dead ends: 32 [2018-09-26 08:24:44,435 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:24:44,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-09-26 08:24:44,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-09-26 08:24:44,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-09-26 08:24:44,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-09-26 08:24:44,448 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-09-26 08:24:44,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:44,448 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-09-26 08:24:44,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-09-26 08:24:44,449 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-09-26 08:24:44,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-09-26 08:24:44,449 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:44,449 INFO L375 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2018-09-26 08:24:44,450 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:44,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:44,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1104336928, now seen corresponding path program 28 times [2018-09-26 08:24:44,450 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:44,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:44,596 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:44,597 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:44,597 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-09-26 08:24:44,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-09-26 08:24:44,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-09-26 08:24:44,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:24:44,599 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2018-09-26 08:24:44,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:44,616 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-09-26 08:24:44,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-26 08:24:44,617 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2018-09-26 08:24:44,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:44,617 INFO L225 Difference]: With dead ends: 35 [2018-09-26 08:24:44,618 INFO L226 Difference]: Without dead ends: 33 [2018-09-26 08:24:44,619 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 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:44,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-09-26 08:24:44,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-09-26 08:24:44,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-09-26 08:24:44,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-09-26 08:24:44,627 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-09-26 08:24:44,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:44,628 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-09-26 08:24:44,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-09-26 08:24:44,628 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-09-26 08:24:44,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-09-26 08:24:44,628 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:44,628 INFO L375 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2018-09-26 08:24:44,629 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:44,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:44,629 INFO L82 PathProgramCache]: Analyzing trace with hash 125289734, now seen corresponding path program 29 times [2018-09-26 08:24:44,630 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:44,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:44,759 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:44,759 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:44,760 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-09-26 08:24:44,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-09-26 08:24:44,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-09-26 08:24:44,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:24:44,761 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2018-09-26 08:24:44,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:44,778 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-09-26 08:24:44,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-26 08:24:44,778 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2018-09-26 08:24:44,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:44,779 INFO L225 Difference]: With dead ends: 36 [2018-09-26 08:24:44,779 INFO L226 Difference]: Without dead ends: 34 [2018-09-26 08:24:44,780 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:24:44,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-09-26 08:24:44,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-09-26 08:24:44,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-09-26 08:24:44,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-09-26 08:24:44,784 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-09-26 08:24:44,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:44,785 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-09-26 08:24:44,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-09-26 08:24:44,785 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-09-26 08:24:44,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-09-26 08:24:44,785 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:44,785 INFO L375 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2018-09-26 08:24:44,786 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:44,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:44,786 INFO L82 PathProgramCache]: Analyzing trace with hash -410989408, now seen corresponding path program 30 times [2018-09-26 08:24:44,786 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:44,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:44,914 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:44,914 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:44,914 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-09-26 08:24:44,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-09-26 08:24:44,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-09-26 08:24:44,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:24:44,916 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2018-09-26 08:24:44,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:44,933 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-09-26 08:24:44,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-26 08:24:44,933 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2018-09-26 08:24:44,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:44,934 INFO L225 Difference]: With dead ends: 37 [2018-09-26 08:24:44,934 INFO L226 Difference]: Without dead ends: 35 [2018-09-26 08:24:44,935 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:24:44,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-09-26 08:24:44,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-09-26 08:24:44,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-09-26 08:24:44,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-09-26 08:24:44,938 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-09-26 08:24:44,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:44,939 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-09-26 08:24:44,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-09-26 08:24:44,939 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-09-26 08:24:44,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-26 08:24:44,939 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:44,939 INFO L375 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2018-09-26 08:24:44,940 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:44,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:44,940 INFO L82 PathProgramCache]: Analyzing trace with hash 144226374, now seen corresponding path program 31 times [2018-09-26 08:24:44,940 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:44,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:45,076 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:45,076 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:45,076 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-09-26 08:24:45,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-09-26 08:24:45,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-09-26 08:24:45,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:24:45,078 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2018-09-26 08:24:45,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:45,093 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-09-26 08:24:45,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-26 08:24:45,093 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2018-09-26 08:24:45,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:45,094 INFO L225 Difference]: With dead ends: 38 [2018-09-26 08:24:45,094 INFO L226 Difference]: Without dead ends: 36 [2018-09-26 08:24:45,095 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 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:45,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-09-26 08:24:45,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-09-26 08:24:45,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-09-26 08:24:45,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-09-26 08:24:45,103 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-09-26 08:24:45,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:45,103 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-09-26 08:24:45,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-09-26 08:24:45,104 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-09-26 08:24:45,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-09-26 08:24:45,104 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:45,104 INFO L375 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2018-09-26 08:24:45,105 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:45,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:45,105 INFO L82 PathProgramCache]: Analyzing trace with hash 176046432, now seen corresponding path program 32 times [2018-09-26 08:24:45,105 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:45,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:45,307 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:45,307 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:45,307 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-09-26 08:24:45,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-09-26 08:24:45,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-09-26 08:24:45,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:24:45,312 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2018-09-26 08:24:45,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:45,328 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-09-26 08:24:45,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-09-26 08:24:45,328 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2018-09-26 08:24:45,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:45,328 INFO L225 Difference]: With dead ends: 39 [2018-09-26 08:24:45,328 INFO L226 Difference]: Without dead ends: 37 [2018-09-26 08:24:45,330 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 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:45,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-09-26 08:24:45,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-09-26 08:24:45,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-09-26 08:24:45,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-09-26 08:24:45,333 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-09-26 08:24:45,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:45,335 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-09-26 08:24:45,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-09-26 08:24:45,335 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-09-26 08:24:45,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-26 08:24:45,336 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:45,336 INFO L375 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2018-09-26 08:24:45,336 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:45,336 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:45,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1162468230, now seen corresponding path program 33 times [2018-09-26 08:24:45,336 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:45,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:45,474 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:45,475 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:45,475 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-09-26 08:24:45,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-09-26 08:24:45,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-09-26 08:24:45,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 08:24:45,476 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2018-09-26 08:24:45,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:45,492 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-09-26 08:24:45,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-26 08:24:45,492 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2018-09-26 08:24:45,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:45,494 INFO L225 Difference]: With dead ends: 40 [2018-09-26 08:24:45,494 INFO L226 Difference]: Without dead ends: 38 [2018-09-26 08:24:45,495 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 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:45,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-09-26 08:24:45,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-09-26 08:24:45,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-09-26 08:24:45,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-09-26 08:24:45,499 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-09-26 08:24:45,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:45,499 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-09-26 08:24:45,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-09-26 08:24:45,499 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-09-26 08:24:45,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-09-26 08:24:45,500 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:45,500 INFO L375 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2018-09-26 08:24:45,500 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:45,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:45,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1676772896, now seen corresponding path program 34 times [2018-09-26 08:24:45,500 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:45,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:45,642 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:45,643 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:45,643 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-09-26 08:24:45,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-09-26 08:24:45,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-09-26 08:24:45,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 08:24:45,646 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2018-09-26 08:24:45,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:45,661 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-09-26 08:24:45,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-26 08:24:45,661 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2018-09-26 08:24:45,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:45,661 INFO L225 Difference]: With dead ends: 41 [2018-09-26 08:24:45,662 INFO L226 Difference]: Without dead ends: 39 [2018-09-26 08:24:45,663 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 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:45,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-09-26 08:24:45,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-09-26 08:24:45,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-09-26 08:24:45,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-09-26 08:24:45,665 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-09-26 08:24:45,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:45,673 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-09-26 08:24:45,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-09-26 08:24:45,673 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-09-26 08:24:45,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-09-26 08:24:45,673 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:45,674 INFO L375 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2018-09-26 08:24:45,674 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:45,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:45,674 INFO L82 PathProgramCache]: Analyzing trace with hash 440348358, now seen corresponding path program 35 times [2018-09-26 08:24:45,674 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:45,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:45,805 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:45,805 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:45,805 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-09-26 08:24:45,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-09-26 08:24:45,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-09-26 08:24:45,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:24:45,807 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2018-09-26 08:24:45,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:45,821 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-09-26 08:24:45,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-26 08:24:45,822 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2018-09-26 08:24:45,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:45,822 INFO L225 Difference]: With dead ends: 42 [2018-09-26 08:24:45,822 INFO L226 Difference]: Without dead ends: 40 [2018-09-26 08:24:45,823 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 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:45,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-09-26 08:24:45,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-09-26 08:24:45,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-09-26 08:24:45,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-09-26 08:24:45,826 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-09-26 08:24:45,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:45,826 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-09-26 08:24:45,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-09-26 08:24:45,826 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-09-26 08:24:45,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-09-26 08:24:45,827 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:45,827 INFO L375 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2018-09-26 08:24:45,827 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:45,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:45,828 INFO L82 PathProgramCache]: Analyzing trace with hash 765893344, now seen corresponding path program 36 times [2018-09-26 08:24:45,828 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:45,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:45,952 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:45,953 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:45,953 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-09-26 08:24:45,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-09-26 08:24:45,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-09-26 08:24:45,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:24:45,955 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2018-09-26 08:24:45,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:45,970 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-09-26 08:24:45,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-26 08:24:45,970 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2018-09-26 08:24:45,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:45,971 INFO L225 Difference]: With dead ends: 43 [2018-09-26 08:24:45,971 INFO L226 Difference]: Without dead ends: 41 [2018-09-26 08:24:45,972 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:24:45,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-09-26 08:24:45,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-09-26 08:24:45,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-09-26 08:24:45,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-09-26 08:24:45,974 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-09-26 08:24:45,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:45,974 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-09-26 08:24:45,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-09-26 08:24:45,974 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-09-26 08:24:45,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-26 08:24:45,975 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:45,975 INFO L375 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2018-09-26 08:24:45,975 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:45,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:45,975 INFO L82 PathProgramCache]: Analyzing trace with hash -2027113978, now seen corresponding path program 37 times [2018-09-26 08:24:45,976 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:45,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:46,102 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:46,102 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:46,102 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-09-26 08:24:46,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-09-26 08:24:46,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-09-26 08:24:46,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 08:24:46,104 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2018-09-26 08:24:46,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:46,123 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-09-26 08:24:46,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-26 08:24:46,123 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2018-09-26 08:24:46,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:46,124 INFO L225 Difference]: With dead ends: 44 [2018-09-26 08:24:46,124 INFO L226 Difference]: Without dead ends: 42 [2018-09-26 08:24:46,125 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 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:46,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-09-26 08:24:46,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-09-26 08:24:46,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-09-26 08:24:46,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-09-26 08:24:46,127 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-09-26 08:24:46,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:46,128 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-09-26 08:24:46,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-09-26 08:24:46,128 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-09-26 08:24:46,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-09-26 08:24:46,128 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:46,129 INFO L375 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2018-09-26 08:24:46,129 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:46,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:46,129 INFO L82 PathProgramCache]: Analyzing trace with hash 1583972256, now seen corresponding path program 38 times [2018-09-26 08:24:46,129 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:46,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:46,260 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:46,260 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:46,260 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-09-26 08:24:46,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-09-26 08:24:46,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-09-26 08:24:46,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-09-26 08:24:46,262 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2018-09-26 08:24:46,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:46,281 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-09-26 08:24:46,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-26 08:24:46,282 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2018-09-26 08:24:46,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:46,282 INFO L225 Difference]: With dead ends: 45 [2018-09-26 08:24:46,282 INFO L226 Difference]: Without dead ends: 43 [2018-09-26 08:24:46,284 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-09-26 08:24:46,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-09-26 08:24:46,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-09-26 08:24:46,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-09-26 08:24:46,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-09-26 08:24:46,286 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-09-26 08:24:46,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:46,286 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-09-26 08:24:46,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-09-26 08:24:46,287 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-09-26 08:24:46,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-09-26 08:24:46,287 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:46,287 INFO L375 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2018-09-26 08:24:46,287 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:46,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:46,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1858495814, now seen corresponding path program 39 times [2018-09-26 08:24:46,288 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:46,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:46,418 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:46,418 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:46,419 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-09-26 08:24:46,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-09-26 08:24:46,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-09-26 08:24:46,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 08:24:46,420 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2018-09-26 08:24:46,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:46,437 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-09-26 08:24:46,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-09-26 08:24:46,437 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2018-09-26 08:24:46,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:46,437 INFO L225 Difference]: With dead ends: 46 [2018-09-26 08:24:46,438 INFO L226 Difference]: Without dead ends: 44 [2018-09-26 08:24:46,439 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 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:46,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-09-26 08:24:46,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-09-26 08:24:46,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-09-26 08:24:46,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-09-26 08:24:46,441 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-09-26 08:24:46,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:46,441 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-09-26 08:24:46,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-09-26 08:24:46,441 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-09-26 08:24:46,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-09-26 08:24:46,442 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:46,442 INFO L375 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2018-09-26 08:24:46,442 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:46,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:46,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1778791520, now seen corresponding path program 40 times [2018-09-26 08:24:46,443 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:46,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:46,580 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:46,581 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:46,581 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-09-26 08:24:46,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-09-26 08:24:46,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-09-26 08:24:46,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-09-26 08:24:46,583 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2018-09-26 08:24:46,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:46,603 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-09-26 08:24:46,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-26 08:24:46,604 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2018-09-26 08:24:46,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:46,604 INFO L225 Difference]: With dead ends: 47 [2018-09-26 08:24:46,604 INFO L226 Difference]: Without dead ends: 45 [2018-09-26 08:24:46,606 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 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:46,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-09-26 08:24:46,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-09-26 08:24:46,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-09-26 08:24:46,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-09-26 08:24:46,608 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-09-26 08:24:46,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:46,608 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-09-26 08:24:46,608 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-09-26 08:24:46,608 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-09-26 08:24:46,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-26 08:24:46,609 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:46,609 INFO L375 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2018-09-26 08:24:46,609 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:46,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:46,609 INFO L82 PathProgramCache]: Analyzing trace with hash -692041594, now seen corresponding path program 41 times [2018-09-26 08:24:46,610 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:46,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:46,768 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:46,769 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:46,769 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-09-26 08:24:46,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-09-26 08:24:46,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-09-26 08:24:46,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 08:24:46,771 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2018-09-26 08:24:46,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:46,789 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-09-26 08:24:46,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-09-26 08:24:46,789 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2018-09-26 08:24:46,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:46,790 INFO L225 Difference]: With dead ends: 48 [2018-09-26 08:24:46,790 INFO L226 Difference]: Without dead ends: 46 [2018-09-26 08:24:46,792 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 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:46,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-09-26 08:24:46,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-09-26 08:24:46,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-09-26 08:24:46,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-09-26 08:24:46,794 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-09-26 08:24:46,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:46,795 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-09-26 08:24:46,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-09-26 08:24:46,795 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-09-26 08:24:46,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-09-26 08:24:46,796 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:46,796 INFO L375 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2018-09-26 08:24:46,796 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:46,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:46,798 INFO L82 PathProgramCache]: Analyzing trace with hash 21543200, now seen corresponding path program 42 times [2018-09-26 08:24:46,798 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:46,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:46,954 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:46,954 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:46,954 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-09-26 08:24:46,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-09-26 08:24:46,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-09-26 08:24:46,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-09-26 08:24:46,957 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2018-09-26 08:24:46,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:46,980 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-09-26 08:24:46,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-09-26 08:24:46,980 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2018-09-26 08:24:46,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:46,981 INFO L225 Difference]: With dead ends: 49 [2018-09-26 08:24:46,981 INFO L226 Difference]: Without dead ends: 47 [2018-09-26 08:24:46,982 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 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:46,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-09-26 08:24:46,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-09-26 08:24:46,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-09-26 08:24:46,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-09-26 08:24:46,987 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-09-26 08:24:46,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:46,987 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-09-26 08:24:46,987 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-09-26 08:24:46,987 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-09-26 08:24:46,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-09-26 08:24:46,988 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:46,988 INFO L375 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2018-09-26 08:24:46,988 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:46,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:46,991 INFO L82 PathProgramCache]: Analyzing trace with hash 667835334, now seen corresponding path program 43 times [2018-09-26 08:24:46,991 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:47,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:47,159 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:47,159 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:47,159 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-09-26 08:24:47,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-09-26 08:24:47,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-09-26 08:24:47,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 08:24:47,162 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2018-09-26 08:24:47,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:47,190 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-09-26 08:24:47,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-09-26 08:24:47,190 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2018-09-26 08:24:47,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:47,191 INFO L225 Difference]: With dead ends: 50 [2018-09-26 08:24:47,191 INFO L226 Difference]: Without dead ends: 48 [2018-09-26 08:24:47,192 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 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:47,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-09-26 08:24:47,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-09-26 08:24:47,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-09-26 08:24:47,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-09-26 08:24:47,195 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2018-09-26 08:24:47,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:47,195 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-09-26 08:24:47,195 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-09-26 08:24:47,195 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-09-26 08:24:47,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-09-26 08:24:47,196 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:47,197 INFO L375 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2018-09-26 08:24:47,197 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:47,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:47,197 INFO L82 PathProgramCache]: Analyzing trace with hash -771944992, now seen corresponding path program 44 times [2018-09-26 08:24:47,197 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:47,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:47,388 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:47,388 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:47,388 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-09-26 08:24:47,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-09-26 08:24:47,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-09-26 08:24:47,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-09-26 08:24:47,390 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2018-09-26 08:24:47,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:47,416 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-09-26 08:24:47,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-09-26 08:24:47,416 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2018-09-26 08:24:47,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:47,417 INFO L225 Difference]: With dead ends: 51 [2018-09-26 08:24:47,417 INFO L226 Difference]: Without dead ends: 49 [2018-09-26 08:24:47,418 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 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:47,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-09-26 08:24:47,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-09-26 08:24:47,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-26 08:24:47,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-09-26 08:24:47,421 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2018-09-26 08:24:47,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:47,421 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-09-26 08:24:47,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-09-26 08:24:47,421 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-09-26 08:24:47,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-09-26 08:24:47,422 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:47,422 INFO L375 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2018-09-26 08:24:47,422 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:47,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:47,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1839505158, now seen corresponding path program 45 times [2018-09-26 08:24:47,423 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:47,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:47,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:47,616 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:47,616 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-09-26 08:24:47,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-09-26 08:24:47,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-09-26 08:24:47,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-09-26 08:24:47,637 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2018-09-26 08:24:47,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:47,658 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-09-26 08:24:47,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-26 08:24:47,658 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2018-09-26 08:24:47,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:47,659 INFO L225 Difference]: With dead ends: 52 [2018-09-26 08:24:47,659 INFO L226 Difference]: Without dead ends: 50 [2018-09-26 08:24:47,660 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 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:47,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-09-26 08:24:47,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-09-26 08:24:47,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-09-26 08:24:47,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-09-26 08:24:47,662 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2018-09-26 08:24:47,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:47,663 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-09-26 08:24:47,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-09-26 08:24:47,663 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-09-26 08:24:47,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-09-26 08:24:47,663 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:47,663 INFO L375 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2018-09-26 08:24:47,664 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:47,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:47,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1190081184, now seen corresponding path program 46 times [2018-09-26 08:24:47,664 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:47,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:47,823 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:47,824 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:47,824 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-09-26 08:24:47,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-09-26 08:24:47,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-09-26 08:24:47,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-09-26 08:24:47,826 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2018-09-26 08:24:47,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:47,844 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-09-26 08:24:47,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-09-26 08:24:47,845 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2018-09-26 08:24:47,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:47,845 INFO L225 Difference]: With dead ends: 53 [2018-09-26 08:24:47,845 INFO L226 Difference]: Without dead ends: 51 [2018-09-26 08:24:47,846 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-09-26 08:24:47,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-09-26 08:24:47,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-09-26 08:24:47,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-09-26 08:24:47,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-09-26 08:24:47,849 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2018-09-26 08:24:47,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:47,849 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-09-26 08:24:47,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-09-26 08:24:47,850 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-09-26 08:24:47,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-09-26 08:24:47,850 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:47,850 INFO L375 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2018-09-26 08:24:47,850 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:47,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:47,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1762192826, now seen corresponding path program 47 times [2018-09-26 08:24:47,851 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:47,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:48,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:48,007 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:48,007 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-09-26 08:24:48,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-09-26 08:24:48,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-09-26 08:24:48,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 08:24:48,009 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2018-09-26 08:24:48,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:48,030 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-09-26 08:24:48,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-26 08:24:48,030 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2018-09-26 08:24:48,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:48,031 INFO L225 Difference]: With dead ends: 54 [2018-09-26 08:24:48,031 INFO L226 Difference]: Without dead ends: 52 [2018-09-26 08:24:48,032 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 08:24:48,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-09-26 08:24:48,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-09-26 08:24:48,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-09-26 08:24:48,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-09-26 08:24:48,034 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2018-09-26 08:24:48,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:48,035 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-09-26 08:24:48,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-09-26 08:24:48,035 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-09-26 08:24:48,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-09-26 08:24:48,035 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:48,035 INFO L375 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2018-09-26 08:24:48,036 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:48,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:48,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1206593376, now seen corresponding path program 48 times [2018-09-26 08:24:48,036 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:48,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:48,199 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:48,200 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:48,200 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-09-26 08:24:48,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-09-26 08:24:48,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-09-26 08:24:48,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-09-26 08:24:48,202 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2018-09-26 08:24:48,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:48,227 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-09-26 08:24:48,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-26 08:24:48,227 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2018-09-26 08:24:48,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:48,228 INFO L225 Difference]: With dead ends: 55 [2018-09-26 08:24:48,228 INFO L226 Difference]: Without dead ends: 53 [2018-09-26 08:24:48,229 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 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:48,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-09-26 08:24:48,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-09-26 08:24:48,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-09-26 08:24:48,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-09-26 08:24:48,231 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2018-09-26 08:24:48,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:48,232 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-09-26 08:24:48,232 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-09-26 08:24:48,232 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-09-26 08:24:48,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-09-26 08:24:48,232 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:48,233 INFO L375 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2018-09-26 08:24:48,233 INFO L423 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:48,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:48,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1250314874, now seen corresponding path program 49 times [2018-09-26 08:24:48,233 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:48,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:48,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:48,410 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:48,410 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-09-26 08:24:48,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-09-26 08:24:48,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-09-26 08:24:48,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 08:24:48,412 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2018-09-26 08:24:48,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:48,440 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-09-26 08:24:48,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-09-26 08:24:48,441 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2018-09-26 08:24:48,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:48,441 INFO L225 Difference]: With dead ends: 56 [2018-09-26 08:24:48,442 INFO L226 Difference]: Without dead ends: 54 [2018-09-26 08:24:48,442 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 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:48,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-09-26 08:24:48,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-09-26 08:24:48,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-09-26 08:24:48,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-09-26 08:24:48,445 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2018-09-26 08:24:48,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:48,445 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-09-26 08:24:48,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-09-26 08:24:48,445 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-09-26 08:24:48,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-09-26 08:24:48,446 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:48,446 INFO L375 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2018-09-26 08:24:48,446 INFO L423 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:48,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:48,447 INFO L82 PathProgramCache]: Analyzing trace with hash -105059296, now seen corresponding path program 50 times [2018-09-26 08:24:48,447 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:48,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:48,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:48,628 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:48,628 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-09-26 08:24:48,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-09-26 08:24:48,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-09-26 08:24:48,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-09-26 08:24:48,630 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2018-09-26 08:24:48,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:48,661 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-09-26 08:24:48,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-09-26 08:24:48,661 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2018-09-26 08:24:48,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:48,662 INFO L225 Difference]: With dead ends: 57 [2018-09-26 08:24:48,662 INFO L226 Difference]: Without dead ends: 55 [2018-09-26 08:24:48,664 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 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:48,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-09-26 08:24:48,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-09-26 08:24:48,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-09-26 08:24:48,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-09-26 08:24:48,674 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2018-09-26 08:24:48,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:48,674 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-09-26 08:24:48,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-09-26 08:24:48,675 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-09-26 08:24:48,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-09-26 08:24:48,675 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:48,675 INFO L375 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2018-09-26 08:24:48,677 INFO L423 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:48,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:48,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1038125254, now seen corresponding path program 51 times [2018-09-26 08:24:48,677 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:48,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:48,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:48,872 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:48,872 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-09-26 08:24:48,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-09-26 08:24:48,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-09-26 08:24:48,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 08:24:48,875 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2018-09-26 08:24:48,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:48,897 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-09-26 08:24:48,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-09-26 08:24:48,898 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2018-09-26 08:24:48,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:48,898 INFO L225 Difference]: With dead ends: 58 [2018-09-26 08:24:48,899 INFO L226 Difference]: Without dead ends: 56 [2018-09-26 08:24:48,900 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 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:48,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-09-26 08:24:48,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-09-26 08:24:48,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-09-26 08:24:48,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-09-26 08:24:48,902 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2018-09-26 08:24:48,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:48,903 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-09-26 08:24:48,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-09-26 08:24:48,903 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-09-26 08:24:48,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-09-26 08:24:48,903 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:48,904 INFO L375 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2018-09-26 08:24:48,904 INFO L423 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:48,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:48,904 INFO L82 PathProgramCache]: Analyzing trace with hash 2117107936, now seen corresponding path program 52 times [2018-09-26 08:24:48,904 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:48,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:49,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:49,090 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:49,090 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-09-26 08:24:49,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-09-26 08:24:49,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-09-26 08:24:49,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-09-26 08:24:49,092 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2018-09-26 08:24:49,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:49,123 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-09-26 08:24:49,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-09-26 08:24:49,124 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2018-09-26 08:24:49,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:49,124 INFO L225 Difference]: With dead ends: 59 [2018-09-26 08:24:49,125 INFO L226 Difference]: Without dead ends: 57 [2018-09-26 08:24:49,126 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 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:49,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-09-26 08:24:49,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-09-26 08:24:49,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-09-26 08:24:49,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-09-26 08:24:49,128 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2018-09-26 08:24:49,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:49,129 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-09-26 08:24:49,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-09-26 08:24:49,129 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-09-26 08:24:49,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-09-26 08:24:49,129 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:49,129 INFO L375 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2018-09-26 08:24:49,130 INFO L423 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:49,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:49,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1205832710, now seen corresponding path program 53 times [2018-09-26 08:24:49,130 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:49,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:49,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:49,321 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:49,321 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-09-26 08:24:49,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-09-26 08:24:49,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-09-26 08:24:49,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 08:24:49,323 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2018-09-26 08:24:49,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:49,355 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-09-26 08:24:49,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-09-26 08:24:49,356 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2018-09-26 08:24:49,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:49,356 INFO L225 Difference]: With dead ends: 60 [2018-09-26 08:24:49,356 INFO L226 Difference]: Without dead ends: 58 [2018-09-26 08:24:49,357 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 08:24:49,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-09-26 08:24:49,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-09-26 08:24:49,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-09-26 08:24:49,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-09-26 08:24:49,360 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2018-09-26 08:24:49,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:49,361 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-09-26 08:24:49,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-09-26 08:24:49,361 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-09-26 08:24:49,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-09-26 08:24:49,361 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:49,361 INFO L375 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2018-09-26 08:24:49,362 INFO L423 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:49,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:49,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1273895520, now seen corresponding path program 54 times [2018-09-26 08:24:49,362 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:49,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:49,561 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:49,561 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:49,561 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-09-26 08:24:49,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-09-26 08:24:49,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-09-26 08:24:49,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-09-26 08:24:49,564 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2018-09-26 08:24:49,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:49,596 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-09-26 08:24:49,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-09-26 08:24:49,597 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2018-09-26 08:24:49,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:49,597 INFO L225 Difference]: With dead ends: 61 [2018-09-26 08:24:49,598 INFO L226 Difference]: Without dead ends: 59 [2018-09-26 08:24:49,599 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-09-26 08:24:49,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-09-26 08:24:49,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-09-26 08:24:49,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-09-26 08:24:49,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-09-26 08:24:49,601 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2018-09-26 08:24:49,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:49,602 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-09-26 08:24:49,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-09-26 08:24:49,602 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-09-26 08:24:49,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-09-26 08:24:49,603 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:49,603 INFO L375 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2018-09-26 08:24:49,603 INFO L423 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:49,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:49,603 INFO L82 PathProgramCache]: Analyzing trace with hash -836059322, now seen corresponding path program 55 times [2018-09-26 08:24:49,603 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:49,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:49,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:49,860 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:49,860 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-09-26 08:24:49,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-09-26 08:24:49,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-09-26 08:24:49,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 08:24:49,863 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2018-09-26 08:24:49,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:49,893 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-09-26 08:24:49,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-09-26 08:24:49,893 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2018-09-26 08:24:49,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:49,894 INFO L225 Difference]: With dead ends: 62 [2018-09-26 08:24:49,894 INFO L226 Difference]: Without dead ends: 60 [2018-09-26 08:24:49,896 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 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:49,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-09-26 08:24:49,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-09-26 08:24:49,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-09-26 08:24:49,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-09-26 08:24:49,900 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2018-09-26 08:24:49,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:49,901 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-09-26 08:24:49,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-09-26 08:24:49,901 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-09-26 08:24:49,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-09-26 08:24:49,902 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:49,902 INFO L375 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2018-09-26 08:24:49,902 INFO L423 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:49,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:49,903 INFO L82 PathProgramCache]: Analyzing trace with hash -148039072, now seen corresponding path program 56 times [2018-09-26 08:24:49,903 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:49,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:50,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:50,170 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:50,170 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-09-26 08:24:50,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-09-26 08:24:50,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-09-26 08:24:50,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-09-26 08:24:50,172 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2018-09-26 08:24:50,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:50,210 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-09-26 08:24:50,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-09-26 08:24:50,210 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2018-09-26 08:24:50,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:50,211 INFO L225 Difference]: With dead ends: 63 [2018-09-26 08:24:50,211 INFO L226 Difference]: Without dead ends: 61 [2018-09-26 08:24:50,212 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-09-26 08:24:50,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-09-26 08:24:50,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-09-26 08:24:50,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-09-26 08:24:50,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-09-26 08:24:50,215 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2018-09-26 08:24:50,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:50,215 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-09-26 08:24:50,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-09-26 08:24:50,215 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-09-26 08:24:50,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-26 08:24:50,216 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:50,216 INFO L375 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2018-09-26 08:24:50,216 INFO L423 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:50,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:50,217 INFO L82 PathProgramCache]: Analyzing trace with hash -294247802, now seen corresponding path program 57 times [2018-09-26 08:24:50,217 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:50,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:50,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:50,422 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:50,422 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-09-26 08:24:50,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-09-26 08:24:50,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-09-26 08:24:50,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-09-26 08:24:50,424 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2018-09-26 08:24:50,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:50,466 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-09-26 08:24:50,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-09-26 08:24:50,466 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2018-09-26 08:24:50,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:50,467 INFO L225 Difference]: With dead ends: 64 [2018-09-26 08:24:50,467 INFO L226 Difference]: Without dead ends: 62 [2018-09-26 08:24:50,468 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 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:50,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-09-26 08:24:50,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-09-26 08:24:50,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-09-26 08:24:50,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-09-26 08:24:50,471 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2018-09-26 08:24:50,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:50,471 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-09-26 08:24:50,471 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-09-26 08:24:50,471 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-09-26 08:24:50,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-09-26 08:24:50,472 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:50,472 INFO L375 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2018-09-26 08:24:50,472 INFO L423 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:50,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:50,473 INFO L82 PathProgramCache]: Analyzing trace with hash -531751136, now seen corresponding path program 58 times [2018-09-26 08:24:50,473 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:50,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:50,686 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:50,686 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:50,687 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-09-26 08:24:50,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-09-26 08:24:50,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-09-26 08:24:50,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-09-26 08:24:50,689 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2018-09-26 08:24:50,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:50,731 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-09-26 08:24:50,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-09-26 08:24:50,731 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2018-09-26 08:24:50,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:50,732 INFO L225 Difference]: With dead ends: 65 [2018-09-26 08:24:50,732 INFO L226 Difference]: Without dead ends: 63 [2018-09-26 08:24:50,733 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 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:50,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-09-26 08:24:50,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-09-26 08:24:50,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-09-26 08:24:50,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-09-26 08:24:50,736 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2018-09-26 08:24:50,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:50,736 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-09-26 08:24:50,737 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-09-26 08:24:50,737 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-09-26 08:24:50,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-09-26 08:24:50,737 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:50,737 INFO L375 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2018-09-26 08:24:50,738 INFO L423 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:50,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:50,738 INFO L82 PathProgramCache]: Analyzing trace with hash 695580102, now seen corresponding path program 59 times [2018-09-26 08:24:50,738 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:50,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:50,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:50,961 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:50,961 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-09-26 08:24:50,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-09-26 08:24:50,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-09-26 08:24:50,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 08:24:50,964 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2018-09-26 08:24:51,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:51,007 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-09-26 08:24:51,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-09-26 08:24:51,007 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2018-09-26 08:24:51,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:51,008 INFO L225 Difference]: With dead ends: 66 [2018-09-26 08:24:51,008 INFO L226 Difference]: Without dead ends: 64 [2018-09-26 08:24:51,009 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 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:51,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-09-26 08:24:51,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-09-26 08:24:51,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-09-26 08:24:51,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-09-26 08:24:51,012 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2018-09-26 08:24:51,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:51,013 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-09-26 08:24:51,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-09-26 08:24:51,013 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-09-26 08:24:51,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-09-26 08:24:51,014 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:51,014 INFO L375 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2018-09-26 08:24:51,014 INFO L423 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:51,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:51,014 INFO L82 PathProgramCache]: Analyzing trace with hash 88142816, now seen corresponding path program 60 times [2018-09-26 08:24:51,014 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:51,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:51,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:51,246 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:51,247 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-09-26 08:24:51,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-09-26 08:24:51,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-09-26 08:24:51,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-09-26 08:24:51,249 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2018-09-26 08:24:51,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:51,288 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-09-26 08:24:51,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-09-26 08:24:51,289 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2018-09-26 08:24:51,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:51,289 INFO L225 Difference]: With dead ends: 67 [2018-09-26 08:24:51,289 INFO L226 Difference]: Without dead ends: 65 [2018-09-26 08:24:51,290 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 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:51,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-09-26 08:24:51,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-09-26 08:24:51,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-09-26 08:24:51,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-09-26 08:24:51,294 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2018-09-26 08:24:51,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:51,294 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-09-26 08:24:51,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-09-26 08:24:51,294 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-09-26 08:24:51,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-09-26 08:24:51,295 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:51,295 INFO L375 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2018-09-26 08:24:51,295 INFO L423 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:51,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:51,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1562543866, now seen corresponding path program 61 times [2018-09-26 08:24:51,296 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:51,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:51,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:51,511 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:51,512 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-09-26 08:24:51,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-09-26 08:24:51,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-09-26 08:24:51,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 08:24:51,514 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2018-09-26 08:24:51,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:51,548 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-09-26 08:24:51,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-09-26 08:24:51,549 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2018-09-26 08:24:51,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:51,549 INFO L225 Difference]: With dead ends: 68 [2018-09-26 08:24:51,550 INFO L226 Difference]: Without dead ends: 66 [2018-09-26 08:24:51,550 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 08:24:51,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-09-26 08:24:51,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-09-26 08:24:51,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-09-26 08:24:51,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-09-26 08:24:51,553 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2018-09-26 08:24:51,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:51,554 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-09-26 08:24:51,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-09-26 08:24:51,554 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-09-26 08:24:51,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-09-26 08:24:51,554 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:51,555 INFO L375 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2018-09-26 08:24:51,555 INFO L423 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:51,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:51,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1194223456, now seen corresponding path program 62 times [2018-09-26 08:24:51,555 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:51,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:51,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:51,771 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:51,771 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-09-26 08:24:51,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-09-26 08:24:51,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-09-26 08:24:51,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-09-26 08:24:51,773 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2018-09-26 08:24:51,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:51,818 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-09-26 08:24:51,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-09-26 08:24:51,818 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2018-09-26 08:24:51,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:51,819 INFO L225 Difference]: With dead ends: 69 [2018-09-26 08:24:51,819 INFO L226 Difference]: Without dead ends: 67 [2018-09-26 08:24:51,820 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 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:51,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-09-26 08:24:51,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-09-26 08:24:51,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-09-26 08:24:51,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-09-26 08:24:51,822 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2018-09-26 08:24:51,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:51,823 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-09-26 08:24:51,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-09-26 08:24:51,823 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-09-26 08:24:51,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-26 08:24:51,823 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:51,824 INFO L375 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2018-09-26 08:24:51,824 INFO L423 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:51,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:51,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1633774662, now seen corresponding path program 63 times [2018-09-26 08:24:51,824 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:51,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:52,048 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:52,048 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:52,048 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-09-26 08:24:52,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-09-26 08:24:52,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-09-26 08:24:52,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 08:24:52,050 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2018-09-26 08:24:52,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:52,083 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-09-26 08:24:52,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-09-26 08:24:52,083 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2018-09-26 08:24:52,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:52,084 INFO L225 Difference]: With dead ends: 70 [2018-09-26 08:24:52,084 INFO L226 Difference]: Without dead ends: 68 [2018-09-26 08:24:52,085 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 08:24:52,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-09-26 08:24:52,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-09-26 08:24:52,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-09-26 08:24:52,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-09-26 08:24:52,088 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2018-09-26 08:24:52,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:52,088 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-09-26 08:24:52,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-09-26 08:24:52,088 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-09-26 08:24:52,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-09-26 08:24:52,089 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:52,089 INFO L375 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2018-09-26 08:24:52,089 INFO L423 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:52,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:52,090 INFO L82 PathProgramCache]: Analyzing trace with hash -892596896, now seen corresponding path program 64 times [2018-09-26 08:24:52,090 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:52,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:52,359 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:52,360 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:52,360 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-09-26 08:24:52,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-09-26 08:24:52,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-09-26 08:24:52,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-09-26 08:24:52,362 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2018-09-26 08:24:52,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:52,412 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-09-26 08:24:52,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-09-26 08:24:52,413 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2018-09-26 08:24:52,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:52,413 INFO L225 Difference]: With dead ends: 71 [2018-09-26 08:24:52,414 INFO L226 Difference]: Without dead ends: 69 [2018-09-26 08:24:52,414 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 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:52,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-09-26 08:24:52,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-09-26 08:24:52,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-09-26 08:24:52,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-09-26 08:24:52,418 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2018-09-26 08:24:52,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:52,419 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-09-26 08:24:52,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-09-26 08:24:52,419 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-09-26 08:24:52,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-09-26 08:24:52,420 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:52,420 INFO L375 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2018-09-26 08:24:52,421 INFO L423 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:52,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:52,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1900703866, now seen corresponding path program 65 times [2018-09-26 08:24:52,421 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:52,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:52,722 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:52,722 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:52,722 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-09-26 08:24:52,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-09-26 08:24:52,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-09-26 08:24:52,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 08:24:52,725 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2018-09-26 08:24:52,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:52,778 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-09-26 08:24:52,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-09-26 08:24:52,778 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2018-09-26 08:24:52,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:52,779 INFO L225 Difference]: With dead ends: 72 [2018-09-26 08:24:52,809 INFO L226 Difference]: Without dead ends: 70 [2018-09-26 08:24:52,810 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 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:52,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-09-26 08:24:52,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-09-26 08:24:52,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-09-26 08:24:52,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-09-26 08:24:52,813 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2018-09-26 08:24:52,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:52,814 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-09-26 08:24:52,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-09-26 08:24:52,814 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-09-26 08:24:52,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-09-26 08:24:52,815 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:52,815 INFO L375 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2018-09-26 08:24:52,815 INFO L423 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:52,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:52,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1207718432, now seen corresponding path program 66 times [2018-09-26 08:24:52,816 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:52,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:53,033 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:53,033 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:53,034 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-09-26 08:24:53,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-09-26 08:24:53,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-09-26 08:24:53,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-09-26 08:24:53,035 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2018-09-26 08:24:53,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:53,075 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-09-26 08:24:53,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-09-26 08:24:53,075 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2018-09-26 08:24:53,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:53,076 INFO L225 Difference]: With dead ends: 73 [2018-09-26 08:24:53,076 INFO L226 Difference]: Without dead ends: 71 [2018-09-26 08:24:53,077 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-09-26 08:24:53,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-09-26 08:24:53,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-09-26 08:24:53,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-09-26 08:24:53,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-09-26 08:24:53,079 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2018-09-26 08:24:53,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:53,080 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-09-26 08:24:53,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-09-26 08:24:53,080 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-09-26 08:24:53,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-09-26 08:24:53,080 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:53,081 INFO L375 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2018-09-26 08:24:53,081 INFO L423 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:53,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:53,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1215438138, now seen corresponding path program 67 times [2018-09-26 08:24:53,081 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:53,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:53,308 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:53,308 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:53,308 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-09-26 08:24:53,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-09-26 08:24:53,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-09-26 08:24:53,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 08:24:53,310 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2018-09-26 08:24:53,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:53,340 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-09-26 08:24:53,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-09-26 08:24:53,341 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2018-09-26 08:24:53,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:53,341 INFO L225 Difference]: With dead ends: 74 [2018-09-26 08:24:53,341 INFO L226 Difference]: Without dead ends: 72 [2018-09-26 08:24:53,342 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 08:24:53,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-09-26 08:24:53,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-09-26 08:24:53,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-09-26 08:24:53,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-09-26 08:24:53,345 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2018-09-26 08:24:53,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:53,346 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-09-26 08:24:53,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-09-26 08:24:53,346 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-09-26 08:24:53,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-09-26 08:24:53,347 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:53,347 INFO L375 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2018-09-26 08:24:53,347 INFO L423 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:53,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:53,347 INFO L82 PathProgramCache]: Analyzing trace with hash 976119520, now seen corresponding path program 68 times [2018-09-26 08:24:53,348 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:53,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:53,577 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:53,578 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:53,578 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-09-26 08:24:53,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-09-26 08:24:53,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-09-26 08:24:53,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-09-26 08:24:53,580 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2018-09-26 08:24:53,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:53,626 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-09-26 08:24:53,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-09-26 08:24:53,626 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2018-09-26 08:24:53,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:53,627 INFO L225 Difference]: With dead ends: 75 [2018-09-26 08:24:53,627 INFO L226 Difference]: Without dead ends: 73 [2018-09-26 08:24:53,628 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-09-26 08:24:53,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-09-26 08:24:53,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-09-26 08:24:53,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-09-26 08:24:53,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-09-26 08:24:53,631 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2018-09-26 08:24:53,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:53,631 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-09-26 08:24:53,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-09-26 08:24:53,632 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-09-26 08:24:53,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-09-26 08:24:53,632 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:53,632 INFO L375 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2018-09-26 08:24:53,633 INFO L423 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:53,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:53,633 INFO L82 PathProgramCache]: Analyzing trace with hash 194930182, now seen corresponding path program 69 times [2018-09-26 08:24:53,633 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:53,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:53,867 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:53,867 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:53,867 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-09-26 08:24:53,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-09-26 08:24:53,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-09-26 08:24:53,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-09-26 08:24:53,869 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2018-09-26 08:24:53,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:53,924 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-09-26 08:24:53,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-09-26 08:24:53,924 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2018-09-26 08:24:53,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:53,925 INFO L225 Difference]: With dead ends: 76 [2018-09-26 08:24:53,925 INFO L226 Difference]: Without dead ends: 74 [2018-09-26 08:24:53,925 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-09-26 08:24:53,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-09-26 08:24:53,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-09-26 08:24:53,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-09-26 08:24:53,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-09-26 08:24:53,928 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2018-09-26 08:24:53,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:53,929 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-09-26 08:24:53,929 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-09-26 08:24:53,929 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-09-26 08:24:53,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-09-26 08:24:53,930 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:53,930 INFO L375 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2018-09-26 08:24:53,930 INFO L423 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:53,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:53,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1747864480, now seen corresponding path program 70 times [2018-09-26 08:24:53,930 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:53,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:54,166 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:54,166 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:54,166 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-09-26 08:24:54,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-09-26 08:24:54,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-09-26 08:24:54,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-09-26 08:24:54,168 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2018-09-26 08:24:54,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:54,220 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-09-26 08:24:54,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-09-26 08:24:54,220 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2018-09-26 08:24:54,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:54,221 INFO L225 Difference]: With dead ends: 77 [2018-09-26 08:24:54,221 INFO L226 Difference]: Without dead ends: 75 [2018-09-26 08:24:54,222 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-09-26 08:24:54,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-09-26 08:24:54,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-09-26 08:24:54,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-09-26 08:24:54,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-09-26 08:24:54,226 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2018-09-26 08:24:54,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:54,226 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-09-26 08:24:54,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-09-26 08:24:54,227 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-09-26 08:24:54,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-09-26 08:24:54,227 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:54,227 INFO L375 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2018-09-26 08:24:54,228 INFO L423 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:54,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:54,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1650779834, now seen corresponding path program 71 times [2018-09-26 08:24:54,228 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:54,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:54,457 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:54,457 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:54,457 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-09-26 08:24:54,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-09-26 08:24:54,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-09-26 08:24:54,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 08:24:54,459 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2018-09-26 08:24:54,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:54,527 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-09-26 08:24:54,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-09-26 08:24:54,527 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2018-09-26 08:24:54,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:54,528 INFO L225 Difference]: With dead ends: 78 [2018-09-26 08:24:54,528 INFO L226 Difference]: Without dead ends: 76 [2018-09-26 08:24:54,529 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 08:24:54,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-09-26 08:24:54,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-09-26 08:24:54,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-09-26 08:24:54,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-09-26 08:24:54,532 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2018-09-26 08:24:54,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:54,532 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-09-26 08:24:54,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-09-26 08:24:54,532 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-09-26 08:24:54,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-09-26 08:24:54,533 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:54,533 INFO L375 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2018-09-26 08:24:54,533 INFO L423 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:54,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:54,534 INFO L82 PathProgramCache]: Analyzing trace with hash 365428832, now seen corresponding path program 72 times [2018-09-26 08:24:54,534 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:54,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:54,771 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:54,771 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:54,771 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-09-26 08:24:54,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-09-26 08:24:54,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-09-26 08:24:54,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-09-26 08:24:54,776 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2018-09-26 08:24:54,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:54,842 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-09-26 08:24:54,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-09-26 08:24:54,842 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2018-09-26 08:24:54,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:54,843 INFO L225 Difference]: With dead ends: 79 [2018-09-26 08:24:54,843 INFO L226 Difference]: Without dead ends: 77 [2018-09-26 08:24:54,844 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-09-26 08:24:54,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-09-26 08:24:54,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-09-26 08:24:54,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-09-26 08:24:54,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-09-26 08:24:54,847 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2018-09-26 08:24:54,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:54,847 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-09-26 08:24:54,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-09-26 08:24:54,848 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-09-26 08:24:54,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-09-26 08:24:54,848 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:54,848 INFO L375 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2018-09-26 08:24:54,849 INFO L423 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:54,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:54,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1556611962, now seen corresponding path program 73 times [2018-09-26 08:24:54,849 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:54,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:55,108 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:55,109 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:55,109 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-09-26 08:24:55,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-09-26 08:24:55,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-09-26 08:24:55,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-09-26 08:24:55,111 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2018-09-26 08:24:55,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:55,167 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-09-26 08:24:55,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-09-26 08:24:55,167 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2018-09-26 08:24:55,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:55,168 INFO L225 Difference]: With dead ends: 80 [2018-09-26 08:24:55,168 INFO L226 Difference]: Without dead ends: 78 [2018-09-26 08:24:55,168 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 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:55,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-09-26 08:24:55,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-09-26 08:24:55,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-09-26 08:24:55,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-09-26 08:24:55,171 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2018-09-26 08:24:55,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:55,172 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-09-26 08:24:55,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-09-26 08:24:55,172 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-09-26 08:24:55,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-09-26 08:24:55,173 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:55,173 INFO L375 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2018-09-26 08:24:55,173 INFO L423 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:55,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:55,173 INFO L82 PathProgramCache]: Analyzing trace with hash -1010334432, now seen corresponding path program 74 times [2018-09-26 08:24:55,173 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:55,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:55,484 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:55,485 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:55,485 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-09-26 08:24:55,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-09-26 08:24:55,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-09-26 08:24:55,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-09-26 08:24:55,487 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2018-09-26 08:24:55,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:55,544 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-09-26 08:24:55,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-09-26 08:24:55,544 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2018-09-26 08:24:55,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:55,545 INFO L225 Difference]: With dead ends: 81 [2018-09-26 08:24:55,545 INFO L226 Difference]: Without dead ends: 79 [2018-09-26 08:24:55,546 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 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:55,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-09-26 08:24:55,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-09-26 08:24:55,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-09-26 08:24:55,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-09-26 08:24:55,549 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2018-09-26 08:24:55,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:55,549 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-09-26 08:24:55,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-09-26 08:24:55,549 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-09-26 08:24:55,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-09-26 08:24:55,550 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:55,550 INFO L375 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2018-09-26 08:24:55,550 INFO L423 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:55,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:55,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1255600186, now seen corresponding path program 75 times [2018-09-26 08:24:55,551 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:55,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:55,778 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:55,779 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:55,779 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-09-26 08:24:55,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-09-26 08:24:55,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-09-26 08:24:55,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 08:24:55,780 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2018-09-26 08:24:55,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:55,842 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-09-26 08:24:55,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-09-26 08:24:55,842 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2018-09-26 08:24:55,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:55,843 INFO L225 Difference]: With dead ends: 82 [2018-09-26 08:24:55,843 INFO L226 Difference]: Without dead ends: 80 [2018-09-26 08:24:55,844 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 08:24:55,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-09-26 08:24:55,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-09-26 08:24:55,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-09-26 08:24:55,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-09-26 08:24:55,847 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2018-09-26 08:24:55,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:55,847 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-09-26 08:24:55,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-09-26 08:24:55,847 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-09-26 08:24:55,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-09-26 08:24:55,848 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:55,848 INFO L375 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2018-09-26 08:24:55,848 INFO L423 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:55,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:55,849 INFO L82 PathProgramCache]: Analyzing trace with hash -268903968, now seen corresponding path program 76 times [2018-09-26 08:24:55,849 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:55,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:56,092 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:56,093 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:56,093 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-09-26 08:24:56,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-09-26 08:24:56,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-09-26 08:24:56,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-09-26 08:24:56,095 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2018-09-26 08:24:56,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:56,134 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-09-26 08:24:56,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-09-26 08:24:56,135 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2018-09-26 08:24:56,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:56,135 INFO L225 Difference]: With dead ends: 83 [2018-09-26 08:24:56,135 INFO L226 Difference]: Without dead ends: 81 [2018-09-26 08:24:56,136 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 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:56,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-09-26 08:24:56,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-09-26 08:24:56,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-09-26 08:24:56,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-09-26 08:24:56,139 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2018-09-26 08:24:56,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:56,139 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-09-26 08:24:56,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-09-26 08:24:56,140 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-09-26 08:24:56,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-09-26 08:24:56,140 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:56,140 INFO L375 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2018-09-26 08:24:56,141 INFO L423 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:56,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:56,141 INFO L82 PathProgramCache]: Analyzing trace with hash 253907718, now seen corresponding path program 77 times [2018-09-26 08:24:56,141 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:56,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:56,386 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:56,386 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:56,386 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-09-26 08:24:56,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-09-26 08:24:56,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-09-26 08:24:56,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 08:24:56,388 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2018-09-26 08:24:56,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:56,425 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-09-26 08:24:56,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-09-26 08:24:56,426 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2018-09-26 08:24:56,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:56,426 INFO L225 Difference]: With dead ends: 84 [2018-09-26 08:24:56,427 INFO L226 Difference]: Without dead ends: 82 [2018-09-26 08:24:56,427 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 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:56,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-09-26 08:24:56,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-09-26 08:24:56,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-09-26 08:24:56,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-09-26 08:24:56,430 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2018-09-26 08:24:56,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:56,430 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-09-26 08:24:56,430 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-09-26 08:24:56,430 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-09-26 08:24:56,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-09-26 08:24:56,431 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:56,431 INFO L375 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2018-09-26 08:24:56,432 INFO L423 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:56,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:56,432 INFO L82 PathProgramCache]: Analyzing trace with hash -718799200, now seen corresponding path program 78 times [2018-09-26 08:24:56,432 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:56,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:56,672 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:56,673 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:56,673 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-09-26 08:24:56,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-09-26 08:24:56,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-09-26 08:24:56,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-09-26 08:24:56,674 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2018-09-26 08:24:56,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:56,738 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-09-26 08:24:56,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-09-26 08:24:56,739 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2018-09-26 08:24:56,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:56,739 INFO L225 Difference]: With dead ends: 85 [2018-09-26 08:24:56,739 INFO L226 Difference]: Without dead ends: 83 [2018-09-26 08:24:56,740 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 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,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-09-26 08:24:56,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-09-26 08:24:56,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-09-26 08:24:56,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-09-26 08:24:56,743 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2018-09-26 08:24:56,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:56,743 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-09-26 08:24:56,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-09-26 08:24:56,743 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-09-26 08:24:56,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-09-26 08:24:56,744 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:56,744 INFO L375 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2018-09-26 08:24:56,744 INFO L423 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:56,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:56,745 INFO L82 PathProgramCache]: Analyzing trace with hash -807942586, now seen corresponding path program 79 times [2018-09-26 08:24:56,745 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:56,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:57,006 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:57,007 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:57,007 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-09-26 08:24:57,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-09-26 08:24:57,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-09-26 08:24:57,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 08:24:57,009 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2018-09-26 08:24:57,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:57,084 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-09-26 08:24:57,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-09-26 08:24:57,084 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2018-09-26 08:24:57,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:57,085 INFO L225 Difference]: With dead ends: 86 [2018-09-26 08:24:57,085 INFO L226 Difference]: Without dead ends: 84 [2018-09-26 08:24:57,086 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 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:57,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-09-26 08:24:57,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-09-26 08:24:57,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-09-26 08:24:57,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-09-26 08:24:57,089 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2018-09-26 08:24:57,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:57,090 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-09-26 08:24:57,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-09-26 08:24:57,090 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-09-26 08:24:57,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-09-26 08:24:57,091 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:57,091 INFO L375 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2018-09-26 08:24:57,091 INFO L423 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:57,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:57,092 INFO L82 PathProgramCache]: Analyzing trace with hash 723579744, now seen corresponding path program 80 times [2018-09-26 08:24:57,092 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:57,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:57,470 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:57,470 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:57,471 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-09-26 08:24:57,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-09-26 08:24:57,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-09-26 08:24:57,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-09-26 08:24:57,473 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2018-09-26 08:24:57,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:57,532 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-09-26 08:24:57,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-09-26 08:24:57,532 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2018-09-26 08:24:57,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:57,533 INFO L225 Difference]: With dead ends: 87 [2018-09-26 08:24:57,533 INFO L226 Difference]: Without dead ends: 85 [2018-09-26 08:24:57,534 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-09-26 08:24:57,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-09-26 08:24:57,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-09-26 08:24:57,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-09-26 08:24:57,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-09-26 08:24:57,537 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2018-09-26 08:24:57,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:57,538 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-09-26 08:24:57,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-09-26 08:24:57,538 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-09-26 08:24:57,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-09-26 08:24:57,539 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:57,539 INFO L375 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2018-09-26 08:24:57,539 INFO L423 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:57,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:57,540 INFO L82 PathProgramCache]: Analyzing trace with hash 956131718, now seen corresponding path program 81 times [2018-09-26 08:24:57,540 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:57,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:57,872 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:57,873 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:57,873 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-09-26 08:24:57,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-09-26 08:24:57,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-09-26 08:24:57,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-09-26 08:24:57,875 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2018-09-26 08:24:57,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:57,934 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-09-26 08:24:57,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-09-26 08:24:57,935 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2018-09-26 08:24:57,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:57,935 INFO L225 Difference]: With dead ends: 88 [2018-09-26 08:24:57,935 INFO L226 Difference]: Without dead ends: 86 [2018-09-26 08:24:57,936 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-09-26 08:24:57,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-09-26 08:24:57,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-09-26 08:24:57,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-09-26 08:24:57,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-09-26 08:24:57,939 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2018-09-26 08:24:57,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:57,939 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-09-26 08:24:57,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-09-26 08:24:57,940 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-09-26 08:24:57,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-09-26 08:24:57,940 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:57,940 INFO L375 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2018-09-26 08:24:57,941 INFO L423 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:57,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:57,941 INFO L82 PathProgramCache]: Analyzing trace with hash -424691680, now seen corresponding path program 82 times [2018-09-26 08:24:57,941 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:57,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:58,201 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:58,201 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:58,201 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-09-26 08:24:58,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-09-26 08:24:58,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-09-26 08:24:58,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-09-26 08:24:58,203 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2018-09-26 08:24:58,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:58,269 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-09-26 08:24:58,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-09-26 08:24:58,270 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2018-09-26 08:24:58,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:58,270 INFO L225 Difference]: With dead ends: 89 [2018-09-26 08:24:58,271 INFO L226 Difference]: Without dead ends: 87 [2018-09-26 08:24:58,271 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-09-26 08:24:58,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-09-26 08:24:58,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-09-26 08:24:58,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-09-26 08:24:58,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-09-26 08:24:58,274 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2018-09-26 08:24:58,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:58,274 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-09-26 08:24:58,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-09-26 08:24:58,275 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-09-26 08:24:58,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-09-26 08:24:58,275 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:58,275 INFO L375 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2018-09-26 08:24:58,276 INFO L423 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:58,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:58,276 INFO L82 PathProgramCache]: Analyzing trace with hash -280544058, now seen corresponding path program 83 times [2018-09-26 08:24:58,276 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:58,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:58,528 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:58,528 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:58,528 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-09-26 08:24:58,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-09-26 08:24:58,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-09-26 08:24:58,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 08:24:58,530 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2018-09-26 08:24:58,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:58,570 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-09-26 08:24:58,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-09-26 08:24:58,570 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2018-09-26 08:24:58,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:58,571 INFO L225 Difference]: With dead ends: 90 [2018-09-26 08:24:58,571 INFO L226 Difference]: Without dead ends: 88 [2018-09-26 08:24:58,572 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 08:24:58,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-09-26 08:24:58,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-09-26 08:24:58,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-09-26 08:24:58,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-09-26 08:24:58,575 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2018-09-26 08:24:58,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:58,575 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-09-26 08:24:58,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-09-26 08:24:58,575 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-09-26 08:24:58,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-09-26 08:24:58,576 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:58,576 INFO L375 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2018-09-26 08:24:58,576 INFO L423 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:58,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:58,577 INFO L82 PathProgramCache]: Analyzing trace with hash -106935072, now seen corresponding path program 84 times [2018-09-26 08:24:58,577 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:58,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:58,815 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:58,816 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:58,816 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-09-26 08:24:58,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-09-26 08:24:58,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-09-26 08:24:58,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-09-26 08:24:58,818 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2018-09-26 08:24:58,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:58,885 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-09-26 08:24:58,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-09-26 08:24:58,885 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2018-09-26 08:24:58,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:58,886 INFO L225 Difference]: With dead ends: 91 [2018-09-26 08:24:58,886 INFO L226 Difference]: Without dead ends: 89 [2018-09-26 08:24:58,887 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-09-26 08:24:58,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-09-26 08:24:58,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-09-26 08:24:58,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-09-26 08:24:58,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-09-26 08:24:58,889 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2018-09-26 08:24:58,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:58,890 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-09-26 08:24:58,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-09-26 08:24:58,890 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-09-26 08:24:58,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-09-26 08:24:58,891 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:58,891 INFO L375 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2018-09-26 08:24:58,891 INFO L423 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:58,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:58,892 INFO L82 PathProgramCache]: Analyzing trace with hash 979976198, now seen corresponding path program 85 times [2018-09-26 08:24:58,892 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:58,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:59,144 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:59,144 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:59,145 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-09-26 08:24:59,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-09-26 08:24:59,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-09-26 08:24:59,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-09-26 08:24:59,147 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2018-09-26 08:24:59,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:59,182 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-09-26 08:24:59,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-09-26 08:24:59,182 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2018-09-26 08:24:59,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:59,183 INFO L225 Difference]: With dead ends: 92 [2018-09-26 08:24:59,183 INFO L226 Difference]: Without dead ends: 90 [2018-09-26 08:24:59,184 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-09-26 08:24:59,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-09-26 08:24:59,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-09-26 08:24:59,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-09-26 08:24:59,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-09-26 08:24:59,187 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2018-09-26 08:24:59,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:59,187 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-09-26 08:24:59,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-09-26 08:24:59,187 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-09-26 08:24:59,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-09-26 08:24:59,188 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:59,188 INFO L375 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2018-09-26 08:24:59,188 INFO L423 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:59,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:59,189 INFO L82 PathProgramCache]: Analyzing trace with hash 314487200, now seen corresponding path program 86 times [2018-09-26 08:24:59,189 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:59,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:59,501 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:59,501 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:59,501 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-09-26 08:24:59,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-09-26 08:24:59,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-09-26 08:24:59,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-09-26 08:24:59,503 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2018-09-26 08:24:59,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:59,601 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-09-26 08:24:59,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-09-26 08:24:59,601 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2018-09-26 08:24:59,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:59,602 INFO L225 Difference]: With dead ends: 93 [2018-09-26 08:24:59,602 INFO L226 Difference]: Without dead ends: 91 [2018-09-26 08:24:59,603 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 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,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-09-26 08:24:59,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-09-26 08:24:59,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-09-26 08:24:59,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-09-26 08:24:59,607 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2018-09-26 08:24:59,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:59,607 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-09-26 08:24:59,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-09-26 08:24:59,608 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-09-26 08:24:59,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-09-26 08:24:59,608 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:59,608 INFO L375 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2018-09-26 08:24:59,609 INFO L423 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:59,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:59,609 INFO L82 PathProgramCache]: Analyzing trace with hash 1159164742, now seen corresponding path program 87 times [2018-09-26 08:24:59,609 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:59,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:59,877 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:59,877 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:59,877 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-09-26 08:24:59,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-09-26 08:24:59,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-09-26 08:24:59,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-09-26 08:24:59,879 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2018-09-26 08:24:59,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:59,913 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-09-26 08:24:59,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-09-26 08:24:59,913 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2018-09-26 08:24:59,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:59,914 INFO L225 Difference]: With dead ends: 94 [2018-09-26 08:24:59,914 INFO L226 Difference]: Without dead ends: 92 [2018-09-26 08:24:59,915 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-09-26 08:24:59,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-09-26 08:24:59,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-09-26 08:24:59,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-09-26 08:24:59,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-09-26 08:24:59,918 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2018-09-26 08:24:59,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:59,918 INFO L480 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-09-26 08:24:59,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-09-26 08:24:59,918 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-09-26 08:24:59,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-09-26 08:24:59,922 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:59,922 INFO L375 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2018-09-26 08:24:59,922 INFO L423 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:59,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:59,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1574364768, now seen corresponding path program 88 times [2018-09-26 08:24:59,923 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:59,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:00,221 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:00,221 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:00,221 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-09-26 08:25:00,222 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-09-26 08:25:00,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-09-26 08:25:00,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-09-26 08:25:00,224 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2018-09-26 08:25:00,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:00,299 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-09-26 08:25:00,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-09-26 08:25:00,299 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2018-09-26 08:25:00,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:00,301 INFO L225 Difference]: With dead ends: 95 [2018-09-26 08:25:00,302 INFO L226 Difference]: Without dead ends: 93 [2018-09-26 08:25:00,302 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 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,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-09-26 08:25:00,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-09-26 08:25:00,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-09-26 08:25:00,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-09-26 08:25:00,305 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2018-09-26 08:25:00,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:00,306 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-09-26 08:25:00,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-09-26 08:25:00,306 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-09-26 08:25:00,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-09-26 08:25:00,307 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:00,307 INFO L375 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2018-09-26 08:25:00,307 INFO L423 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:00,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:00,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1560663686, now seen corresponding path program 89 times [2018-09-26 08:25:00,308 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:00,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:00,541 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:00,541 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:00,541 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-09-26 08:25:00,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-09-26 08:25:00,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-09-26 08:25:00,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-09-26 08:25:00,543 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2018-09-26 08:25:00,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:00,614 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-09-26 08:25:00,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-09-26 08:25:00,614 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2018-09-26 08:25:00,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:00,615 INFO L225 Difference]: With dead ends: 96 [2018-09-26 08:25:00,615 INFO L226 Difference]: Without dead ends: 94 [2018-09-26 08:25:00,616 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-09-26 08:25:00,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-09-26 08:25:00,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-09-26 08:25:00,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-09-26 08:25:00,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-09-26 08:25:00,619 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2018-09-26 08:25:00,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:00,620 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-09-26 08:25:00,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-09-26 08:25:00,620 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-09-26 08:25:00,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-09-26 08:25:00,621 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:00,621 INFO L375 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2018-09-26 08:25:00,621 INFO L423 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:00,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:00,621 INFO L82 PathProgramCache]: Analyzing trace with hash 1135930144, now seen corresponding path program 90 times [2018-09-26 08:25:00,621 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:00,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:00,875 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:00,875 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:00,875 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-09-26 08:25:00,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-09-26 08:25:00,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-09-26 08:25:00,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-09-26 08:25:00,877 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2018-09-26 08:25:00,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:00,925 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-09-26 08:25:00,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-09-26 08:25:00,925 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2018-09-26 08:25:00,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:00,926 INFO L225 Difference]: With dead ends: 97 [2018-09-26 08:25:00,926 INFO L226 Difference]: Without dead ends: 95 [2018-09-26 08:25:00,927 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-09-26 08:25:00,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-09-26 08:25:00,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-09-26 08:25:00,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-09-26 08:25:00,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-09-26 08:25:00,932 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2018-09-26 08:25:00,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:00,932 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-09-26 08:25:00,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-09-26 08:25:00,932 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-09-26 08:25:00,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-09-26 08:25:00,933 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:00,933 INFO L375 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2018-09-26 08:25:00,933 INFO L423 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:00,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:00,934 INFO L82 PathProgramCache]: Analyzing trace with hash 854092230, now seen corresponding path program 91 times [2018-09-26 08:25:00,934 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:00,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:01,196 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:01,196 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:01,196 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-09-26 08:25:01,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-09-26 08:25:01,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-09-26 08:25:01,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-09-26 08:25:01,198 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2018-09-26 08:25:01,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:01,261 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-09-26 08:25:01,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-09-26 08:25:01,261 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2018-09-26 08:25:01,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:01,262 INFO L225 Difference]: With dead ends: 98 [2018-09-26 08:25:01,262 INFO L226 Difference]: Without dead ends: 96 [2018-09-26 08:25:01,262 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 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:01,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-09-26 08:25:01,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-09-26 08:25:01,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-09-26 08:25:01,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-09-26 08:25:01,265 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2018-09-26 08:25:01,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:01,266 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-09-26 08:25:01,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-09-26 08:25:01,266 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-09-26 08:25:01,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-09-26 08:25:01,266 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:01,267 INFO L375 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2018-09-26 08:25:01,267 INFO L423 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:01,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:01,267 INFO L82 PathProgramCache]: Analyzing trace with hash 707051488, now seen corresponding path program 92 times [2018-09-26 08:25:01,267 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:01,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:01,526 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:01,526 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:01,526 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-09-26 08:25:01,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-09-26 08:25:01,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-09-26 08:25:01,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-09-26 08:25:01,528 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2018-09-26 08:25:01,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:01,609 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-09-26 08:25:01,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-09-26 08:25:01,610 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2018-09-26 08:25:01,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:01,610 INFO L225 Difference]: With dead ends: 99 [2018-09-26 08:25:01,611 INFO L226 Difference]: Without dead ends: 97 [2018-09-26 08:25:01,611 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 1 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:01,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-09-26 08:25:01,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-09-26 08:25:01,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-09-26 08:25:01,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-09-26 08:25:01,614 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2018-09-26 08:25:01,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:01,615 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-09-26 08:25:01,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-09-26 08:25:01,615 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-09-26 08:25:01,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-09-26 08:25:01,615 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:01,616 INFO L375 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2018-09-26 08:25:01,616 INFO L423 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:01,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:01,616 INFO L82 PathProgramCache]: Analyzing trace with hash 443755782, now seen corresponding path program 93 times [2018-09-26 08:25:01,616 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:01,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:02,012 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:02,012 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:02,013 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-09-26 08:25:02,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-09-26 08:25:02,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-09-26 08:25:02,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-09-26 08:25:02,015 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2018-09-26 08:25:02,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:02,095 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-09-26 08:25:02,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-09-26 08:25:02,096 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2018-09-26 08:25:02,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:02,096 INFO L225 Difference]: With dead ends: 100 [2018-09-26 08:25:02,097 INFO L226 Difference]: Without dead ends: 98 [2018-09-26 08:25:02,097 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-09-26 08:25:02,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-09-26 08:25:02,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-09-26 08:25:02,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-09-26 08:25:02,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-09-26 08:25:02,101 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2018-09-26 08:25:02,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:02,101 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-09-26 08:25:02,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-09-26 08:25:02,102 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-09-26 08:25:02,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-09-26 08:25:02,102 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:02,103 INFO L375 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2018-09-26 08:25:02,103 INFO L423 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:02,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:02,103 INFO L82 PathProgramCache]: Analyzing trace with hash 871523488, now seen corresponding path program 94 times [2018-09-26 08:25:02,103 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:02,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:02,419 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:02,419 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:02,419 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-09-26 08:25:02,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-09-26 08:25:02,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-09-26 08:25:02,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-09-26 08:25:02,421 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 97 states. [2018-09-26 08:25:02,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:02,475 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-09-26 08:25:02,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-09-26 08:25:02,475 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2018-09-26 08:25:02,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:02,476 INFO L225 Difference]: With dead ends: 101 [2018-09-26 08:25:02,476 INFO L226 Difference]: Without dead ends: 99 [2018-09-26 08:25:02,476 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-09-26 08:25:02,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-09-26 08:25:02,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-09-26 08:25:02,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-09-26 08:25:02,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-09-26 08:25:02,479 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2018-09-26 08:25:02,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:02,479 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-09-26 08:25:02,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-09-26 08:25:02,479 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-09-26 08:25:02,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-09-26 08:25:02,480 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:02,480 INFO L375 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2018-09-26 08:25:02,480 INFO L423 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:02,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:02,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1247420486, now seen corresponding path program 95 times [2018-09-26 08:25:02,480 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:02,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:02,724 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:02,725 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:02,725 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-09-26 08:25:02,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-09-26 08:25:02,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-09-26 08:25:02,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 08:25:02,726 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 98 states. [2018-09-26 08:25:02,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:02,771 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-09-26 08:25:02,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-09-26 08:25:02,771 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2018-09-26 08:25:02,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:02,771 INFO L225 Difference]: With dead ends: 102 [2018-09-26 08:25:02,771 INFO L226 Difference]: Without dead ends: 100 [2018-09-26 08:25:02,772 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 08:25:02,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-09-26 08:25:02,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-09-26 08:25:02,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-09-26 08:25:02,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-09-26 08:25:02,775 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2018-09-26 08:25:02,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:02,775 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-09-26 08:25:02,776 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-09-26 08:25:02,776 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-09-26 08:25:02,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-09-26 08:25:02,776 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:02,776 INFO L375 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2018-09-26 08:25:02,777 INFO L423 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:02,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:02,777 INFO L82 PathProgramCache]: Analyzing trace with hash 15325536, now seen corresponding path program 96 times [2018-09-26 08:25:02,777 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:02,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:03,027 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:03,028 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:03,028 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-09-26 08:25:03,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-09-26 08:25:03,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-09-26 08:25:03,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-09-26 08:25:03,030 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2018-09-26 08:25:03,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:03,086 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-09-26 08:25:03,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-09-26 08:25:03,087 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2018-09-26 08:25:03,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:03,087 INFO L225 Difference]: With dead ends: 103 [2018-09-26 08:25:03,087 INFO L226 Difference]: Without dead ends: 101 [2018-09-26 08:25:03,088 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-09-26 08:25:03,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-09-26 08:25:03,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-09-26 08:25:03,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-09-26 08:25:03,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-09-26 08:25:03,091 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2018-09-26 08:25:03,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:03,091 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-09-26 08:25:03,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-09-26 08:25:03,091 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-09-26 08:25:03,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-09-26 08:25:03,092 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:03,092 INFO L375 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2018-09-26 08:25:03,092 INFO L423 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:03,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:03,093 INFO L82 PathProgramCache]: Analyzing trace with hash 475087750, now seen corresponding path program 97 times [2018-09-26 08:25:03,093 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:03,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:03,349 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:03,349 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:03,349 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-09-26 08:25:03,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-09-26 08:25:03,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-09-26 08:25:03,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-09-26 08:25:03,351 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 100 states. [2018-09-26 08:25:03,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:03,405 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-09-26 08:25:03,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-09-26 08:25:03,405 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2018-09-26 08:25:03,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:03,405 INFO L225 Difference]: With dead ends: 104 [2018-09-26 08:25:03,406 INFO L226 Difference]: Without dead ends: 102 [2018-09-26 08:25:03,406 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 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:03,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-09-26 08:25:03,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-09-26 08:25:03,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-09-26 08:25:03,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-09-26 08:25:03,409 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2018-09-26 08:25:03,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:03,410 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-09-26 08:25:03,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-09-26 08:25:03,410 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-09-26 08:25:03,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-09-26 08:25:03,410 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:03,410 INFO L375 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2018-09-26 08:25:03,411 INFO L423 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:03,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:03,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1842814496, now seen corresponding path program 98 times [2018-09-26 08:25:03,411 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:03,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:03,697 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:03,698 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:03,698 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-09-26 08:25:03,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-09-26 08:25:03,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-09-26 08:25:03,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-09-26 08:25:03,700 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 101 states. [2018-09-26 08:25:03,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:03,755 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-09-26 08:25:03,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-09-26 08:25:03,756 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2018-09-26 08:25:03,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:03,756 INFO L225 Difference]: With dead ends: 105 [2018-09-26 08:25:03,757 INFO L226 Difference]: Without dead ends: 103 [2018-09-26 08:25:03,757 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 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:03,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-09-26 08:25:03,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-09-26 08:25:03,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-09-26 08:25:03,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-09-26 08:25:03,759 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2018-09-26 08:25:03,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:03,760 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-09-26 08:25:03,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-09-26 08:25:03,760 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-09-26 08:25:03,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-09-26 08:25:03,760 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:03,761 INFO L375 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2018-09-26 08:25:03,761 INFO L423 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:03,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:03,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1292670662, now seen corresponding path program 99 times [2018-09-26 08:25:03,761 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:03,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:04,054 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:04,054 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:04,054 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-09-26 08:25:04,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-09-26 08:25:04,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-09-26 08:25:04,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-09-26 08:25:04,056 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 102 states. [2018-09-26 08:25:04,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:04,115 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-09-26 08:25:04,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-09-26 08:25:04,116 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2018-09-26 08:25:04,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:04,116 INFO L225 Difference]: With dead ends: 106 [2018-09-26 08:25:04,117 INFO L226 Difference]: Without dead ends: 104 [2018-09-26 08:25:04,117 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-09-26 08:25:04,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-09-26 08:25:04,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-09-26 08:25:04,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-09-26 08:25:04,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-09-26 08:25:04,120 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2018-09-26 08:25:04,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:04,120 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-09-26 08:25:04,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-09-26 08:25:04,120 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-09-26 08:25:04,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-09-26 08:25:04,121 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:04,121 INFO L375 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2018-09-26 08:25:04,121 INFO L423 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:04,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:04,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1418080992, now seen corresponding path program 100 times [2018-09-26 08:25:04,122 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:04,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:04,421 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:04,421 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:04,421 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-09-26 08:25:04,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-09-26 08:25:04,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-09-26 08:25:04,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-09-26 08:25:04,423 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 103 states. [2018-09-26 08:25:04,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:04,483 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-09-26 08:25:04,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-09-26 08:25:04,483 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 103 [2018-09-26 08:25:04,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:04,484 INFO L225 Difference]: With dead ends: 107 [2018-09-26 08:25:04,484 INFO L226 Difference]: Without dead ends: 105 [2018-09-26 08:25:04,485 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-09-26 08:25:04,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-09-26 08:25:04,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-09-26 08:25:04,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-09-26 08:25:04,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-09-26 08:25:04,488 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2018-09-26 08:25:04,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:04,488 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-09-26 08:25:04,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-09-26 08:25:04,488 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-09-26 08:25:04,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-09-26 08:25:04,489 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:04,489 INFO L375 BasicCegarLoop]: trace histogram [101, 1, 1, 1] [2018-09-26 08:25:04,489 INFO L423 AbstractCegarLoop]: === Iteration 102 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:04,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:04,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1010833926, now seen corresponding path program 101 times [2018-09-26 08:25:04,490 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:04,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:04,802 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:04,803 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:04,803 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-09-26 08:25:04,803 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-09-26 08:25:04,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-09-26 08:25:04,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-09-26 08:25:04,805 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 104 states. [2018-09-26 08:25:04,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:04,882 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-09-26 08:25:04,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-09-26 08:25:04,882 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 104 [2018-09-26 08:25:04,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:04,883 INFO L225 Difference]: With dead ends: 108 [2018-09-26 08:25:04,883 INFO L226 Difference]: Without dead ends: 106 [2018-09-26 08:25:04,884 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-09-26 08:25:04,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-09-26 08:25:04,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-09-26 08:25:04,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-09-26 08:25:04,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-09-26 08:25:04,887 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2018-09-26 08:25:04,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:04,887 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-09-26 08:25:04,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-09-26 08:25:04,887 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-09-26 08:25:04,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-09-26 08:25:04,888 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:04,888 INFO L375 BasicCegarLoop]: trace histogram [102, 1, 1, 1] [2018-09-26 08:25:04,888 INFO L423 AbstractCegarLoop]: === Iteration 103 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:04,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:04,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1271076768, now seen corresponding path program 102 times [2018-09-26 08:25:04,889 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:04,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:05,175 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:05,175 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:05,175 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2018-09-26 08:25:05,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-09-26 08:25:05,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-09-26 08:25:05,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2018-09-26 08:25:05,177 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 105 states. [2018-09-26 08:25:05,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:05,275 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-09-26 08:25:05,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-09-26 08:25:05,275 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 105 [2018-09-26 08:25:05,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:05,276 INFO L225 Difference]: With dead ends: 109 [2018-09-26 08:25:05,276 INFO L226 Difference]: Without dead ends: 107 [2018-09-26 08:25:05,276 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2018-09-26 08:25:05,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-09-26 08:25:05,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-09-26 08:25:05,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-09-26 08:25:05,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-09-26 08:25:05,279 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2018-09-26 08:25:05,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:05,280 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-09-26 08:25:05,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-09-26 08:25:05,280 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-09-26 08:25:05,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-09-26 08:25:05,280 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:05,280 INFO L375 BasicCegarLoop]: trace histogram [103, 1, 1, 1] [2018-09-26 08:25:05,281 INFO L423 AbstractCegarLoop]: === Iteration 104 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:05,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:05,281 INFO L82 PathProgramCache]: Analyzing trace with hash 748670278, now seen corresponding path program 103 times [2018-09-26 08:25:05,281 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:05,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:05,577 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:05,578 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:05,578 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-09-26 08:25:05,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-09-26 08:25:05,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-09-26 08:25:05,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-09-26 08:25:05,580 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 106 states. [2018-09-26 08:25:05,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:05,695 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2018-09-26 08:25:05,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-09-26 08:25:05,695 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 106 [2018-09-26 08:25:05,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:05,695 INFO L225 Difference]: With dead ends: 110 [2018-09-26 08:25:05,696 INFO L226 Difference]: Without dead ends: 108 [2018-09-26 08:25:05,696 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-09-26 08:25:05,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-09-26 08:25:05,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-09-26 08:25:05,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-09-26 08:25:05,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-09-26 08:25:05,699 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2018-09-26 08:25:05,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:05,700 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-09-26 08:25:05,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-09-26 08:25:05,700 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-09-26 08:25:05,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-09-26 08:25:05,700 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:05,701 INFO L375 BasicCegarLoop]: trace histogram [104, 1, 1, 1] [2018-09-26 08:25:05,701 INFO L423 AbstractCegarLoop]: === Iteration 105 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:05,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:05,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1733938272, now seen corresponding path program 104 times [2018-09-26 08:25:05,701 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:05,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:06,114 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:06,114 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:06,114 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2018-09-26 08:25:06,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-09-26 08:25:06,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-09-26 08:25:06,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2018-09-26 08:25:06,116 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 107 states. [2018-09-26 08:25:06,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:06,185 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-09-26 08:25:06,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-09-26 08:25:06,185 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 107 [2018-09-26 08:25:06,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:06,186 INFO L225 Difference]: With dead ends: 111 [2018-09-26 08:25:06,186 INFO L226 Difference]: Without dead ends: 109 [2018-09-26 08:25:06,187 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 1 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:06,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-09-26 08:25:06,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-09-26 08:25:06,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-09-26 08:25:06,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-09-26 08:25:06,190 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2018-09-26 08:25:06,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:06,190 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-09-26 08:25:06,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-09-26 08:25:06,191 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-09-26 08:25:06,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-09-26 08:25:06,191 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:06,191 INFO L375 BasicCegarLoop]: trace histogram [105, 1, 1, 1] [2018-09-26 08:25:06,192 INFO L423 AbstractCegarLoop]: === Iteration 106 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:06,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:06,192 INFO L82 PathProgramCache]: Analyzing trace with hash -2082492282, now seen corresponding path program 105 times [2018-09-26 08:25:06,192 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:06,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:06,525 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:06,525 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:06,525 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-09-26 08:25:06,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-09-26 08:25:06,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-09-26 08:25:06,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-09-26 08:25:06,528 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 108 states. [2018-09-26 08:25:06,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:06,593 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2018-09-26 08:25:06,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-09-26 08:25:06,593 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 108 [2018-09-26 08:25:06,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:06,593 INFO L225 Difference]: With dead ends: 112 [2018-09-26 08:25:06,594 INFO L226 Difference]: Without dead ends: 110 [2018-09-26 08:25:06,594 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-09-26 08:25:06,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-09-26 08:25:06,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-09-26 08:25:06,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-09-26 08:25:06,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-09-26 08:25:06,598 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2018-09-26 08:25:06,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:06,599 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-09-26 08:25:06,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-09-26 08:25:06,599 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-09-26 08:25:06,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-09-26 08:25:06,600 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:06,600 INFO L375 BasicCegarLoop]: trace histogram [106, 1, 1, 1] [2018-09-26 08:25:06,600 INFO L423 AbstractCegarLoop]: === Iteration 107 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:06,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:06,600 INFO L82 PathProgramCache]: Analyzing trace with hash -132755168, now seen corresponding path program 106 times [2018-09-26 08:25:06,600 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:06,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:06,986 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:06,986 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:06,986 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2018-09-26 08:25:06,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-09-26 08:25:06,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-09-26 08:25:06,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2018-09-26 08:25:06,988 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 109 states. [2018-09-26 08:25:07,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:07,098 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-09-26 08:25:07,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-09-26 08:25:07,098 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 109 [2018-09-26 08:25:07,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:07,098 INFO L225 Difference]: With dead ends: 113 [2018-09-26 08:25:07,098 INFO L226 Difference]: Without dead ends: 111 [2018-09-26 08:25:07,099 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2018-09-26 08:25:07,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-09-26 08:25:07,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-09-26 08:25:07,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-09-26 08:25:07,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-09-26 08:25:07,102 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2018-09-26 08:25:07,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:07,103 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-09-26 08:25:07,103 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-09-26 08:25:07,103 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-09-26 08:25:07,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-09-26 08:25:07,104 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:07,104 INFO L375 BasicCegarLoop]: trace histogram [107, 1, 1, 1] [2018-09-26 08:25:07,104 INFO L423 AbstractCegarLoop]: === Iteration 108 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:07,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:07,104 INFO L82 PathProgramCache]: Analyzing trace with hash 179553222, now seen corresponding path program 107 times [2018-09-26 08:25:07,104 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:07,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:07,427 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:07,427 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:07,427 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-09-26 08:25:07,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-09-26 08:25:07,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-09-26 08:25:07,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-09-26 08:25:07,430 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 110 states. [2018-09-26 08:25:07,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:07,554 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-09-26 08:25:07,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-09-26 08:25:07,554 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 110 [2018-09-26 08:25:07,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:07,555 INFO L225 Difference]: With dead ends: 114 [2018-09-26 08:25:07,555 INFO L226 Difference]: Without dead ends: 112 [2018-09-26 08:25:07,556 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-09-26 08:25:07,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-09-26 08:25:07,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-09-26 08:25:07,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-09-26 08:25:07,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-09-26 08:25:07,559 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2018-09-26 08:25:07,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:07,560 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-09-26 08:25:07,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-09-26 08:25:07,560 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-09-26 08:25:07,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-09-26 08:25:07,560 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:07,561 INFO L375 BasicCegarLoop]: trace histogram [108, 1, 1, 1] [2018-09-26 08:25:07,561 INFO L423 AbstractCegarLoop]: === Iteration 109 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:07,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:07,561 INFO L82 PathProgramCache]: Analyzing trace with hash 1271178720, now seen corresponding path program 108 times [2018-09-26 08:25:07,561 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:07,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:07,916 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:07,916 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:07,916 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2018-09-26 08:25:07,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-09-26 08:25:07,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-09-26 08:25:07,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2018-09-26 08:25:07,919 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 111 states. [2018-09-26 08:25:08,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:08,020 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-09-26 08:25:08,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-09-26 08:25:08,020 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 111 [2018-09-26 08:25:08,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:08,021 INFO L225 Difference]: With dead ends: 115 [2018-09-26 08:25:08,021 INFO L226 Difference]: Without dead ends: 113 [2018-09-26 08:25:08,022 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2018-09-26 08:25:08,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-09-26 08:25:08,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-09-26 08:25:08,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-09-26 08:25:08,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-09-26 08:25:08,024 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2018-09-26 08:25:08,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:08,025 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-09-26 08:25:08,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-09-26 08:25:08,025 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-09-26 08:25:08,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-09-26 08:25:08,025 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:08,026 INFO L375 BasicCegarLoop]: trace histogram [109, 1, 1, 1] [2018-09-26 08:25:08,026 INFO L423 AbstractCegarLoop]: === Iteration 110 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:08,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:08,026 INFO L82 PathProgramCache]: Analyzing trace with hash 751830790, now seen corresponding path program 109 times [2018-09-26 08:25:08,026 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:08,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:08,362 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:08,363 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:08,363 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-09-26 08:25:08,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-09-26 08:25:08,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-09-26 08:25:08,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-09-26 08:25:08,365 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 112 states. [2018-09-26 08:25:08,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:08,506 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2018-09-26 08:25:08,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-09-26 08:25:08,507 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 112 [2018-09-26 08:25:08,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:08,507 INFO L225 Difference]: With dead ends: 116 [2018-09-26 08:25:08,508 INFO L226 Difference]: Without dead ends: 114 [2018-09-26 08:25:08,508 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-09-26 08:25:08,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-09-26 08:25:08,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-09-26 08:25:08,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-09-26 08:25:08,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2018-09-26 08:25:08,512 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2018-09-26 08:25:08,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:08,512 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2018-09-26 08:25:08,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-09-26 08:25:08,512 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2018-09-26 08:25:08,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-09-26 08:25:08,513 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:08,513 INFO L375 BasicCegarLoop]: trace histogram [110, 1, 1, 1] [2018-09-26 08:25:08,514 INFO L423 AbstractCegarLoop]: === Iteration 111 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:08,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:08,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1831914144, now seen corresponding path program 110 times [2018-09-26 08:25:08,514 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:08,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:08,951 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:08,952 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:08,952 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2018-09-26 08:25:08,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-09-26 08:25:08,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-09-26 08:25:08,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2018-09-26 08:25:08,954 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 113 states. [2018-09-26 08:25:09,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:09,040 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-09-26 08:25:09,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-09-26 08:25:09,040 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 113 [2018-09-26 08:25:09,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:09,041 INFO L225 Difference]: With dead ends: 117 [2018-09-26 08:25:09,041 INFO L226 Difference]: Without dead ends: 115 [2018-09-26 08:25:09,042 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 1 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:09,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-09-26 08:25:09,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-09-26 08:25:09,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-09-26 08:25:09,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-09-26 08:25:09,046 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 113 [2018-09-26 08:25:09,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:09,046 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-09-26 08:25:09,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-09-26 08:25:09,046 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-09-26 08:25:09,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-09-26 08:25:09,047 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:09,047 INFO L375 BasicCegarLoop]: trace histogram [111, 1, 1, 1] [2018-09-26 08:25:09,047 INFO L423 AbstractCegarLoop]: === Iteration 112 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:09,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:09,048 INFO L82 PathProgramCache]: Analyzing trace with hash 954759750, now seen corresponding path program 111 times [2018-09-26 08:25:09,048 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:09,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:09,624 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:09,625 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:09,625 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-09-26 08:25:09,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-09-26 08:25:09,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-09-26 08:25:09,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-09-26 08:25:09,627 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 114 states. [2018-09-26 08:25:09,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:09,859 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2018-09-26 08:25:09,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-09-26 08:25:09,859 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 114 [2018-09-26 08:25:09,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:09,860 INFO L225 Difference]: With dead ends: 118 [2018-09-26 08:25:09,860 INFO L226 Difference]: Without dead ends: 116 [2018-09-26 08:25:09,860 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-09-26 08:25:09,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-09-26 08:25:09,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-09-26 08:25:09,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-09-26 08:25:09,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2018-09-26 08:25:09,864 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 114 [2018-09-26 08:25:09,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:09,864 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2018-09-26 08:25:09,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-09-26 08:25:09,864 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2018-09-26 08:25:09,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-09-26 08:25:09,865 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:09,865 INFO L375 BasicCegarLoop]: trace histogram [112, 1, 1, 1] [2018-09-26 08:25:09,865 INFO L423 AbstractCegarLoop]: === Iteration 113 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:09,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:09,865 INFO L82 PathProgramCache]: Analyzing trace with hash -467222688, now seen corresponding path program 112 times [2018-09-26 08:25:09,866 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:09,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:10,292 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:10,292 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:10,292 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2018-09-26 08:25:10,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-09-26 08:25:10,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-09-26 08:25:10,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2018-09-26 08:25:10,295 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 115 states. [2018-09-26 08:25:10,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:10,426 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-09-26 08:25:10,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-09-26 08:25:10,427 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 115 [2018-09-26 08:25:10,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:10,427 INFO L225 Difference]: With dead ends: 119 [2018-09-26 08:25:10,427 INFO L226 Difference]: Without dead ends: 117 [2018-09-26 08:25:10,428 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 1 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:10,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-09-26 08:25:10,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-09-26 08:25:10,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-09-26 08:25:10,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-09-26 08:25:10,431 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 115 [2018-09-26 08:25:10,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:10,431 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-09-26 08:25:10,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-09-26 08:25:10,431 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-09-26 08:25:10,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-09-26 08:25:10,432 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:10,432 INFO L375 BasicCegarLoop]: trace histogram [113, 1, 1, 1] [2018-09-26 08:25:10,432 INFO L423 AbstractCegarLoop]: === Iteration 114 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:10,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:10,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1599005306, now seen corresponding path program 113 times [2018-09-26 08:25:10,432 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:10,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:10,793 INFO L134 CoverageAnalysis]: Checked inductivity of 6441 backedges. 0 proven. 6441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:10,793 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:10,793 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-09-26 08:25:10,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-09-26 08:25:10,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-09-26 08:25:10,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-09-26 08:25:10,795 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 116 states. [2018-09-26 08:25:10,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:10,902 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2018-09-26 08:25:10,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-09-26 08:25:10,903 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 116 [2018-09-26 08:25:10,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:10,903 INFO L225 Difference]: With dead ends: 120 [2018-09-26 08:25:10,903 INFO L226 Difference]: Without dead ends: 118 [2018-09-26 08:25:10,904 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-09-26 08:25:10,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-09-26 08:25:10,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-09-26 08:25:10,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-09-26 08:25:10,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2018-09-26 08:25:10,907 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 116 [2018-09-26 08:25:10,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:10,908 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2018-09-26 08:25:10,908 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-09-26 08:25:10,908 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2018-09-26 08:25:10,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-09-26 08:25:10,908 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:10,909 INFO L375 BasicCegarLoop]: trace histogram [114, 1, 1, 1] [2018-09-26 08:25:10,909 INFO L423 AbstractCegarLoop]: === Iteration 115 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:10,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:10,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1970439200, now seen corresponding path program 114 times [2018-09-26 08:25:10,909 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:10,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:11,300 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:11,301 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:11,301 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2018-09-26 08:25:11,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-09-26 08:25:11,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-09-26 08:25:11,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2018-09-26 08:25:11,303 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 117 states. [2018-09-26 08:25:11,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:11,437 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-09-26 08:25:11,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-09-26 08:25:11,437 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 117 [2018-09-26 08:25:11,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:11,438 INFO L225 Difference]: With dead ends: 121 [2018-09-26 08:25:11,438 INFO L226 Difference]: Without dead ends: 119 [2018-09-26 08:25:11,439 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2018-09-26 08:25:11,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-09-26 08:25:11,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-09-26 08:25:11,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-09-26 08:25:11,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2018-09-26 08:25:11,442 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 117 [2018-09-26 08:25:11,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:11,442 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2018-09-26 08:25:11,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-09-26 08:25:11,443 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2018-09-26 08:25:11,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-09-26 08:25:11,443 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:11,443 INFO L375 BasicCegarLoop]: trace histogram [115, 1, 1, 1] [2018-09-26 08:25:11,444 INFO L423 AbstractCegarLoop]: === Iteration 116 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:11,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:11,444 INFO L82 PathProgramCache]: Analyzing trace with hash 954069190, now seen corresponding path program 115 times [2018-09-26 08:25:11,444 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:11,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:11,998 INFO L134 CoverageAnalysis]: Checked inductivity of 6670 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:11,998 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:11,998 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-09-26 08:25:11,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-09-26 08:25:12,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-09-26 08:25:12,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-09-26 08:25:12,000 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 118 states. [2018-09-26 08:25:12,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:12,164 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2018-09-26 08:25:12,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-09-26 08:25:12,164 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 118 [2018-09-26 08:25:12,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:12,164 INFO L225 Difference]: With dead ends: 122 [2018-09-26 08:25:12,165 INFO L226 Difference]: Without dead ends: 120 [2018-09-26 08:25:12,166 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-09-26 08:25:12,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-09-26 08:25:12,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-09-26 08:25:12,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-09-26 08:25:12,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2018-09-26 08:25:12,170 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 118 [2018-09-26 08:25:12,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:12,171 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2018-09-26 08:25:12,171 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-09-26 08:25:12,171 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2018-09-26 08:25:12,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-09-26 08:25:12,171 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:12,171 INFO L375 BasicCegarLoop]: trace histogram [116, 1, 1, 1] [2018-09-26 08:25:12,172 INFO L423 AbstractCegarLoop]: === Iteration 117 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:12,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:12,172 INFO L82 PathProgramCache]: Analyzing trace with hash -488630048, now seen corresponding path program 116 times [2018-09-26 08:25:12,172 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:12,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:12,622 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:12,623 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:12,623 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2018-09-26 08:25:12,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-09-26 08:25:12,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-09-26 08:25:12,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2018-09-26 08:25:12,626 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 119 states. [2018-09-26 08:25:12,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:12,758 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-09-26 08:25:12,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-09-26 08:25:12,758 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 119 [2018-09-26 08:25:12,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:12,759 INFO L225 Difference]: With dead ends: 123 [2018-09-26 08:25:12,759 INFO L226 Difference]: Without dead ends: 121 [2018-09-26 08:25:12,760 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2018-09-26 08:25:12,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-09-26 08:25:12,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-09-26 08:25:12,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-09-26 08:25:12,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-09-26 08:25:12,764 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 119 [2018-09-26 08:25:12,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:12,765 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-09-26 08:25:12,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-09-26 08:25:12,765 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-09-26 08:25:12,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-09-26 08:25:12,766 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:12,766 INFO L375 BasicCegarLoop]: trace histogram [117, 1, 1, 1] [2018-09-26 08:25:12,766 INFO L423 AbstractCegarLoop]: === Iteration 118 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:12,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:12,766 INFO L82 PathProgramCache]: Analyzing trace with hash 2032333830, now seen corresponding path program 117 times [2018-09-26 08:25:12,766 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:12,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:13,199 INFO L134 CoverageAnalysis]: Checked inductivity of 6903 backedges. 0 proven. 6903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:13,200 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:13,200 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-09-26 08:25:13,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-09-26 08:25:13,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-09-26 08:25:13,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-09-26 08:25:13,202 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 120 states. [2018-09-26 08:25:13,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:13,355 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2018-09-26 08:25:13,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-09-26 08:25:13,355 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 120 [2018-09-26 08:25:13,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:13,356 INFO L225 Difference]: With dead ends: 124 [2018-09-26 08:25:13,356 INFO L226 Difference]: Without dead ends: 122 [2018-09-26 08:25:13,357 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-09-26 08:25:13,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-09-26 08:25:13,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-09-26 08:25:13,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-09-26 08:25:13,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2018-09-26 08:25:13,360 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 120 [2018-09-26 08:25:13,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:13,360 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2018-09-26 08:25:13,360 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-09-26 08:25:13,361 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2018-09-26 08:25:13,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-09-26 08:25:13,361 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:13,361 INFO L375 BasicCegarLoop]: trace histogram [118, 1, 1, 1] [2018-09-26 08:25:13,361 INFO L423 AbstractCegarLoop]: === Iteration 119 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:13,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:13,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1422164576, now seen corresponding path program 118 times [2018-09-26 08:25:13,362 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:13,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:13,899 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:13,899 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:13,899 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [120] total 120 [2018-09-26 08:25:13,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-09-26 08:25:13,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-09-26 08:25:13,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7260, Invalid=7260, Unknown=0, NotChecked=0, Total=14520 [2018-09-26 08:25:13,901 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 121 states. [2018-09-26 08:25:14,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:14,037 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2018-09-26 08:25:14,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-09-26 08:25:14,037 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 121 [2018-09-26 08:25:14,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:14,038 INFO L225 Difference]: With dead ends: 125 [2018-09-26 08:25:14,038 INFO L226 Difference]: Without dead ends: 123 [2018-09-26 08:25:14,039 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=7260, Invalid=7260, Unknown=0, NotChecked=0, Total=14520 [2018-09-26 08:25:14,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-09-26 08:25:14,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-09-26 08:25:14,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-09-26 08:25:14,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-09-26 08:25:14,042 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 121 [2018-09-26 08:25:14,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:14,042 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-09-26 08:25:14,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-09-26 08:25:14,043 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-09-26 08:25:14,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-09-26 08:25:14,043 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:14,043 INFO L375 BasicCegarLoop]: trace histogram [119, 1, 1, 1] [2018-09-26 08:25:14,043 INFO L423 AbstractCegarLoop]: === Iteration 120 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:14,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:14,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1137432762, now seen corresponding path program 119 times [2018-09-26 08:25:14,044 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:14,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:14,491 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:25:14,492 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:14,492 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-09-26 08:25:14,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-09-26 08:25:14,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-09-26 08:25:14,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-09-26 08:25:14,494 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 122 states. [2018-09-26 08:25:14,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:14,570 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2018-09-26 08:25:14,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-09-26 08:25:14,570 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 122 [2018-09-26 08:25:14,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:14,571 INFO L225 Difference]: With dead ends: 126 [2018-09-26 08:25:14,571 INFO L226 Difference]: Without dead ends: 124 [2018-09-26 08:25:14,572 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-09-26 08:25:14,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-09-26 08:25:14,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-09-26 08:25:14,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-09-26 08:25:14,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2018-09-26 08:25:14,576 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 122 [2018-09-26 08:25:14,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:14,576 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2018-09-26 08:25:14,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-09-26 08:25:14,576 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2018-09-26 08:25:14,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-09-26 08:25:14,577 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:14,577 INFO L375 BasicCegarLoop]: trace histogram [120, 1, 1, 1] [2018-09-26 08:25:14,577 INFO L423 AbstractCegarLoop]: === Iteration 121 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:14,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:14,577 INFO L82 PathProgramCache]: Analyzing trace with hash -900681120, now seen corresponding path program 120 times [2018-09-26 08:25:14,577 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:14,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:15,180 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:15,180 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:15,180 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [122] total 122 [2018-09-26 08:25:15,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-09-26 08:25:15,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-09-26 08:25:15,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7503, Invalid=7503, Unknown=0, NotChecked=0, Total=15006 [2018-09-26 08:25:15,182 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 123 states. [2018-09-26 08:25:15,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:15,326 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-09-26 08:25:15,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-09-26 08:25:15,326 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 123 [2018-09-26 08:25:15,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:15,327 INFO L225 Difference]: With dead ends: 127 [2018-09-26 08:25:15,327 INFO L226 Difference]: Without dead ends: 125 [2018-09-26 08:25:15,328 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 1 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:15,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-09-26 08:25:15,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-09-26 08:25:15,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-09-26 08:25:15,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-09-26 08:25:15,331 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 123 [2018-09-26 08:25:15,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:15,332 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-09-26 08:25:15,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-09-26 08:25:15,332 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-09-26 08:25:15,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-09-26 08:25:15,332 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:15,332 INFO L375 BasicCegarLoop]: trace histogram [121, 1, 1, 1] [2018-09-26 08:25:15,333 INFO L423 AbstractCegarLoop]: === Iteration 122 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:15,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:15,333 INFO L82 PathProgramCache]: Analyzing trace with hash 2143652486, now seen corresponding path program 121 times [2018-09-26 08:25:15,333 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:15,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:15,755 INFO L134 CoverageAnalysis]: Checked inductivity of 7381 backedges. 0 proven. 7381 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:15,755 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:15,755 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-09-26 08:25:15,756 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-09-26 08:25:15,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-09-26 08:25:15,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-09-26 08:25:15,757 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 124 states. [2018-09-26 08:25:15,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:15,886 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2018-09-26 08:25:15,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2018-09-26 08:25:15,886 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 124 [2018-09-26 08:25:15,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:15,887 INFO L225 Difference]: With dead ends: 128 [2018-09-26 08:25:15,887 INFO L226 Difference]: Without dead ends: 126 [2018-09-26 08:25:15,888 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-09-26 08:25:15,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-09-26 08:25:15,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-09-26 08:25:15,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-09-26 08:25:15,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2018-09-26 08:25:15,891 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 124 [2018-09-26 08:25:15,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:15,891 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2018-09-26 08:25:15,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-09-26 08:25:15,891 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2018-09-26 08:25:15,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-09-26 08:25:15,892 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:15,892 INFO L375 BasicCegarLoop]: trace histogram [122, 1, 1, 1] [2018-09-26 08:25:15,892 INFO L423 AbstractCegarLoop]: === Iteration 123 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:15,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:15,893 INFO L82 PathProgramCache]: Analyzing trace with hash 2028713760, now seen corresponding path program 122 times [2018-09-26 08:25:15,893 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:15,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:16,579 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:16,580 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:16,580 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [124] total 124 [2018-09-26 08:25:16,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-09-26 08:25:16,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-09-26 08:25:16,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7750, Invalid=7750, Unknown=0, NotChecked=0, Total=15500 [2018-09-26 08:25:16,583 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 125 states. [2018-09-26 08:25:16,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:16,908 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-09-26 08:25:16,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-09-26 08:25:16,909 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 125 [2018-09-26 08:25:16,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:16,909 INFO L225 Difference]: With dead ends: 129 [2018-09-26 08:25:16,909 INFO L226 Difference]: Without dead ends: 127 [2018-09-26 08:25:16,911 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 1 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:16,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-09-26 08:25:16,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-09-26 08:25:16,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-09-26 08:25:16,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2018-09-26 08:25:16,914 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 125 [2018-09-26 08:25:16,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:16,914 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2018-09-26 08:25:16,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-09-26 08:25:16,914 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2018-09-26 08:25:16,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-09-26 08:25:16,915 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:16,915 INFO L375 BasicCegarLoop]: trace histogram [123, 1, 1, 1] [2018-09-26 08:25:16,915 INFO L423 AbstractCegarLoop]: === Iteration 124 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:16,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:16,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1534386746, now seen corresponding path program 123 times [2018-09-26 08:25:16,916 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:16,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:17,357 INFO L134 CoverageAnalysis]: Checked inductivity of 7626 backedges. 0 proven. 7626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:17,357 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:17,357 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-09-26 08:25:17,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-09-26 08:25:17,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-09-26 08:25:17,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-09-26 08:25:17,359 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 126 states. [2018-09-26 08:25:17,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:17,475 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2018-09-26 08:25:17,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-09-26 08:25:17,475 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 126 [2018-09-26 08:25:17,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:17,476 INFO L225 Difference]: With dead ends: 130 [2018-09-26 08:25:17,476 INFO L226 Difference]: Without dead ends: 128 [2018-09-26 08:25:17,477 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-09-26 08:25:17,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-09-26 08:25:17,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-09-26 08:25:17,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-09-26 08:25:17,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2018-09-26 08:25:17,479 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 126 [2018-09-26 08:25:17,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:17,480 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2018-09-26 08:25:17,480 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-09-26 08:25:17,480 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2018-09-26 08:25:17,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-09-26 08:25:17,481 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:17,481 INFO L375 BasicCegarLoop]: trace histogram [124, 1, 1, 1] [2018-09-26 08:25:17,481 INFO L423 AbstractCegarLoop]: === Iteration 125 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:17,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:17,481 INFO L82 PathProgramCache]: Analyzing trace with hash -321352736, now seen corresponding path program 124 times [2018-09-26 08:25:17,481 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:17,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:17,953 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:17,953 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:17,953 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [126] total 126 [2018-09-26 08:25:17,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-09-26 08:25:17,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-09-26 08:25:17,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8001, Invalid=8001, Unknown=0, NotChecked=0, Total=16002 [2018-09-26 08:25:17,955 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 127 states. [2018-09-26 08:25:18,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:18,152 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-09-26 08:25:18,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-09-26 08:25:18,152 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 127 [2018-09-26 08:25:18,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:18,153 INFO L225 Difference]: With dead ends: 131 [2018-09-26 08:25:18,153 INFO L226 Difference]: Without dead ends: 129 [2018-09-26 08:25:18,154 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8001, Invalid=8001, Unknown=0, NotChecked=0, Total=16002 [2018-09-26 08:25:18,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-09-26 08:25:18,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-09-26 08:25:18,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-09-26 08:25:18,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-09-26 08:25:18,157 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 127 [2018-09-26 08:25:18,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:18,157 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-09-26 08:25:18,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-09-26 08:25:18,157 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-09-26 08:25:18,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-09-26 08:25:18,158 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:18,158 INFO L375 BasicCegarLoop]: trace histogram [125, 1, 1, 1] [2018-09-26 08:25:18,158 INFO L423 AbstractCegarLoop]: === Iteration 126 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:18,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:18,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1372004090, now seen corresponding path program 125 times [2018-09-26 08:25:18,158 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:18,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:18,557 INFO L134 CoverageAnalysis]: Checked inductivity of 7875 backedges. 0 proven. 7875 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:18,558 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:18,558 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-09-26 08:25:18,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-09-26 08:25:18,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-09-26 08:25:18,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-09-26 08:25:18,560 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 128 states. [2018-09-26 08:25:18,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:18,655 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2018-09-26 08:25:18,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-09-26 08:25:18,656 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 128 [2018-09-26 08:25:18,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:18,656 INFO L225 Difference]: With dead ends: 132 [2018-09-26 08:25:18,656 INFO L226 Difference]: Without dead ends: 130 [2018-09-26 08:25:18,657 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-09-26 08:25:18,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-09-26 08:25:18,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-09-26 08:25:18,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-09-26 08:25:18,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2018-09-26 08:25:18,660 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 128 [2018-09-26 08:25:18,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:18,660 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2018-09-26 08:25:18,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-09-26 08:25:18,660 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2018-09-26 08:25:18,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-09-26 08:25:18,661 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:18,661 INFO L375 BasicCegarLoop]: trace histogram [126, 1, 1, 1] [2018-09-26 08:25:18,661 INFO L423 AbstractCegarLoop]: === Iteration 127 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:18,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:18,661 INFO L82 PathProgramCache]: Analyzing trace with hash 417542304, now seen corresponding path program 126 times [2018-09-26 08:25:18,662 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:18,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:19,121 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:19,121 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:19,121 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [128] total 128 [2018-09-26 08:25:19,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-09-26 08:25:19,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-09-26 08:25:19,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8256, Invalid=8256, Unknown=0, NotChecked=0, Total=16512 [2018-09-26 08:25:19,124 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 129 states. [2018-09-26 08:25:19,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:19,339 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2018-09-26 08:25:19,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-09-26 08:25:19,339 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 129 [2018-09-26 08:25:19,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:19,340 INFO L225 Difference]: With dead ends: 133 [2018-09-26 08:25:19,340 INFO L226 Difference]: Without dead ends: 131 [2018-09-26 08:25:19,341 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8256, Invalid=8256, Unknown=0, NotChecked=0, Total=16512 [2018-09-26 08:25:19,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-09-26 08:25:19,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-09-26 08:25:19,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-09-26 08:25:19,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-09-26 08:25:19,345 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 129 [2018-09-26 08:25:19,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:19,345 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-09-26 08:25:19,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-09-26 08:25:19,345 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-09-26 08:25:19,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-09-26 08:25:19,346 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:19,346 INFO L375 BasicCegarLoop]: trace histogram [127, 1, 1, 1] [2018-09-26 08:25:19,347 INFO L423 AbstractCegarLoop]: === Iteration 128 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:19,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:19,347 INFO L82 PathProgramCache]: Analyzing trace with hash 58905670, now seen corresponding path program 127 times [2018-09-26 08:25:19,347 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:19,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:20,085 INFO L134 CoverageAnalysis]: Checked inductivity of 8128 backedges. 0 proven. 8128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:20,085 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:20,085 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-09-26 08:25:20,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-09-26 08:25:20,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-09-26 08:25:20,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-09-26 08:25:20,094 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 130 states. [2018-09-26 08:25:20,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:20,235 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2018-09-26 08:25:20,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-09-26 08:25:20,236 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 130 [2018-09-26 08:25:20,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:20,236 INFO L225 Difference]: With dead ends: 134 [2018-09-26 08:25:20,236 INFO L226 Difference]: Without dead ends: 132 [2018-09-26 08:25:20,237 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 1 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:20,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-09-26 08:25:20,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-09-26 08:25:20,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-09-26 08:25:20,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2018-09-26 08:25:20,242 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 130 [2018-09-26 08:25:20,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:20,243 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2018-09-26 08:25:20,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-09-26 08:25:20,243 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2018-09-26 08:25:20,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-09-26 08:25:20,245 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:20,245 INFO L375 BasicCegarLoop]: trace histogram [128, 1, 1, 1] [2018-09-26 08:25:20,245 INFO L423 AbstractCegarLoop]: === Iteration 129 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:20,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:20,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1826071904, now seen corresponding path program 128 times [2018-09-26 08:25:20,245 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:20,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:20,719 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:20,719 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:20,720 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [130] total 130 [2018-09-26 08:25:20,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-09-26 08:25:20,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-09-26 08:25:20,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8515, Invalid=8515, Unknown=0, NotChecked=0, Total=17030 [2018-09-26 08:25:20,722 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 131 states. [2018-09-26 08:25:20,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:20,906 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-09-26 08:25:20,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-09-26 08:25:20,906 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 131 [2018-09-26 08:25:20,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:20,907 INFO L225 Difference]: With dead ends: 135 [2018-09-26 08:25:20,907 INFO L226 Difference]: Without dead ends: 133 [2018-09-26 08:25:20,908 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8515, Invalid=8515, Unknown=0, NotChecked=0, Total=17030 [2018-09-26 08:25:20,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-09-26 08:25:20,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-09-26 08:25:20,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-09-26 08:25:20,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-09-26 08:25:20,911 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 131 [2018-09-26 08:25:20,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:20,911 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-09-26 08:25:20,911 INFO L481 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-09-26 08:25:20,911 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-09-26 08:25:20,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-09-26 08:25:20,912 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:20,912 INFO L375 BasicCegarLoop]: trace histogram [129, 1, 1, 1] [2018-09-26 08:25:20,912 INFO L423 AbstractCegarLoop]: === Iteration 130 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:20,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:20,913 INFO L82 PathProgramCache]: Analyzing trace with hash 773650310, now seen corresponding path program 129 times [2018-09-26 08:25:20,913 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:20,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:21,378 INFO L134 CoverageAnalysis]: Checked inductivity of 8385 backedges. 0 proven. 8385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:21,379 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:21,379 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-09-26 08:25:21,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-09-26 08:25:21,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-09-26 08:25:21,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-09-26 08:25:21,381 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 132 states. [2018-09-26 08:25:21,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:21,585 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2018-09-26 08:25:21,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-09-26 08:25:21,585 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 132 [2018-09-26 08:25:21,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:21,586 INFO L225 Difference]: With dead ends: 136 [2018-09-26 08:25:21,586 INFO L226 Difference]: Without dead ends: 134 [2018-09-26 08:25:21,587 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-09-26 08:25:21,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-09-26 08:25:21,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-09-26 08:25:21,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-09-26 08:25:21,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 134 transitions. [2018-09-26 08:25:21,590 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 134 transitions. Word has length 132 [2018-09-26 08:25:21,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:21,590 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 134 transitions. [2018-09-26 08:25:21,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-09-26 08:25:21,590 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2018-09-26 08:25:21,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-09-26 08:25:21,591 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:21,591 INFO L375 BasicCegarLoop]: trace histogram [130, 1, 1, 1] [2018-09-26 08:25:21,591 INFO L423 AbstractCegarLoop]: === Iteration 131 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:21,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:21,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1786648032, now seen corresponding path program 130 times [2018-09-26 08:25:21,591 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:21,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:22,077 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:22,077 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:22,077 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [132] total 132 [2018-09-26 08:25:22,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-09-26 08:25:22,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-09-26 08:25:22,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8778, Invalid=8778, Unknown=0, NotChecked=0, Total=17556 [2018-09-26 08:25:22,080 INFO L87 Difference]: Start difference. First operand 134 states and 134 transitions. Second operand 133 states. [2018-09-26 08:25:22,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:22,234 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2018-09-26 08:25:22,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-09-26 08:25:22,234 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 133 [2018-09-26 08:25:22,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:22,235 INFO L225 Difference]: With dead ends: 137 [2018-09-26 08:25:22,235 INFO L226 Difference]: Without dead ends: 135 [2018-09-26 08:25:22,236 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8778, Invalid=8778, Unknown=0, NotChecked=0, Total=17556 [2018-09-26 08:25:22,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-09-26 08:25:22,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-09-26 08:25:22,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-09-26 08:25:22,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2018-09-26 08:25:22,239 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 133 [2018-09-26 08:25:22,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:22,239 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2018-09-26 08:25:22,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-09-26 08:25:22,239 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2018-09-26 08:25:22,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-09-26 08:25:22,240 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:22,240 INFO L375 BasicCegarLoop]: trace histogram [131, 1, 1, 1] [2018-09-26 08:25:22,240 INFO L423 AbstractCegarLoop]: === Iteration 132 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:22,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:22,241 INFO L82 PathProgramCache]: Analyzing trace with hash 448481990, now seen corresponding path program 131 times [2018-09-26 08:25:22,241 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:22,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:22,687 INFO L134 CoverageAnalysis]: Checked inductivity of 8646 backedges. 0 proven. 8646 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:22,687 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:22,687 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-09-26 08:25:22,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-09-26 08:25:22,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-09-26 08:25:22,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-09-26 08:25:22,689 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 134 states. [2018-09-26 08:25:22,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:22,866 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2018-09-26 08:25:22,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-09-26 08:25:22,866 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 134 [2018-09-26 08:25:22,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:22,866 INFO L225 Difference]: With dead ends: 138 [2018-09-26 08:25:22,866 INFO L226 Difference]: Without dead ends: 136 [2018-09-26 08:25:22,867 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-09-26 08:25:22,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-09-26 08:25:22,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-09-26 08:25:22,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-09-26 08:25:22,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2018-09-26 08:25:22,870 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 134 [2018-09-26 08:25:22,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:22,870 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2018-09-26 08:25:22,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-09-26 08:25:22,870 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2018-09-26 08:25:22,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-09-26 08:25:22,871 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:22,871 INFO L375 BasicCegarLoop]: trace histogram [132, 1, 1, 1] [2018-09-26 08:25:22,871 INFO L423 AbstractCegarLoop]: === Iteration 133 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:22,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:22,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1018035936, now seen corresponding path program 132 times [2018-09-26 08:25:22,872 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:22,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:23,405 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:23,405 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:23,406 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [134] total 134 [2018-09-26 08:25:23,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-09-26 08:25:23,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-09-26 08:25:23,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9045, Invalid=9045, Unknown=0, NotChecked=0, Total=18090 [2018-09-26 08:25:23,408 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 135 states. [2018-09-26 08:25:23,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:23,596 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-09-26 08:25:23,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-09-26 08:25:23,596 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 135 [2018-09-26 08:25:23,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:23,596 INFO L225 Difference]: With dead ends: 139 [2018-09-26 08:25:23,597 INFO L226 Difference]: Without dead ends: 137 [2018-09-26 08:25:23,598 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9045, Invalid=9045, Unknown=0, NotChecked=0, Total=18090 [2018-09-26 08:25:23,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-09-26 08:25:23,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-09-26 08:25:23,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-09-26 08:25:23,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-09-26 08:25:23,601 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 135 [2018-09-26 08:25:23,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:23,601 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-09-26 08:25:23,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-09-26 08:25:23,601 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-09-26 08:25:23,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-09-26 08:25:23,602 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:23,602 INFO L375 BasicCegarLoop]: trace histogram [133, 1, 1, 1] [2018-09-26 08:25:23,602 INFO L423 AbstractCegarLoop]: === Iteration 134 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:23,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:23,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1494339078, now seen corresponding path program 133 times [2018-09-26 08:25:23,603 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:23,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:24,108 INFO L134 CoverageAnalysis]: Checked inductivity of 8911 backedges. 0 proven. 8911 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:24,109 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:24,109 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-09-26 08:25:24,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-09-26 08:25:24,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-09-26 08:25:24,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-09-26 08:25:24,112 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 136 states. [2018-09-26 08:25:24,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:24,288 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2018-09-26 08:25:24,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2018-09-26 08:25:24,289 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 136 [2018-09-26 08:25:24,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:24,289 INFO L225 Difference]: With dead ends: 140 [2018-09-26 08:25:24,289 INFO L226 Difference]: Without dead ends: 138 [2018-09-26 08:25:24,291 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-09-26 08:25:24,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-09-26 08:25:24,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-09-26 08:25:24,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-09-26 08:25:24,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2018-09-26 08:25:24,294 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 136 [2018-09-26 08:25:24,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:24,294 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 138 transitions. [2018-09-26 08:25:24,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-09-26 08:25:24,294 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2018-09-26 08:25:24,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-09-26 08:25:24,295 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:24,295 INFO L375 BasicCegarLoop]: trace histogram [134, 1, 1, 1] [2018-09-26 08:25:24,295 INFO L423 AbstractCegarLoop]: === Iteration 135 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:24,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:24,295 INFO L82 PathProgramCache]: Analyzing trace with hash -920132704, now seen corresponding path program 134 times [2018-09-26 08:25:24,296 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:24,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:24,936 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:24,936 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:24,936 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [136] total 136 [2018-09-26 08:25:24,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-09-26 08:25:24,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-09-26 08:25:24,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9316, Invalid=9316, Unknown=0, NotChecked=0, Total=18632 [2018-09-26 08:25:24,939 INFO L87 Difference]: Start difference. First operand 138 states and 138 transitions. Second operand 137 states. [2018-09-26 08:25:25,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:25,165 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-09-26 08:25:25,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2018-09-26 08:25:25,166 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 137 [2018-09-26 08:25:25,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:25,166 INFO L225 Difference]: With dead ends: 141 [2018-09-26 08:25:25,166 INFO L226 Difference]: Without dead ends: 139 [2018-09-26 08:25:25,167 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 1 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:25,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-09-26 08:25:25,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-09-26 08:25:25,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-09-26 08:25:25,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2018-09-26 08:25:25,170 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 137 [2018-09-26 08:25:25,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:25,170 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2018-09-26 08:25:25,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-09-26 08:25:25,170 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2018-09-26 08:25:25,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-09-26 08:25:25,171 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:25,171 INFO L375 BasicCegarLoop]: trace histogram [135, 1, 1, 1] [2018-09-26 08:25:25,171 INFO L423 AbstractCegarLoop]: === Iteration 136 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:25,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:25,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1540653382, now seen corresponding path program 135 times [2018-09-26 08:25:25,171 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:25,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:25,718 INFO L134 CoverageAnalysis]: Checked inductivity of 9180 backedges. 0 proven. 9180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:25,718 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:25,718 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2018-09-26 08:25:25,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-09-26 08:25:25,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-09-26 08:25:25,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-09-26 08:25:25,721 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 138 states. [2018-09-26 08:25:26,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:26,009 INFO L93 Difference]: Finished difference Result 142 states and 142 transitions. [2018-09-26 08:25:26,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-09-26 08:25:26,009 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 138 [2018-09-26 08:25:26,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:26,010 INFO L225 Difference]: With dead ends: 142 [2018-09-26 08:25:26,010 INFO L226 Difference]: Without dead ends: 140 [2018-09-26 08:25:26,011 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-09-26 08:25:26,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-09-26 08:25:26,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-09-26 08:25:26,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-09-26 08:25:26,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 140 transitions. [2018-09-26 08:25:26,014 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 140 transitions. Word has length 138 [2018-09-26 08:25:26,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:26,014 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 140 transitions. [2018-09-26 08:25:26,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-09-26 08:25:26,014 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 140 transitions. [2018-09-26 08:25:26,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-09-26 08:25:26,015 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:26,015 INFO L375 BasicCegarLoop]: trace histogram [136, 1, 1, 1] [2018-09-26 08:25:26,015 INFO L423 AbstractCegarLoop]: === Iteration 137 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:26,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:26,016 INFO L82 PathProgramCache]: Analyzing trace with hash 515610720, now seen corresponding path program 136 times [2018-09-26 08:25:26,016 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:26,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:26,610 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:26,610 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:26,610 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [138] total 138 [2018-09-26 08:25:26,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 139 states [2018-09-26 08:25:26,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2018-09-26 08:25:26,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9591, Invalid=9591, Unknown=0, NotChecked=0, Total=19182 [2018-09-26 08:25:26,614 INFO L87 Difference]: Start difference. First operand 140 states and 140 transitions. Second operand 139 states. [2018-09-26 08:25:26,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:26,733 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-09-26 08:25:26,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2018-09-26 08:25:26,734 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 139 [2018-09-26 08:25:26,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:26,734 INFO L225 Difference]: With dead ends: 143 [2018-09-26 08:25:26,734 INFO L226 Difference]: Without dead ends: 141 [2018-09-26 08:25:26,736 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9591, Invalid=9591, Unknown=0, NotChecked=0, Total=19182 [2018-09-26 08:25:26,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-09-26 08:25:26,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-09-26 08:25:26,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-09-26 08:25:26,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-09-26 08:25:26,739 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 139 [2018-09-26 08:25:26,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:26,739 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-09-26 08:25:26,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 139 states. [2018-09-26 08:25:26,739 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-09-26 08:25:26,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-09-26 08:25:26,740 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:26,740 INFO L375 BasicCegarLoop]: trace histogram [137, 1, 1, 1] [2018-09-26 08:25:26,740 INFO L423 AbstractCegarLoop]: === Iteration 138 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:26,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:26,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1195940730, now seen corresponding path program 137 times [2018-09-26 08:25:26,741 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:26,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:27,341 INFO L134 CoverageAnalysis]: Checked inductivity of 9453 backedges. 0 proven. 9453 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:27,342 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:27,342 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2018-09-26 08:25:27,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-09-26 08:25:27,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-09-26 08:25:27,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-09-26 08:25:27,345 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 140 states. [2018-09-26 08:25:27,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:27,593 INFO L93 Difference]: Finished difference Result 144 states and 144 transitions. [2018-09-26 08:25:27,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2018-09-26 08:25:27,593 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 140 [2018-09-26 08:25:27,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:27,593 INFO L225 Difference]: With dead ends: 144 [2018-09-26 08:25:27,593 INFO L226 Difference]: Without dead ends: 142 [2018-09-26 08:25:27,594 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-09-26 08:25:27,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-09-26 08:25:27,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-09-26 08:25:27,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-09-26 08:25:27,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2018-09-26 08:25:27,597 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 140 [2018-09-26 08:25:27,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:27,597 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2018-09-26 08:25:27,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-09-26 08:25:27,597 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2018-09-26 08:25:27,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-09-26 08:25:27,597 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:27,598 INFO L375 BasicCegarLoop]: trace histogram [138, 1, 1, 1] [2018-09-26 08:25:27,598 INFO L423 AbstractCegarLoop]: === Iteration 139 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:27,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:27,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1580539168, now seen corresponding path program 138 times [2018-09-26 08:25:27,598 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:27,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:28,136 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:28,136 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:28,136 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [140] total 140 [2018-09-26 08:25:28,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 141 states [2018-09-26 08:25:28,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2018-09-26 08:25:28,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9870, Invalid=9870, Unknown=0, NotChecked=0, Total=19740 [2018-09-26 08:25:28,139 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand 141 states. [2018-09-26 08:25:28,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:28,375 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2018-09-26 08:25:28,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-09-26 08:25:28,375 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 141 [2018-09-26 08:25:28,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:28,375 INFO L225 Difference]: With dead ends: 145 [2018-09-26 08:25:28,375 INFO L226 Difference]: Without dead ends: 143 [2018-09-26 08:25:28,376 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9870, Invalid=9870, Unknown=0, NotChecked=0, Total=19740 [2018-09-26 08:25:28,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-09-26 08:25:28,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-09-26 08:25:28,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-09-26 08:25:28,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-09-26 08:25:28,379 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 141 [2018-09-26 08:25:28,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:28,379 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-09-26 08:25:28,379 INFO L481 AbstractCegarLoop]: Interpolant automaton has 141 states. [2018-09-26 08:25:28,379 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-09-26 08:25:28,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-09-26 08:25:28,380 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:28,380 INFO L375 BasicCegarLoop]: trace histogram [139, 1, 1, 1] [2018-09-26 08:25:28,380 INFO L423 AbstractCegarLoop]: === Iteration 140 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:28,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:28,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1752070086, now seen corresponding path program 139 times [2018-09-26 08:25:28,381 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:28,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:28,939 INFO L134 CoverageAnalysis]: Checked inductivity of 9730 backedges. 0 proven. 9730 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:28,939 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:28,939 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141] total 141 [2018-09-26 08:25:28,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-09-26 08:25:28,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-09-26 08:25:28,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-09-26 08:25:28,942 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 142 states. [2018-09-26 08:25:29,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:29,284 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2018-09-26 08:25:29,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2018-09-26 08:25:29,284 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 142 [2018-09-26 08:25:29,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:29,285 INFO L225 Difference]: With dead ends: 146 [2018-09-26 08:25:29,285 INFO L226 Difference]: Without dead ends: 144 [2018-09-26 08:25:29,286 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-09-26 08:25:29,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-09-26 08:25:29,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-09-26 08:25:29,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-09-26 08:25:29,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 144 transitions. [2018-09-26 08:25:29,289 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 144 transitions. Word has length 142 [2018-09-26 08:25:29,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:29,289 INFO L480 AbstractCegarLoop]: Abstraction has 144 states and 144 transitions. [2018-09-26 08:25:29,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-09-26 08:25:29,289 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 144 transitions. [2018-09-26 08:25:29,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-09-26 08:25:29,290 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:29,290 INFO L375 BasicCegarLoop]: trace histogram [140, 1, 1, 1] [2018-09-26 08:25:29,290 INFO L423 AbstractCegarLoop]: === Iteration 141 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:29,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:29,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1520406048, now seen corresponding path program 140 times [2018-09-26 08:25:29,291 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:29,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:29,863 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:29,863 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:29,864 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [142] total 142 [2018-09-26 08:25:29,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 143 states [2018-09-26 08:25:29,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2018-09-26 08:25:29,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10153, Invalid=10153, Unknown=0, NotChecked=0, Total=20306 [2018-09-26 08:25:29,867 INFO L87 Difference]: Start difference. First operand 144 states and 144 transitions. Second operand 143 states. [2018-09-26 08:25:30,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:30,124 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-09-26 08:25:30,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-09-26 08:25:30,124 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 143 [2018-09-26 08:25:30,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:30,125 INFO L225 Difference]: With dead ends: 147 [2018-09-26 08:25:30,125 INFO L226 Difference]: Without dead ends: 145 [2018-09-26 08:25:30,126 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10153, Invalid=10153, Unknown=0, NotChecked=0, Total=20306 [2018-09-26 08:25:30,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-09-26 08:25:30,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-09-26 08:25:30,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-09-26 08:25:30,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-09-26 08:25:30,129 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 143 [2018-09-26 08:25:30,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:30,129 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-09-26 08:25:30,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 143 states. [2018-09-26 08:25:30,130 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-09-26 08:25:30,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-09-26 08:25:30,130 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:30,130 INFO L375 BasicCegarLoop]: trace histogram [141, 1, 1, 1] [2018-09-26 08:25:30,131 INFO L423 AbstractCegarLoop]: === Iteration 142 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:30,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:30,131 INFO L82 PathProgramCache]: Analyzing trace with hash 112048902, now seen corresponding path program 141 times [2018-09-26 08:25:30,131 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:30,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:30,748 INFO L134 CoverageAnalysis]: Checked inductivity of 10011 backedges. 0 proven. 10011 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:30,748 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:30,748 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143] total 143 [2018-09-26 08:25:30,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2018-09-26 08:25:30,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2018-09-26 08:25:30,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-09-26 08:25:30,752 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 144 states. [2018-09-26 08:25:30,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:30,917 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2018-09-26 08:25:30,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-09-26 08:25:30,917 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 144 [2018-09-26 08:25:30,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:30,917 INFO L225 Difference]: With dead ends: 148 [2018-09-26 08:25:30,917 INFO L226 Difference]: Without dead ends: 146 [2018-09-26 08:25:30,918 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-09-26 08:25:30,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-09-26 08:25:30,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-09-26 08:25:30,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-09-26 08:25:30,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2018-09-26 08:25:30,920 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 144 [2018-09-26 08:25:30,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:30,920 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2018-09-26 08:25:30,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2018-09-26 08:25:30,920 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2018-09-26 08:25:30,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-09-26 08:25:30,921 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:30,921 INFO L375 BasicCegarLoop]: trace histogram [142, 1, 1, 1] [2018-09-26 08:25:30,921 INFO L423 AbstractCegarLoop]: === Iteration 143 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:30,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:30,921 INFO L82 PathProgramCache]: Analyzing trace with hash -821455200, now seen corresponding path program 142 times [2018-09-26 08:25:30,921 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:30,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:31,484 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:31,484 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:31,485 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [144] total 144 [2018-09-26 08:25:31,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 145 states [2018-09-26 08:25:31,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2018-09-26 08:25:31,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10440, Invalid=10440, Unknown=0, NotChecked=0, Total=20880 [2018-09-26 08:25:31,487 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 145 states. [2018-09-26 08:25:31,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:31,648 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2018-09-26 08:25:31,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2018-09-26 08:25:31,648 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 145 [2018-09-26 08:25:31,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:31,649 INFO L225 Difference]: With dead ends: 149 [2018-09-26 08:25:31,649 INFO L226 Difference]: Without dead ends: 147 [2018-09-26 08:25:31,650 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10440, Invalid=10440, Unknown=0, NotChecked=0, Total=20880 [2018-09-26 08:25:31,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-09-26 08:25:31,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-09-26 08:25:31,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-09-26 08:25:31,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-09-26 08:25:31,653 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 145 [2018-09-26 08:25:31,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:31,654 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-09-26 08:25:31,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 145 states. [2018-09-26 08:25:31,654 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-09-26 08:25:31,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-09-26 08:25:31,654 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:31,655 INFO L375 BasicCegarLoop]: trace histogram [143, 1, 1, 1] [2018-09-26 08:25:31,655 INFO L423 AbstractCegarLoop]: === Iteration 144 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:31,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:31,655 INFO L82 PathProgramCache]: Analyzing trace with hash 304688710, now seen corresponding path program 143 times [2018-09-26 08:25:31,655 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:31,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:32,216 INFO L134 CoverageAnalysis]: Checked inductivity of 10296 backedges. 0 proven. 10296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:32,217 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:32,217 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145] total 145 [2018-09-26 08:25:32,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2018-09-26 08:25:32,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2018-09-26 08:25:32,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-09-26 08:25:32,220 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 146 states. [2018-09-26 08:25:32,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:32,511 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2018-09-26 08:25:32,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-09-26 08:25:32,511 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 146 [2018-09-26 08:25:32,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:32,511 INFO L225 Difference]: With dead ends: 150 [2018-09-26 08:25:32,511 INFO L226 Difference]: Without dead ends: 148 [2018-09-26 08:25:32,512 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-09-26 08:25:32,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-09-26 08:25:32,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-09-26 08:25:32,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-09-26 08:25:32,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2018-09-26 08:25:32,515 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 146 [2018-09-26 08:25:32,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:32,515 INFO L480 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2018-09-26 08:25:32,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2018-09-26 08:25:32,515 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2018-09-26 08:25:32,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-09-26 08:25:32,515 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:32,516 INFO L375 BasicCegarLoop]: trace histogram [144, 1, 1, 1] [2018-09-26 08:25:32,516 INFO L423 AbstractCegarLoop]: === Iteration 145 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:32,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:32,516 INFO L82 PathProgramCache]: Analyzing trace with hash 855411552, now seen corresponding path program 144 times [2018-09-26 08:25:32,516 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:32,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:33,108 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:33,109 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:33,109 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [146] total 146 [2018-09-26 08:25:33,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 147 states [2018-09-26 08:25:33,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2018-09-26 08:25:33,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10731, Invalid=10731, Unknown=0, NotChecked=0, Total=21462 [2018-09-26 08:25:33,112 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 147 states. [2018-09-26 08:25:33,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:33,453 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-09-26 08:25:33,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-09-26 08:25:33,453 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 147 [2018-09-26 08:25:33,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:33,454 INFO L225 Difference]: With dead ends: 151 [2018-09-26 08:25:33,454 INFO L226 Difference]: Without dead ends: 149 [2018-09-26 08:25:33,455 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10731, Invalid=10731, Unknown=0, NotChecked=0, Total=21462 [2018-09-26 08:25:33,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-09-26 08:25:33,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-09-26 08:25:33,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-09-26 08:25:33,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-09-26 08:25:33,457 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 147 [2018-09-26 08:25:33,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:33,457 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2018-09-26 08:25:33,457 INFO L481 AbstractCegarLoop]: Interpolant automaton has 147 states. [2018-09-26 08:25:33,458 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-09-26 08:25:33,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-09-26 08:25:33,458 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:33,458 INFO L375 BasicCegarLoop]: trace histogram [145, 1, 1, 1] [2018-09-26 08:25:33,458 INFO L423 AbstractCegarLoop]: === Iteration 146 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:33,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:33,459 INFO L82 PathProgramCache]: Analyzing trace with hash 747950470, now seen corresponding path program 145 times [2018-09-26 08:25:33,459 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:33,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:34,071 INFO L134 CoverageAnalysis]: Checked inductivity of 10585 backedges. 0 proven. 10585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:34,071 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:34,071 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147] total 147 [2018-09-26 08:25:34,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-09-26 08:25:34,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-09-26 08:25:34,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-09-26 08:25:34,075 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 148 states. [2018-09-26 08:25:34,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:34,395 INFO L93 Difference]: Finished difference Result 152 states and 152 transitions. [2018-09-26 08:25:34,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2018-09-26 08:25:34,395 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 148 [2018-09-26 08:25:34,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:34,395 INFO L225 Difference]: With dead ends: 152 [2018-09-26 08:25:34,396 INFO L226 Difference]: Without dead ends: 150 [2018-09-26 08:25:34,397 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-09-26 08:25:34,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-09-26 08:25:34,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-09-26 08:25:34,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-09-26 08:25:34,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 150 transitions. [2018-09-26 08:25:34,400 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 150 transitions. Word has length 148 [2018-09-26 08:25:34,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:34,400 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 150 transitions. [2018-09-26 08:25:34,400 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2018-09-26 08:25:34,400 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 150 transitions. [2018-09-26 08:25:34,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-09-26 08:25:34,401 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:34,401 INFO L375 BasicCegarLoop]: trace histogram [146, 1, 1, 1] [2018-09-26 08:25:34,401 INFO L423 AbstractCegarLoop]: === Iteration 147 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:34,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:34,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1711624224, now seen corresponding path program 146 times [2018-09-26 08:25:34,402 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:34,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:35,159 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:35,159 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:35,159 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [148] total 148 [2018-09-26 08:25:35,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 149 states [2018-09-26 08:25:35,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2018-09-26 08:25:35,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11026, Invalid=11026, Unknown=0, NotChecked=0, Total=22052 [2018-09-26 08:25:35,161 INFO L87 Difference]: Start difference. First operand 150 states and 150 transitions. Second operand 149 states. [2018-09-26 08:25:35,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:35,482 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-09-26 08:25:35,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2018-09-26 08:25:35,482 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 149 [2018-09-26 08:25:35,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:35,482 INFO L225 Difference]: With dead ends: 153 [2018-09-26 08:25:35,482 INFO L226 Difference]: Without dead ends: 151 [2018-09-26 08:25:35,483 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 1 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:35,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-09-26 08:25:35,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-09-26 08:25:35,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-09-26 08:25:35,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-09-26 08:25:35,487 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 149 [2018-09-26 08:25:35,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:35,487 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-09-26 08:25:35,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 149 states. [2018-09-26 08:25:35,487 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-09-26 08:25:35,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-09-26 08:25:35,488 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:35,488 INFO L375 BasicCegarLoop]: trace histogram [147, 1, 1, 1] [2018-09-26 08:25:35,488 INFO L423 AbstractCegarLoop]: === Iteration 148 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:35,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:35,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1520739526, now seen corresponding path program 147 times [2018-09-26 08:25:35,489 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:35,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:36,105 INFO L134 CoverageAnalysis]: Checked inductivity of 10878 backedges. 0 proven. 10878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:36,105 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:36,105 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [149] total 149 [2018-09-26 08:25:36,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2018-09-26 08:25:36,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2018-09-26 08:25:36,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-09-26 08:25:36,108 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 150 states. [2018-09-26 08:25:36,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:36,480 INFO L93 Difference]: Finished difference Result 154 states and 154 transitions. [2018-09-26 08:25:36,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-09-26 08:25:36,480 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 150 [2018-09-26 08:25:36,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:36,480 INFO L225 Difference]: With dead ends: 154 [2018-09-26 08:25:36,480 INFO L226 Difference]: Without dead ends: 152 [2018-09-26 08:25:36,481 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-09-26 08:25:36,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-09-26 08:25:36,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-09-26 08:25:36,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-09-26 08:25:36,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2018-09-26 08:25:36,484 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 150 [2018-09-26 08:25:36,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:36,484 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2018-09-26 08:25:36,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2018-09-26 08:25:36,484 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2018-09-26 08:25:36,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-09-26 08:25:36,485 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:36,485 INFO L375 BasicCegarLoop]: trace histogram [148, 1, 1, 1] [2018-09-26 08:25:36,486 INFO L423 AbstractCegarLoop]: === Iteration 149 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:36,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:36,486 INFO L82 PathProgramCache]: Analyzing trace with hash -101718816, now seen corresponding path program 148 times [2018-09-26 08:25:36,486 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:36,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:37,166 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:37,167 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:37,167 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [150] total 150 [2018-09-26 08:25:37,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 151 states [2018-09-26 08:25:37,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 151 interpolants. [2018-09-26 08:25:37,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11325, Invalid=11325, Unknown=0, NotChecked=0, Total=22650 [2018-09-26 08:25:37,170 INFO L87 Difference]: Start difference. First operand 152 states and 152 transitions. Second operand 151 states. [2018-09-26 08:25:37,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:37,567 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-09-26 08:25:37,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2018-09-26 08:25:37,567 INFO L78 Accepts]: Start accepts. Automaton has 151 states. Word has length 151 [2018-09-26 08:25:37,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:37,567 INFO L225 Difference]: With dead ends: 155 [2018-09-26 08:25:37,567 INFO L226 Difference]: Without dead ends: 153 [2018-09-26 08:25:37,568 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=11325, Invalid=11325, Unknown=0, NotChecked=0, Total=22650 [2018-09-26 08:25:37,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-09-26 08:25:37,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-09-26 08:25:37,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-09-26 08:25:37,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-09-26 08:25:37,571 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 151 [2018-09-26 08:25:37,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:37,572 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-09-26 08:25:37,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 151 states. [2018-09-26 08:25:37,572 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-09-26 08:25:37,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-09-26 08:25:37,573 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:37,573 INFO L375 BasicCegarLoop]: trace histogram [149, 1, 1, 1] [2018-09-26 08:25:37,573 INFO L423 AbstractCegarLoop]: === Iteration 150 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:37,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:37,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1141680134, now seen corresponding path program 149 times [2018-09-26 08:25:37,574 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:37,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:38,239 INFO L134 CoverageAnalysis]: Checked inductivity of 11175 backedges. 0 proven. 11175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:38,239 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:38,239 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [151] total 151 [2018-09-26 08:25:38,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2018-09-26 08:25:38,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2018-09-26 08:25:38,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-09-26 08:25:38,243 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 152 states. [2018-09-26 08:25:38,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:38,665 INFO L93 Difference]: Finished difference Result 156 states and 156 transitions. [2018-09-26 08:25:38,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-09-26 08:25:38,665 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 152 [2018-09-26 08:25:38,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:38,665 INFO L225 Difference]: With dead ends: 156 [2018-09-26 08:25:38,665 INFO L226 Difference]: Without dead ends: 154 [2018-09-26 08:25:38,667 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-09-26 08:25:38,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-09-26 08:25:38,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-09-26 08:25:38,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-09-26 08:25:38,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 154 transitions. [2018-09-26 08:25:38,669 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 154 transitions. Word has length 152 [2018-09-26 08:25:38,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:38,669 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 154 transitions. [2018-09-26 08:25:38,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2018-09-26 08:25:38,670 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 154 transitions. [2018-09-26 08:25:38,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-09-26 08:25:38,670 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:38,670 INFO L375 BasicCegarLoop]: trace histogram [150, 1, 1, 1] [2018-09-26 08:25:38,670 INFO L423 AbstractCegarLoop]: === Iteration 151 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:38,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:38,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1032341920, now seen corresponding path program 150 times [2018-09-26 08:25:38,671 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:38,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:39,341 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:39,342 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:39,342 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [152] total 152 [2018-09-26 08:25:39,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 153 states [2018-09-26 08:25:39,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 153 interpolants. [2018-09-26 08:25:39,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11628, Invalid=11628, Unknown=0, NotChecked=0, Total=23256 [2018-09-26 08:25:39,345 INFO L87 Difference]: Start difference. First operand 154 states and 154 transitions. Second operand 153 states. [2018-09-26 08:25:39,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:39,766 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2018-09-26 08:25:39,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2018-09-26 08:25:39,767 INFO L78 Accepts]: Start accepts. Automaton has 153 states. Word has length 153 [2018-09-26 08:25:39,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:39,767 INFO L225 Difference]: With dead ends: 157 [2018-09-26 08:25:39,767 INFO L226 Difference]: Without dead ends: 155 [2018-09-26 08:25:39,768 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=11628, Invalid=11628, Unknown=0, NotChecked=0, Total=23256 [2018-09-26 08:25:39,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-09-26 08:25:39,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-09-26 08:25:39,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-09-26 08:25:39,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2018-09-26 08:25:39,771 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 153 [2018-09-26 08:25:39,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:39,771 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2018-09-26 08:25:39,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 153 states. [2018-09-26 08:25:39,771 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2018-09-26 08:25:39,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-09-26 08:25:39,771 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:39,772 INFO L375 BasicCegarLoop]: trace histogram [151, 1, 1, 1] [2018-09-26 08:25:39,772 INFO L423 AbstractCegarLoop]: === Iteration 152 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:39,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:39,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1937824582, now seen corresponding path program 151 times [2018-09-26 08:25:39,772 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:39,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:40,421 INFO L134 CoverageAnalysis]: Checked inductivity of 11476 backedges. 0 proven. 11476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:40,421 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:40,422 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [153] total 153 [2018-09-26 08:25:40,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2018-09-26 08:25:40,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2018-09-26 08:25:40,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-09-26 08:25:40,426 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 154 states. [2018-09-26 08:25:40,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:40,852 INFO L93 Difference]: Finished difference Result 158 states and 158 transitions. [2018-09-26 08:25:40,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2018-09-26 08:25:40,852 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 154 [2018-09-26 08:25:40,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:40,852 INFO L225 Difference]: With dead ends: 158 [2018-09-26 08:25:40,852 INFO L226 Difference]: Without dead ends: 156 [2018-09-26 08:25:40,853 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-09-26 08:25:40,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-09-26 08:25:40,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-09-26 08:25:40,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-09-26 08:25:40,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2018-09-26 08:25:40,856 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 154 [2018-09-26 08:25:40,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:40,856 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2018-09-26 08:25:40,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2018-09-26 08:25:40,856 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2018-09-26 08:25:40,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-09-26 08:25:40,857 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:40,857 INFO L375 BasicCegarLoop]: trace histogram [152, 1, 1, 1] [2018-09-26 08:25:40,857 INFO L423 AbstractCegarLoop]: === Iteration 153 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:40,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:40,857 INFO L82 PathProgramCache]: Analyzing trace with hash -56983968, now seen corresponding path program 152 times [2018-09-26 08:25:40,857 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:40,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:41,511 INFO L134 CoverageAnalysis]: Checked inductivity of 11628 backedges. 0 proven. 11628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:41,511 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:41,511 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [154] total 154 [2018-09-26 08:25:41,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 155 states [2018-09-26 08:25:41,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2018-09-26 08:25:41,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11935, Invalid=11935, Unknown=0, NotChecked=0, Total=23870 [2018-09-26 08:25:41,514 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 155 states. [2018-09-26 08:25:41,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:41,918 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-09-26 08:25:41,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2018-09-26 08:25:41,918 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 155 [2018-09-26 08:25:41,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:41,918 INFO L225 Difference]: With dead ends: 159 [2018-09-26 08:25:41,918 INFO L226 Difference]: Without dead ends: 157 [2018-09-26 08:25:41,920 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=11935, Invalid=11935, Unknown=0, NotChecked=0, Total=23870 [2018-09-26 08:25:41,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-09-26 08:25:41,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-09-26 08:25:41,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-09-26 08:25:41,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-09-26 08:25:41,923 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 155 [2018-09-26 08:25:41,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:41,923 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-09-26 08:25:41,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 155 states. [2018-09-26 08:25:41,923 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-09-26 08:25:41,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-09-26 08:25:41,924 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:41,924 INFO L375 BasicCegarLoop]: trace histogram [153, 1, 1, 1] [2018-09-26 08:25:41,924 INFO L423 AbstractCegarLoop]: === Iteration 154 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:41,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:41,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1766506874, now seen corresponding path program 153 times [2018-09-26 08:25:41,924 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:42,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:42,662 INFO L134 CoverageAnalysis]: Checked inductivity of 11781 backedges. 0 proven. 11781 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:42,662 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:42,662 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [155] total 155 [2018-09-26 08:25:42,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 156 states [2018-09-26 08:25:42,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2018-09-26 08:25:42,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-09-26 08:25:42,666 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 156 states. [2018-09-26 08:25:43,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:43,118 INFO L93 Difference]: Finished difference Result 160 states and 160 transitions. [2018-09-26 08:25:43,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2018-09-26 08:25:43,118 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 156 [2018-09-26 08:25:43,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:43,119 INFO L225 Difference]: With dead ends: 160 [2018-09-26 08:25:43,119 INFO L226 Difference]: Without dead ends: 158 [2018-09-26 08:25:43,120 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-09-26 08:25:43,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-09-26 08:25:43,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2018-09-26 08:25:43,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-09-26 08:25:43,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 158 transitions. [2018-09-26 08:25:43,123 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 158 transitions. Word has length 156 [2018-09-26 08:25:43,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:43,123 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 158 transitions. [2018-09-26 08:25:43,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 156 states. [2018-09-26 08:25:43,123 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 158 transitions. [2018-09-26 08:25:43,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-09-26 08:25:43,124 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:43,124 INFO L375 BasicCegarLoop]: trace histogram [154, 1, 1, 1] [2018-09-26 08:25:43,124 INFO L423 AbstractCegarLoop]: === Iteration 155 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:43,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:43,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1072857888, now seen corresponding path program 154 times [2018-09-26 08:25:43,125 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:43,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:43,853 INFO L134 CoverageAnalysis]: Checked inductivity of 11935 backedges. 0 proven. 11935 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:43,853 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:43,853 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [156] total 156 [2018-09-26 08:25:43,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 157 states [2018-09-26 08:25:43,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 157 interpolants. [2018-09-26 08:25:43,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12246, Invalid=12246, Unknown=0, NotChecked=0, Total=24492 [2018-09-26 08:25:43,856 INFO L87 Difference]: Start difference. First operand 158 states and 158 transitions. Second operand 157 states. [2018-09-26 08:25:44,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:44,255 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2018-09-26 08:25:44,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2018-09-26 08:25:44,255 INFO L78 Accepts]: Start accepts. Automaton has 157 states. Word has length 157 [2018-09-26 08:25:44,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:44,256 INFO L225 Difference]: With dead ends: 161 [2018-09-26 08:25:44,256 INFO L226 Difference]: Without dead ends: 159 [2018-09-26 08:25:44,257 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=12246, Invalid=12246, Unknown=0, NotChecked=0, Total=24492 [2018-09-26 08:25:44,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-09-26 08:25:44,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-09-26 08:25:44,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-09-26 08:25:44,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2018-09-26 08:25:44,260 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 157 [2018-09-26 08:25:44,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:44,260 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 159 transitions. [2018-09-26 08:25:44,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 157 states. [2018-09-26 08:25:44,260 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 159 transitions. [2018-09-26 08:25:44,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-09-26 08:25:44,260 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:44,260 INFO L375 BasicCegarLoop]: trace histogram [155, 1, 1, 1] [2018-09-26 08:25:44,261 INFO L423 AbstractCegarLoop]: === Iteration 156 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:44,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:44,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1101147706, now seen corresponding path program 155 times [2018-09-26 08:25:44,261 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:44,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:45,068 INFO L134 CoverageAnalysis]: Checked inductivity of 12090 backedges. 0 proven. 12090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:45,068 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:45,068 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [157] total 157 [2018-09-26 08:25:45,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 158 states [2018-09-26 08:25:45,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2018-09-26 08:25:45,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-09-26 08:25:45,071 INFO L87 Difference]: Start difference. First operand 159 states and 159 transitions. Second operand 158 states. [2018-09-26 08:25:45,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:45,304 INFO L93 Difference]: Finished difference Result 162 states and 162 transitions. [2018-09-26 08:25:45,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2018-09-26 08:25:45,304 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 158 [2018-09-26 08:25:45,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:45,304 INFO L225 Difference]: With dead ends: 162 [2018-09-26 08:25:45,304 INFO L226 Difference]: Without dead ends: 160 [2018-09-26 08:25:45,306 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-09-26 08:25:45,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-09-26 08:25:45,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2018-09-26 08:25:45,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-09-26 08:25:45,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 160 transitions. [2018-09-26 08:25:45,308 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 160 transitions. Word has length 158 [2018-09-26 08:25:45,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:45,308 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 160 transitions. [2018-09-26 08:25:45,309 INFO L481 AbstractCegarLoop]: Interpolant automaton has 158 states. [2018-09-26 08:25:45,309 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 160 transitions. [2018-09-26 08:25:45,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-09-26 08:25:45,309 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:45,310 INFO L375 BasicCegarLoop]: trace histogram [156, 1, 1, 1] [2018-09-26 08:25:45,310 INFO L423 AbstractCegarLoop]: === Iteration 157 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:45,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:45,310 INFO L82 PathProgramCache]: Analyzing trace with hash 224155616, now seen corresponding path program 156 times [2018-09-26 08:25:45,310 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:45,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:46,004 INFO L134 CoverageAnalysis]: Checked inductivity of 12246 backedges. 0 proven. 12246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:46,005 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:46,005 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [158] total 158 [2018-09-26 08:25:46,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 159 states [2018-09-26 08:25:46,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 159 interpolants. [2018-09-26 08:25:46,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12561, Invalid=12561, Unknown=0, NotChecked=0, Total=25122 [2018-09-26 08:25:46,008 INFO L87 Difference]: Start difference. First operand 160 states and 160 transitions. Second operand 159 states. [2018-09-26 08:25:46,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:46,172 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-09-26 08:25:46,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2018-09-26 08:25:46,172 INFO L78 Accepts]: Start accepts. Automaton has 159 states. Word has length 159 [2018-09-26 08:25:46,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:46,173 INFO L225 Difference]: With dead ends: 163 [2018-09-26 08:25:46,173 INFO L226 Difference]: Without dead ends: 161 [2018-09-26 08:25:46,174 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=12561, Invalid=12561, Unknown=0, NotChecked=0, Total=25122 [2018-09-26 08:25:46,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-09-26 08:25:46,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-09-26 08:25:46,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-09-26 08:25:46,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-09-26 08:25:46,177 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 159 [2018-09-26 08:25:46,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:46,177 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-09-26 08:25:46,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 159 states. [2018-09-26 08:25:46,177 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-09-26 08:25:46,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-09-26 08:25:46,177 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:46,177 INFO L375 BasicCegarLoop]: trace histogram [157, 1, 1, 1] [2018-09-26 08:25:46,178 INFO L423 AbstractCegarLoop]: === Iteration 158 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:46,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:46,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1641114362, now seen corresponding path program 157 times [2018-09-26 08:25:46,178 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:46,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:46,872 INFO L134 CoverageAnalysis]: Checked inductivity of 12403 backedges. 0 proven. 12403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:46,872 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:46,872 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [159] total 159 [2018-09-26 08:25:46,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2018-09-26 08:25:46,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2018-09-26 08:25:46,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-09-26 08:25:46,875 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 160 states. [2018-09-26 08:25:47,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:47,203 INFO L93 Difference]: Finished difference Result 164 states and 164 transitions. [2018-09-26 08:25:47,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2018-09-26 08:25:47,203 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 160 [2018-09-26 08:25:47,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:47,203 INFO L225 Difference]: With dead ends: 164 [2018-09-26 08:25:47,203 INFO L226 Difference]: Without dead ends: 162 [2018-09-26 08:25:47,205 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-09-26 08:25:47,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-09-26 08:25:47,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-09-26 08:25:47,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-09-26 08:25:47,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 162 transitions. [2018-09-26 08:25:47,207 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 162 transitions. Word has length 160 [2018-09-26 08:25:47,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:47,207 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 162 transitions. [2018-09-26 08:25:47,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2018-09-26 08:25:47,208 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2018-09-26 08:25:47,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-09-26 08:25:47,208 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:47,208 INFO L375 BasicCegarLoop]: trace histogram [158, 1, 1, 1] [2018-09-26 08:25:47,208 INFO L423 AbstractCegarLoop]: === Iteration 159 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:47,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:47,208 INFO L82 PathProgramCache]: Analyzing trace with hash 665058464, now seen corresponding path program 158 times [2018-09-26 08:25:47,209 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:47,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:47,949 INFO L134 CoverageAnalysis]: Checked inductivity of 12561 backedges. 0 proven. 12561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:47,949 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:47,949 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [160] total 160 [2018-09-26 08:25:47,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 161 states [2018-09-26 08:25:47,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 161 interpolants. [2018-09-26 08:25:47,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12880, Invalid=12880, Unknown=0, NotChecked=0, Total=25760 [2018-09-26 08:25:47,953 INFO L87 Difference]: Start difference. First operand 162 states and 162 transitions. Second operand 161 states. [2018-09-26 08:25:48,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:48,486 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2018-09-26 08:25:48,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2018-09-26 08:25:48,486 INFO L78 Accepts]: Start accepts. Automaton has 161 states. Word has length 161 [2018-09-26 08:25:48,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:48,487 INFO L225 Difference]: With dead ends: 165 [2018-09-26 08:25:48,487 INFO L226 Difference]: Without dead ends: 163 [2018-09-26 08:25:48,488 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=12880, Invalid=12880, Unknown=0, NotChecked=0, Total=25760 [2018-09-26 08:25:48,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-09-26 08:25:48,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-09-26 08:25:48,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-09-26 08:25:48,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2018-09-26 08:25:48,491 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 161 [2018-09-26 08:25:48,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:48,491 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2018-09-26 08:25:48,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 161 states. [2018-09-26 08:25:48,491 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2018-09-26 08:25:48,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-09-26 08:25:48,491 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:48,492 INFO L375 BasicCegarLoop]: trace histogram [159, 1, 1, 1] [2018-09-26 08:25:48,492 INFO L423 AbstractCegarLoop]: === Iteration 160 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:48,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:48,492 INFO L82 PathProgramCache]: Analyzing trace with hash -858027962, now seen corresponding path program 159 times [2018-09-26 08:25:48,492 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:48,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:49,242 INFO L134 CoverageAnalysis]: Checked inductivity of 12720 backedges. 0 proven. 12720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:49,243 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:49,243 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [161] total 161 [2018-09-26 08:25:49,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 162 states [2018-09-26 08:25:49,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2018-09-26 08:25:49,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-09-26 08:25:49,245 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 162 states. [2018-09-26 08:25:49,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:49,761 INFO L93 Difference]: Finished difference Result 166 states and 166 transitions. [2018-09-26 08:25:49,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2018-09-26 08:25:49,762 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 162 [2018-09-26 08:25:49,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:49,762 INFO L225 Difference]: With dead ends: 166 [2018-09-26 08:25:49,762 INFO L226 Difference]: Without dead ends: 164 [2018-09-26 08:25:49,763 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-09-26 08:25:49,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-09-26 08:25:49,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2018-09-26 08:25:49,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-09-26 08:25:49,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 164 transitions. [2018-09-26 08:25:49,766 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 164 transitions. Word has length 162 [2018-09-26 08:25:49,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:49,767 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 164 transitions. [2018-09-26 08:25:49,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 162 states. [2018-09-26 08:25:49,767 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 164 transitions. [2018-09-26 08:25:49,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-09-26 08:25:49,768 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:49,768 INFO L375 BasicCegarLoop]: trace histogram [160, 1, 1, 1] [2018-09-26 08:25:49,768 INFO L423 AbstractCegarLoop]: === Iteration 161 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:49,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:49,768 INFO L82 PathProgramCache]: Analyzing trace with hash -829066912, now seen corresponding path program 160 times [2018-09-26 08:25:49,769 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:49,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:50,531 INFO L134 CoverageAnalysis]: Checked inductivity of 12880 backedges. 0 proven. 12880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:50,531 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:50,531 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [162] total 162 [2018-09-26 08:25:50,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 163 states [2018-09-26 08:25:50,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 163 interpolants. [2018-09-26 08:25:50,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13203, Invalid=13203, Unknown=0, NotChecked=0, Total=26406 [2018-09-26 08:25:50,535 INFO L87 Difference]: Start difference. First operand 164 states and 164 transitions. Second operand 163 states. [2018-09-26 08:25:50,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:50,993 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-09-26 08:25:50,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2018-09-26 08:25:50,993 INFO L78 Accepts]: Start accepts. Automaton has 163 states. Word has length 163 [2018-09-26 08:25:50,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:50,994 INFO L225 Difference]: With dead ends: 167 [2018-09-26 08:25:50,994 INFO L226 Difference]: Without dead ends: 165 [2018-09-26 08:25:50,996 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13203, Invalid=13203, Unknown=0, NotChecked=0, Total=26406 [2018-09-26 08:25:50,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-09-26 08:25:50,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-09-26 08:25:50,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-09-26 08:25:50,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-09-26 08:25:50,998 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 163 [2018-09-26 08:25:50,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:50,998 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-09-26 08:25:50,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 163 states. [2018-09-26 08:25:50,998 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-09-26 08:25:50,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-09-26 08:25:50,999 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:50,999 INFO L375 BasicCegarLoop]: trace histogram [161, 1, 1, 1] [2018-09-26 08:25:50,999 INFO L423 AbstractCegarLoop]: === Iteration 162 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:50,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:50,999 INFO L82 PathProgramCache]: Analyzing trace with hash 68725638, now seen corresponding path program 161 times [2018-09-26 08:25:51,000 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:51,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:51,750 INFO L134 CoverageAnalysis]: Checked inductivity of 13041 backedges. 0 proven. 13041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:51,751 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:51,751 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [163] total 163 [2018-09-26 08:25:51,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 164 states [2018-09-26 08:25:51,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2018-09-26 08:25:51,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-09-26 08:25:51,754 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 164 states. [2018-09-26 08:25:51,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:51,931 INFO L93 Difference]: Finished difference Result 168 states and 168 transitions. [2018-09-26 08:25:51,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2018-09-26 08:25:51,931 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 164 [2018-09-26 08:25:51,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:51,932 INFO L225 Difference]: With dead ends: 168 [2018-09-26 08:25:51,932 INFO L226 Difference]: Without dead ends: 166 [2018-09-26 08:25:51,934 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-09-26 08:25:51,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-09-26 08:25:51,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-09-26 08:25:51,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-09-26 08:25:51,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2018-09-26 08:25:51,937 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 164 [2018-09-26 08:25:51,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:51,937 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2018-09-26 08:25:51,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 164 states. [2018-09-26 08:25:51,937 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2018-09-26 08:25:51,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-09-26 08:25:51,938 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:51,938 INFO L375 BasicCegarLoop]: trace histogram [162, 1, 1, 1] [2018-09-26 08:25:51,938 INFO L423 AbstractCegarLoop]: === Iteration 163 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:51,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:51,939 INFO L82 PathProgramCache]: Analyzing trace with hash 2130490912, now seen corresponding path program 162 times [2018-09-26 08:25:51,939 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:52,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:52,846 INFO L134 CoverageAnalysis]: Checked inductivity of 13203 backedges. 0 proven. 13203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:52,846 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:52,846 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [164] total 164 [2018-09-26 08:25:52,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 165 states [2018-09-26 08:25:52,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 165 interpolants. [2018-09-26 08:25:52,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13530, Invalid=13530, Unknown=0, NotChecked=0, Total=27060 [2018-09-26 08:25:52,849 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 165 states. [2018-09-26 08:25:53,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:53,319 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2018-09-26 08:25:53,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2018-09-26 08:25:53,319 INFO L78 Accepts]: Start accepts. Automaton has 165 states. Word has length 165 [2018-09-26 08:25:53,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:53,319 INFO L225 Difference]: With dead ends: 169 [2018-09-26 08:25:53,319 INFO L226 Difference]: Without dead ends: 167 [2018-09-26 08:25:53,321 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=13530, Invalid=13530, Unknown=0, NotChecked=0, Total=27060 [2018-09-26 08:25:53,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-09-26 08:25:53,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-09-26 08:25:53,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-09-26 08:25:53,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2018-09-26 08:25:53,323 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 165 [2018-09-26 08:25:53,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:53,324 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2018-09-26 08:25:53,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 165 states. [2018-09-26 08:25:53,324 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2018-09-26 08:25:53,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-09-26 08:25:53,324 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:53,324 INFO L375 BasicCegarLoop]: trace histogram [163, 1, 1, 1] [2018-09-26 08:25:53,324 INFO L423 AbstractCegarLoop]: === Iteration 164 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:53,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:53,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1620704966, now seen corresponding path program 163 times [2018-09-26 08:25:53,325 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:53,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:54,136 INFO L134 CoverageAnalysis]: Checked inductivity of 13366 backedges. 0 proven. 13366 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:54,137 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:54,137 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [165] total 165 [2018-09-26 08:25:54,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2018-09-26 08:25:54,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2018-09-26 08:25:54,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-09-26 08:25:54,140 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 166 states. [2018-09-26 08:25:54,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:54,739 INFO L93 Difference]: Finished difference Result 170 states and 170 transitions. [2018-09-26 08:25:54,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2018-09-26 08:25:54,739 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 166 [2018-09-26 08:25:54,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:54,740 INFO L225 Difference]: With dead ends: 170 [2018-09-26 08:25:54,740 INFO L226 Difference]: Without dead ends: 168 [2018-09-26 08:25:54,741 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-09-26 08:25:54,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-09-26 08:25:54,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2018-09-26 08:25:54,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-09-26 08:25:54,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 168 transitions. [2018-09-26 08:25:54,743 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 168 transitions. Word has length 166 [2018-09-26 08:25:54,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:54,743 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 168 transitions. [2018-09-26 08:25:54,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 166 states. [2018-09-26 08:25:54,744 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 168 transitions. [2018-09-26 08:25:54,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-09-26 08:25:54,744 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:54,744 INFO L375 BasicCegarLoop]: trace histogram [164, 1, 1, 1] [2018-09-26 08:25:54,744 INFO L423 AbstractCegarLoop]: === Iteration 165 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:54,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:54,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1297757472, now seen corresponding path program 164 times [2018-09-26 08:25:54,745 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:54,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:55,527 INFO L134 CoverageAnalysis]: Checked inductivity of 13530 backedges. 0 proven. 13530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:55,528 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:55,528 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [166] total 166 [2018-09-26 08:25:55,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 167 states [2018-09-26 08:25:55,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 167 interpolants. [2018-09-26 08:25:55,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13861, Invalid=13861, Unknown=0, NotChecked=0, Total=27722 [2018-09-26 08:25:55,532 INFO L87 Difference]: Start difference. First operand 168 states and 168 transitions. Second operand 167 states. [2018-09-26 08:25:55,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:55,950 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-09-26 08:25:55,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2018-09-26 08:25:55,950 INFO L78 Accepts]: Start accepts. Automaton has 167 states. Word has length 167 [2018-09-26 08:25:55,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:55,950 INFO L225 Difference]: With dead ends: 171 [2018-09-26 08:25:55,951 INFO L226 Difference]: Without dead ends: 169 [2018-09-26 08:25:55,952 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=13861, Invalid=13861, Unknown=0, NotChecked=0, Total=27722 [2018-09-26 08:25:55,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-09-26 08:25:55,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-09-26 08:25:55,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-09-26 08:25:55,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2018-09-26 08:25:55,954 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 167 [2018-09-26 08:25:55,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:55,955 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2018-09-26 08:25:55,955 INFO L481 AbstractCegarLoop]: Interpolant automaton has 167 states. [2018-09-26 08:25:55,955 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2018-09-26 08:25:55,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-09-26 08:25:55,955 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:55,955 INFO L375 BasicCegarLoop]: trace histogram [165, 1, 1, 1] [2018-09-26 08:25:55,955 INFO L423 AbstractCegarLoop]: === Iteration 166 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:55,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:55,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1575779834, now seen corresponding path program 165 times [2018-09-26 08:25:55,956 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:56,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:56,788 INFO L134 CoverageAnalysis]: Checked inductivity of 13695 backedges. 0 proven. 13695 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:56,788 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:56,789 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [167] total 167 [2018-09-26 08:25:56,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 168 states [2018-09-26 08:25:56,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2018-09-26 08:25:56,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-09-26 08:25:56,792 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 168 states. [2018-09-26 08:25:57,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:57,082 INFO L93 Difference]: Finished difference Result 172 states and 172 transitions. [2018-09-26 08:25:57,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2018-09-26 08:25:57,082 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 168 [2018-09-26 08:25:57,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:57,082 INFO L225 Difference]: With dead ends: 172 [2018-09-26 08:25:57,083 INFO L226 Difference]: Without dead ends: 170 [2018-09-26 08:25:57,084 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-09-26 08:25:57,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-09-26 08:25:57,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2018-09-26 08:25:57,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-09-26 08:25:57,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 170 transitions. [2018-09-26 08:25:57,088 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 170 transitions. Word has length 168 [2018-09-26 08:25:57,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:57,088 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 170 transitions. [2018-09-26 08:25:57,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 168 states. [2018-09-26 08:25:57,088 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 170 transitions. [2018-09-26 08:25:57,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-09-26 08:25:57,089 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:57,089 INFO L375 BasicCegarLoop]: trace histogram [166, 1, 1, 1] [2018-09-26 08:25:57,089 INFO L423 AbstractCegarLoop]: === Iteration 167 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:57,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:57,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1604538464, now seen corresponding path program 166 times [2018-09-26 08:25:57,090 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:57,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:57,920 INFO L134 CoverageAnalysis]: Checked inductivity of 13861 backedges. 0 proven. 13861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:57,920 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:57,920 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [168] total 168 [2018-09-26 08:25:57,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 169 states [2018-09-26 08:25:57,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 169 interpolants. [2018-09-26 08:25:57,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14196, Invalid=14196, Unknown=0, NotChecked=0, Total=28392 [2018-09-26 08:25:57,924 INFO L87 Difference]: Start difference. First operand 170 states and 170 transitions. Second operand 169 states. [2018-09-26 08:25:58,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:58,595 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2018-09-26 08:25:58,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2018-09-26 08:25:58,595 INFO L78 Accepts]: Start accepts. Automaton has 169 states. Word has length 169 [2018-09-26 08:25:58,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:58,596 INFO L225 Difference]: With dead ends: 173 [2018-09-26 08:25:58,596 INFO L226 Difference]: Without dead ends: 171 [2018-09-26 08:25:58,597 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=14196, Invalid=14196, Unknown=0, NotChecked=0, Total=28392 [2018-09-26 08:25:58,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-09-26 08:25:58,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-09-26 08:25:58,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-09-26 08:25:58,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-09-26 08:25:58,599 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 169 [2018-09-26 08:25:58,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:58,600 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-09-26 08:25:58,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 169 states. [2018-09-26 08:25:58,600 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-09-26 08:25:58,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-09-26 08:25:58,600 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:58,600 INFO L375 BasicCegarLoop]: trace histogram [167, 1, 1, 1] [2018-09-26 08:25:58,600 INFO L423 AbstractCegarLoop]: === Iteration 168 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:58,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:58,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1798911302, now seen corresponding path program 167 times [2018-09-26 08:25:58,601 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:25:58,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:25:59,449 INFO L134 CoverageAnalysis]: Checked inductivity of 14028 backedges. 0 proven. 14028 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:25:59,450 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:25:59,450 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [169] total 169 [2018-09-26 08:25:59,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 170 states [2018-09-26 08:25:59,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2018-09-26 08:25:59,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-09-26 08:25:59,454 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 170 states. [2018-09-26 08:25:59,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:25:59,929 INFO L93 Difference]: Finished difference Result 174 states and 174 transitions. [2018-09-26 08:25:59,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2018-09-26 08:25:59,929 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 170 [2018-09-26 08:25:59,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:25:59,930 INFO L225 Difference]: With dead ends: 174 [2018-09-26 08:25:59,930 INFO L226 Difference]: Without dead ends: 172 [2018-09-26 08:25:59,932 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-09-26 08:25:59,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-09-26 08:25:59,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2018-09-26 08:25:59,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-09-26 08:25:59,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2018-09-26 08:25:59,934 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 170 [2018-09-26 08:25:59,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:25:59,934 INFO L480 AbstractCegarLoop]: Abstraction has 172 states and 172 transitions. [2018-09-26 08:25:59,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 170 states. [2018-09-26 08:25:59,934 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 172 transitions. [2018-09-26 08:25:59,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-09-26 08:25:59,935 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:25:59,935 INFO L375 BasicCegarLoop]: trace histogram [168, 1, 1, 1] [2018-09-26 08:25:59,935 INFO L423 AbstractCegarLoop]: === Iteration 169 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:25:59,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:25:59,935 INFO L82 PathProgramCache]: Analyzing trace with hash -68328352, now seen corresponding path program 168 times [2018-09-26 08:25:59,935 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:00,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:00,790 INFO L134 CoverageAnalysis]: Checked inductivity of 14196 backedges. 0 proven. 14196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:00,791 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:00,791 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [170] total 170 [2018-09-26 08:26:00,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 171 states [2018-09-26 08:26:00,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 171 interpolants. [2018-09-26 08:26:00,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14535, Invalid=14535, Unknown=0, NotChecked=0, Total=29070 [2018-09-26 08:26:00,794 INFO L87 Difference]: Start difference. First operand 172 states and 172 transitions. Second operand 171 states. [2018-09-26 08:26:01,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:01,180 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-09-26 08:26:01,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2018-09-26 08:26:01,180 INFO L78 Accepts]: Start accepts. Automaton has 171 states. Word has length 171 [2018-09-26 08:26:01,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:01,181 INFO L225 Difference]: With dead ends: 175 [2018-09-26 08:26:01,181 INFO L226 Difference]: Without dead ends: 173 [2018-09-26 08:26:01,183 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=14535, Invalid=14535, Unknown=0, NotChecked=0, Total=29070 [2018-09-26 08:26:01,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-09-26 08:26:01,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-09-26 08:26:01,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-09-26 08:26:01,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-09-26 08:26:01,185 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 171 [2018-09-26 08:26:01,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:01,185 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-09-26 08:26:01,185 INFO L481 AbstractCegarLoop]: Interpolant automaton has 171 states. [2018-09-26 08:26:01,185 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-09-26 08:26:01,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-09-26 08:26:01,186 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:01,186 INFO L375 BasicCegarLoop]: trace histogram [169, 1, 1, 1] [2018-09-26 08:26:01,186 INFO L423 AbstractCegarLoop]: === Iteration 170 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:01,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:01,186 INFO L82 PathProgramCache]: Analyzing trace with hash -2118182778, now seen corresponding path program 169 times [2018-09-26 08:26:01,186 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:01,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:02,067 INFO L134 CoverageAnalysis]: Checked inductivity of 14365 backedges. 0 proven. 14365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:02,068 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:02,068 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [171] total 171 [2018-09-26 08:26:02,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 172 states [2018-09-26 08:26:02,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2018-09-26 08:26:02,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-09-26 08:26:02,072 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 172 states. [2018-09-26 08:26:02,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:02,767 INFO L93 Difference]: Finished difference Result 176 states and 176 transitions. [2018-09-26 08:26:02,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2018-09-26 08:26:02,767 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 172 [2018-09-26 08:26:02,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:02,767 INFO L225 Difference]: With dead ends: 176 [2018-09-26 08:26:02,767 INFO L226 Difference]: Without dead ends: 174 [2018-09-26 08:26:02,769 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-09-26 08:26:02,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-09-26 08:26:02,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2018-09-26 08:26:02,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-09-26 08:26:02,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 174 transitions. [2018-09-26 08:26:02,772 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 174 transitions. Word has length 172 [2018-09-26 08:26:02,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:02,772 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 174 transitions. [2018-09-26 08:26:02,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 172 states. [2018-09-26 08:26:02,772 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 174 transitions. [2018-09-26 08:26:02,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-09-26 08:26:02,772 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:02,772 INFO L375 BasicCegarLoop]: trace histogram [170, 1, 1, 1] [2018-09-26 08:26:02,773 INFO L423 AbstractCegarLoop]: === Iteration 171 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:02,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:02,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1239160544, now seen corresponding path program 170 times [2018-09-26 08:26:02,773 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:02,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:03,654 INFO L134 CoverageAnalysis]: Checked inductivity of 14535 backedges. 0 proven. 14535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:03,655 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:03,655 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [172] total 172 [2018-09-26 08:26:03,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 173 states [2018-09-26 08:26:03,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 173 interpolants. [2018-09-26 08:26:03,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14878, Invalid=14878, Unknown=0, NotChecked=0, Total=29756 [2018-09-26 08:26:03,658 INFO L87 Difference]: Start difference. First operand 174 states and 174 transitions. Second operand 173 states. [2018-09-26 08:26:03,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:03,870 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2018-09-26 08:26:03,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2018-09-26 08:26:03,870 INFO L78 Accepts]: Start accepts. Automaton has 173 states. Word has length 173 [2018-09-26 08:26:03,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:03,871 INFO L225 Difference]: With dead ends: 177 [2018-09-26 08:26:03,871 INFO L226 Difference]: Without dead ends: 175 [2018-09-26 08:26:03,872 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=14878, Invalid=14878, Unknown=0, NotChecked=0, Total=29756 [2018-09-26 08:26:03,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-09-26 08:26:03,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-09-26 08:26:03,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-09-26 08:26:03,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2018-09-26 08:26:03,876 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 173 [2018-09-26 08:26:03,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:03,876 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 175 transitions. [2018-09-26 08:26:03,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 173 states. [2018-09-26 08:26:03,877 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 175 transitions. [2018-09-26 08:26:03,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-09-26 08:26:03,877 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:03,878 INFO L375 BasicCegarLoop]: trace histogram [171, 1, 1, 1] [2018-09-26 08:26:03,878 INFO L423 AbstractCegarLoop]: === Iteration 172 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:03,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:03,878 INFO L82 PathProgramCache]: Analyzing trace with hash 240724934, now seen corresponding path program 171 times [2018-09-26 08:26:03,878 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:04,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:04,752 INFO L134 CoverageAnalysis]: Checked inductivity of 14706 backedges. 0 proven. 14706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:04,752 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:04,752 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [173] total 173 [2018-09-26 08:26:04,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 174 states [2018-09-26 08:26:04,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2018-09-26 08:26:04,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-09-26 08:26:04,756 INFO L87 Difference]: Start difference. First operand 175 states and 175 transitions. Second operand 174 states. [2018-09-26 08:26:05,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:05,566 INFO L93 Difference]: Finished difference Result 178 states and 178 transitions. [2018-09-26 08:26:05,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2018-09-26 08:26:05,566 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 174 [2018-09-26 08:26:05,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:05,567 INFO L225 Difference]: With dead ends: 178 [2018-09-26 08:26:05,567 INFO L226 Difference]: Without dead ends: 176 [2018-09-26 08:26:05,569 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-09-26 08:26:05,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-09-26 08:26:05,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2018-09-26 08:26:05,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-09-26 08:26:05,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2018-09-26 08:26:05,572 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 174 [2018-09-26 08:26:05,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:05,572 INFO L480 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2018-09-26 08:26:05,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 174 states. [2018-09-26 08:26:05,573 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2018-09-26 08:26:05,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-09-26 08:26:05,573 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:05,573 INFO L375 BasicCegarLoop]: trace histogram [172, 1, 1, 1] [2018-09-26 08:26:05,574 INFO L423 AbstractCegarLoop]: === Iteration 173 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:05,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:05,574 INFO L82 PathProgramCache]: Analyzing trace with hash -1127465504, now seen corresponding path program 172 times [2018-09-26 08:26:05,574 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:05,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:06,474 INFO L134 CoverageAnalysis]: Checked inductivity of 14878 backedges. 0 proven. 14878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:06,474 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:06,474 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [174] total 174 [2018-09-26 08:26:06,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 175 states [2018-09-26 08:26:06,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 175 interpolants. [2018-09-26 08:26:06,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15225, Invalid=15225, Unknown=0, NotChecked=0, Total=30450 [2018-09-26 08:26:06,478 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 175 states. [2018-09-26 08:26:06,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:06,895 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-09-26 08:26:06,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2018-09-26 08:26:06,895 INFO L78 Accepts]: Start accepts. Automaton has 175 states. Word has length 175 [2018-09-26 08:26:06,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:06,895 INFO L225 Difference]: With dead ends: 179 [2018-09-26 08:26:06,895 INFO L226 Difference]: Without dead ends: 177 [2018-09-26 08:26:06,898 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=15225, Invalid=15225, Unknown=0, NotChecked=0, Total=30450 [2018-09-26 08:26:06,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-09-26 08:26:06,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-09-26 08:26:06,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-09-26 08:26:06,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-09-26 08:26:06,900 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 175 [2018-09-26 08:26:06,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:06,901 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-09-26 08:26:06,901 INFO L481 AbstractCegarLoop]: Interpolant automaton has 175 states. [2018-09-26 08:26:06,901 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-09-26 08:26:06,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-09-26 08:26:06,901 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:06,902 INFO L375 BasicCegarLoop]: trace histogram [173, 1, 1, 1] [2018-09-26 08:26:06,902 INFO L423 AbstractCegarLoop]: === Iteration 174 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:06,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:06,902 INFO L82 PathProgramCache]: Analyzing trace with hash -591696122, now seen corresponding path program 173 times [2018-09-26 08:26:06,902 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:07,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:07,840 INFO L134 CoverageAnalysis]: Checked inductivity of 15051 backedges. 0 proven. 15051 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:07,840 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:07,840 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [175] total 175 [2018-09-26 08:26:07,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 176 states [2018-09-26 08:26:07,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2018-09-26 08:26:07,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-09-26 08:26:07,844 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 176 states. [2018-09-26 08:26:08,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:08,575 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2018-09-26 08:26:08,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2018-09-26 08:26:08,576 INFO L78 Accepts]: Start accepts. Automaton has 176 states. Word has length 176 [2018-09-26 08:26:08,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:08,576 INFO L225 Difference]: With dead ends: 180 [2018-09-26 08:26:08,576 INFO L226 Difference]: Without dead ends: 178 [2018-09-26 08:26:08,578 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-09-26 08:26:08,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-09-26 08:26:08,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2018-09-26 08:26:08,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-09-26 08:26:08,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 178 transitions. [2018-09-26 08:26:08,581 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 178 transitions. Word has length 176 [2018-09-26 08:26:08,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:08,581 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 178 transitions. [2018-09-26 08:26:08,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 176 states. [2018-09-26 08:26:08,581 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 178 transitions. [2018-09-26 08:26:08,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-09-26 08:26:08,582 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:08,582 INFO L375 BasicCegarLoop]: trace histogram [174, 1, 1, 1] [2018-09-26 08:26:08,582 INFO L423 AbstractCegarLoop]: === Iteration 175 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:08,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:08,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1162714464, now seen corresponding path program 174 times [2018-09-26 08:26:08,582 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:08,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:09,543 INFO L134 CoverageAnalysis]: Checked inductivity of 15225 backedges. 0 proven. 15225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:09,543 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:09,543 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [176] total 176 [2018-09-26 08:26:09,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 177 states [2018-09-26 08:26:09,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 177 interpolants. [2018-09-26 08:26:09,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15576, Invalid=15576, Unknown=0, NotChecked=0, Total=31152 [2018-09-26 08:26:09,547 INFO L87 Difference]: Start difference. First operand 178 states and 178 transitions. Second operand 177 states. [2018-09-26 08:26:10,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:10,064 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2018-09-26 08:26:10,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2018-09-26 08:26:10,064 INFO L78 Accepts]: Start accepts. Automaton has 177 states. Word has length 177 [2018-09-26 08:26:10,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:10,065 INFO L225 Difference]: With dead ends: 181 [2018-09-26 08:26:10,065 INFO L226 Difference]: Without dead ends: 179 [2018-09-26 08:26:10,067 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=15576, Invalid=15576, Unknown=0, NotChecked=0, Total=31152 [2018-09-26 08:26:10,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-09-26 08:26:10,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-09-26 08:26:10,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-09-26 08:26:10,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2018-09-26 08:26:10,069 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 179 transitions. Word has length 177 [2018-09-26 08:26:10,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:10,070 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 179 transitions. [2018-09-26 08:26:10,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 177 states. [2018-09-26 08:26:10,070 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 179 transitions. [2018-09-26 08:26:10,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-09-26 08:26:10,070 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:10,070 INFO L375 BasicCegarLoop]: trace histogram [175, 1, 1, 1] [2018-09-26 08:26:10,070 INFO L423 AbstractCegarLoop]: === Iteration 176 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:10,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:10,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1684413882, now seen corresponding path program 175 times [2018-09-26 08:26:10,071 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:10,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:11,051 INFO L134 CoverageAnalysis]: Checked inductivity of 15400 backedges. 0 proven. 15400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:11,052 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:11,052 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [177] total 177 [2018-09-26 08:26:11,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 178 states [2018-09-26 08:26:11,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2018-09-26 08:26:11,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-09-26 08:26:11,056 INFO L87 Difference]: Start difference. First operand 179 states and 179 transitions. Second operand 178 states. [2018-09-26 08:26:11,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:11,800 INFO L93 Difference]: Finished difference Result 182 states and 182 transitions. [2018-09-26 08:26:11,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2018-09-26 08:26:11,800 INFO L78 Accepts]: Start accepts. Automaton has 178 states. Word has length 178 [2018-09-26 08:26:11,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:11,801 INFO L225 Difference]: With dead ends: 182 [2018-09-26 08:26:11,801 INFO L226 Difference]: Without dead ends: 180 [2018-09-26 08:26:11,802 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-09-26 08:26:11,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-09-26 08:26:11,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2018-09-26 08:26:11,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-09-26 08:26:11,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 180 transitions. [2018-09-26 08:26:11,805 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 180 transitions. Word has length 178 [2018-09-26 08:26:11,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:11,805 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 180 transitions. [2018-09-26 08:26:11,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 178 states. [2018-09-26 08:26:11,805 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 180 transitions. [2018-09-26 08:26:11,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-09-26 08:26:11,806 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:11,806 INFO L375 BasicCegarLoop]: trace histogram [176, 1, 1, 1] [2018-09-26 08:26:11,806 INFO L423 AbstractCegarLoop]: === Iteration 177 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:11,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:11,806 INFO L82 PathProgramCache]: Analyzing trace with hash -677226656, now seen corresponding path program 176 times [2018-09-26 08:26:11,806 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:11,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:12,753 INFO L134 CoverageAnalysis]: Checked inductivity of 15576 backedges. 0 proven. 15576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:12,753 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:12,753 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [178] total 178 [2018-09-26 08:26:12,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 179 states [2018-09-26 08:26:12,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 179 interpolants. [2018-09-26 08:26:12,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15931, Invalid=15931, Unknown=0, NotChecked=0, Total=31862 [2018-09-26 08:26:12,757 INFO L87 Difference]: Start difference. First operand 180 states and 180 transitions. Second operand 179 states. [2018-09-26 08:26:13,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:13,224 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-09-26 08:26:13,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 179 states. [2018-09-26 08:26:13,224 INFO L78 Accepts]: Start accepts. Automaton has 179 states. Word has length 179 [2018-09-26 08:26:13,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:13,225 INFO L225 Difference]: With dead ends: 183 [2018-09-26 08:26:13,225 INFO L226 Difference]: Without dead ends: 181 [2018-09-26 08:26:13,227 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=15931, Invalid=15931, Unknown=0, NotChecked=0, Total=31862 [2018-09-26 08:26:13,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-09-26 08:26:13,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-09-26 08:26:13,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-09-26 08:26:13,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-09-26 08:26:13,230 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 179 [2018-09-26 08:26:13,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:13,230 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-09-26 08:26:13,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 179 states. [2018-09-26 08:26:13,230 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-09-26 08:26:13,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-09-26 08:26:13,231 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:13,231 INFO L375 BasicCegarLoop]: trace histogram [177, 1, 1, 1] [2018-09-26 08:26:13,231 INFO L423 AbstractCegarLoop]: === Iteration 178 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:13,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:13,232 INFO L82 PathProgramCache]: Analyzing trace with hash 480806278, now seen corresponding path program 177 times [2018-09-26 08:26:13,232 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:13,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:14,233 INFO L134 CoverageAnalysis]: Checked inductivity of 15753 backedges. 0 proven. 15753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:14,234 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:14,234 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [179] total 179 [2018-09-26 08:26:14,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 180 states [2018-09-26 08:26:14,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 180 interpolants. [2018-09-26 08:26:14,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-09-26 08:26:14,237 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 180 states. [2018-09-26 08:26:15,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:15,125 INFO L93 Difference]: Finished difference Result 184 states and 184 transitions. [2018-09-26 08:26:15,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2018-09-26 08:26:15,125 INFO L78 Accepts]: Start accepts. Automaton has 180 states. Word has length 180 [2018-09-26 08:26:15,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:15,126 INFO L225 Difference]: With dead ends: 184 [2018-09-26 08:26:15,126 INFO L226 Difference]: Without dead ends: 182 [2018-09-26 08:26:15,128 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-09-26 08:26:15,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-09-26 08:26:15,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-09-26 08:26:15,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-09-26 08:26:15,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 182 transitions. [2018-09-26 08:26:15,130 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 182 transitions. Word has length 180 [2018-09-26 08:26:15,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:15,130 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 182 transitions. [2018-09-26 08:26:15,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 180 states. [2018-09-26 08:26:15,131 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 182 transitions. [2018-09-26 08:26:15,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-09-26 08:26:15,131 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:15,131 INFO L375 BasicCegarLoop]: trace histogram [178, 1, 1, 1] [2018-09-26 08:26:15,131 INFO L423 AbstractCegarLoop]: === Iteration 179 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:15,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:15,132 INFO L82 PathProgramCache]: Analyzing trace with hash 2020088864, now seen corresponding path program 178 times [2018-09-26 08:26:15,132 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:15,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:16,107 INFO L134 CoverageAnalysis]: Checked inductivity of 15931 backedges. 0 proven. 15931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:16,107 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:16,107 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [180] total 180 [2018-09-26 08:26:16,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 181 states [2018-09-26 08:26:16,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 181 interpolants. [2018-09-26 08:26:16,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16290, Invalid=16290, Unknown=0, NotChecked=0, Total=32580 [2018-09-26 08:26:16,111 INFO L87 Difference]: Start difference. First operand 182 states and 182 transitions. Second operand 181 states. [2018-09-26 08:26:16,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:16,401 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2018-09-26 08:26:16,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 181 states. [2018-09-26 08:26:16,402 INFO L78 Accepts]: Start accepts. Automaton has 181 states. Word has length 181 [2018-09-26 08:26:16,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:16,402 INFO L225 Difference]: With dead ends: 185 [2018-09-26 08:26:16,402 INFO L226 Difference]: Without dead ends: 183 [2018-09-26 08:26:16,404 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=16290, Invalid=16290, Unknown=0, NotChecked=0, Total=32580 [2018-09-26 08:26:16,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-09-26 08:26:16,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-09-26 08:26:16,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-09-26 08:26:16,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2018-09-26 08:26:16,407 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 181 [2018-09-26 08:26:16,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:16,407 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2018-09-26 08:26:16,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 181 states. [2018-09-26 08:26:16,407 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2018-09-26 08:26:16,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-09-26 08:26:16,408 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:16,408 INFO L375 BasicCegarLoop]: trace histogram [179, 1, 1, 1] [2018-09-26 08:26:16,408 INFO L423 AbstractCegarLoop]: === Iteration 180 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:16,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:16,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1801758522, now seen corresponding path program 179 times [2018-09-26 08:26:16,408 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:16,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:17,410 INFO L134 CoverageAnalysis]: Checked inductivity of 16110 backedges. 0 proven. 16110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:17,411 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:17,411 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [181] total 181 [2018-09-26 08:26:17,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 182 states [2018-09-26 08:26:17,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 182 interpolants. [2018-09-26 08:26:17,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-09-26 08:26:17,415 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 182 states. [2018-09-26 08:26:18,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:18,294 INFO L93 Difference]: Finished difference Result 186 states and 186 transitions. [2018-09-26 08:26:18,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2018-09-26 08:26:18,294 INFO L78 Accepts]: Start accepts. Automaton has 182 states. Word has length 182 [2018-09-26 08:26:18,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:18,294 INFO L225 Difference]: With dead ends: 186 [2018-09-26 08:26:18,295 INFO L226 Difference]: Without dead ends: 184 [2018-09-26 08:26:18,297 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-09-26 08:26:18,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-09-26 08:26:18,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2018-09-26 08:26:18,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-09-26 08:26:18,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 184 transitions. [2018-09-26 08:26:18,299 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 184 transitions. Word has length 182 [2018-09-26 08:26:18,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:18,300 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 184 transitions. [2018-09-26 08:26:18,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 182 states. [2018-09-26 08:26:18,300 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 184 transitions. [2018-09-26 08:26:18,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-09-26 08:26:18,300 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:18,300 INFO L375 BasicCegarLoop]: trace histogram [180, 1, 1, 1] [2018-09-26 08:26:18,301 INFO L423 AbstractCegarLoop]: === Iteration 181 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:18,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:18,301 INFO L82 PathProgramCache]: Analyzing trace with hash -19943200, now seen corresponding path program 180 times [2018-09-26 08:26:18,301 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:18,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:19,313 INFO L134 CoverageAnalysis]: Checked inductivity of 16290 backedges. 0 proven. 16290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:19,313 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:19,314 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [182] total 182 [2018-09-26 08:26:19,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 183 states [2018-09-26 08:26:19,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 183 interpolants. [2018-09-26 08:26:19,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16653, Invalid=16653, Unknown=0, NotChecked=0, Total=33306 [2018-09-26 08:26:19,317 INFO L87 Difference]: Start difference. First operand 184 states and 184 transitions. Second operand 183 states. [2018-09-26 08:26:19,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:19,680 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2018-09-26 08:26:19,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2018-09-26 08:26:19,680 INFO L78 Accepts]: Start accepts. Automaton has 183 states. Word has length 183 [2018-09-26 08:26:19,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:19,681 INFO L225 Difference]: With dead ends: 187 [2018-09-26 08:26:19,681 INFO L226 Difference]: Without dead ends: 185 [2018-09-26 08:26:19,682 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=16653, Invalid=16653, Unknown=0, NotChecked=0, Total=33306 [2018-09-26 08:26:19,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-09-26 08:26:19,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2018-09-26 08:26:19,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-09-26 08:26:19,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2018-09-26 08:26:19,686 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 183 [2018-09-26 08:26:19,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:19,686 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2018-09-26 08:26:19,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 183 states. [2018-09-26 08:26:19,686 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2018-09-26 08:26:19,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-09-26 08:26:19,687 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:19,687 INFO L375 BasicCegarLoop]: trace histogram [181, 1, 1, 1] [2018-09-26 08:26:19,687 INFO L423 AbstractCegarLoop]: === Iteration 182 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:19,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:19,688 INFO L82 PathProgramCache]: Analyzing trace with hash -618243066, now seen corresponding path program 181 times [2018-09-26 08:26:19,688 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:19,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:20,688 INFO L134 CoverageAnalysis]: Checked inductivity of 16471 backedges. 0 proven. 16471 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:20,688 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:20,688 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [183] total 183 [2018-09-26 08:26:20,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 184 states [2018-09-26 08:26:20,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 184 interpolants. [2018-09-26 08:26:20,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-09-26 08:26:20,692 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 184 states. [2018-09-26 08:26:21,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:21,393 INFO L93 Difference]: Finished difference Result 188 states and 188 transitions. [2018-09-26 08:26:21,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2018-09-26 08:26:21,394 INFO L78 Accepts]: Start accepts. Automaton has 184 states. Word has length 184 [2018-09-26 08:26:21,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:21,394 INFO L225 Difference]: With dead ends: 188 [2018-09-26 08:26:21,394 INFO L226 Difference]: Without dead ends: 186 [2018-09-26 08:26:21,396 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-09-26 08:26:21,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-09-26 08:26:21,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2018-09-26 08:26:21,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-09-26 08:26:21,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2018-09-26 08:26:21,399 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 184 [2018-09-26 08:26:21,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:21,399 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2018-09-26 08:26:21,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 184 states. [2018-09-26 08:26:21,399 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2018-09-26 08:26:21,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-09-26 08:26:21,400 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:21,400 INFO L375 BasicCegarLoop]: trace histogram [182, 1, 1, 1] [2018-09-26 08:26:21,400 INFO L423 AbstractCegarLoop]: === Iteration 183 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:21,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:21,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1985669728, now seen corresponding path program 182 times [2018-09-26 08:26:21,400 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:21,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:22,486 INFO L134 CoverageAnalysis]: Checked inductivity of 16653 backedges. 0 proven. 16653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:22,486 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:22,486 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [184] total 184 [2018-09-26 08:26:22,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 185 states [2018-09-26 08:26:22,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 185 interpolants. [2018-09-26 08:26:22,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17020, Invalid=17020, Unknown=0, NotChecked=0, Total=34040 [2018-09-26 08:26:22,491 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand 185 states. [2018-09-26 08:26:23,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:23,495 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2018-09-26 08:26:23,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2018-09-26 08:26:23,495 INFO L78 Accepts]: Start accepts. Automaton has 185 states. Word has length 185 [2018-09-26 08:26:23,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:23,496 INFO L225 Difference]: With dead ends: 189 [2018-09-26 08:26:23,496 INFO L226 Difference]: Without dead ends: 187 [2018-09-26 08:26:23,498 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=17020, Invalid=17020, Unknown=0, NotChecked=0, Total=34040 [2018-09-26 08:26:23,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-09-26 08:26:23,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-09-26 08:26:23,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-09-26 08:26:23,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2018-09-26 08:26:23,500 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 185 [2018-09-26 08:26:23,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:23,500 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2018-09-26 08:26:23,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 185 states. [2018-09-26 08:26:23,501 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2018-09-26 08:26:23,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-09-26 08:26:23,501 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:23,501 INFO L375 BasicCegarLoop]: trace histogram [183, 1, 1, 1] [2018-09-26 08:26:23,501 INFO L423 AbstractCegarLoop]: === Iteration 184 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:23,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:23,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1426223290, now seen corresponding path program 183 times [2018-09-26 08:26:23,502 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:23,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:24,542 INFO L134 CoverageAnalysis]: Checked inductivity of 16836 backedges. 0 proven. 16836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:24,543 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:24,543 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [185] total 185 [2018-09-26 08:26:24,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 186 states [2018-09-26 08:26:24,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 186 interpolants. [2018-09-26 08:26:24,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-09-26 08:26:24,546 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 186 states. [2018-09-26 08:26:24,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:24,821 INFO L93 Difference]: Finished difference Result 190 states and 190 transitions. [2018-09-26 08:26:24,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 186 states. [2018-09-26 08:26:24,821 INFO L78 Accepts]: Start accepts. Automaton has 186 states. Word has length 186 [2018-09-26 08:26:24,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:24,822 INFO L225 Difference]: With dead ends: 190 [2018-09-26 08:26:24,822 INFO L226 Difference]: Without dead ends: 188 [2018-09-26 08:26:24,824 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-09-26 08:26:24,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-09-26 08:26:24,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2018-09-26 08:26:24,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-09-26 08:26:24,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 188 transitions. [2018-09-26 08:26:24,826 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 188 transitions. Word has length 186 [2018-09-26 08:26:24,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:24,826 INFO L480 AbstractCegarLoop]: Abstraction has 188 states and 188 transitions. [2018-09-26 08:26:24,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has 186 states. [2018-09-26 08:26:24,827 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 188 transitions. [2018-09-26 08:26:24,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-09-26 08:26:24,827 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:24,827 INFO L375 BasicCegarLoop]: trace histogram [184, 1, 1, 1] [2018-09-26 08:26:24,827 INFO L423 AbstractCegarLoop]: === Iteration 185 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:24,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:24,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1263252896, now seen corresponding path program 184 times [2018-09-26 08:26:24,828 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:25,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:25,888 INFO L134 CoverageAnalysis]: Checked inductivity of 17020 backedges. 0 proven. 17020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:25,889 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:25,889 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [186] total 186 [2018-09-26 08:26:25,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 187 states [2018-09-26 08:26:25,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 187 interpolants. [2018-09-26 08:26:25,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17391, Invalid=17391, Unknown=0, NotChecked=0, Total=34782 [2018-09-26 08:26:25,893 INFO L87 Difference]: Start difference. First operand 188 states and 188 transitions. Second operand 187 states. [2018-09-26 08:26:26,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:26,663 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-09-26 08:26:26,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 187 states. [2018-09-26 08:26:26,663 INFO L78 Accepts]: Start accepts. Automaton has 187 states. Word has length 187 [2018-09-26 08:26:26,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:26,664 INFO L225 Difference]: With dead ends: 191 [2018-09-26 08:26:26,664 INFO L226 Difference]: Without dead ends: 189 [2018-09-26 08:26:26,666 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=17391, Invalid=17391, Unknown=0, NotChecked=0, Total=34782 [2018-09-26 08:26:26,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-09-26 08:26:26,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2018-09-26 08:26:26,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-09-26 08:26:26,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2018-09-26 08:26:26,669 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 187 [2018-09-26 08:26:26,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:26,669 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2018-09-26 08:26:26,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 187 states. [2018-09-26 08:26:26,669 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2018-09-26 08:26:26,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-09-26 08:26:26,670 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:26,670 INFO L375 BasicCegarLoop]: trace histogram [185, 1, 1, 1] [2018-09-26 08:26:26,670 INFO L423 AbstractCegarLoop]: === Iteration 186 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:26,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:26,670 INFO L82 PathProgramCache]: Analyzing trace with hash -506137978, now seen corresponding path program 185 times [2018-09-26 08:26:26,670 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:26,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:27,793 INFO L134 CoverageAnalysis]: Checked inductivity of 17205 backedges. 0 proven. 17205 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:27,793 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:27,794 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [187] total 187 [2018-09-26 08:26:27,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 188 states [2018-09-26 08:26:27,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 188 interpolants. [2018-09-26 08:26:27,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-09-26 08:26:27,798 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 188 states. [2018-09-26 08:26:28,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:28,828 INFO L93 Difference]: Finished difference Result 192 states and 192 transitions. [2018-09-26 08:26:28,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 188 states. [2018-09-26 08:26:28,828 INFO L78 Accepts]: Start accepts. Automaton has 188 states. Word has length 188 [2018-09-26 08:26:28,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:28,829 INFO L225 Difference]: With dead ends: 192 [2018-09-26 08:26:28,829 INFO L226 Difference]: Without dead ends: 190 [2018-09-26 08:26:28,831 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-09-26 08:26:28,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-09-26 08:26:28,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2018-09-26 08:26:28,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-09-26 08:26:28,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 190 transitions. [2018-09-26 08:26:28,833 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 190 transitions. Word has length 188 [2018-09-26 08:26:28,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:28,834 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 190 transitions. [2018-09-26 08:26:28,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 188 states. [2018-09-26 08:26:28,834 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 190 transitions. [2018-09-26 08:26:28,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-09-26 08:26:28,834 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:28,834 INFO L375 BasicCegarLoop]: trace histogram [186, 1, 1, 1] [2018-09-26 08:26:28,835 INFO L423 AbstractCegarLoop]: === Iteration 187 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:28,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:28,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1489588000, now seen corresponding path program 186 times [2018-09-26 08:26:28,835 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:29,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:29,877 INFO L134 CoverageAnalysis]: Checked inductivity of 17391 backedges. 0 proven. 17391 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:29,877 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:29,877 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [188] total 188 [2018-09-26 08:26:29,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 189 states [2018-09-26 08:26:29,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 189 interpolants. [2018-09-26 08:26:29,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17766, Invalid=17766, Unknown=0, NotChecked=0, Total=35532 [2018-09-26 08:26:29,881 INFO L87 Difference]: Start difference. First operand 190 states and 190 transitions. Second operand 189 states. [2018-09-26 08:26:30,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:30,343 INFO L93 Difference]: Finished difference Result 193 states and 193 transitions. [2018-09-26 08:26:30,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 189 states. [2018-09-26 08:26:30,343 INFO L78 Accepts]: Start accepts. Automaton has 189 states. Word has length 189 [2018-09-26 08:26:30,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:30,344 INFO L225 Difference]: With dead ends: 193 [2018-09-26 08:26:30,344 INFO L226 Difference]: Without dead ends: 191 [2018-09-26 08:26:30,345 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=17766, Invalid=17766, Unknown=0, NotChecked=0, Total=35532 [2018-09-26 08:26:30,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-09-26 08:26:30,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-09-26 08:26:30,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-09-26 08:26:30,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2018-09-26 08:26:30,348 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 189 [2018-09-26 08:26:30,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:30,348 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2018-09-26 08:26:30,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 189 states. [2018-09-26 08:26:30,348 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2018-09-26 08:26:30,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-09-26 08:26:30,348 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:30,349 INFO L375 BasicCegarLoop]: trace histogram [187, 1, 1, 1] [2018-09-26 08:26:30,349 INFO L423 AbstractCegarLoop]: === Iteration 188 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:30,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:30,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1067416122, now seen corresponding path program 187 times [2018-09-26 08:26:30,349 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:30,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:31,459 INFO L134 CoverageAnalysis]: Checked inductivity of 17578 backedges. 0 proven. 17578 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:31,459 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:31,459 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [189] total 189 [2018-09-26 08:26:31,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 190 states [2018-09-26 08:26:31,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 190 interpolants. [2018-09-26 08:26:31,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-09-26 08:26:31,463 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 190 states. [2018-09-26 08:26:31,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:31,869 INFO L93 Difference]: Finished difference Result 194 states and 194 transitions. [2018-09-26 08:26:31,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2018-09-26 08:26:31,869 INFO L78 Accepts]: Start accepts. Automaton has 190 states. Word has length 190 [2018-09-26 08:26:31,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:31,869 INFO L225 Difference]: With dead ends: 194 [2018-09-26 08:26:31,869 INFO L226 Difference]: Without dead ends: 192 [2018-09-26 08:26:31,871 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-09-26 08:26:31,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-09-26 08:26:31,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2018-09-26 08:26:31,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-09-26 08:26:31,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 192 transitions. [2018-09-26 08:26:31,873 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 192 transitions. Word has length 190 [2018-09-26 08:26:31,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:31,874 INFO L480 AbstractCegarLoop]: Abstraction has 192 states and 192 transitions. [2018-09-26 08:26:31,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 190 states. [2018-09-26 08:26:31,874 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 192 transitions. [2018-09-26 08:26:31,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-09-26 08:26:31,874 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:31,874 INFO L375 BasicCegarLoop]: trace histogram [188, 1, 1, 1] [2018-09-26 08:26:31,875 INFO L423 AbstractCegarLoop]: === Iteration 189 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:31,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:31,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1269834720, now seen corresponding path program 188 times [2018-09-26 08:26:31,875 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:32,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:32,916 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:32,917 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:32,917 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [190] total 190 [2018-09-26 08:26:32,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 191 states [2018-09-26 08:26:32,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 191 interpolants. [2018-09-26 08:26:32,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18145, Invalid=18145, Unknown=0, NotChecked=0, Total=36290 [2018-09-26 08:26:32,921 INFO L87 Difference]: Start difference. First operand 192 states and 192 transitions. Second operand 191 states. [2018-09-26 08:26:33,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:33,855 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-09-26 08:26:33,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 191 states. [2018-09-26 08:26:33,855 INFO L78 Accepts]: Start accepts. Automaton has 191 states. Word has length 191 [2018-09-26 08:26:33,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:33,856 INFO L225 Difference]: With dead ends: 195 [2018-09-26 08:26:33,856 INFO L226 Difference]: Without dead ends: 193 [2018-09-26 08:26:33,859 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=18145, Invalid=18145, Unknown=0, NotChecked=0, Total=36290 [2018-09-26 08:26:33,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-09-26 08:26:33,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2018-09-26 08:26:33,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-09-26 08:26:33,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2018-09-26 08:26:33,862 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 191 [2018-09-26 08:26:33,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:33,863 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2018-09-26 08:26:33,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 191 states. [2018-09-26 08:26:33,863 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2018-09-26 08:26:33,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-09-26 08:26:33,864 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:33,864 INFO L375 BasicCegarLoop]: trace histogram [189, 1, 1, 1] [2018-09-26 08:26:33,864 INFO L423 AbstractCegarLoop]: === Iteration 190 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:33,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:33,864 INFO L82 PathProgramCache]: Analyzing trace with hash 710166790, now seen corresponding path program 189 times [2018-09-26 08:26:33,864 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:34,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:35,102 INFO L134 CoverageAnalysis]: Checked inductivity of 17955 backedges. 0 proven. 17955 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:35,103 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:35,103 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [191] total 191 [2018-09-26 08:26:35,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 192 states [2018-09-26 08:26:35,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2018-09-26 08:26:35,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-09-26 08:26:35,108 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 192 states. [2018-09-26 08:26:36,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:36,228 INFO L93 Difference]: Finished difference Result 196 states and 196 transitions. [2018-09-26 08:26:36,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2018-09-26 08:26:36,229 INFO L78 Accepts]: Start accepts. Automaton has 192 states. Word has length 192 [2018-09-26 08:26:36,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:36,229 INFO L225 Difference]: With dead ends: 196 [2018-09-26 08:26:36,229 INFO L226 Difference]: Without dead ends: 194 [2018-09-26 08:26:36,231 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-09-26 08:26:36,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-09-26 08:26:36,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2018-09-26 08:26:36,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-09-26 08:26:36,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 194 transitions. [2018-09-26 08:26:36,235 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 194 transitions. Word has length 192 [2018-09-26 08:26:36,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:36,235 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 194 transitions. [2018-09-26 08:26:36,235 INFO L481 AbstractCegarLoop]: Interpolant automaton has 192 states. [2018-09-26 08:26:36,235 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 194 transitions. [2018-09-26 08:26:36,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-09-26 08:26:36,236 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:36,236 INFO L375 BasicCegarLoop]: trace histogram [190, 1, 1, 1] [2018-09-26 08:26:36,236 INFO L423 AbstractCegarLoop]: === Iteration 191 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:36,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:36,236 INFO L82 PathProgramCache]: Analyzing trace with hash 540330144, now seen corresponding path program 190 times [2018-09-26 08:26:36,237 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:36,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:37,248 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:37,248 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:37,248 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [192] total 192 [2018-09-26 08:26:37,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 193 states [2018-09-26 08:26:37,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 193 interpolants. [2018-09-26 08:26:37,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18528, Invalid=18528, Unknown=0, NotChecked=0, Total=37056 [2018-09-26 08:26:37,252 INFO L87 Difference]: Start difference. First operand 194 states and 194 transitions. Second operand 193 states. [2018-09-26 08:26:37,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:37,807 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2018-09-26 08:26:37,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 193 states. [2018-09-26 08:26:37,807 INFO L78 Accepts]: Start accepts. Automaton has 193 states. Word has length 193 [2018-09-26 08:26:37,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:37,808 INFO L225 Difference]: With dead ends: 197 [2018-09-26 08:26:37,808 INFO L226 Difference]: Without dead ends: 195 [2018-09-26 08:26:37,809 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=18528, Invalid=18528, Unknown=0, NotChecked=0, Total=37056 [2018-09-26 08:26:37,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-09-26 08:26:37,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2018-09-26 08:26:37,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-09-26 08:26:37,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 195 transitions. [2018-09-26 08:26:37,812 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 195 transitions. Word has length 193 [2018-09-26 08:26:37,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:37,812 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 195 transitions. [2018-09-26 08:26:37,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 193 states. [2018-09-26 08:26:37,812 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 195 transitions. [2018-09-26 08:26:37,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-09-26 08:26:37,812 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:37,812 INFO L375 BasicCegarLoop]: trace histogram [191, 1, 1, 1] [2018-09-26 08:26:37,813 INFO L423 AbstractCegarLoop]: === Iteration 192 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:37,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:37,813 INFO L82 PathProgramCache]: Analyzing trace with hash -429638586, now seen corresponding path program 191 times [2018-09-26 08:26:37,813 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:37,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:38,893 INFO L134 CoverageAnalysis]: Checked inductivity of 18336 backedges. 0 proven. 18336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:38,894 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:38,894 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [193] total 193 [2018-09-26 08:26:38,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 194 states [2018-09-26 08:26:38,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 194 interpolants. [2018-09-26 08:26:38,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-09-26 08:26:38,900 INFO L87 Difference]: Start difference. First operand 195 states and 195 transitions. Second operand 194 states. [2018-09-26 08:26:39,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:39,225 INFO L93 Difference]: Finished difference Result 198 states and 198 transitions. [2018-09-26 08:26:39,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 194 states. [2018-09-26 08:26:39,226 INFO L78 Accepts]: Start accepts. Automaton has 194 states. Word has length 194 [2018-09-26 08:26:39,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:39,226 INFO L225 Difference]: With dead ends: 198 [2018-09-26 08:26:39,226 INFO L226 Difference]: Without dead ends: 196 [2018-09-26 08:26:39,230 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-09-26 08:26:39,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-09-26 08:26:39,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2018-09-26 08:26:39,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-09-26 08:26:39,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2018-09-26 08:26:39,234 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 194 [2018-09-26 08:26:39,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:39,234 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2018-09-26 08:26:39,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 194 states. [2018-09-26 08:26:39,234 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2018-09-26 08:26:39,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-09-26 08:26:39,235 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:39,235 INFO L375 BasicCegarLoop]: trace histogram [192, 1, 1, 1] [2018-09-26 08:26:39,235 INFO L423 AbstractCegarLoop]: === Iteration 193 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:39,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:39,236 INFO L82 PathProgramCache]: Analyzing trace with hash -433898144, now seen corresponding path program 192 times [2018-09-26 08:26:39,236 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:39,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:40,325 INFO L134 CoverageAnalysis]: Checked inductivity of 18528 backedges. 0 proven. 18528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:40,325 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:40,325 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [194] total 194 [2018-09-26 08:26:40,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 195 states [2018-09-26 08:26:40,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 195 interpolants. [2018-09-26 08:26:40,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18915, Invalid=18915, Unknown=0, NotChecked=0, Total=37830 [2018-09-26 08:26:40,330 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 195 states. [2018-09-26 08:26:40,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:40,801 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2018-09-26 08:26:40,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2018-09-26 08:26:40,802 INFO L78 Accepts]: Start accepts. Automaton has 195 states. Word has length 195 [2018-09-26 08:26:40,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:40,802 INFO L225 Difference]: With dead ends: 199 [2018-09-26 08:26:40,802 INFO L226 Difference]: Without dead ends: 197 [2018-09-26 08:26:40,804 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=18915, Invalid=18915, Unknown=0, NotChecked=0, Total=37830 [2018-09-26 08:26:40,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-09-26 08:26:40,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2018-09-26 08:26:40,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-09-26 08:26:40,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2018-09-26 08:26:40,807 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 195 [2018-09-26 08:26:40,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:40,807 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2018-09-26 08:26:40,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 195 states. [2018-09-26 08:26:40,807 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2018-09-26 08:26:40,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-09-26 08:26:40,808 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:40,808 INFO L375 BasicCegarLoop]: trace histogram [193, 1, 1, 1] [2018-09-26 08:26:40,808 INFO L423 AbstractCegarLoop]: === Iteration 194 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:40,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:40,808 INFO L82 PathProgramCache]: Analyzing trace with hash -565944442, now seen corresponding path program 193 times [2018-09-26 08:26:40,809 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:40,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:41,907 INFO L134 CoverageAnalysis]: Checked inductivity of 18721 backedges. 0 proven. 18721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:41,908 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:41,908 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [195] total 195 [2018-09-26 08:26:41,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 196 states [2018-09-26 08:26:41,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 196 interpolants. [2018-09-26 08:26:41,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-09-26 08:26:41,912 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 196 states. [2018-09-26 08:26:42,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:42,736 INFO L93 Difference]: Finished difference Result 200 states and 200 transitions. [2018-09-26 08:26:42,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 196 states. [2018-09-26 08:26:42,736 INFO L78 Accepts]: Start accepts. Automaton has 196 states. Word has length 196 [2018-09-26 08:26:42,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:42,737 INFO L225 Difference]: With dead ends: 200 [2018-09-26 08:26:42,737 INFO L226 Difference]: Without dead ends: 198 [2018-09-26 08:26:42,739 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-09-26 08:26:42,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-09-26 08:26:42,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2018-09-26 08:26:42,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-09-26 08:26:42,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 198 transitions. [2018-09-26 08:26:42,743 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 198 transitions. Word has length 196 [2018-09-26 08:26:42,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:42,743 INFO L480 AbstractCegarLoop]: Abstraction has 198 states and 198 transitions. [2018-09-26 08:26:42,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 196 states. [2018-09-26 08:26:42,743 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 198 transitions. [2018-09-26 08:26:42,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-09-26 08:26:42,744 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:42,744 INFO L375 BasicCegarLoop]: trace histogram [194, 1, 1, 1] [2018-09-26 08:26:42,744 INFO L423 AbstractCegarLoop]: === Iteration 195 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:42,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:42,745 INFO L82 PathProgramCache]: Analyzing trace with hash -364412384, now seen corresponding path program 194 times [2018-09-26 08:26:42,745 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:43,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:43,952 INFO L134 CoverageAnalysis]: Checked inductivity of 18915 backedges. 0 proven. 18915 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:43,952 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:43,952 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [196] total 196 [2018-09-26 08:26:43,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 197 states [2018-09-26 08:26:43,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 197 interpolants. [2018-09-26 08:26:43,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19306, Invalid=19306, Unknown=0, NotChecked=0, Total=38612 [2018-09-26 08:26:43,955 INFO L87 Difference]: Start difference. First operand 198 states and 198 transitions. Second operand 197 states. [2018-09-26 08:26:45,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:45,021 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2018-09-26 08:26:45,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 197 states. [2018-09-26 08:26:45,022 INFO L78 Accepts]: Start accepts. Automaton has 197 states. Word has length 197 [2018-09-26 08:26:45,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:45,022 INFO L225 Difference]: With dead ends: 201 [2018-09-26 08:26:45,022 INFO L226 Difference]: Without dead ends: 199 [2018-09-26 08:26:45,023 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=19306, Invalid=19306, Unknown=0, NotChecked=0, Total=38612 [2018-09-26 08:26:45,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-09-26 08:26:45,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2018-09-26 08:26:45,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-09-26 08:26:45,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 199 transitions. [2018-09-26 08:26:45,026 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 199 transitions. Word has length 197 [2018-09-26 08:26:45,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:45,026 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 199 transitions. [2018-09-26 08:26:45,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 197 states. [2018-09-26 08:26:45,026 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 199 transitions. [2018-09-26 08:26:45,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-09-26 08:26:45,027 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:45,027 INFO L375 BasicCegarLoop]: trace histogram [195, 1, 1, 1] [2018-09-26 08:26:45,027 INFO L423 AbstractCegarLoop]: === Iteration 196 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:45,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:45,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1588114118, now seen corresponding path program 195 times [2018-09-26 08:26:45,027 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:45,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:46,135 INFO L134 CoverageAnalysis]: Checked inductivity of 19110 backedges. 0 proven. 19110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:46,136 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:46,136 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [197] total 197 [2018-09-26 08:26:46,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 198 states [2018-09-26 08:26:46,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 198 interpolants. [2018-09-26 08:26:46,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-09-26 08:26:46,140 INFO L87 Difference]: Start difference. First operand 199 states and 199 transitions. Second operand 198 states. [2018-09-26 08:26:47,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:47,375 INFO L93 Difference]: Finished difference Result 202 states and 202 transitions. [2018-09-26 08:26:47,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 198 states. [2018-09-26 08:26:47,375 INFO L78 Accepts]: Start accepts. Automaton has 198 states. Word has length 198 [2018-09-26 08:26:47,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:47,376 INFO L225 Difference]: With dead ends: 202 [2018-09-26 08:26:47,376 INFO L226 Difference]: Without dead ends: 200 [2018-09-26 08:26:47,378 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-09-26 08:26:47,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-09-26 08:26:47,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2018-09-26 08:26:47,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-09-26 08:26:47,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 200 transitions. [2018-09-26 08:26:47,381 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 200 transitions. Word has length 198 [2018-09-26 08:26:47,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:47,381 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 200 transitions. [2018-09-26 08:26:47,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 198 states. [2018-09-26 08:26:47,381 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 200 transitions. [2018-09-26 08:26:47,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-09-26 08:26:47,382 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:47,382 INFO L375 BasicCegarLoop]: trace histogram [196, 1, 1, 1] [2018-09-26 08:26:47,382 INFO L423 AbstractCegarLoop]: === Iteration 197 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:47,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:47,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1986893536, now seen corresponding path program 196 times [2018-09-26 08:26:47,382 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:47,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:48,445 INFO L134 CoverageAnalysis]: Checked inductivity of 19306 backedges. 0 proven. 19306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:48,445 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:48,445 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [198] total 198 [2018-09-26 08:26:48,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 199 states [2018-09-26 08:26:48,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 199 interpolants. [2018-09-26 08:26:48,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19701, Invalid=19701, Unknown=0, NotChecked=0, Total=39402 [2018-09-26 08:26:48,449 INFO L87 Difference]: Start difference. First operand 200 states and 200 transitions. Second operand 199 states. [2018-09-26 08:26:49,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:49,635 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2018-09-26 08:26:49,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 199 states. [2018-09-26 08:26:49,636 INFO L78 Accepts]: Start accepts. Automaton has 199 states. Word has length 199 [2018-09-26 08:26:49,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:49,636 INFO L225 Difference]: With dead ends: 203 [2018-09-26 08:26:49,637 INFO L226 Difference]: Without dead ends: 201 [2018-09-26 08:26:49,639 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=19701, Invalid=19701, Unknown=0, NotChecked=0, Total=39402 [2018-09-26 08:26:49,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-09-26 08:26:49,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2018-09-26 08:26:49,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-09-26 08:26:49,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2018-09-26 08:26:49,643 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 199 [2018-09-26 08:26:49,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:49,643 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2018-09-26 08:26:49,643 INFO L481 AbstractCegarLoop]: Interpolant automaton has 199 states. [2018-09-26 08:26:49,643 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2018-09-26 08:26:49,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-09-26 08:26:49,644 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:49,644 INFO L375 BasicCegarLoop]: trace histogram [197, 1, 1, 1] [2018-09-26 08:26:49,645 INFO L423 AbstractCegarLoop]: === Iteration 198 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:49,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:49,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1464153606, now seen corresponding path program 197 times [2018-09-26 08:26:49,645 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:49,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:50,910 INFO L134 CoverageAnalysis]: Checked inductivity of 19503 backedges. 0 proven. 19503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:50,910 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:50,910 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [199] total 199 [2018-09-26 08:26:50,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 200 states [2018-09-26 08:26:50,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 200 interpolants. [2018-09-26 08:26:50,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-09-26 08:26:50,915 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 200 states. [2018-09-26 08:26:52,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:52,099 INFO L93 Difference]: Finished difference Result 204 states and 204 transitions. [2018-09-26 08:26:52,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2018-09-26 08:26:52,099 INFO L78 Accepts]: Start accepts. Automaton has 200 states. Word has length 200 [2018-09-26 08:26:52,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:52,100 INFO L225 Difference]: With dead ends: 204 [2018-09-26 08:26:52,100 INFO L226 Difference]: Without dead ends: 202 [2018-09-26 08:26:52,102 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-09-26 08:26:52,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-09-26 08:26:52,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2018-09-26 08:26:52,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-09-26 08:26:52,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 202 transitions. [2018-09-26 08:26:52,104 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 202 transitions. Word has length 200 [2018-09-26 08:26:52,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:52,105 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 202 transitions. [2018-09-26 08:26:52,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 200 states. [2018-09-26 08:26:52,105 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 202 transitions. [2018-09-26 08:26:52,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-09-26 08:26:52,105 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:52,105 INFO L375 BasicCegarLoop]: trace histogram [198, 1, 1, 1] [2018-09-26 08:26:52,106 INFO L423 AbstractCegarLoop]: === Iteration 199 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:52,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:52,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1855882336, now seen corresponding path program 198 times [2018-09-26 08:26:52,106 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:52,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:53,244 INFO L134 CoverageAnalysis]: Checked inductivity of 19701 backedges. 0 proven. 19701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:53,244 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:53,245 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [200] total 200 [2018-09-26 08:26:53,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 201 states [2018-09-26 08:26:53,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 201 interpolants. [2018-09-26 08:26:53,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20100, Invalid=20100, Unknown=0, NotChecked=0, Total=40200 [2018-09-26 08:26:53,249 INFO L87 Difference]: Start difference. First operand 202 states and 202 transitions. Second operand 201 states. [2018-09-26 08:26:54,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:54,251 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2018-09-26 08:26:54,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2018-09-26 08:26:54,251 INFO L78 Accepts]: Start accepts. Automaton has 201 states. Word has length 201 [2018-09-26 08:26:54,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:54,251 INFO L225 Difference]: With dead ends: 205 [2018-09-26 08:26:54,251 INFO L226 Difference]: Without dead ends: 203 [2018-09-26 08:26:54,254 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=20100, Invalid=20100, Unknown=0, NotChecked=0, Total=40200 [2018-09-26 08:26:54,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-09-26 08:26:54,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-09-26 08:26:54,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-09-26 08:26:54,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 203 transitions. [2018-09-26 08:26:54,256 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 203 transitions. Word has length 201 [2018-09-26 08:26:54,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:54,257 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 203 transitions. [2018-09-26 08:26:54,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 201 states. [2018-09-26 08:26:54,257 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 203 transitions. [2018-09-26 08:26:54,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-09-26 08:26:54,257 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:54,257 INFO L375 BasicCegarLoop]: trace histogram [199, 1, 1, 1] [2018-09-26 08:26:54,258 INFO L423 AbstractCegarLoop]: === Iteration 200 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:54,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:54,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1697781434, now seen corresponding path program 199 times [2018-09-26 08:26:54,258 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:54,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:55,630 INFO L134 CoverageAnalysis]: Checked inductivity of 19900 backedges. 0 proven. 19900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:55,630 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:55,631 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [201] total 201 [2018-09-26 08:26:55,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 202 states [2018-09-26 08:26:55,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 202 interpolants. [2018-09-26 08:26:55,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-09-26 08:26:55,634 INFO L87 Difference]: Start difference. First operand 203 states and 203 transitions. Second operand 202 states. [2018-09-26 08:26:56,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:56,595 INFO L93 Difference]: Finished difference Result 206 states and 206 transitions. [2018-09-26 08:26:56,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2018-09-26 08:26:56,595 INFO L78 Accepts]: Start accepts. Automaton has 202 states. Word has length 202 [2018-09-26 08:26:56,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:56,596 INFO L225 Difference]: With dead ends: 206 [2018-09-26 08:26:56,596 INFO L226 Difference]: Without dead ends: 204 [2018-09-26 08:26:56,597 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-09-26 08:26:56,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-09-26 08:26:56,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2018-09-26 08:26:56,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-09-26 08:26:56,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 204 transitions. [2018-09-26 08:26:56,600 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 204 transitions. Word has length 202 [2018-09-26 08:26:56,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:56,600 INFO L480 AbstractCegarLoop]: Abstraction has 204 states and 204 transitions. [2018-09-26 08:26:56,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 202 states. [2018-09-26 08:26:56,600 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 204 transitions. [2018-09-26 08:26:56,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-09-26 08:26:56,600 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:56,601 INFO L375 BasicCegarLoop]: trace histogram [200, 1, 1, 1] [2018-09-26 08:26:56,601 INFO L423 AbstractCegarLoop]: === Iteration 201 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:56,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:56,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1091620768, now seen corresponding path program 200 times [2018-09-26 08:26:56,601 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:56,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:26:57,876 INFO L134 CoverageAnalysis]: Checked inductivity of 20100 backedges. 0 proven. 20100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:26:57,877 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:26:57,877 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [202] total 202 [2018-09-26 08:26:57,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 203 states [2018-09-26 08:26:57,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 203 interpolants. [2018-09-26 08:26:57,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20503, Invalid=20503, Unknown=0, NotChecked=0, Total=41006 [2018-09-26 08:26:57,882 INFO L87 Difference]: Start difference. First operand 204 states and 204 transitions. Second operand 203 states. [2018-09-26 08:26:58,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:26:58,865 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2018-09-26 08:26:58,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 203 states. [2018-09-26 08:26:58,866 INFO L78 Accepts]: Start accepts. Automaton has 203 states. Word has length 203 [2018-09-26 08:26:58,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:26:58,866 INFO L225 Difference]: With dead ends: 207 [2018-09-26 08:26:58,866 INFO L226 Difference]: Without dead ends: 205 [2018-09-26 08:26:58,869 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=20503, Invalid=20503, Unknown=0, NotChecked=0, Total=41006 [2018-09-26 08:26:58,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-09-26 08:26:58,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2018-09-26 08:26:58,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-09-26 08:26:58,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2018-09-26 08:26:58,871 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 203 [2018-09-26 08:26:58,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:26:58,872 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2018-09-26 08:26:58,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 203 states. [2018-09-26 08:26:58,872 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2018-09-26 08:26:58,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-09-26 08:26:58,872 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:26:58,872 INFO L375 BasicCegarLoop]: trace histogram [201, 1, 1, 1] [2018-09-26 08:26:58,873 INFO L423 AbstractCegarLoop]: === Iteration 202 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:26:58,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:26:58,873 INFO L82 PathProgramCache]: Analyzing trace with hash 519490694, now seen corresponding path program 201 times [2018-09-26 08:26:58,873 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:26:59,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:00,142 INFO L134 CoverageAnalysis]: Checked inductivity of 20301 backedges. 0 proven. 20301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:00,142 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:00,142 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [203] total 203 [2018-09-26 08:27:00,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 204 states [2018-09-26 08:27:00,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 204 interpolants. [2018-09-26 08:27:00,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-09-26 08:27:00,148 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 204 states. [2018-09-26 08:27:01,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:01,236 INFO L93 Difference]: Finished difference Result 208 states and 208 transitions. [2018-09-26 08:27:01,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 204 states. [2018-09-26 08:27:01,236 INFO L78 Accepts]: Start accepts. Automaton has 204 states. Word has length 204 [2018-09-26 08:27:01,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:01,237 INFO L225 Difference]: With dead ends: 208 [2018-09-26 08:27:01,237 INFO L226 Difference]: Without dead ends: 206 [2018-09-26 08:27:01,239 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-09-26 08:27:01,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-09-26 08:27:01,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2018-09-26 08:27:01,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-09-26 08:27:01,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 206 transitions. [2018-09-26 08:27:01,242 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 206 transitions. Word has length 204 [2018-09-26 08:27:01,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:01,242 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 206 transitions. [2018-09-26 08:27:01,242 INFO L481 AbstractCegarLoop]: Interpolant automaton has 204 states. [2018-09-26 08:27:01,242 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 206 transitions. [2018-09-26 08:27:01,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-09-26 08:27:01,243 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:01,243 INFO L375 BasicCegarLoop]: trace histogram [202, 1, 1, 1] [2018-09-26 08:27:01,243 INFO L423 AbstractCegarLoop]: === Iteration 203 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:01,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:01,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1075661536, now seen corresponding path program 202 times [2018-09-26 08:27:01,243 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:01,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:02,607 INFO L134 CoverageAnalysis]: Checked inductivity of 20503 backedges. 0 proven. 20503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:02,607 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:02,607 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [204] total 204 [2018-09-26 08:27:02,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 205 states [2018-09-26 08:27:02,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 205 interpolants. [2018-09-26 08:27:02,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20910, Invalid=20910, Unknown=0, NotChecked=0, Total=41820 [2018-09-26 08:27:02,614 INFO L87 Difference]: Start difference. First operand 206 states and 206 transitions. Second operand 205 states. [2018-09-26 08:27:03,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:03,852 INFO L93 Difference]: Finished difference Result 209 states and 209 transitions. [2018-09-26 08:27:03,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 205 states. [2018-09-26 08:27:03,852 INFO L78 Accepts]: Start accepts. Automaton has 205 states. Word has length 205 [2018-09-26 08:27:03,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:03,852 INFO L225 Difference]: With dead ends: 209 [2018-09-26 08:27:03,852 INFO L226 Difference]: Without dead ends: 207 [2018-09-26 08:27:03,855 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=20910, Invalid=20910, Unknown=0, NotChecked=0, Total=41820 [2018-09-26 08:27:03,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-09-26 08:27:03,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2018-09-26 08:27:03,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-09-26 08:27:03,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 207 transitions. [2018-09-26 08:27:03,857 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 207 transitions. Word has length 205 [2018-09-26 08:27:03,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:03,857 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 207 transitions. [2018-09-26 08:27:03,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 205 states. [2018-09-26 08:27:03,858 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 207 transitions. [2018-09-26 08:27:03,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-09-26 08:27:03,858 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:03,858 INFO L375 BasicCegarLoop]: trace histogram [203, 1, 1, 1] [2018-09-26 08:27:03,858 INFO L423 AbstractCegarLoop]: === Iteration 204 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:03,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:03,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1014226886, now seen corresponding path program 203 times [2018-09-26 08:27:03,859 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:04,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:05,200 INFO L134 CoverageAnalysis]: Checked inductivity of 20706 backedges. 0 proven. 20706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:05,200 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:05,200 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [205] total 205 [2018-09-26 08:27:05,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 206 states [2018-09-26 08:27:05,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 206 interpolants. [2018-09-26 08:27:05,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-09-26 08:27:05,206 INFO L87 Difference]: Start difference. First operand 207 states and 207 transitions. Second operand 206 states. [2018-09-26 08:27:06,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:06,580 INFO L93 Difference]: Finished difference Result 210 states and 210 transitions. [2018-09-26 08:27:06,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 206 states. [2018-09-26 08:27:06,581 INFO L78 Accepts]: Start accepts. Automaton has 206 states. Word has length 206 [2018-09-26 08:27:06,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:06,581 INFO L225 Difference]: With dead ends: 210 [2018-09-26 08:27:06,581 INFO L226 Difference]: Without dead ends: 208 [2018-09-26 08:27:06,584 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-09-26 08:27:06,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-09-26 08:27:06,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2018-09-26 08:27:06,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-09-26 08:27:06,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 208 transitions. [2018-09-26 08:27:06,587 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 208 transitions. Word has length 206 [2018-09-26 08:27:06,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:06,588 INFO L480 AbstractCegarLoop]: Abstraction has 208 states and 208 transitions. [2018-09-26 08:27:06,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 206 states. [2018-09-26 08:27:06,588 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 208 transitions. [2018-09-26 08:27:06,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-09-26 08:27:06,588 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:06,589 INFO L375 BasicCegarLoop]: trace histogram [204, 1, 1, 1] [2018-09-26 08:27:06,589 INFO L423 AbstractCegarLoop]: === Iteration 205 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:06,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:06,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1376258528, now seen corresponding path program 204 times [2018-09-26 08:27:06,589 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:06,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:07,931 INFO L134 CoverageAnalysis]: Checked inductivity of 20910 backedges. 0 proven. 20910 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:07,931 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:07,931 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [206] total 206 [2018-09-26 08:27:07,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 207 states [2018-09-26 08:27:07,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 207 interpolants. [2018-09-26 08:27:07,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21321, Invalid=21321, Unknown=0, NotChecked=0, Total=42642 [2018-09-26 08:27:07,935 INFO L87 Difference]: Start difference. First operand 208 states and 208 transitions. Second operand 207 states. [2018-09-26 08:27:09,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:09,317 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2018-09-26 08:27:09,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 207 states. [2018-09-26 08:27:09,318 INFO L78 Accepts]: Start accepts. Automaton has 207 states. Word has length 207 [2018-09-26 08:27:09,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:09,318 INFO L225 Difference]: With dead ends: 211 [2018-09-26 08:27:09,318 INFO L226 Difference]: Without dead ends: 209 [2018-09-26 08:27:09,320 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=21321, Invalid=21321, Unknown=0, NotChecked=0, Total=42642 [2018-09-26 08:27:09,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-09-26 08:27:09,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2018-09-26 08:27:09,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-09-26 08:27:09,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2018-09-26 08:27:09,323 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 207 [2018-09-26 08:27:09,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:09,324 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2018-09-26 08:27:09,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 207 states. [2018-09-26 08:27:09,324 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2018-09-26 08:27:09,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-09-26 08:27:09,324 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:09,324 INFO L375 BasicCegarLoop]: trace histogram [205, 1, 1, 1] [2018-09-26 08:27:09,325 INFO L423 AbstractCegarLoop]: === Iteration 206 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:09,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:09,325 INFO L82 PathProgramCache]: Analyzing trace with hash -285662458, now seen corresponding path program 205 times [2018-09-26 08:27:09,325 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:09,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:10,690 INFO L134 CoverageAnalysis]: Checked inductivity of 21115 backedges. 0 proven. 21115 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:10,691 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:10,691 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [207] total 207 [2018-09-26 08:27:10,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 208 states [2018-09-26 08:27:10,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 208 interpolants. [2018-09-26 08:27:10,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-09-26 08:27:10,696 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 208 states. [2018-09-26 08:27:12,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:12,233 INFO L93 Difference]: Finished difference Result 212 states and 212 transitions. [2018-09-26 08:27:12,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 208 states. [2018-09-26 08:27:12,233 INFO L78 Accepts]: Start accepts. Automaton has 208 states. Word has length 208 [2018-09-26 08:27:12,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:12,233 INFO L225 Difference]: With dead ends: 212 [2018-09-26 08:27:12,234 INFO L226 Difference]: Without dead ends: 210 [2018-09-26 08:27:12,236 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=21528, Invalid=21528, Unknown=0, NotChecked=0, Total=43056 [2018-09-26 08:27:12,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-09-26 08:27:12,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2018-09-26 08:27:12,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-09-26 08:27:12,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 210 transitions. [2018-09-26 08:27:12,239 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 210 transitions. Word has length 208 [2018-09-26 08:27:12,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:12,239 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 210 transitions. [2018-09-26 08:27:12,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 208 states. [2018-09-26 08:27:12,239 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 210 transitions. [2018-09-26 08:27:12,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-09-26 08:27:12,240 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:12,240 INFO L375 BasicCegarLoop]: trace histogram [206, 1, 1, 1] [2018-09-26 08:27:12,240 INFO L423 AbstractCegarLoop]: === Iteration 207 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:12,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:12,241 INFO L82 PathProgramCache]: Analyzing trace with hash -265605472, now seen corresponding path program 206 times [2018-09-26 08:27:12,241 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:12,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:13,647 INFO L134 CoverageAnalysis]: Checked inductivity of 21321 backedges. 0 proven. 21321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:13,648 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:13,648 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [208] total 208 [2018-09-26 08:27:13,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 209 states [2018-09-26 08:27:13,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 209 interpolants. [2018-09-26 08:27:13,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21736, Invalid=21736, Unknown=0, NotChecked=0, Total=43472 [2018-09-26 08:27:13,651 INFO L87 Difference]: Start difference. First operand 210 states and 210 transitions. Second operand 209 states. [2018-09-26 08:27:14,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:14,946 INFO L93 Difference]: Finished difference Result 213 states and 213 transitions. [2018-09-26 08:27:14,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 209 states. [2018-09-26 08:27:14,946 INFO L78 Accepts]: Start accepts. Automaton has 209 states. Word has length 209 [2018-09-26 08:27:14,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:14,947 INFO L225 Difference]: With dead ends: 213 [2018-09-26 08:27:14,947 INFO L226 Difference]: Without dead ends: 211 [2018-09-26 08:27:14,948 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=21736, Invalid=21736, Unknown=0, NotChecked=0, Total=43472 [2018-09-26 08:27:14,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-09-26 08:27:14,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2018-09-26 08:27:14,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-09-26 08:27:14,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2018-09-26 08:27:14,951 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 209 [2018-09-26 08:27:14,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:14,951 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2018-09-26 08:27:14,951 INFO L481 AbstractCegarLoop]: Interpolant automaton has 209 states. [2018-09-26 08:27:14,952 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2018-09-26 08:27:14,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-09-26 08:27:14,952 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:14,952 INFO L375 BasicCegarLoop]: trace histogram [207, 1, 1, 1] [2018-09-26 08:27:14,952 INFO L423 AbstractCegarLoop]: === Iteration 208 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:14,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:14,953 INFO L82 PathProgramCache]: Analyzing trace with hash 356161094, now seen corresponding path program 207 times [2018-09-26 08:27:14,953 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:15,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:16,317 INFO L134 CoverageAnalysis]: Checked inductivity of 21528 backedges. 0 proven. 21528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:16,317 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:16,317 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [209] total 209 [2018-09-26 08:27:16,318 INFO L459 AbstractCegarLoop]: Interpolant automaton has 210 states [2018-09-26 08:27:16,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 210 interpolants. [2018-09-26 08:27:16,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2018-09-26 08:27:16,323 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 210 states. [2018-09-26 08:27:17,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:17,402 INFO L93 Difference]: Finished difference Result 214 states and 214 transitions. [2018-09-26 08:27:17,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 210 states. [2018-09-26 08:27:17,403 INFO L78 Accepts]: Start accepts. Automaton has 210 states. Word has length 210 [2018-09-26 08:27:17,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:17,403 INFO L225 Difference]: With dead ends: 214 [2018-09-26 08:27:17,403 INFO L226 Difference]: Without dead ends: 212 [2018-09-26 08:27:17,406 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=21945, Invalid=21945, Unknown=0, NotChecked=0, Total=43890 [2018-09-26 08:27:17,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-09-26 08:27:17,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2018-09-26 08:27:17,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-09-26 08:27:17,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 212 transitions. [2018-09-26 08:27:17,409 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 212 transitions. Word has length 210 [2018-09-26 08:27:17,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:17,410 INFO L480 AbstractCegarLoop]: Abstraction has 212 states and 212 transitions. [2018-09-26 08:27:17,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 210 states. [2018-09-26 08:27:17,410 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 212 transitions. [2018-09-26 08:27:17,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-09-26 08:27:17,411 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:17,411 INFO L375 BasicCegarLoop]: trace histogram [208, 1, 1, 1] [2018-09-26 08:27:17,411 INFO L423 AbstractCegarLoop]: === Iteration 209 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:17,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:17,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1843911840, now seen corresponding path program 208 times [2018-09-26 08:27:17,412 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:17,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:18,962 INFO L134 CoverageAnalysis]: Checked inductivity of 21736 backedges. 0 proven. 21736 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:18,962 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:18,962 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [210] total 210 [2018-09-26 08:27:18,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 211 states [2018-09-26 08:27:18,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 211 interpolants. [2018-09-26 08:27:18,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22155, Invalid=22155, Unknown=0, NotChecked=0, Total=44310 [2018-09-26 08:27:18,968 INFO L87 Difference]: Start difference. First operand 212 states and 212 transitions. Second operand 211 states. [2018-09-26 08:27:19,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:19,714 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2018-09-26 08:27:19,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 211 states. [2018-09-26 08:27:19,714 INFO L78 Accepts]: Start accepts. Automaton has 211 states. Word has length 211 [2018-09-26 08:27:19,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:19,715 INFO L225 Difference]: With dead ends: 215 [2018-09-26 08:27:19,715 INFO L226 Difference]: Without dead ends: 213 [2018-09-26 08:27:19,718 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=22155, Invalid=22155, Unknown=0, NotChecked=0, Total=44310 [2018-09-26 08:27:19,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-09-26 08:27:19,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2018-09-26 08:27:19,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-09-26 08:27:19,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2018-09-26 08:27:19,720 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 211 [2018-09-26 08:27:19,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:19,721 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2018-09-26 08:27:19,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 211 states. [2018-09-26 08:27:19,721 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2018-09-26 08:27:19,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-09-26 08:27:19,721 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:19,721 INFO L375 BasicCegarLoop]: trace histogram [209, 1, 1, 1] [2018-09-26 08:27:19,722 INFO L423 AbstractCegarLoop]: === Iteration 210 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:19,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:19,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1326696058, now seen corresponding path program 209 times [2018-09-26 08:27:19,722 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:19,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:20,970 INFO L134 CoverageAnalysis]: Checked inductivity of 21945 backedges. 0 proven. 21945 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:20,970 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:20,970 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [211] total 211 [2018-09-26 08:27:20,970 INFO L459 AbstractCegarLoop]: Interpolant automaton has 212 states [2018-09-26 08:27:20,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 212 interpolants. [2018-09-26 08:27:20,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2018-09-26 08:27:20,976 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 212 states. [2018-09-26 08:27:21,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:21,751 INFO L93 Difference]: Finished difference Result 216 states and 216 transitions. [2018-09-26 08:27:21,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 212 states. [2018-09-26 08:27:21,751 INFO L78 Accepts]: Start accepts. Automaton has 212 states. Word has length 212 [2018-09-26 08:27:21,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:21,752 INFO L225 Difference]: With dead ends: 216 [2018-09-26 08:27:21,752 INFO L226 Difference]: Without dead ends: 214 [2018-09-26 08:27:21,754 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 210 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=22366, Invalid=22366, Unknown=0, NotChecked=0, Total=44732 [2018-09-26 08:27:21,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-09-26 08:27:21,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2018-09-26 08:27:21,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-09-26 08:27:21,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 214 transitions. [2018-09-26 08:27:21,757 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 214 transitions. Word has length 212 [2018-09-26 08:27:21,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:21,757 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 214 transitions. [2018-09-26 08:27:21,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 212 states. [2018-09-26 08:27:21,757 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 214 transitions. [2018-09-26 08:27:21,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-09-26 08:27:21,758 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:21,758 INFO L375 BasicCegarLoop]: trace histogram [210, 1, 1, 1] [2018-09-26 08:27:21,758 INFO L423 AbstractCegarLoop]: === Iteration 211 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:21,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:21,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1822091296, now seen corresponding path program 210 times [2018-09-26 08:27:21,759 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:22,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:23,167 INFO L134 CoverageAnalysis]: Checked inductivity of 22155 backedges. 0 proven. 22155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:23,167 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:23,167 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [212] total 212 [2018-09-26 08:27:23,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 213 states [2018-09-26 08:27:23,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 213 interpolants. [2018-09-26 08:27:23,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22578, Invalid=22578, Unknown=0, NotChecked=0, Total=45156 [2018-09-26 08:27:23,175 INFO L87 Difference]: Start difference. First operand 214 states and 214 transitions. Second operand 213 states. [2018-09-26 08:27:24,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:24,456 INFO L93 Difference]: Finished difference Result 217 states and 217 transitions. [2018-09-26 08:27:24,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 213 states. [2018-09-26 08:27:24,456 INFO L78 Accepts]: Start accepts. Automaton has 213 states. Word has length 213 [2018-09-26 08:27:24,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:24,456 INFO L225 Difference]: With dead ends: 217 [2018-09-26 08:27:24,456 INFO L226 Difference]: Without dead ends: 215 [2018-09-26 08:27:24,459 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=22578, Invalid=22578, Unknown=0, NotChecked=0, Total=45156 [2018-09-26 08:27:24,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-09-26 08:27:24,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2018-09-26 08:27:24,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-09-26 08:27:24,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 215 transitions. [2018-09-26 08:27:24,462 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 215 transitions. Word has length 213 [2018-09-26 08:27:24,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:24,462 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 215 transitions. [2018-09-26 08:27:24,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 213 states. [2018-09-26 08:27:24,462 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 215 transitions. [2018-09-26 08:27:24,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-09-26 08:27:24,463 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:24,463 INFO L375 BasicCegarLoop]: trace histogram [211, 1, 1, 1] [2018-09-26 08:27:24,463 INFO L423 AbstractCegarLoop]: === Iteration 212 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:24,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:24,463 INFO L82 PathProgramCache]: Analyzing trace with hash 650251462, now seen corresponding path program 211 times [2018-09-26 08:27:24,463 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:24,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:25,905 INFO L134 CoverageAnalysis]: Checked inductivity of 22366 backedges. 0 proven. 22366 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:25,905 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:25,906 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [213] total 213 [2018-09-26 08:27:25,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 214 states [2018-09-26 08:27:25,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 214 interpolants. [2018-09-26 08:27:25,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2018-09-26 08:27:25,911 INFO L87 Difference]: Start difference. First operand 215 states and 215 transitions. Second operand 214 states. [2018-09-26 08:27:27,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:27,547 INFO L93 Difference]: Finished difference Result 218 states and 218 transitions. [2018-09-26 08:27:27,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 214 states. [2018-09-26 08:27:27,547 INFO L78 Accepts]: Start accepts. Automaton has 214 states. Word has length 214 [2018-09-26 08:27:27,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:27,548 INFO L225 Difference]: With dead ends: 218 [2018-09-26 08:27:27,548 INFO L226 Difference]: Without dead ends: 216 [2018-09-26 08:27:27,550 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=22791, Invalid=22791, Unknown=0, NotChecked=0, Total=45582 [2018-09-26 08:27:27,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-09-26 08:27:27,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2018-09-26 08:27:27,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-09-26 08:27:27,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 216 transitions. [2018-09-26 08:27:27,553 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 216 transitions. Word has length 214 [2018-09-26 08:27:27,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:27,554 INFO L480 AbstractCegarLoop]: Abstraction has 216 states and 216 transitions. [2018-09-26 08:27:27,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 214 states. [2018-09-26 08:27:27,554 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 216 transitions. [2018-09-26 08:27:27,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-09-26 08:27:27,554 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:27,554 INFO L375 BasicCegarLoop]: trace histogram [212, 1, 1, 1] [2018-09-26 08:27:27,555 INFO L423 AbstractCegarLoop]: === Iteration 213 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:27,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:27,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1317045024, now seen corresponding path program 212 times [2018-09-26 08:27:27,555 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:27,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:28,928 INFO L134 CoverageAnalysis]: Checked inductivity of 22578 backedges. 0 proven. 22578 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:28,928 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:28,928 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [214] total 214 [2018-09-26 08:27:28,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 215 states [2018-09-26 08:27:28,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 215 interpolants. [2018-09-26 08:27:28,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23005, Invalid=23005, Unknown=0, NotChecked=0, Total=46010 [2018-09-26 08:27:28,934 INFO L87 Difference]: Start difference. First operand 216 states and 216 transitions. Second operand 215 states. [2018-09-26 08:27:29,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:29,942 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2018-09-26 08:27:29,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 215 states. [2018-09-26 08:27:29,942 INFO L78 Accepts]: Start accepts. Automaton has 215 states. Word has length 215 [2018-09-26 08:27:29,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:29,943 INFO L225 Difference]: With dead ends: 219 [2018-09-26 08:27:29,943 INFO L226 Difference]: Without dead ends: 217 [2018-09-26 08:27:29,946 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=23005, Invalid=23005, Unknown=0, NotChecked=0, Total=46010 [2018-09-26 08:27:29,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-09-26 08:27:29,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2018-09-26 08:27:29,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-09-26 08:27:29,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2018-09-26 08:27:29,950 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 215 [2018-09-26 08:27:29,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:29,950 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2018-09-26 08:27:29,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 215 states. [2018-09-26 08:27:29,950 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2018-09-26 08:27:29,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-09-26 08:27:29,951 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:29,951 INFO L375 BasicCegarLoop]: trace histogram [213, 1, 1, 1] [2018-09-26 08:27:29,951 INFO L423 AbstractCegarLoop]: === Iteration 214 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:29,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:29,951 INFO L82 PathProgramCache]: Analyzing trace with hash 2121273350, now seen corresponding path program 213 times [2018-09-26 08:27:29,951 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:30,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:31,359 INFO L134 CoverageAnalysis]: Checked inductivity of 22791 backedges. 0 proven. 22791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:31,360 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:31,360 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [215] total 215 [2018-09-26 08:27:31,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 216 states [2018-09-26 08:27:31,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 216 interpolants. [2018-09-26 08:27:31,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2018-09-26 08:27:31,365 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 216 states. [2018-09-26 08:27:31,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:31,817 INFO L93 Difference]: Finished difference Result 220 states and 220 transitions. [2018-09-26 08:27:31,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 216 states. [2018-09-26 08:27:31,817 INFO L78 Accepts]: Start accepts. Automaton has 216 states. Word has length 216 [2018-09-26 08:27:31,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:31,818 INFO L225 Difference]: With dead ends: 220 [2018-09-26 08:27:31,818 INFO L226 Difference]: Without dead ends: 218 [2018-09-26 08:27:31,819 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=23220, Invalid=23220, Unknown=0, NotChecked=0, Total=46440 [2018-09-26 08:27:31,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-09-26 08:27:31,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2018-09-26 08:27:31,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-09-26 08:27:31,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 218 transitions. [2018-09-26 08:27:31,822 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 218 transitions. Word has length 216 [2018-09-26 08:27:31,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:31,822 INFO L480 AbstractCegarLoop]: Abstraction has 218 states and 218 transitions. [2018-09-26 08:27:31,822 INFO L481 AbstractCegarLoop]: Interpolant automaton has 216 states. [2018-09-26 08:27:31,822 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 218 transitions. [2018-09-26 08:27:31,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-09-26 08:27:31,823 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:31,823 INFO L375 BasicCegarLoop]: trace histogram [214, 1, 1, 1] [2018-09-26 08:27:31,823 INFO L423 AbstractCegarLoop]: === Iteration 215 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:31,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:31,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1334960544, now seen corresponding path program 214 times [2018-09-26 08:27:31,824 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:32,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:33,336 INFO L134 CoverageAnalysis]: Checked inductivity of 23005 backedges. 0 proven. 23005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:33,337 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:33,337 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [216] total 216 [2018-09-26 08:27:33,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 217 states [2018-09-26 08:27:33,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 217 interpolants. [2018-09-26 08:27:33,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23436, Invalid=23436, Unknown=0, NotChecked=0, Total=46872 [2018-09-26 08:27:33,343 INFO L87 Difference]: Start difference. First operand 218 states and 218 transitions. Second operand 217 states. [2018-09-26 08:27:34,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:34,424 INFO L93 Difference]: Finished difference Result 221 states and 221 transitions. [2018-09-26 08:27:34,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 217 states. [2018-09-26 08:27:34,424 INFO L78 Accepts]: Start accepts. Automaton has 217 states. Word has length 217 [2018-09-26 08:27:34,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:34,425 INFO L225 Difference]: With dead ends: 221 [2018-09-26 08:27:34,425 INFO L226 Difference]: Without dead ends: 219 [2018-09-26 08:27:34,428 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=23436, Invalid=23436, Unknown=0, NotChecked=0, Total=46872 [2018-09-26 08:27:34,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-09-26 08:27:34,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2018-09-26 08:27:34,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-09-26 08:27:34,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 219 transitions. [2018-09-26 08:27:34,431 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 219 transitions. Word has length 217 [2018-09-26 08:27:34,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:34,431 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 219 transitions. [2018-09-26 08:27:34,431 INFO L481 AbstractCegarLoop]: Interpolant automaton has 217 states. [2018-09-26 08:27:34,431 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 219 transitions. [2018-09-26 08:27:34,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-09-26 08:27:34,432 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:34,432 INFO L375 BasicCegarLoop]: trace histogram [215, 1, 1, 1] [2018-09-26 08:27:34,432 INFO L423 AbstractCegarLoop]: === Iteration 216 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:34,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:34,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1565899962, now seen corresponding path program 215 times [2018-09-26 08:27:34,432 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:34,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:35,824 INFO L134 CoverageAnalysis]: Checked inductivity of 23220 backedges. 0 proven. 23220 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:35,825 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:35,825 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [217] total 217 [2018-09-26 08:27:35,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 218 states [2018-09-26 08:27:35,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 218 interpolants. [2018-09-26 08:27:35,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2018-09-26 08:27:35,829 INFO L87 Difference]: Start difference. First operand 219 states and 219 transitions. Second operand 218 states. [2018-09-26 08:27:37,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:37,583 INFO L93 Difference]: Finished difference Result 222 states and 222 transitions. [2018-09-26 08:27:37,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 218 states. [2018-09-26 08:27:37,584 INFO L78 Accepts]: Start accepts. Automaton has 218 states. Word has length 218 [2018-09-26 08:27:37,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:37,584 INFO L225 Difference]: With dead ends: 222 [2018-09-26 08:27:37,584 INFO L226 Difference]: Without dead ends: 220 [2018-09-26 08:27:37,586 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=23653, Invalid=23653, Unknown=0, NotChecked=0, Total=47306 [2018-09-26 08:27:37,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-09-26 08:27:37,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2018-09-26 08:27:37,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-09-26 08:27:37,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 220 transitions. [2018-09-26 08:27:37,589 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 220 transitions. Word has length 218 [2018-09-26 08:27:37,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:37,589 INFO L480 AbstractCegarLoop]: Abstraction has 220 states and 220 transitions. [2018-09-26 08:27:37,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 218 states. [2018-09-26 08:27:37,589 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 220 transitions. [2018-09-26 08:27:37,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-09-26 08:27:37,590 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:37,590 INFO L375 BasicCegarLoop]: trace histogram [216, 1, 1, 1] [2018-09-26 08:27:37,590 INFO L423 AbstractCegarLoop]: === Iteration 217 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:37,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:37,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1298262432, now seen corresponding path program 216 times [2018-09-26 08:27:37,590 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:37,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:39,148 INFO L134 CoverageAnalysis]: Checked inductivity of 23436 backedges. 0 proven. 23436 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:39,148 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:39,149 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [218] total 218 [2018-09-26 08:27:39,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 219 states [2018-09-26 08:27:39,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 219 interpolants. [2018-09-26 08:27:39,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23871, Invalid=23871, Unknown=0, NotChecked=0, Total=47742 [2018-09-26 08:27:39,154 INFO L87 Difference]: Start difference. First operand 220 states and 220 transitions. Second operand 219 states. [2018-09-26 08:27:40,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:40,338 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2018-09-26 08:27:40,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 219 states. [2018-09-26 08:27:40,338 INFO L78 Accepts]: Start accepts. Automaton has 219 states. Word has length 219 [2018-09-26 08:27:40,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:40,339 INFO L225 Difference]: With dead ends: 223 [2018-09-26 08:27:40,339 INFO L226 Difference]: Without dead ends: 221 [2018-09-26 08:27:40,341 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=23871, Invalid=23871, Unknown=0, NotChecked=0, Total=47742 [2018-09-26 08:27:40,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-09-26 08:27:40,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2018-09-26 08:27:40,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-09-26 08:27:40,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2018-09-26 08:27:40,344 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 219 [2018-09-26 08:27:40,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:40,345 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2018-09-26 08:27:40,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 219 states. [2018-09-26 08:27:40,345 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2018-09-26 08:27:40,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-09-26 08:27:40,345 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:40,345 INFO L375 BasicCegarLoop]: trace histogram [217, 1, 1, 1] [2018-09-26 08:27:40,346 INFO L423 AbstractCegarLoop]: === Iteration 218 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:40,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:40,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1591433594, now seen corresponding path program 217 times [2018-09-26 08:27:40,346 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:40,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:41,898 INFO L134 CoverageAnalysis]: Checked inductivity of 23653 backedges. 0 proven. 23653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:41,898 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:41,898 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [219] total 219 [2018-09-26 08:27:41,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 220 states [2018-09-26 08:27:41,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 220 interpolants. [2018-09-26 08:27:41,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2018-09-26 08:27:41,904 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 220 states. [2018-09-26 08:27:42,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:42,997 INFO L93 Difference]: Finished difference Result 224 states and 224 transitions. [2018-09-26 08:27:42,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 220 states. [2018-09-26 08:27:42,997 INFO L78 Accepts]: Start accepts. Automaton has 220 states. Word has length 220 [2018-09-26 08:27:42,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:42,998 INFO L225 Difference]: With dead ends: 224 [2018-09-26 08:27:42,998 INFO L226 Difference]: Without dead ends: 222 [2018-09-26 08:27:43,000 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 218 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=24090, Invalid=24090, Unknown=0, NotChecked=0, Total=48180 [2018-09-26 08:27:43,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-09-26 08:27:43,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2018-09-26 08:27:43,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-09-26 08:27:43,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 222 transitions. [2018-09-26 08:27:43,002 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 222 transitions. Word has length 220 [2018-09-26 08:27:43,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:43,003 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 222 transitions. [2018-09-26 08:27:43,003 INFO L481 AbstractCegarLoop]: Interpolant automaton has 220 states. [2018-09-26 08:27:43,003 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 222 transitions. [2018-09-26 08:27:43,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-09-26 08:27:43,003 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:43,003 INFO L375 BasicCegarLoop]: trace histogram [218, 1, 1, 1] [2018-09-26 08:27:43,004 INFO L423 AbstractCegarLoop]: === Iteration 219 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:43,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:43,004 INFO L82 PathProgramCache]: Analyzing trace with hash -2089805024, now seen corresponding path program 218 times [2018-09-26 08:27:43,004 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:43,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:44,510 INFO L134 CoverageAnalysis]: Checked inductivity of 23871 backedges. 0 proven. 23871 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:44,511 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:44,511 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [220] total 220 [2018-09-26 08:27:44,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 221 states [2018-09-26 08:27:44,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 221 interpolants. [2018-09-26 08:27:44,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24310, Invalid=24310, Unknown=0, NotChecked=0, Total=48620 [2018-09-26 08:27:44,517 INFO L87 Difference]: Start difference. First operand 222 states and 222 transitions. Second operand 221 states. [2018-09-26 08:27:46,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:46,497 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2018-09-26 08:27:46,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 221 states. [2018-09-26 08:27:46,498 INFO L78 Accepts]: Start accepts. Automaton has 221 states. Word has length 221 [2018-09-26 08:27:46,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:46,498 INFO L225 Difference]: With dead ends: 225 [2018-09-26 08:27:46,498 INFO L226 Difference]: Without dead ends: 223 [2018-09-26 08:27:46,502 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=24310, Invalid=24310, Unknown=0, NotChecked=0, Total=48620 [2018-09-26 08:27:46,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-09-26 08:27:46,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2018-09-26 08:27:46,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-09-26 08:27:46,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 223 transitions. [2018-09-26 08:27:46,505 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 223 transitions. Word has length 221 [2018-09-26 08:27:46,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:46,505 INFO L480 AbstractCegarLoop]: Abstraction has 223 states and 223 transitions. [2018-09-26 08:27:46,505 INFO L481 AbstractCegarLoop]: Interpolant automaton has 221 states. [2018-09-26 08:27:46,505 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 223 transitions. [2018-09-26 08:27:46,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-09-26 08:27:46,506 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:46,506 INFO L375 BasicCegarLoop]: trace histogram [219, 1, 1, 1] [2018-09-26 08:27:46,506 INFO L423 AbstractCegarLoop]: === Iteration 220 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:46,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:46,506 INFO L82 PathProgramCache]: Analyzing trace with hash -359450170, now seen corresponding path program 219 times [2018-09-26 08:27:46,506 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:46,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:48,068 INFO L134 CoverageAnalysis]: Checked inductivity of 24090 backedges. 0 proven. 24090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:48,069 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:48,069 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [221] total 221 [2018-09-26 08:27:48,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 222 states [2018-09-26 08:27:48,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 222 interpolants. [2018-09-26 08:27:48,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2018-09-26 08:27:48,075 INFO L87 Difference]: Start difference. First operand 223 states and 223 transitions. Second operand 222 states. [2018-09-26 08:27:48,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:48,664 INFO L93 Difference]: Finished difference Result 226 states and 226 transitions. [2018-09-26 08:27:48,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 222 states. [2018-09-26 08:27:48,664 INFO L78 Accepts]: Start accepts. Automaton has 222 states. Word has length 222 [2018-09-26 08:27:48,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:48,665 INFO L225 Difference]: With dead ends: 226 [2018-09-26 08:27:48,665 INFO L226 Difference]: Without dead ends: 224 [2018-09-26 08:27:48,668 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=24531, Invalid=24531, Unknown=0, NotChecked=0, Total=49062 [2018-09-26 08:27:48,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-09-26 08:27:48,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2018-09-26 08:27:48,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-09-26 08:27:48,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 224 transitions. [2018-09-26 08:27:48,672 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 224 transitions. Word has length 222 [2018-09-26 08:27:48,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:48,672 INFO L480 AbstractCegarLoop]: Abstraction has 224 states and 224 transitions. [2018-09-26 08:27:48,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 222 states. [2018-09-26 08:27:48,672 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 224 transitions. [2018-09-26 08:27:48,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-09-26 08:27:48,673 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:48,673 INFO L375 BasicCegarLoop]: trace histogram [220, 1, 1, 1] [2018-09-26 08:27:48,673 INFO L423 AbstractCegarLoop]: === Iteration 221 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:48,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:48,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1741942752, now seen corresponding path program 220 times [2018-09-26 08:27:48,674 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:49,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:50,484 INFO L134 CoverageAnalysis]: Checked inductivity of 24310 backedges. 0 proven. 24310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:50,485 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:50,485 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [222] total 222 [2018-09-26 08:27:50,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 223 states [2018-09-26 08:27:50,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 223 interpolants. [2018-09-26 08:27:50,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24753, Invalid=24753, Unknown=0, NotChecked=0, Total=49506 [2018-09-26 08:27:50,488 INFO L87 Difference]: Start difference. First operand 224 states and 224 transitions. Second operand 223 states. [2018-09-26 08:27:51,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:51,597 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2018-09-26 08:27:51,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 223 states. [2018-09-26 08:27:51,597 INFO L78 Accepts]: Start accepts. Automaton has 223 states. Word has length 223 [2018-09-26 08:27:51,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:51,598 INFO L225 Difference]: With dead ends: 227 [2018-09-26 08:27:51,598 INFO L226 Difference]: Without dead ends: 225 [2018-09-26 08:27:51,599 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=24753, Invalid=24753, Unknown=0, NotChecked=0, Total=49506 [2018-09-26 08:27:51,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-09-26 08:27:51,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2018-09-26 08:27:51,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-09-26 08:27:51,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions. [2018-09-26 08:27:51,602 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 223 [2018-09-26 08:27:51,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:51,602 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 225 transitions. [2018-09-26 08:27:51,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 223 states. [2018-09-26 08:27:51,602 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 225 transitions. [2018-09-26 08:27:51,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-09-26 08:27:51,603 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:51,603 INFO L375 BasicCegarLoop]: trace histogram [221, 1, 1, 1] [2018-09-26 08:27:51,603 INFO L423 AbstractCegarLoop]: === Iteration 222 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:51,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:51,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1834353402, now seen corresponding path program 221 times [2018-09-26 08:27:51,604 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:51,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:53,209 INFO L134 CoverageAnalysis]: Checked inductivity of 24531 backedges. 0 proven. 24531 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:53,209 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:53,209 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [223] total 223 [2018-09-26 08:27:53,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 224 states [2018-09-26 08:27:53,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 224 interpolants. [2018-09-26 08:27:53,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24976, Invalid=24976, Unknown=0, NotChecked=0, Total=49952 [2018-09-26 08:27:53,216 INFO L87 Difference]: Start difference. First operand 225 states and 225 transitions. Second operand 224 states. [2018-09-26 08:27:55,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:55,103 INFO L93 Difference]: Finished difference Result 228 states and 228 transitions. [2018-09-26 08:27:55,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 224 states. [2018-09-26 08:27:55,103 INFO L78 Accepts]: Start accepts. Automaton has 224 states. Word has length 224 [2018-09-26 08:27:55,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:55,104 INFO L225 Difference]: With dead ends: 228 [2018-09-26 08:27:55,104 INFO L226 Difference]: Without dead ends: 226 [2018-09-26 08:27:55,107 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=24976, Invalid=24976, Unknown=0, NotChecked=0, Total=49952 [2018-09-26 08:27:55,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-09-26 08:27:55,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2018-09-26 08:27:55,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-09-26 08:27:55,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 226 transitions. [2018-09-26 08:27:55,110 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 226 transitions. Word has length 224 [2018-09-26 08:27:55,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:55,110 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 226 transitions. [2018-09-26 08:27:55,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 224 states. [2018-09-26 08:27:55,110 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 226 transitions. [2018-09-26 08:27:55,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-09-26 08:27:55,111 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:55,111 INFO L375 BasicCegarLoop]: trace histogram [222, 1, 1, 1] [2018-09-26 08:27:55,111 INFO L423 AbstractCegarLoop]: === Iteration 223 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:55,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:55,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1030384480, now seen corresponding path program 222 times [2018-09-26 08:27:55,111 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:55,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:56,795 INFO L134 CoverageAnalysis]: Checked inductivity of 24753 backedges. 0 proven. 24753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:56,795 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:56,795 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [224] total 224 [2018-09-26 08:27:56,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 225 states [2018-09-26 08:27:56,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 225 interpolants. [2018-09-26 08:27:56,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25200, Invalid=25200, Unknown=0, NotChecked=0, Total=50400 [2018-09-26 08:27:56,799 INFO L87 Difference]: Start difference. First operand 226 states and 226 transitions. Second operand 225 states. [2018-09-26 08:27:57,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:27:57,800 INFO L93 Difference]: Finished difference Result 229 states and 229 transitions. [2018-09-26 08:27:57,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 225 states. [2018-09-26 08:27:57,800 INFO L78 Accepts]: Start accepts. Automaton has 225 states. Word has length 225 [2018-09-26 08:27:57,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:27:57,801 INFO L225 Difference]: With dead ends: 229 [2018-09-26 08:27:57,801 INFO L226 Difference]: Without dead ends: 227 [2018-09-26 08:27:57,803 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 223 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=25200, Invalid=25200, Unknown=0, NotChecked=0, Total=50400 [2018-09-26 08:27:57,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-09-26 08:27:57,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2018-09-26 08:27:57,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-09-26 08:27:57,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2018-09-26 08:27:57,806 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 225 [2018-09-26 08:27:57,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:27:57,806 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2018-09-26 08:27:57,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 225 states. [2018-09-26 08:27:57,806 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2018-09-26 08:27:57,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-09-26 08:27:57,807 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:27:57,807 INFO L375 BasicCegarLoop]: trace histogram [223, 1, 1, 1] [2018-09-26 08:27:57,807 INFO L423 AbstractCegarLoop]: === Iteration 224 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:27:57,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:27:57,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1877151674, now seen corresponding path program 223 times [2018-09-26 08:27:57,808 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:27:58,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:27:59,467 INFO L134 CoverageAnalysis]: Checked inductivity of 24976 backedges. 0 proven. 24976 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:27:59,467 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:27:59,467 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [225] total 225 [2018-09-26 08:27:59,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 226 states [2018-09-26 08:27:59,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 226 interpolants. [2018-09-26 08:27:59,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25425, Invalid=25425, Unknown=0, NotChecked=0, Total=50850 [2018-09-26 08:27:59,474 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 226 states. [2018-09-26 08:28:01,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:01,605 INFO L93 Difference]: Finished difference Result 230 states and 230 transitions. [2018-09-26 08:28:01,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 226 states. [2018-09-26 08:28:01,605 INFO L78 Accepts]: Start accepts. Automaton has 226 states. Word has length 226 [2018-09-26 08:28:01,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:01,606 INFO L225 Difference]: With dead ends: 230 [2018-09-26 08:28:01,606 INFO L226 Difference]: Without dead ends: 228 [2018-09-26 08:28:01,609 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 224 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=25425, Invalid=25425, Unknown=0, NotChecked=0, Total=50850 [2018-09-26 08:28:01,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-09-26 08:28:01,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 228. [2018-09-26 08:28:01,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-09-26 08:28:01,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 228 transitions. [2018-09-26 08:28:01,611 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 228 transitions. Word has length 226 [2018-09-26 08:28:01,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:01,612 INFO L480 AbstractCegarLoop]: Abstraction has 228 states and 228 transitions. [2018-09-26 08:28:01,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 226 states. [2018-09-26 08:28:01,612 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 228 transitions. [2018-09-26 08:28:01,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-09-26 08:28:01,612 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:01,612 INFO L375 BasicCegarLoop]: trace histogram [224, 1, 1, 1] [2018-09-26 08:28:01,613 INFO L423 AbstractCegarLoop]: === Iteration 225 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:01,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:01,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1937836384, now seen corresponding path program 224 times [2018-09-26 08:28:01,613 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:02,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:03,327 INFO L134 CoverageAnalysis]: Checked inductivity of 25200 backedges. 0 proven. 25200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:03,327 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:03,327 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [226] total 226 [2018-09-26 08:28:03,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 227 states [2018-09-26 08:28:03,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 227 interpolants. [2018-09-26 08:28:03,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25651, Invalid=25651, Unknown=0, NotChecked=0, Total=51302 [2018-09-26 08:28:03,333 INFO L87 Difference]: Start difference. First operand 228 states and 228 transitions. Second operand 227 states. [2018-09-26 08:28:03,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:03,877 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2018-09-26 08:28:03,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 227 states. [2018-09-26 08:28:03,878 INFO L78 Accepts]: Start accepts. Automaton has 227 states. Word has length 227 [2018-09-26 08:28:03,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:03,878 INFO L225 Difference]: With dead ends: 231 [2018-09-26 08:28:03,878 INFO L226 Difference]: Without dead ends: 229 [2018-09-26 08:28:03,880 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=25651, Invalid=25651, Unknown=0, NotChecked=0, Total=51302 [2018-09-26 08:28:03,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-09-26 08:28:03,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2018-09-26 08:28:03,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-09-26 08:28:03,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2018-09-26 08:28:03,883 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 227 [2018-09-26 08:28:03,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:03,883 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 229 transitions. [2018-09-26 08:28:03,883 INFO L481 AbstractCegarLoop]: Interpolant automaton has 227 states. [2018-09-26 08:28:03,883 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 229 transitions. [2018-09-26 08:28:03,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-09-26 08:28:03,884 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:03,884 INFO L375 BasicCegarLoop]: trace histogram [225, 1, 1, 1] [2018-09-26 08:28:03,884 INFO L423 AbstractCegarLoop]: === Iteration 226 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:03,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:03,884 INFO L82 PathProgramCache]: Analyzing trace with hash -56618106, now seen corresponding path program 225 times [2018-09-26 08:28:03,885 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:04,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:05,672 INFO L134 CoverageAnalysis]: Checked inductivity of 25425 backedges. 0 proven. 25425 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:05,672 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:05,673 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [227] total 227 [2018-09-26 08:28:05,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 228 states [2018-09-26 08:28:05,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 228 interpolants. [2018-09-26 08:28:05,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25878, Invalid=25878, Unknown=0, NotChecked=0, Total=51756 [2018-09-26 08:28:05,679 INFO L87 Difference]: Start difference. First operand 229 states and 229 transitions. Second operand 228 states. [2018-09-26 08:28:07,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:07,569 INFO L93 Difference]: Finished difference Result 232 states and 232 transitions. [2018-09-26 08:28:07,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 228 states. [2018-09-26 08:28:07,569 INFO L78 Accepts]: Start accepts. Automaton has 228 states. Word has length 228 [2018-09-26 08:28:07,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:07,570 INFO L225 Difference]: With dead ends: 232 [2018-09-26 08:28:07,570 INFO L226 Difference]: Without dead ends: 230 [2018-09-26 08:28:07,572 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=25878, Invalid=25878, Unknown=0, NotChecked=0, Total=51756 [2018-09-26 08:28:07,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-09-26 08:28:07,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2018-09-26 08:28:07,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-09-26 08:28:07,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 230 transitions. [2018-09-26 08:28:07,575 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 230 transitions. Word has length 228 [2018-09-26 08:28:07,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:07,576 INFO L480 AbstractCegarLoop]: Abstraction has 230 states and 230 transitions. [2018-09-26 08:28:07,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 228 states. [2018-09-26 08:28:07,576 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 230 transitions. [2018-09-26 08:28:07,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-09-26 08:28:07,576 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:07,576 INFO L375 BasicCegarLoop]: trace histogram [226, 1, 1, 1] [2018-09-26 08:28:07,577 INFO L423 AbstractCegarLoop]: === Iteration 227 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:07,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:07,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1755165152, now seen corresponding path program 226 times [2018-09-26 08:28:07,577 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:07,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:09,331 INFO L134 CoverageAnalysis]: Checked inductivity of 25651 backedges. 0 proven. 25651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:09,331 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:09,331 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [228] total 228 [2018-09-26 08:28:09,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 229 states [2018-09-26 08:28:09,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 229 interpolants. [2018-09-26 08:28:09,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26106, Invalid=26106, Unknown=0, NotChecked=0, Total=52212 [2018-09-26 08:28:09,338 INFO L87 Difference]: Start difference. First operand 230 states and 230 transitions. Second operand 229 states. [2018-09-26 08:28:10,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:10,585 INFO L93 Difference]: Finished difference Result 233 states and 233 transitions. [2018-09-26 08:28:10,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 229 states. [2018-09-26 08:28:10,585 INFO L78 Accepts]: Start accepts. Automaton has 229 states. Word has length 229 [2018-09-26 08:28:10,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:10,586 INFO L225 Difference]: With dead ends: 233 [2018-09-26 08:28:10,586 INFO L226 Difference]: Without dead ends: 231 [2018-09-26 08:28:10,589 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 227 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=26106, Invalid=26106, Unknown=0, NotChecked=0, Total=52212 [2018-09-26 08:28:10,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-09-26 08:28:10,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2018-09-26 08:28:10,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-09-26 08:28:10,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 231 transitions. [2018-09-26 08:28:10,592 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 231 transitions. Word has length 229 [2018-09-26 08:28:10,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:10,593 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 231 transitions. [2018-09-26 08:28:10,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 229 states. [2018-09-26 08:28:10,593 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 231 transitions. [2018-09-26 08:28:10,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-09-26 08:28:10,593 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:10,593 INFO L375 BasicCegarLoop]: trace histogram [227, 1, 1, 1] [2018-09-26 08:28:10,594 INFO L423 AbstractCegarLoop]: === Iteration 228 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:10,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:10,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1424451270, now seen corresponding path program 227 times [2018-09-26 08:28:10,594 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:11,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:12,431 INFO L134 CoverageAnalysis]: Checked inductivity of 25878 backedges. 0 proven. 25878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:12,431 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:12,431 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [229] total 229 [2018-09-26 08:28:12,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 230 states [2018-09-26 08:28:12,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 230 interpolants. [2018-09-26 08:28:12,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26335, Invalid=26335, Unknown=0, NotChecked=0, Total=52670 [2018-09-26 08:28:12,439 INFO L87 Difference]: Start difference. First operand 231 states and 231 transitions. Second operand 230 states. [2018-09-26 08:28:14,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:14,712 INFO L93 Difference]: Finished difference Result 234 states and 234 transitions. [2018-09-26 08:28:14,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 230 states. [2018-09-26 08:28:14,713 INFO L78 Accepts]: Start accepts. Automaton has 230 states. Word has length 230 [2018-09-26 08:28:14,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:14,713 INFO L225 Difference]: With dead ends: 234 [2018-09-26 08:28:14,713 INFO L226 Difference]: Without dead ends: 232 [2018-09-26 08:28:14,717 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 228 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=26335, Invalid=26335, Unknown=0, NotChecked=0, Total=52670 [2018-09-26 08:28:14,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-09-26 08:28:14,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2018-09-26 08:28:14,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-09-26 08:28:14,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 232 transitions. [2018-09-26 08:28:14,719 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 232 transitions. Word has length 230 [2018-09-26 08:28:14,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:14,720 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 232 transitions. [2018-09-26 08:28:14,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 230 states. [2018-09-26 08:28:14,720 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 232 transitions. [2018-09-26 08:28:14,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-09-26 08:28:14,720 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:14,720 INFO L375 BasicCegarLoop]: trace histogram [228, 1, 1, 1] [2018-09-26 08:28:14,721 INFO L423 AbstractCegarLoop]: === Iteration 229 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:14,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:14,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1208312544, now seen corresponding path program 228 times [2018-09-26 08:28:14,721 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:15,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:16,473 INFO L134 CoverageAnalysis]: Checked inductivity of 26106 backedges. 0 proven. 26106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:16,473 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:16,473 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [230] total 230 [2018-09-26 08:28:16,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 231 states [2018-09-26 08:28:16,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 231 interpolants. [2018-09-26 08:28:16,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26565, Invalid=26565, Unknown=0, NotChecked=0, Total=53130 [2018-09-26 08:28:16,480 INFO L87 Difference]: Start difference. First operand 232 states and 232 transitions. Second operand 231 states. [2018-09-26 08:28:17,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:17,104 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2018-09-26 08:28:17,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 231 states. [2018-09-26 08:28:17,104 INFO L78 Accepts]: Start accepts. Automaton has 231 states. Word has length 231 [2018-09-26 08:28:17,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:17,105 INFO L225 Difference]: With dead ends: 235 [2018-09-26 08:28:17,105 INFO L226 Difference]: Without dead ends: 233 [2018-09-26 08:28:17,108 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=26565, Invalid=26565, Unknown=0, NotChecked=0, Total=53130 [2018-09-26 08:28:17,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-09-26 08:28:17,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2018-09-26 08:28:17,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-09-26 08:28:17,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2018-09-26 08:28:17,111 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 231 [2018-09-26 08:28:17,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:17,111 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2018-09-26 08:28:17,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 231 states. [2018-09-26 08:28:17,111 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2018-09-26 08:28:17,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-09-26 08:28:17,112 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:17,112 INFO L375 BasicCegarLoop]: trace histogram [229, 1, 1, 1] [2018-09-26 08:28:17,112 INFO L423 AbstractCegarLoop]: === Iteration 230 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:17,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:17,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1197020666, now seen corresponding path program 229 times [2018-09-26 08:28:17,113 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:17,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:18,982 INFO L134 CoverageAnalysis]: Checked inductivity of 26335 backedges. 0 proven. 26335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:18,982 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:18,982 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [231] total 231 [2018-09-26 08:28:18,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 232 states [2018-09-26 08:28:18,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 232 interpolants. [2018-09-26 08:28:18,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26796, Invalid=26796, Unknown=0, NotChecked=0, Total=53592 [2018-09-26 08:28:18,987 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 232 states. [2018-09-26 08:28:21,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:21,096 INFO L93 Difference]: Finished difference Result 236 states and 236 transitions. [2018-09-26 08:28:21,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 232 states. [2018-09-26 08:28:21,096 INFO L78 Accepts]: Start accepts. Automaton has 232 states. Word has length 232 [2018-09-26 08:28:21,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:21,096 INFO L225 Difference]: With dead ends: 236 [2018-09-26 08:28:21,097 INFO L226 Difference]: Without dead ends: 234 [2018-09-26 08:28:21,098 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=26796, Invalid=26796, Unknown=0, NotChecked=0, Total=53592 [2018-09-26 08:28:21,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-09-26 08:28:21,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2018-09-26 08:28:21,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-09-26 08:28:21,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 234 transitions. [2018-09-26 08:28:21,101 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 234 transitions. Word has length 232 [2018-09-26 08:28:21,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:21,101 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 234 transitions. [2018-09-26 08:28:21,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 232 states. [2018-09-26 08:28:21,102 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 234 transitions. [2018-09-26 08:28:21,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-09-26 08:28:21,102 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:21,102 INFO L375 BasicCegarLoop]: trace histogram [230, 1, 1, 1] [2018-09-26 08:28:21,103 INFO L423 AbstractCegarLoop]: === Iteration 231 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:21,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:21,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1547061152, now seen corresponding path program 230 times [2018-09-26 08:28:21,103 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:21,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:22,936 INFO L134 CoverageAnalysis]: Checked inductivity of 26565 backedges. 0 proven. 26565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:22,936 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:22,936 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [232] total 232 [2018-09-26 08:28:22,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 233 states [2018-09-26 08:28:22,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 233 interpolants. [2018-09-26 08:28:22,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27028, Invalid=27028, Unknown=0, NotChecked=0, Total=54056 [2018-09-26 08:28:22,943 INFO L87 Difference]: Start difference. First operand 234 states and 234 transitions. Second operand 233 states. [2018-09-26 08:28:24,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:24,417 INFO L93 Difference]: Finished difference Result 237 states and 237 transitions. [2018-09-26 08:28:24,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 233 states. [2018-09-26 08:28:24,417 INFO L78 Accepts]: Start accepts. Automaton has 233 states. Word has length 233 [2018-09-26 08:28:24,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:24,418 INFO L225 Difference]: With dead ends: 237 [2018-09-26 08:28:24,418 INFO L226 Difference]: Without dead ends: 235 [2018-09-26 08:28:24,421 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 231 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=27028, Invalid=27028, Unknown=0, NotChecked=0, Total=54056 [2018-09-26 08:28:24,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-09-26 08:28:24,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2018-09-26 08:28:24,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-09-26 08:28:24,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 235 transitions. [2018-09-26 08:28:24,424 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 235 transitions. Word has length 233 [2018-09-26 08:28:24,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:24,424 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 235 transitions. [2018-09-26 08:28:24,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 233 states. [2018-09-26 08:28:24,425 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 235 transitions. [2018-09-26 08:28:24,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-09-26 08:28:24,425 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:24,425 INFO L375 BasicCegarLoop]: trace histogram [231, 1, 1, 1] [2018-09-26 08:28:24,426 INFO L423 AbstractCegarLoop]: === Iteration 232 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:24,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:24,426 INFO L82 PathProgramCache]: Analyzing trace with hash 714251590, now seen corresponding path program 231 times [2018-09-26 08:28:24,426 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:24,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:26,175 INFO L134 CoverageAnalysis]: Checked inductivity of 26796 backedges. 0 proven. 26796 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:26,176 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:26,176 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [233] total 233 [2018-09-26 08:28:26,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 234 states [2018-09-26 08:28:26,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 234 interpolants. [2018-09-26 08:28:26,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27261, Invalid=27261, Unknown=0, NotChecked=0, Total=54522 [2018-09-26 08:28:26,181 INFO L87 Difference]: Start difference. First operand 235 states and 235 transitions. Second operand 234 states. [2018-09-26 08:28:27,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:27,140 INFO L93 Difference]: Finished difference Result 238 states and 238 transitions. [2018-09-26 08:28:27,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 234 states. [2018-09-26 08:28:27,141 INFO L78 Accepts]: Start accepts. Automaton has 234 states. Word has length 234 [2018-09-26 08:28:27,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:27,141 INFO L225 Difference]: With dead ends: 238 [2018-09-26 08:28:27,141 INFO L226 Difference]: Without dead ends: 236 [2018-09-26 08:28:27,143 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=27261, Invalid=27261, Unknown=0, NotChecked=0, Total=54522 [2018-09-26 08:28:27,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-09-26 08:28:27,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2018-09-26 08:28:27,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-09-26 08:28:27,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 236 transitions. [2018-09-26 08:28:27,146 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 236 transitions. Word has length 234 [2018-09-26 08:28:27,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:27,146 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 236 transitions. [2018-09-26 08:28:27,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 234 states. [2018-09-26 08:28:27,147 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 236 transitions. [2018-09-26 08:28:27,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-09-26 08:28:27,147 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:27,147 INFO L375 BasicCegarLoop]: trace histogram [232, 1, 1, 1] [2018-09-26 08:28:27,148 INFO L423 AbstractCegarLoop]: === Iteration 233 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:27,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:27,148 INFO L82 PathProgramCache]: Analyzing trace with hash 666958944, now seen corresponding path program 232 times [2018-09-26 08:28:27,148 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:27,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:28,991 INFO L134 CoverageAnalysis]: Checked inductivity of 27028 backedges. 0 proven. 27028 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:28,992 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:28,992 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [234] total 234 [2018-09-26 08:28:28,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 235 states [2018-09-26 08:28:28,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 235 interpolants. [2018-09-26 08:28:28,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27495, Invalid=27495, Unknown=0, NotChecked=0, Total=54990 [2018-09-26 08:28:28,998 INFO L87 Difference]: Start difference. First operand 236 states and 236 transitions. Second operand 235 states. [2018-09-26 08:28:31,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:31,077 INFO L93 Difference]: Finished difference Result 239 states and 239 transitions. [2018-09-26 08:28:31,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 235 states. [2018-09-26 08:28:31,078 INFO L78 Accepts]: Start accepts. Automaton has 235 states. Word has length 235 [2018-09-26 08:28:31,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:31,078 INFO L225 Difference]: With dead ends: 239 [2018-09-26 08:28:31,078 INFO L226 Difference]: Without dead ends: 237 [2018-09-26 08:28:31,081 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=27495, Invalid=27495, Unknown=0, NotChecked=0, Total=54990 [2018-09-26 08:28:31,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-09-26 08:28:31,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2018-09-26 08:28:31,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-09-26 08:28:31,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2018-09-26 08:28:31,084 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 235 [2018-09-26 08:28:31,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:31,084 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2018-09-26 08:28:31,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 235 states. [2018-09-26 08:28:31,084 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2018-09-26 08:28:31,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-09-26 08:28:31,085 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:31,085 INFO L375 BasicCegarLoop]: trace histogram [233, 1, 1, 1] [2018-09-26 08:28:31,085 INFO L423 AbstractCegarLoop]: === Iteration 234 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:31,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:31,085 INFO L82 PathProgramCache]: Analyzing trace with hash -799113082, now seen corresponding path program 233 times [2018-09-26 08:28:31,085 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:31,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:32,864 INFO L134 CoverageAnalysis]: Checked inductivity of 27261 backedges. 0 proven. 27261 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:32,864 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:32,865 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [235] total 235 [2018-09-26 08:28:32,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 236 states [2018-09-26 08:28:32,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 236 interpolants. [2018-09-26 08:28:32,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27730, Invalid=27730, Unknown=0, NotChecked=0, Total=55460 [2018-09-26 08:28:32,871 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 236 states. [2018-09-26 08:28:34,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:34,344 INFO L93 Difference]: Finished difference Result 240 states and 240 transitions. [2018-09-26 08:28:34,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 236 states. [2018-09-26 08:28:34,345 INFO L78 Accepts]: Start accepts. Automaton has 236 states. Word has length 236 [2018-09-26 08:28:34,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:34,345 INFO L225 Difference]: With dead ends: 240 [2018-09-26 08:28:34,345 INFO L226 Difference]: Without dead ends: 238 [2018-09-26 08:28:34,348 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=27730, Invalid=27730, Unknown=0, NotChecked=0, Total=55460 [2018-09-26 08:28:34,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-09-26 08:28:34,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2018-09-26 08:28:34,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-09-26 08:28:34,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 238 transitions. [2018-09-26 08:28:34,351 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 238 transitions. Word has length 236 [2018-09-26 08:28:34,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:34,351 INFO L480 AbstractCegarLoop]: Abstraction has 238 states and 238 transitions. [2018-09-26 08:28:34,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 236 states. [2018-09-26 08:28:34,352 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 238 transitions. [2018-09-26 08:28:34,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-09-26 08:28:34,352 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:34,352 INFO L375 BasicCegarLoop]: trace histogram [234, 1, 1, 1] [2018-09-26 08:28:34,352 INFO L423 AbstractCegarLoop]: === Iteration 235 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:34,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:34,353 INFO L82 PathProgramCache]: Analyzing trace with hash 997294368, now seen corresponding path program 234 times [2018-09-26 08:28:34,353 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:34,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:36,172 INFO L134 CoverageAnalysis]: Checked inductivity of 27495 backedges. 0 proven. 27495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:36,173 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:36,173 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [236] total 236 [2018-09-26 08:28:36,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 237 states [2018-09-26 08:28:36,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 237 interpolants. [2018-09-26 08:28:36,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27966, Invalid=27966, Unknown=0, NotChecked=0, Total=55932 [2018-09-26 08:28:36,177 INFO L87 Difference]: Start difference. First operand 238 states and 238 transitions. Second operand 237 states. [2018-09-26 08:28:37,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:37,533 INFO L93 Difference]: Finished difference Result 241 states and 241 transitions. [2018-09-26 08:28:37,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 237 states. [2018-09-26 08:28:37,533 INFO L78 Accepts]: Start accepts. Automaton has 237 states. Word has length 237 [2018-09-26 08:28:37,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:37,534 INFO L225 Difference]: With dead ends: 241 [2018-09-26 08:28:37,534 INFO L226 Difference]: Without dead ends: 239 [2018-09-26 08:28:37,535 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=27966, Invalid=27966, Unknown=0, NotChecked=0, Total=55932 [2018-09-26 08:28:37,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-09-26 08:28:37,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2018-09-26 08:28:37,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-09-26 08:28:37,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 239 transitions. [2018-09-26 08:28:37,538 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 239 transitions. Word has length 237 [2018-09-26 08:28:37,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:37,538 INFO L480 AbstractCegarLoop]: Abstraction has 239 states and 239 transitions. [2018-09-26 08:28:37,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 237 states. [2018-09-26 08:28:37,538 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 239 transitions. [2018-09-26 08:28:37,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-09-26 08:28:37,539 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:37,539 INFO L375 BasicCegarLoop]: trace histogram [235, 1, 1, 1] [2018-09-26 08:28:37,539 INFO L423 AbstractCegarLoop]: === Iteration 236 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:37,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:37,539 INFO L82 PathProgramCache]: Analyzing trace with hash 851350470, now seen corresponding path program 235 times [2018-09-26 08:28:37,539 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:37,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:39,360 INFO L134 CoverageAnalysis]: Checked inductivity of 27730 backedges. 0 proven. 27730 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:39,360 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:39,361 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [237] total 237 [2018-09-26 08:28:39,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 238 states [2018-09-26 08:28:39,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 238 interpolants. [2018-09-26 08:28:39,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28203, Invalid=28203, Unknown=0, NotChecked=0, Total=56406 [2018-09-26 08:28:39,369 INFO L87 Difference]: Start difference. First operand 239 states and 239 transitions. Second operand 238 states. [2018-09-26 08:28:41,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:41,292 INFO L93 Difference]: Finished difference Result 242 states and 242 transitions. [2018-09-26 08:28:41,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 238 states. [2018-09-26 08:28:41,292 INFO L78 Accepts]: Start accepts. Automaton has 238 states. Word has length 238 [2018-09-26 08:28:41,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:41,292 INFO L225 Difference]: With dead ends: 242 [2018-09-26 08:28:41,292 INFO L226 Difference]: Without dead ends: 240 [2018-09-26 08:28:41,295 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=28203, Invalid=28203, Unknown=0, NotChecked=0, Total=56406 [2018-09-26 08:28:41,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-09-26 08:28:41,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2018-09-26 08:28:41,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-09-26 08:28:41,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 240 transitions. [2018-09-26 08:28:41,298 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 240 transitions. Word has length 238 [2018-09-26 08:28:41,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:41,298 INFO L480 AbstractCegarLoop]: Abstraction has 240 states and 240 transitions. [2018-09-26 08:28:41,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 238 states. [2018-09-26 08:28:41,298 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 240 transitions. [2018-09-26 08:28:41,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-09-26 08:28:41,299 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:41,299 INFO L375 BasicCegarLoop]: trace histogram [236, 1, 1, 1] [2018-09-26 08:28:41,299 INFO L423 AbstractCegarLoop]: === Iteration 237 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:41,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:41,300 INFO L82 PathProgramCache]: Analyzing trace with hash 622056928, now seen corresponding path program 236 times [2018-09-26 08:28:41,300 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:41,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:43,065 INFO L134 CoverageAnalysis]: Checked inductivity of 27966 backedges. 0 proven. 27966 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:43,066 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:43,066 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [238] total 238 [2018-09-26 08:28:43,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 239 states [2018-09-26 08:28:43,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 239 interpolants. [2018-09-26 08:28:43,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28441, Invalid=28441, Unknown=0, NotChecked=0, Total=56882 [2018-09-26 08:28:43,071 INFO L87 Difference]: Start difference. First operand 240 states and 240 transitions. Second operand 239 states. [2018-09-26 08:28:44,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:44,273 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2018-09-26 08:28:44,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 239 states. [2018-09-26 08:28:44,273 INFO L78 Accepts]: Start accepts. Automaton has 239 states. Word has length 239 [2018-09-26 08:28:44,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:44,274 INFO L225 Difference]: With dead ends: 243 [2018-09-26 08:28:44,274 INFO L226 Difference]: Without dead ends: 241 [2018-09-26 08:28:44,275 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=28441, Invalid=28441, Unknown=0, NotChecked=0, Total=56882 [2018-09-26 08:28:44,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-09-26 08:28:44,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2018-09-26 08:28:44,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-09-26 08:28:44,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2018-09-26 08:28:44,278 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 239 [2018-09-26 08:28:44,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:44,278 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2018-09-26 08:28:44,278 INFO L481 AbstractCegarLoop]: Interpolant automaton has 239 states. [2018-09-26 08:28:44,278 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2018-09-26 08:28:44,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-09-26 08:28:44,279 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:44,279 INFO L375 BasicCegarLoop]: trace histogram [237, 1, 1, 1] [2018-09-26 08:28:44,279 INFO L423 AbstractCegarLoop]: === Iteration 238 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:44,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:44,279 INFO L82 PathProgramCache]: Analyzing trace with hash 2103891718, now seen corresponding path program 237 times [2018-09-26 08:28:44,279 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:44,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:46,118 INFO L134 CoverageAnalysis]: Checked inductivity of 28203 backedges. 0 proven. 28203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:46,118 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:46,118 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [239] total 239 [2018-09-26 08:28:46,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 240 states [2018-09-26 08:28:46,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 240 interpolants. [2018-09-26 08:28:46,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28680, Invalid=28680, Unknown=0, NotChecked=0, Total=57360 [2018-09-26 08:28:46,126 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 240 states. [2018-09-26 08:28:47,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:47,147 INFO L93 Difference]: Finished difference Result 244 states and 244 transitions. [2018-09-26 08:28:47,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 240 states. [2018-09-26 08:28:47,147 INFO L78 Accepts]: Start accepts. Automaton has 240 states. Word has length 240 [2018-09-26 08:28:47,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:47,147 INFO L225 Difference]: With dead ends: 244 [2018-09-26 08:28:47,147 INFO L226 Difference]: Without dead ends: 242 [2018-09-26 08:28:47,150 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=28680, Invalid=28680, Unknown=0, NotChecked=0, Total=57360 [2018-09-26 08:28:47,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-09-26 08:28:47,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2018-09-26 08:28:47,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-09-26 08:28:47,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 242 transitions. [2018-09-26 08:28:47,152 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 242 transitions. Word has length 240 [2018-09-26 08:28:47,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:47,152 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 242 transitions. [2018-09-26 08:28:47,152 INFO L481 AbstractCegarLoop]: Interpolant automaton has 240 states. [2018-09-26 08:28:47,153 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 242 transitions. [2018-09-26 08:28:47,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-09-26 08:28:47,153 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:47,153 INFO L375 BasicCegarLoop]: trace histogram [238, 1, 1, 1] [2018-09-26 08:28:47,153 INFO L423 AbstractCegarLoop]: === Iteration 239 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:47,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:47,154 INFO L82 PathProgramCache]: Analyzing trace with hash 796129952, now seen corresponding path program 238 times [2018-09-26 08:28:47,154 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:47,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:49,015 INFO L134 CoverageAnalysis]: Checked inductivity of 28441 backedges. 0 proven. 28441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:49,015 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:49,015 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [240] total 240 [2018-09-26 08:28:49,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 241 states [2018-09-26 08:28:49,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 241 interpolants. [2018-09-26 08:28:49,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28920, Invalid=28920, Unknown=0, NotChecked=0, Total=57840 [2018-09-26 08:28:49,022 INFO L87 Difference]: Start difference. First operand 242 states and 242 transitions. Second operand 241 states. [2018-09-26 08:28:51,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:51,564 INFO L93 Difference]: Finished difference Result 245 states and 245 transitions. [2018-09-26 08:28:51,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 241 states. [2018-09-26 08:28:51,564 INFO L78 Accepts]: Start accepts. Automaton has 241 states. Word has length 241 [2018-09-26 08:28:51,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:51,564 INFO L225 Difference]: With dead ends: 245 [2018-09-26 08:28:51,564 INFO L226 Difference]: Without dead ends: 243 [2018-09-26 08:28:51,567 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 239 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=28920, Invalid=28920, Unknown=0, NotChecked=0, Total=57840 [2018-09-26 08:28:51,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-09-26 08:28:51,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2018-09-26 08:28:51,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-09-26 08:28:51,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 243 transitions. [2018-09-26 08:28:51,570 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 243 transitions. Word has length 241 [2018-09-26 08:28:51,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:51,570 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 243 transitions. [2018-09-26 08:28:51,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 241 states. [2018-09-26 08:28:51,570 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 243 transitions. [2018-09-26 08:28:51,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-09-26 08:28:51,571 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:51,571 INFO L375 BasicCegarLoop]: trace histogram [239, 1, 1, 1] [2018-09-26 08:28:51,571 INFO L423 AbstractCegarLoop]: === Iteration 240 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:51,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:51,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1089779130, now seen corresponding path program 239 times [2018-09-26 08:28:51,572 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:52,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:53,521 INFO L134 CoverageAnalysis]: Checked inductivity of 28680 backedges. 0 proven. 28680 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:53,521 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:53,521 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [241] total 241 [2018-09-26 08:28:53,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 242 states [2018-09-26 08:28:53,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 242 interpolants. [2018-09-26 08:28:53,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29161, Invalid=29161, Unknown=0, NotChecked=0, Total=58322 [2018-09-26 08:28:53,525 INFO L87 Difference]: Start difference. First operand 243 states and 243 transitions. Second operand 242 states. [2018-09-26 08:28:55,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:55,335 INFO L93 Difference]: Finished difference Result 246 states and 246 transitions. [2018-09-26 08:28:55,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 242 states. [2018-09-26 08:28:55,335 INFO L78 Accepts]: Start accepts. Automaton has 242 states. Word has length 242 [2018-09-26 08:28:55,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:55,336 INFO L225 Difference]: With dead ends: 246 [2018-09-26 08:28:55,336 INFO L226 Difference]: Without dead ends: 244 [2018-09-26 08:28:55,337 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 240 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=29161, Invalid=29161, Unknown=0, NotChecked=0, Total=58322 [2018-09-26 08:28:55,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-09-26 08:28:55,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2018-09-26 08:28:55,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2018-09-26 08:28:55,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 244 transitions. [2018-09-26 08:28:55,340 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 244 transitions. Word has length 242 [2018-09-26 08:28:55,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:55,340 INFO L480 AbstractCegarLoop]: Abstraction has 244 states and 244 transitions. [2018-09-26 08:28:55,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 242 states. [2018-09-26 08:28:55,340 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 244 transitions. [2018-09-26 08:28:55,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-09-26 08:28:55,341 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:55,341 INFO L375 BasicCegarLoop]: trace histogram [240, 1, 1, 1] [2018-09-26 08:28:55,341 INFO L423 AbstractCegarLoop]: === Iteration 241 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:55,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:55,342 INFO L82 PathProgramCache]: Analyzing trace with hash 576581472, now seen corresponding path program 240 times [2018-09-26 08:28:55,342 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:55,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:28:57,299 INFO L134 CoverageAnalysis]: Checked inductivity of 28920 backedges. 0 proven. 28920 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:28:57,300 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:28:57,300 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [242] total 242 [2018-09-26 08:28:57,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 243 states [2018-09-26 08:28:57,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 243 interpolants. [2018-09-26 08:28:57,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29403, Invalid=29403, Unknown=0, NotChecked=0, Total=58806 [2018-09-26 08:28:57,306 INFO L87 Difference]: Start difference. First operand 244 states and 244 transitions. Second operand 243 states. [2018-09-26 08:28:58,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:28:58,081 INFO L93 Difference]: Finished difference Result 247 states and 247 transitions. [2018-09-26 08:28:58,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 243 states. [2018-09-26 08:28:58,081 INFO L78 Accepts]: Start accepts. Automaton has 243 states. Word has length 243 [2018-09-26 08:28:58,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:28:58,082 INFO L225 Difference]: With dead ends: 247 [2018-09-26 08:28:58,082 INFO L226 Difference]: Without dead ends: 245 [2018-09-26 08:28:58,084 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=29403, Invalid=29403, Unknown=0, NotChecked=0, Total=58806 [2018-09-26 08:28:58,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-09-26 08:28:58,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2018-09-26 08:28:58,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-09-26 08:28:58,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2018-09-26 08:28:58,087 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 243 [2018-09-26 08:28:58,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:28:58,088 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2018-09-26 08:28:58,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 243 states. [2018-09-26 08:28:58,088 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2018-09-26 08:28:58,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-09-26 08:28:58,088 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:28:58,088 INFO L375 BasicCegarLoop]: trace histogram [241, 1, 1, 1] [2018-09-26 08:28:58,088 INFO L423 AbstractCegarLoop]: === Iteration 242 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:28:58,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:28:58,089 INFO L82 PathProgramCache]: Analyzing trace with hash 694152582, now seen corresponding path program 241 times [2018-09-26 08:28:58,089 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:28:58,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:29:00,040 INFO L134 CoverageAnalysis]: Checked inductivity of 29161 backedges. 0 proven. 29161 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:29:00,041 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:29:00,041 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [243] total 243 [2018-09-26 08:29:00,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 244 states [2018-09-26 08:29:00,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 244 interpolants. [2018-09-26 08:29:00,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29646, Invalid=29646, Unknown=0, NotChecked=0, Total=59292 [2018-09-26 08:29:00,046 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 244 states. [2018-09-26 08:29:02,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:29:02,032 INFO L93 Difference]: Finished difference Result 248 states and 248 transitions. [2018-09-26 08:29:02,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 244 states. [2018-09-26 08:29:02,032 INFO L78 Accepts]: Start accepts. Automaton has 244 states. Word has length 244 [2018-09-26 08:29:02,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:29:02,033 INFO L225 Difference]: With dead ends: 248 [2018-09-26 08:29:02,033 INFO L226 Difference]: Without dead ends: 246 [2018-09-26 08:29:02,035 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 242 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=29646, Invalid=29646, Unknown=0, NotChecked=0, Total=59292 [2018-09-26 08:29:02,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-09-26 08:29:02,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 246. [2018-09-26 08:29:02,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-09-26 08:29:02,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 246 transitions. [2018-09-26 08:29:02,038 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 246 transitions. Word has length 244 [2018-09-26 08:29:02,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:29:02,038 INFO L480 AbstractCegarLoop]: Abstraction has 246 states and 246 transitions. [2018-09-26 08:29:02,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 244 states. [2018-09-26 08:29:02,038 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 246 transitions. [2018-09-26 08:29:02,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-09-26 08:29:02,039 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:29:02,039 INFO L375 BasicCegarLoop]: trace histogram [242, 1, 1, 1] [2018-09-26 08:29:02,039 INFO L423 AbstractCegarLoop]: === Iteration 243 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:29:02,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:29:02,039 INFO L82 PathProgramCache]: Analyzing trace with hash 43889696, now seen corresponding path program 242 times [2018-09-26 08:29:02,039 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:29:02,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2018-09-26 08:29:02,778 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-26 08:29:02,782 WARN L206 ceAbstractionStarter]: Timeout [2018-09-26 08:29:02,782 INFO L202 PluginConnector]: Adding new model Octopussy.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 08:29:02 BoogieIcfgContainer [2018-09-26 08:29:02,782 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 08:29:02,783 INFO L168 Benchmark]: Toolchain (without parser) took 261862.12 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 1.8 GB in the end (delta: -283.2 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2018-09-26 08:29:02,784 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:29:02,784 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.41 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:29:02,784 INFO L168 Benchmark]: Boogie Preprocessor took 25.63 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:29:02,785 INFO L168 Benchmark]: RCFGBuilder took 231.02 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:29:02,785 INFO L168 Benchmark]: TraceAbstraction took 261551.44 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 1.8 GB in the end (delta: -293.8 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2018-09-26 08:29:02,787 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 45.41 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.63 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 231.02 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 261551.44 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 1.8 GB in the end (delta: -293.8 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 26]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 26). Cancelled while BasicCegarLoop was analyzing trace of length 246 with TraceHistMax 242, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 96 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. TIMEOUT Result, 261.4s OverallTime, 243 OverallIterations, 242 TraceHistogramMax, 101.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 728 SDtfs, 2 SDslu, 15673 SDs, 0 SdLazy, 45318 SolverSat, 450 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 29645 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 29403 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 117.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=246occurred in iteration=242, 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: 0.7s AutomataMinimizationTime, 242 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 27.3s SatisfiabilityAnalysisTime, 126.4s InterpolantComputationTime, 29887 NumberOfCodeBlocks, 29887 NumberOfCodeBlocksAsserted, 242 NumberOfCheckSat, 29645 ConstructedInterpolants, 0 QuantifiedInterpolants, 14378309 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 242 InterpolantComputations, 1 PerfectInterpolantSequences, 0/2362041 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/Octopussy.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_08-29-02-795.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Octopussy.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_08-29-02-795.csv Completed graceful shutdown