java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./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/Sandman01.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-e6fd87c [2018-07-25 13:35:08,897 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-25 13:35:08,899 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-25 13:35:08,912 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-25 13:35:08,912 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-25 13:35:08,914 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-25 13:35:08,915 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-25 13:35:08,917 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-25 13:35:08,919 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-25 13:35:08,920 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-25 13:35:08,921 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-25 13:35:08,921 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-25 13:35:08,922 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-25 13:35:08,923 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-25 13:35:08,925 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-25 13:35:08,926 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-25 13:35:08,927 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-25 13:35:08,929 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-25 13:35:08,931 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-25 13:35:08,933 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-25 13:35:08,934 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-25 13:35:08,935 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-25 13:35:08,938 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-25 13:35:08,938 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-25 13:35:08,939 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-25 13:35:08,940 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-25 13:35:08,941 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-25 13:35:08,942 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-25 13:35:08,943 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-25 13:35:08,944 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-25 13:35:08,944 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-25 13:35:08,945 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-25 13:35:08,945 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-25 13:35:08,946 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-25 13:35:08,947 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-25 13:35:08,948 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-25 13:35:08,948 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-07-25 13:35:08,957 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-25 13:35:08,957 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-25 13:35:08,958 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-25 13:35:08,959 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-25 13:35:08,959 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-25 13:35:08,959 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-25 13:35:08,959 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-25 13:35:08,960 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-25 13:35:09,020 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-25 13:35:09,044 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-25 13:35:09,051 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-25 13:35:09,053 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-25 13:35:09,054 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-25 13:35:09,055 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Sandman01.bpl [2018-07-25 13:35:09,055 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Sandman01.bpl' [2018-07-25 13:35:09,111 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-25 13:35:09,114 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-07-25 13:35:09,115 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-25 13:35:09,115 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-25 13:35:09,115 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-25 13:35:09,139 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "Sandman01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:35:09" (1/1) ... [2018-07-25 13:35:09,156 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "Sandman01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:35:09" (1/1) ... [2018-07-25 13:35:09,161 WARN L165 Inliner]: Program contained no entry procedure! [2018-07-25 13:35:09,161 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-07-25 13:35:09,161 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-07-25 13:35:09,164 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-25 13:35:09,165 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-25 13:35:09,166 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-25 13:35:09,166 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-25 13:35:09,179 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "Sandman01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:35:09" (1/1) ... [2018-07-25 13:35:09,180 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "Sandman01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:35:09" (1/1) ... [2018-07-25 13:35:09,180 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "Sandman01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:35:09" (1/1) ... [2018-07-25 13:35:09,181 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "Sandman01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:35:09" (1/1) ... [2018-07-25 13:35:09,186 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "Sandman01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:35:09" (1/1) ... [2018-07-25 13:35:09,194 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "Sandman01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:35:09" (1/1) ... [2018-07-25 13:35:09,195 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "Sandman01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:35:09" (1/1) ... [2018-07-25 13:35:09,197 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-25 13:35:09,197 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-25 13:35:09,197 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-25 13:35:09,198 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-25 13:35:09,202 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Sandman01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:35:09" (1/1) ... [2018-07-25 13:35:09,296 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-07-25 13:35:09,296 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-07-25 13:35:09,296 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-07-25 13:35:09,449 INFO L270 CfgBuilder]: Using library mode [2018-07-25 13:35:09,450 INFO L202 PluginConnector]: Adding new model Sandman01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 01:35:09 BoogieIcfgContainer [2018-07-25 13:35:09,450 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-25 13:35:09,452 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-25 13:35:09,452 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-25 13:35:09,456 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-25 13:35:09,456 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Sandman01.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:35:09" (1/2) ... [2018-07-25 13:35:09,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18289384 and model type Sandman01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.07 01:35:09, skipping insertion in model container [2018-07-25 13:35:09,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Sandman01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 01:35:09" (2/2) ... [2018-07-25 13:35:09,460 INFO L112 eAbstractionObserver]: Analyzing ICFG Sandman01.bpl [2018-07-25 13:35:09,471 INFO L133 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-25 13:35:09,480 INFO L145 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-25 13:35:09,532 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-25 13:35:09,534 INFO L374 AbstractCegarLoop]: Interprodecural is true [2018-07-25 13:35:09,534 INFO L375 AbstractCegarLoop]: Hoare is true [2018-07-25 13:35:09,534 INFO L376 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-25 13:35:09,535 INFO L377 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-25 13:35:09,535 INFO L378 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-25 13:35:09,535 INFO L379 AbstractCegarLoop]: Difference is false [2018-07-25 13:35:09,535 INFO L380 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-25 13:35:09,536 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-25 13:35:09,552 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-07-25 13:35:09,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-07-25 13:35:09,562 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:09,563 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-07-25 13:35:09,565 INFO L415 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:09,571 INFO L82 PathProgramCache]: Analyzing trace with hash 30048, now seen corresponding path program 1 times [2018-07-25 13:35:09,579 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:09,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:09,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:09,701 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:35:09,702 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-25 13:35:09,706 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 13:35:09,718 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 13:35:09,719 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:35:09,722 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-07-25 13:35:09,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:09,761 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-07-25 13:35:09,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 13:35:09,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-07-25 13:35:09,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:09,775 INFO L225 Difference]: With dead ends: 13 [2018-07-25 13:35:09,775 INFO L226 Difference]: Without dead ends: 5 [2018-07-25 13:35:09,781 INFO L574 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-07-25 13:35:09,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-07-25 13:35:09,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-07-25 13:35:09,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-07-25 13:35:09,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-07-25 13:35:09,823 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-07-25 13:35:09,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:09,824 INFO L472 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-07-25 13:35:09,824 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 13:35:09,824 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-07-25 13:35:09,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-25 13:35:09,825 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:09,825 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-25 13:35:09,825 INFO L415 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:09,826 INFO L82 PathProgramCache]: Analyzing trace with hash 927622, now seen corresponding path program 1 times [2018-07-25 13:35:09,826 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:09,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:09,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:09,879 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:09,879 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-07-25 13:35:09,886 INFO L451 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-25 13:35:09,887 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-25 13:35:09,887 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-07-25 13:35:09,888 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2018-07-25 13:35:09,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:09,916 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-07-25 13:35:09,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-25 13:35:09,916 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-07-25 13:35:09,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:09,917 INFO L225 Difference]: With dead ends: 8 [2018-07-25 13:35:09,917 INFO L226 Difference]: Without dead ends: 6 [2018-07-25 13:35:09,919 INFO L574 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-07-25 13:35:09,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-07-25 13:35:09,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-07-25 13:35:09,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-07-25 13:35:09,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-07-25 13:35:09,923 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-07-25 13:35:09,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:09,924 INFO L472 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-07-25 13:35:09,924 INFO L473 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-25 13:35:09,924 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-07-25 13:35:09,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-07-25 13:35:09,926 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:09,926 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-07-25 13:35:09,926 INFO L415 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:09,926 INFO L82 PathProgramCache]: Analyzing trace with hash 28752416, now seen corresponding path program 2 times [2018-07-25 13:35:09,927 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:09,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:10,042 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:10,042 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:10,043 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-25 13:35:10,043 INFO L451 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-25 13:35:10,043 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-25 13:35:10,044 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-07-25 13:35:10,044 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2018-07-25 13:35:10,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:10,091 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-07-25 13:35:10,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-25 13:35:10,092 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-07-25 13:35:10,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:10,093 INFO L225 Difference]: With dead ends: 9 [2018-07-25 13:35:10,093 INFO L226 Difference]: Without dead ends: 7 [2018-07-25 13:35:10,094 INFO L574 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-07-25 13:35:10,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-07-25 13:35:10,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-07-25 13:35:10,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-07-25 13:35:10,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-07-25 13:35:10,098 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-07-25 13:35:10,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:10,098 INFO L472 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-07-25 13:35:10,098 INFO L473 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-25 13:35:10,098 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-07-25 13:35:10,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 13:35:10,099 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:10,099 INFO L354 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-07-25 13:35:10,100 INFO L415 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:10,100 INFO L82 PathProgramCache]: Analyzing trace with hash 891321030, now seen corresponding path program 3 times [2018-07-25 13:35:10,100 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:10,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:10,201 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:10,202 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:10,202 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-25 13:35:10,202 INFO L451 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-25 13:35:10,203 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-25 13:35:10,203 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-07-25 13:35:10,204 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-07-25 13:35:10,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:10,225 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-07-25 13:35:10,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-25 13:35:10,226 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-07-25 13:35:10,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:10,226 INFO L225 Difference]: With dead ends: 10 [2018-07-25 13:35:10,227 INFO L226 Difference]: Without dead ends: 8 [2018-07-25 13:35:10,227 INFO L574 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-07-25 13:35:10,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-07-25 13:35:10,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-07-25 13:35:10,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-07-25 13:35:10,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-07-25 13:35:10,231 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-07-25 13:35:10,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:10,232 INFO L472 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-07-25 13:35:10,232 INFO L473 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-25 13:35:10,232 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-07-25 13:35:10,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-25 13:35:10,233 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:10,233 INFO L354 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-07-25 13:35:10,233 INFO L415 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:10,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1861144288, now seen corresponding path program 4 times [2018-07-25 13:35:10,234 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:10,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:10,314 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:10,314 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:10,316 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 13:35:10,316 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:35:10,316 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:35:10,317 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:35:10,317 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2018-07-25 13:35:10,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:10,342 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-07-25 13:35:10,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-25 13:35:10,343 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-07-25 13:35:10,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:10,343 INFO L225 Difference]: With dead ends: 11 [2018-07-25 13:35:10,344 INFO L226 Difference]: Without dead ends: 9 [2018-07-25 13:35:10,344 INFO L574 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-07-25 13:35:10,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-07-25 13:35:10,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-07-25 13:35:10,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-07-25 13:35:10,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-07-25 13:35:10,349 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-07-25 13:35:10,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:10,349 INFO L472 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-07-25 13:35:10,349 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:35:10,350 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-07-25 13:35:10,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 13:35:10,350 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:10,350 INFO L354 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-07-25 13:35:10,351 INFO L415 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:10,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1860894214, now seen corresponding path program 5 times [2018-07-25 13:35:10,351 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:10,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:10,504 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:10,504 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:10,504 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:35:10,505 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:35:10,505 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:35:10,505 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:35:10,506 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2018-07-25 13:35:10,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:10,556 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-07-25 13:35:10,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-25 13:35:10,556 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-25 13:35:10,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:10,557 INFO L225 Difference]: With dead ends: 12 [2018-07-25 13:35:10,557 INFO L226 Difference]: Without dead ends: 10 [2018-07-25 13:35:10,558 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:35:10,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-07-25 13:35:10,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-07-25 13:35:10,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-07-25 13:35:10,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-07-25 13:35:10,562 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-07-25 13:35:10,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:10,563 INFO L472 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-07-25 13:35:10,563 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:35:10,563 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-07-25 13:35:10,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-07-25 13:35:10,564 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:10,564 INFO L354 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-07-25 13:35:10,564 INFO L415 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:10,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1853141920, now seen corresponding path program 6 times [2018-07-25 13:35:10,565 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:10,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:10,684 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:10,685 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:10,685 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 13:35:10,685 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:35:10,686 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:35:10,686 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:35:10,689 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2018-07-25 13:35:10,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:10,746 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-07-25 13:35:10,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-25 13:35:10,746 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-07-25 13:35:10,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:10,747 INFO L225 Difference]: With dead ends: 13 [2018-07-25 13:35:10,748 INFO L226 Difference]: Without dead ends: 11 [2018-07-25 13:35:10,748 INFO L574 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-07-25 13:35:10,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-07-25 13:35:10,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-07-25 13:35:10,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-07-25 13:35:10,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-07-25 13:35:10,759 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-07-25 13:35:10,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:10,760 INFO L472 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-07-25 13:35:10,760 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:35:10,760 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-07-25 13:35:10,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-25 13:35:10,765 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:10,765 INFO L354 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-07-25 13:35:10,766 INFO L415 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:10,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1612820806, now seen corresponding path program 7 times [2018-07-25 13:35:10,767 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:10,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:10,902 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:10,902 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:10,903 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 13:35:10,903 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 13:35:10,904 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 13:35:10,904 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:35:10,905 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2018-07-25 13:35:10,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:10,927 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-07-25 13:35:10,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 13:35:10,927 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-07-25 13:35:10,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:10,928 INFO L225 Difference]: With dead ends: 14 [2018-07-25 13:35:10,929 INFO L226 Difference]: Without dead ends: 12 [2018-07-25 13:35:10,929 INFO L574 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-07-25 13:35:10,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-07-25 13:35:10,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-07-25 13:35:10,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-07-25 13:35:10,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-07-25 13:35:10,935 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-07-25 13:35:10,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:10,936 INFO L472 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-07-25 13:35:10,936 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 13:35:10,936 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-07-25 13:35:10,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-25 13:35:10,937 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:10,937 INFO L354 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-07-25 13:35:10,937 INFO L415 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:10,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1542166432, now seen corresponding path program 8 times [2018-07-25 13:35:10,938 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:10,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:11,067 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:11,068 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:11,068 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:35:11,068 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:35:11,069 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:35:11,069 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:35:11,070 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2018-07-25 13:35:11,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:11,111 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-07-25 13:35:11,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 13:35:11,112 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-07-25 13:35:11,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:11,113 INFO L225 Difference]: With dead ends: 15 [2018-07-25 13:35:11,113 INFO L226 Difference]: Without dead ends: 13 [2018-07-25 13:35:11,114 INFO L574 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-07-25 13:35:11,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-07-25 13:35:11,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-07-25 13:35:11,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-07-25 13:35:11,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-07-25 13:35:11,122 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-07-25 13:35:11,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:11,123 INFO L472 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-07-25 13:35:11,123 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:35:11,123 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-07-25 13:35:11,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 13:35:11,124 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:11,124 INFO L354 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-07-25 13:35:11,125 INFO L415 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:11,125 INFO L82 PathProgramCache]: Analyzing trace with hash -562523002, now seen corresponding path program 9 times [2018-07-25 13:35:11,125 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:11,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:11,233 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:11,234 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:11,234 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 13:35:11,234 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 13:35:11,235 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 13:35:11,235 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:35:11,235 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2018-07-25 13:35:11,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:11,267 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-07-25 13:35:11,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 13:35:11,268 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-07-25 13:35:11,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:11,268 INFO L225 Difference]: With dead ends: 16 [2018-07-25 13:35:11,269 INFO L226 Difference]: Without dead ends: 14 [2018-07-25 13:35:11,270 INFO L574 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-07-25 13:35:11,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-07-25 13:35:11,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-07-25 13:35:11,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-07-25 13:35:11,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-07-25 13:35:11,275 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-07-25 13:35:11,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:11,275 INFO L472 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-07-25 13:35:11,275 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 13:35:11,275 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-07-25 13:35:11,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-25 13:35:11,276 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:11,278 INFO L354 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2018-07-25 13:35:11,278 INFO L415 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:11,279 INFO L82 PathProgramCache]: Analyzing trace with hash -258347744, now seen corresponding path program 10 times [2018-07-25 13:35:11,279 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:11,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:11,418 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:11,418 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:11,419 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 13:35:11,419 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 13:35:11,420 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 13:35:11,420 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:35:11,420 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2018-07-25 13:35:11,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:11,448 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-07-25 13:35:11,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 13:35:11,448 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-07-25 13:35:11,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:11,449 INFO L225 Difference]: With dead ends: 17 [2018-07-25 13:35:11,449 INFO L226 Difference]: Without dead ends: 15 [2018-07-25 13:35:11,450 INFO L574 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-07-25 13:35:11,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-07-25 13:35:11,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-07-25 13:35:11,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-07-25 13:35:11,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-07-25 13:35:11,455 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-07-25 13:35:11,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:11,456 INFO L472 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-07-25 13:35:11,456 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 13:35:11,456 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-07-25 13:35:11,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-25 13:35:11,457 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:11,457 INFO L354 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-07-25 13:35:11,458 INFO L415 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:11,458 INFO L82 PathProgramCache]: Analyzing trace with hash 581150662, now seen corresponding path program 11 times [2018-07-25 13:35:11,458 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:11,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:11,573 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:11,573 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:11,574 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-25 13:35:11,574 INFO L451 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-25 13:35:11,575 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-25 13:35:11,575 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:35:11,576 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2018-07-25 13:35:11,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:11,609 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-07-25 13:35:11,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 13:35:11,609 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-07-25 13:35:11,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:11,610 INFO L225 Difference]: With dead ends: 18 [2018-07-25 13:35:11,610 INFO L226 Difference]: Without dead ends: 16 [2018-07-25 13:35:11,611 INFO L574 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-07-25 13:35:11,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-07-25 13:35:11,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-07-25 13:35:11,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-07-25 13:35:11,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-07-25 13:35:11,617 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-07-25 13:35:11,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:11,617 INFO L472 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-07-25 13:35:11,617 INFO L473 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-25 13:35:11,618 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-07-25 13:35:11,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 13:35:11,618 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:11,618 INFO L354 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2018-07-25 13:35:11,619 INFO L415 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:11,619 INFO L82 PathProgramCache]: Analyzing trace with hash 835797472, now seen corresponding path program 12 times [2018-07-25 13:35:11,620 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:11,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:11,760 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:11,761 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:11,761 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-25 13:35:11,762 INFO L451 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-25 13:35:11,762 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-25 13:35:11,762 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-07-25 13:35:11,763 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2018-07-25 13:35:11,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:11,789 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-07-25 13:35:11,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 13:35:11,790 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-07-25 13:35:11,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:11,790 INFO L225 Difference]: With dead ends: 19 [2018-07-25 13:35:11,791 INFO L226 Difference]: Without dead ends: 17 [2018-07-25 13:35:11,791 INFO L574 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-07-25 13:35:11,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-07-25 13:35:11,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-07-25 13:35:11,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-07-25 13:35:11,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-07-25 13:35:11,797 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-07-25 13:35:11,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:11,797 INFO L472 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-07-25 13:35:11,797 INFO L473 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-25 13:35:11,797 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-07-25 13:35:11,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 13:35:11,798 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:11,798 INFO L354 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2018-07-25 13:35:11,799 INFO L415 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:11,799 INFO L82 PathProgramCache]: Analyzing trace with hash 139913990, now seen corresponding path program 13 times [2018-07-25 13:35:11,799 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:11,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:11,927 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:11,930 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:11,934 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-25 13:35:11,935 INFO L451 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-25 13:35:11,935 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-25 13:35:11,936 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-07-25 13:35:11,936 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2018-07-25 13:35:11,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:11,962 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-07-25 13:35:11,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-25 13:35:11,962 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2018-07-25 13:35:11,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:11,963 INFO L225 Difference]: With dead ends: 20 [2018-07-25 13:35:11,963 INFO L226 Difference]: Without dead ends: 18 [2018-07-25 13:35:11,964 INFO L574 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-07-25 13:35:11,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-07-25 13:35:11,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-07-25 13:35:11,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-07-25 13:35:11,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-07-25 13:35:11,972 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-07-25 13:35:11,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:11,972 INFO L472 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-07-25 13:35:11,972 INFO L473 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-25 13:35:11,973 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-07-25 13:35:11,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-25 13:35:11,973 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:11,974 INFO L354 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2018-07-25 13:35:11,974 INFO L415 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:11,974 INFO L82 PathProgramCache]: Analyzing trace with hash 42362528, now seen corresponding path program 14 times [2018-07-25 13:35:11,974 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:11,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:12,126 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:12,127 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:12,127 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-07-25 13:35:12,128 INFO L451 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-07-25 13:35:12,128 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-07-25 13:35:12,128 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-07-25 13:35:12,129 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2018-07-25 13:35:12,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:12,157 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-07-25 13:35:12,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-25 13:35:12,158 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2018-07-25 13:35:12,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:12,159 INFO L225 Difference]: With dead ends: 21 [2018-07-25 13:35:12,159 INFO L226 Difference]: Without dead ends: 19 [2018-07-25 13:35:12,161 INFO L574 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-07-25 13:35:12,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-07-25 13:35:12,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-07-25 13:35:12,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-07-25 13:35:12,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-07-25 13:35:12,168 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-07-25 13:35:12,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:12,169 INFO L472 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-07-25 13:35:12,169 INFO L473 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-07-25 13:35:12,169 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-07-25 13:35:12,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 13:35:12,170 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:12,170 INFO L354 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2018-07-25 13:35:12,172 INFO L415 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:12,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1313234502, now seen corresponding path program 15 times [2018-07-25 13:35:12,172 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:12,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:12,359 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:12,360 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:12,360 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-07-25 13:35:12,365 INFO L451 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-07-25 13:35:12,365 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-07-25 13:35:12,366 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-07-25 13:35:12,367 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2018-07-25 13:35:12,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:12,407 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-07-25 13:35:12,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-25 13:35:12,408 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-07-25 13:35:12,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:12,409 INFO L225 Difference]: With dead ends: 22 [2018-07-25 13:35:12,409 INFO L226 Difference]: Without dead ends: 20 [2018-07-25 13:35:12,410 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-07-25 13:35:12,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-07-25 13:35:12,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-07-25 13:35:12,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-07-25 13:35:12,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-07-25 13:35:12,421 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-07-25 13:35:12,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:12,421 INFO L472 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-07-25 13:35:12,421 INFO L473 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-07-25 13:35:12,421 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-07-25 13:35:12,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-25 13:35:12,422 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:12,422 INFO L354 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2018-07-25 13:35:12,423 INFO L415 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:12,423 INFO L82 PathProgramCache]: Analyzing trace with hash 2055560032, now seen corresponding path program 16 times [2018-07-25 13:35:12,424 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:12,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:12,586 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:12,587 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:12,587 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-07-25 13:35:12,589 INFO L451 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-07-25 13:35:12,589 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-07-25 13:35:12,590 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-07-25 13:35:12,590 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2018-07-25 13:35:12,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:12,628 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-07-25 13:35:12,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-25 13:35:12,629 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2018-07-25 13:35:12,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:12,630 INFO L225 Difference]: With dead ends: 23 [2018-07-25 13:35:12,630 INFO L226 Difference]: Without dead ends: 21 [2018-07-25 13:35:12,630 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-07-25 13:35:12,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-07-25 13:35:12,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-07-25 13:35:12,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-07-25 13:35:12,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-07-25 13:35:12,637 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-07-25 13:35:12,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:12,637 INFO L472 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-07-25 13:35:12,637 INFO L473 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-07-25 13:35:12,637 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-07-25 13:35:12,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 13:35:12,638 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:12,640 INFO L354 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2018-07-25 13:35:12,640 INFO L415 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:12,640 INFO L82 PathProgramCache]: Analyzing trace with hash -702152314, now seen corresponding path program 17 times [2018-07-25 13:35:12,641 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:12,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:12,822 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:12,823 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:12,823 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-07-25 13:35:12,827 INFO L451 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-07-25 13:35:12,827 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-07-25 13:35:12,828 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-07-25 13:35:12,831 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2018-07-25 13:35:12,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:12,861 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-07-25 13:35:12,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-25 13:35:12,861 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2018-07-25 13:35:12,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:12,862 INFO L225 Difference]: With dead ends: 24 [2018-07-25 13:35:12,862 INFO L226 Difference]: Without dead ends: 22 [2018-07-25 13:35:12,863 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-07-25 13:35:12,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-07-25 13:35:12,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-07-25 13:35:12,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-07-25 13:35:12,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-07-25 13:35:12,875 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-07-25 13:35:12,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:12,875 INFO L472 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-07-25 13:35:12,876 INFO L473 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-07-25 13:35:12,876 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-07-25 13:35:12,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-25 13:35:12,878 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:12,878 INFO L354 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2018-07-25 13:35:12,878 INFO L415 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:12,878 INFO L82 PathProgramCache]: Analyzing trace with hash -291889120, now seen corresponding path program 18 times [2018-07-25 13:35:12,879 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:12,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:13,089 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:13,090 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:13,090 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-07-25 13:35:13,090 INFO L451 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-07-25 13:35:13,091 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-07-25 13:35:13,091 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-07-25 13:35:13,092 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2018-07-25 13:35:13,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:13,117 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-07-25 13:35:13,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-25 13:35:13,118 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2018-07-25 13:35:13,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:13,119 INFO L225 Difference]: With dead ends: 25 [2018-07-25 13:35:13,119 INFO L226 Difference]: Without dead ends: 23 [2018-07-25 13:35:13,121 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-07-25 13:35:13,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-07-25 13:35:13,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-07-25 13:35:13,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-07-25 13:35:13,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-07-25 13:35:13,131 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-07-25 13:35:13,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:13,131 INFO L472 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-07-25 13:35:13,131 INFO L473 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-07-25 13:35:13,132 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-07-25 13:35:13,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-25 13:35:13,132 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:13,133 INFO L354 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2018-07-25 13:35:13,133 INFO L415 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:13,133 INFO L82 PathProgramCache]: Analyzing trace with hash -458631994, now seen corresponding path program 19 times [2018-07-25 13:35:13,134 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:13,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:13,327 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:13,328 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:13,328 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-07-25 13:35:13,329 INFO L451 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-07-25 13:35:13,329 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-07-25 13:35:13,330 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-07-25 13:35:13,330 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2018-07-25 13:35:13,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:13,358 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-07-25 13:35:13,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-25 13:35:13,358 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2018-07-25 13:35:13,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:13,359 INFO L225 Difference]: With dead ends: 26 [2018-07-25 13:35:13,359 INFO L226 Difference]: Without dead ends: 24 [2018-07-25 13:35:13,360 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-07-25 13:35:13,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-07-25 13:35:13,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-07-25 13:35:13,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-07-25 13:35:13,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-07-25 13:35:13,367 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-07-25 13:35:13,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:13,368 INFO L472 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-07-25 13:35:13,368 INFO L473 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-07-25 13:35:13,368 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-07-25 13:35:13,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-25 13:35:13,369 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:13,369 INFO L354 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2018-07-25 13:35:13,369 INFO L415 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:13,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1332693792, now seen corresponding path program 20 times [2018-07-25 13:35:13,370 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:13,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:13,628 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:13,628 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:13,628 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-07-25 13:35:13,629 INFO L451 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-07-25 13:35:13,629 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-07-25 13:35:13,630 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-07-25 13:35:13,630 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2018-07-25 13:35:13,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:13,663 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-07-25 13:35:13,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-25 13:35:13,664 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2018-07-25 13:35:13,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:13,664 INFO L225 Difference]: With dead ends: 27 [2018-07-25 13:35:13,665 INFO L226 Difference]: Without dead ends: 25 [2018-07-25 13:35:13,668 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-07-25 13:35:13,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-07-25 13:35:13,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-07-25 13:35:13,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-07-25 13:35:13,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-07-25 13:35:13,674 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-07-25 13:35:13,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:13,675 INFO L472 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-07-25 13:35:13,675 INFO L473 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-07-25 13:35:13,675 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-07-25 13:35:13,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-07-25 13:35:13,676 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:13,676 INFO L354 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2018-07-25 13:35:13,676 INFO L415 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:13,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1636161542, now seen corresponding path program 21 times [2018-07-25 13:35:13,677 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:13,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:13,893 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 0 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:13,893 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:13,894 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-07-25 13:35:13,894 INFO L451 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-07-25 13:35:13,894 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-07-25 13:35:13,895 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-07-25 13:35:13,895 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2018-07-25 13:35:13,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:13,925 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-07-25 13:35:13,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 13:35:13,926 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2018-07-25 13:35:13,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:13,927 INFO L225 Difference]: With dead ends: 28 [2018-07-25 13:35:13,927 INFO L226 Difference]: Without dead ends: 26 [2018-07-25 13:35:13,927 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-07-25 13:35:13,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-07-25 13:35:13,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-07-25 13:35:13,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-07-25 13:35:13,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-07-25 13:35:13,934 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-07-25 13:35:13,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:13,934 INFO L472 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-07-25 13:35:13,934 INFO L473 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-07-25 13:35:13,935 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-07-25 13:35:13,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-25 13:35:13,935 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:13,935 INFO L354 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2018-07-25 13:35:13,936 INFO L415 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:13,936 INFO L82 PathProgramCache]: Analyzing trace with hash -818603616, now seen corresponding path program 22 times [2018-07-25 13:35:13,936 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:13,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:14,214 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:14,215 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:14,215 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-07-25 13:35:14,215 INFO L451 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-07-25 13:35:14,215 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-07-25 13:35:14,216 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-07-25 13:35:14,216 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2018-07-25 13:35:14,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:14,237 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-07-25 13:35:14,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-07-25 13:35:14,237 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2018-07-25 13:35:14,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:14,238 INFO L225 Difference]: With dead ends: 29 [2018-07-25 13:35:14,238 INFO L226 Difference]: Without dead ends: 27 [2018-07-25 13:35:14,239 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-07-25 13:35:14,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-07-25 13:35:14,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-07-25 13:35:14,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-07-25 13:35:14,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-07-25 13:35:14,245 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-07-25 13:35:14,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:14,245 INFO L472 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-07-25 13:35:14,245 INFO L473 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-07-25 13:35:14,245 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-07-25 13:35:14,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-07-25 13:35:14,246 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:14,246 INFO L354 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2018-07-25 13:35:14,246 INFO L415 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:14,247 INFO L82 PathProgramCache]: Analyzing trace with hash 393087814, now seen corresponding path program 23 times [2018-07-25 13:35:14,247 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:14,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:14,479 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:14,479 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:14,480 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-07-25 13:35:14,480 INFO L451 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-07-25 13:35:14,480 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-07-25 13:35:14,481 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-07-25 13:35:14,481 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2018-07-25 13:35:14,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:14,510 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-07-25 13:35:14,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-25 13:35:14,510 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2018-07-25 13:35:14,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:14,511 INFO L225 Difference]: With dead ends: 30 [2018-07-25 13:35:14,511 INFO L226 Difference]: Without dead ends: 28 [2018-07-25 13:35:14,514 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-07-25 13:35:14,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-07-25 13:35:14,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-07-25 13:35:14,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-07-25 13:35:14,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-07-25 13:35:14,525 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-07-25 13:35:14,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:14,525 INFO L472 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-07-25 13:35:14,526 INFO L473 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-07-25 13:35:14,526 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-07-25 13:35:14,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-07-25 13:35:14,527 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:14,527 INFO L354 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2018-07-25 13:35:14,527 INFO L415 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:14,529 INFO L82 PathProgramCache]: Analyzing trace with hash -699183520, now seen corresponding path program 24 times [2018-07-25 13:35:14,529 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:14,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:14,765 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:14,766 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:14,766 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-07-25 13:35:14,766 INFO L451 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-07-25 13:35:14,767 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-07-25 13:35:14,767 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-07-25 13:35:14,768 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2018-07-25 13:35:14,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:14,802 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-07-25 13:35:14,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-25 13:35:14,803 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2018-07-25 13:35:14,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:14,803 INFO L225 Difference]: With dead ends: 31 [2018-07-25 13:35:14,803 INFO L226 Difference]: Without dead ends: 29 [2018-07-25 13:35:14,804 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-07-25 13:35:14,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-07-25 13:35:14,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-07-25 13:35:14,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-07-25 13:35:14,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-07-25 13:35:14,813 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-07-25 13:35:14,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:14,814 INFO L472 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-07-25 13:35:14,814 INFO L473 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-07-25 13:35:14,814 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-07-25 13:35:14,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-07-25 13:35:14,815 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:14,815 INFO L354 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2018-07-25 13:35:14,815 INFO L415 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:14,815 INFO L82 PathProgramCache]: Analyzing trace with hash -199856506, now seen corresponding path program 25 times [2018-07-25 13:35:14,816 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:14,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:15,084 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:15,085 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:15,085 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-07-25 13:35:15,085 INFO L451 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-07-25 13:35:15,085 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-07-25 13:35:15,086 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-07-25 13:35:15,088 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2018-07-25 13:35:15,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:15,126 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-07-25 13:35:15,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-25 13:35:15,126 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2018-07-25 13:35:15,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:15,127 INFO L225 Difference]: With dead ends: 32 [2018-07-25 13:35:15,127 INFO L226 Difference]: Without dead ends: 30 [2018-07-25 13:35:15,128 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-07-25 13:35:15,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-07-25 13:35:15,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-07-25 13:35:15,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-07-25 13:35:15,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-07-25 13:35:15,134 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-07-25 13:35:15,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:15,135 INFO L472 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-07-25 13:35:15,135 INFO L473 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-07-25 13:35:15,135 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-07-25 13:35:15,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-07-25 13:35:15,136 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:15,136 INFO L354 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2018-07-25 13:35:15,136 INFO L415 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:15,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1900588256, now seen corresponding path program 26 times [2018-07-25 13:35:15,136 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:15,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:15,398 INFO L134 CoverageAnalysis]: Checked inductivity of 351 backedges. 0 proven. 351 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:15,399 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:15,399 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-07-25 13:35:15,399 INFO L451 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-07-25 13:35:15,400 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-07-25 13:35:15,400 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-07-25 13:35:15,401 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2018-07-25 13:35:15,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:15,429 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-07-25 13:35:15,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-25 13:35:15,429 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2018-07-25 13:35:15,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:15,430 INFO L225 Difference]: With dead ends: 33 [2018-07-25 13:35:15,430 INFO L226 Difference]: Without dead ends: 31 [2018-07-25 13:35:15,431 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-07-25 13:35:15,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-07-25 13:35:15,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-07-25 13:35:15,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-07-25 13:35:15,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-07-25 13:35:15,438 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-07-25 13:35:15,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:15,438 INFO L472 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-07-25 13:35:15,438 INFO L473 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-07-25 13:35:15,438 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-07-25 13:35:15,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-07-25 13:35:15,439 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:15,439 INFO L354 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2018-07-25 13:35:15,440 INFO L415 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:15,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1211302342, now seen corresponding path program 27 times [2018-07-25 13:35:15,440 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:15,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:15,688 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:15,688 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:15,689 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-07-25 13:35:15,689 INFO L451 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-07-25 13:35:15,689 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-07-25 13:35:15,690 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-07-25 13:35:15,690 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2018-07-25 13:35:15,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:15,729 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-07-25 13:35:15,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-25 13:35:15,730 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2018-07-25 13:35:15,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:15,730 INFO L225 Difference]: With dead ends: 34 [2018-07-25 13:35:15,730 INFO L226 Difference]: Without dead ends: 32 [2018-07-25 13:35:15,731 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-07-25 13:35:15,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-07-25 13:35:15,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-07-25 13:35:15,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-07-25 13:35:15,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-07-25 13:35:15,744 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-07-25 13:35:15,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:15,744 INFO L472 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-07-25 13:35:15,745 INFO L473 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-07-25 13:35:15,745 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-07-25 13:35:15,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-07-25 13:35:15,745 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:15,745 INFO L354 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2018-07-25 13:35:15,746 INFO L415 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:15,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1104336928, now seen corresponding path program 28 times [2018-07-25 13:35:15,746 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:15,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:16,002 INFO L134 CoverageAnalysis]: Checked inductivity of 406 backedges. 0 proven. 406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:16,003 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:16,003 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-07-25 13:35:16,003 INFO L451 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-07-25 13:35:16,003 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-07-25 13:35:16,004 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-07-25 13:35:16,004 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2018-07-25 13:35:16,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:16,031 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-07-25 13:35:16,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-25 13:35:16,031 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2018-07-25 13:35:16,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:16,032 INFO L225 Difference]: With dead ends: 35 [2018-07-25 13:35:16,032 INFO L226 Difference]: Without dead ends: 33 [2018-07-25 13:35:16,033 INFO L574 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-07-25 13:35:16,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-07-25 13:35:16,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-07-25 13:35:16,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-07-25 13:35:16,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-07-25 13:35:16,043 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-07-25 13:35:16,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:16,044 INFO L472 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-07-25 13:35:16,044 INFO L473 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-07-25 13:35:16,044 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-07-25 13:35:16,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-07-25 13:35:16,045 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:16,045 INFO L354 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2018-07-25 13:35:16,045 INFO L415 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:16,045 INFO L82 PathProgramCache]: Analyzing trace with hash 125289734, now seen corresponding path program 29 times [2018-07-25 13:35:16,045 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:16,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:16,289 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 0 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:16,290 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:16,290 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-07-25 13:35:16,290 INFO L451 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-07-25 13:35:16,291 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-07-25 13:35:16,291 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-07-25 13:35:16,292 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2018-07-25 13:35:16,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:16,325 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-07-25 13:35:16,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-07-25 13:35:16,326 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2018-07-25 13:35:16,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:16,326 INFO L225 Difference]: With dead ends: 36 [2018-07-25 13:35:16,326 INFO L226 Difference]: Without dead ends: 34 [2018-07-25 13:35:16,327 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-07-25 13:35:16,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-07-25 13:35:16,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-07-25 13:35:16,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-07-25 13:35:16,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-07-25 13:35:16,333 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-07-25 13:35:16,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:16,333 INFO L472 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-07-25 13:35:16,334 INFO L473 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-07-25 13:35:16,334 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-07-25 13:35:16,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-07-25 13:35:16,334 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:16,334 INFO L354 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2018-07-25 13:35:16,334 INFO L415 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:16,335 INFO L82 PathProgramCache]: Analyzing trace with hash -410989408, now seen corresponding path program 30 times [2018-07-25 13:35:16,335 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:16,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:16,582 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:16,582 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:16,582 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-07-25 13:35:16,583 INFO L451 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-07-25 13:35:16,583 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-07-25 13:35:16,584 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-07-25 13:35:16,584 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2018-07-25 13:35:16,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:16,620 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-07-25 13:35:16,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-07-25 13:35:16,620 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2018-07-25 13:35:16,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:16,621 INFO L225 Difference]: With dead ends: 37 [2018-07-25 13:35:16,621 INFO L226 Difference]: Without dead ends: 35 [2018-07-25 13:35:16,622 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-07-25 13:35:16,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-07-25 13:35:16,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-07-25 13:35:16,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-07-25 13:35:16,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-07-25 13:35:16,629 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-07-25 13:35:16,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:16,629 INFO L472 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-07-25 13:35:16,629 INFO L473 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-07-25 13:35:16,629 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-07-25 13:35:16,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-07-25 13:35:16,630 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:16,630 INFO L354 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2018-07-25 13:35:16,630 INFO L415 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:16,630 INFO L82 PathProgramCache]: Analyzing trace with hash 144226374, now seen corresponding path program 31 times [2018-07-25 13:35:16,631 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:16,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:16,926 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:16,926 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:16,926 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-07-25 13:35:16,927 INFO L451 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-07-25 13:35:16,927 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-07-25 13:35:16,928 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-07-25 13:35:16,928 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2018-07-25 13:35:16,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:16,958 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-07-25 13:35:16,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-25 13:35:16,958 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2018-07-25 13:35:16,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:16,959 INFO L225 Difference]: With dead ends: 38 [2018-07-25 13:35:16,959 INFO L226 Difference]: Without dead ends: 36 [2018-07-25 13:35:16,960 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-07-25 13:35:16,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-07-25 13:35:16,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-07-25 13:35:16,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-07-25 13:35:16,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-07-25 13:35:16,966 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-07-25 13:35:16,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:16,967 INFO L472 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-07-25 13:35:16,967 INFO L473 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-07-25 13:35:16,967 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-07-25 13:35:16,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-07-25 13:35:16,967 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:16,968 INFO L354 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2018-07-25 13:35:16,968 INFO L415 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:16,968 INFO L82 PathProgramCache]: Analyzing trace with hash 176046432, now seen corresponding path program 32 times [2018-07-25 13:35:16,968 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:16,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:17,291 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:17,292 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:17,292 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-07-25 13:35:17,292 INFO L451 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-07-25 13:35:17,293 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-07-25 13:35:17,293 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-07-25 13:35:17,294 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2018-07-25 13:35:17,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:17,320 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-07-25 13:35:17,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-07-25 13:35:17,320 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2018-07-25 13:35:17,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:17,320 INFO L225 Difference]: With dead ends: 39 [2018-07-25 13:35:17,321 INFO L226 Difference]: Without dead ends: 37 [2018-07-25 13:35:17,322 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-07-25 13:35:17,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-07-25 13:35:17,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-07-25 13:35:17,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-07-25 13:35:17,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-07-25 13:35:17,328 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-07-25 13:35:17,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:17,328 INFO L472 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-07-25 13:35:17,328 INFO L473 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-07-25 13:35:17,329 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-07-25 13:35:17,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-07-25 13:35:17,329 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:17,329 INFO L354 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2018-07-25 13:35:17,329 INFO L415 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:17,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1162468230, now seen corresponding path program 33 times [2018-07-25 13:35:17,330 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:17,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:17,597 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:17,597 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:17,597 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-07-25 13:35:17,598 INFO L451 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-07-25 13:35:17,598 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-07-25 13:35:17,599 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-07-25 13:35:17,599 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2018-07-25 13:35:17,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:17,626 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-07-25 13:35:17,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-07-25 13:35:17,626 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2018-07-25 13:35:17,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:17,627 INFO L225 Difference]: With dead ends: 40 [2018-07-25 13:35:17,627 INFO L226 Difference]: Without dead ends: 38 [2018-07-25 13:35:17,628 INFO L574 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-07-25 13:35:17,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-07-25 13:35:17,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-07-25 13:35:17,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-07-25 13:35:17,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-07-25 13:35:17,634 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-07-25 13:35:17,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:17,634 INFO L472 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-07-25 13:35:17,634 INFO L473 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-07-25 13:35:17,634 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-07-25 13:35:17,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-07-25 13:35:17,635 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:17,635 INFO L354 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2018-07-25 13:35:17,635 INFO L415 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:17,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1676772896, now seen corresponding path program 34 times [2018-07-25 13:35:17,635 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:17,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:17,905 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 0 proven. 595 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:17,905 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:17,905 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-07-25 13:35:17,905 INFO L451 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-07-25 13:35:17,906 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-07-25 13:35:17,906 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-07-25 13:35:17,907 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2018-07-25 13:35:17,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:17,931 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-07-25 13:35:17,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-07-25 13:35:17,931 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2018-07-25 13:35:17,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:17,932 INFO L225 Difference]: With dead ends: 41 [2018-07-25 13:35:17,932 INFO L226 Difference]: Without dead ends: 39 [2018-07-25 13:35:17,933 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-07-25 13:35:17,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-07-25 13:35:17,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-07-25 13:35:17,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-07-25 13:35:17,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-07-25 13:35:17,939 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-07-25 13:35:17,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:17,939 INFO L472 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-07-25 13:35:17,939 INFO L473 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-07-25 13:35:17,939 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-07-25 13:35:17,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-07-25 13:35:17,940 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:17,940 INFO L354 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2018-07-25 13:35:17,940 INFO L415 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:17,940 INFO L82 PathProgramCache]: Analyzing trace with hash 440348358, now seen corresponding path program 35 times [2018-07-25 13:35:17,941 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:17,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:18,227 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 0 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:18,227 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:18,228 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-07-25 13:35:18,228 INFO L451 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-07-25 13:35:18,228 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-07-25 13:35:18,229 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-07-25 13:35:18,229 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2018-07-25 13:35:18,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:18,259 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-07-25 13:35:18,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-07-25 13:35:18,259 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2018-07-25 13:35:18,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:18,260 INFO L225 Difference]: With dead ends: 42 [2018-07-25 13:35:18,260 INFO L226 Difference]: Without dead ends: 40 [2018-07-25 13:35:18,261 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-07-25 13:35:18,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-07-25 13:35:18,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-07-25 13:35:18,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-07-25 13:35:18,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-07-25 13:35:18,267 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-07-25 13:35:18,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:18,267 INFO L472 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-07-25 13:35:18,267 INFO L473 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-07-25 13:35:18,268 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-07-25 13:35:18,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-07-25 13:35:18,268 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:18,268 INFO L354 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2018-07-25 13:35:18,268 INFO L415 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:18,270 INFO L82 PathProgramCache]: Analyzing trace with hash 765893344, now seen corresponding path program 36 times [2018-07-25 13:35:18,270 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:18,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:18,559 INFO L134 CoverageAnalysis]: Checked inductivity of 666 backedges. 0 proven. 666 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:18,559 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:18,559 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-07-25 13:35:18,560 INFO L451 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-07-25 13:35:18,560 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-07-25 13:35:18,561 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-07-25 13:35:18,561 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2018-07-25 13:35:18,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:18,592 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-07-25 13:35:18,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-07-25 13:35:18,592 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2018-07-25 13:35:18,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:18,593 INFO L225 Difference]: With dead ends: 43 [2018-07-25 13:35:18,593 INFO L226 Difference]: Without dead ends: 41 [2018-07-25 13:35:18,594 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-07-25 13:35:18,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-07-25 13:35:18,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-07-25 13:35:18,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-07-25 13:35:18,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-07-25 13:35:18,599 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-07-25 13:35:18,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:18,600 INFO L472 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-07-25 13:35:18,600 INFO L473 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-07-25 13:35:18,600 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-07-25 13:35:18,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-07-25 13:35:18,600 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:18,601 INFO L354 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2018-07-25 13:35:18,601 INFO L415 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:18,601 INFO L82 PathProgramCache]: Analyzing trace with hash -2027113978, now seen corresponding path program 37 times [2018-07-25 13:35:18,601 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:18,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:18,896 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 0 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:18,897 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:18,897 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-07-25 13:35:18,897 INFO L451 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-07-25 13:35:18,897 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-07-25 13:35:18,898 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-07-25 13:35:18,899 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2018-07-25 13:35:18,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:18,936 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-07-25 13:35:18,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-07-25 13:35:18,936 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2018-07-25 13:35:18,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:18,937 INFO L225 Difference]: With dead ends: 44 [2018-07-25 13:35:18,937 INFO L226 Difference]: Without dead ends: 42 [2018-07-25 13:35:18,938 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-07-25 13:35:18,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-07-25 13:35:18,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-07-25 13:35:18,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-07-25 13:35:18,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-07-25 13:35:18,944 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-07-25 13:35:18,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:18,945 INFO L472 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-07-25 13:35:18,945 INFO L473 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-07-25 13:35:18,945 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-07-25 13:35:18,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-07-25 13:35:18,945 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:18,946 INFO L354 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2018-07-25 13:35:18,946 INFO L415 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:18,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1583972256, now seen corresponding path program 38 times [2018-07-25 13:35:18,948 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:18,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:19,238 INFO L134 CoverageAnalysis]: Checked inductivity of 741 backedges. 0 proven. 741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:19,238 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:19,239 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-07-25 13:35:19,239 INFO L451 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-07-25 13:35:19,239 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-07-25 13:35:19,240 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-07-25 13:35:19,241 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2018-07-25 13:35:19,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:19,285 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-07-25 13:35:19,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-07-25 13:35:19,286 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2018-07-25 13:35:19,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:19,286 INFO L225 Difference]: With dead ends: 45 [2018-07-25 13:35:19,287 INFO L226 Difference]: Without dead ends: 43 [2018-07-25 13:35:19,288 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-07-25 13:35:19,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-07-25 13:35:19,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-07-25 13:35:19,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-07-25 13:35:19,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-07-25 13:35:19,294 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-07-25 13:35:19,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:19,294 INFO L472 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-07-25 13:35:19,294 INFO L473 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-07-25 13:35:19,295 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-07-25 13:35:19,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-07-25 13:35:19,295 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:19,295 INFO L354 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2018-07-25 13:35:19,295 INFO L415 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:19,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1858495814, now seen corresponding path program 39 times [2018-07-25 13:35:19,296 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:19,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:19,665 INFO L134 CoverageAnalysis]: Checked inductivity of 780 backedges. 0 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:19,665 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:19,666 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-07-25 13:35:19,666 INFO L451 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-07-25 13:35:19,667 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-07-25 13:35:19,667 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-07-25 13:35:19,668 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2018-07-25 13:35:19,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:19,705 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-07-25 13:35:19,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-07-25 13:35:19,705 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2018-07-25 13:35:19,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:19,706 INFO L225 Difference]: With dead ends: 46 [2018-07-25 13:35:19,706 INFO L226 Difference]: Without dead ends: 44 [2018-07-25 13:35:19,707 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-07-25 13:35:19,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-07-25 13:35:19,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-07-25 13:35:19,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-07-25 13:35:19,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-07-25 13:35:19,714 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-07-25 13:35:19,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:19,715 INFO L472 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-07-25 13:35:19,715 INFO L473 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-07-25 13:35:19,715 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-07-25 13:35:19,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-07-25 13:35:19,716 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:19,716 INFO L354 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2018-07-25 13:35:19,716 INFO L415 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:19,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1778791520, now seen corresponding path program 40 times [2018-07-25 13:35:19,716 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:19,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:20,082 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:20,082 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:20,082 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-07-25 13:35:20,083 INFO L451 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-07-25 13:35:20,083 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-07-25 13:35:20,084 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-07-25 13:35:20,084 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2018-07-25 13:35:20,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:20,127 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-07-25 13:35:20,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-07-25 13:35:20,128 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2018-07-25 13:35:20,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:20,128 INFO L225 Difference]: With dead ends: 47 [2018-07-25 13:35:20,128 INFO L226 Difference]: Without dead ends: 45 [2018-07-25 13:35:20,130 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-07-25 13:35:20,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-07-25 13:35:20,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-07-25 13:35:20,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-07-25 13:35:20,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-07-25 13:35:20,136 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-07-25 13:35:20,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:20,136 INFO L472 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-07-25 13:35:20,136 INFO L473 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-07-25 13:35:20,136 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-07-25 13:35:20,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-07-25 13:35:20,137 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:20,137 INFO L354 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2018-07-25 13:35:20,137 INFO L415 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:20,137 INFO L82 PathProgramCache]: Analyzing trace with hash -692041594, now seen corresponding path program 41 times [2018-07-25 13:35:20,138 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:20,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:20,439 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:20,439 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:20,439 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-07-25 13:35:20,440 INFO L451 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-07-25 13:35:20,440 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-07-25 13:35:20,441 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-07-25 13:35:20,441 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2018-07-25 13:35:20,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:20,473 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-07-25 13:35:20,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-07-25 13:35:20,473 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2018-07-25 13:35:20,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:20,473 INFO L225 Difference]: With dead ends: 48 [2018-07-25 13:35:20,474 INFO L226 Difference]: Without dead ends: 46 [2018-07-25 13:35:20,475 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-07-25 13:35:20,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-07-25 13:35:20,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-07-25 13:35:20,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-07-25 13:35:20,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-07-25 13:35:20,482 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-07-25 13:35:20,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:20,482 INFO L472 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-07-25 13:35:20,482 INFO L473 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-07-25 13:35:20,482 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-07-25 13:35:20,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-07-25 13:35:20,483 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:20,483 INFO L354 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2018-07-25 13:35:20,483 INFO L415 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:20,483 INFO L82 PathProgramCache]: Analyzing trace with hash 21543200, now seen corresponding path program 42 times [2018-07-25 13:35:20,484 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:20,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:20,799 INFO L134 CoverageAnalysis]: Checked inductivity of 903 backedges. 0 proven. 903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:20,799 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:20,799 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-07-25 13:35:20,799 INFO L451 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-07-25 13:35:20,800 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-07-25 13:35:20,801 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-07-25 13:35:20,801 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2018-07-25 13:35:20,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:20,832 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-07-25 13:35:20,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-07-25 13:35:20,833 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2018-07-25 13:35:20,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:20,833 INFO L225 Difference]: With dead ends: 49 [2018-07-25 13:35:20,833 INFO L226 Difference]: Without dead ends: 47 [2018-07-25 13:35:20,835 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-07-25 13:35:20,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-07-25 13:35:20,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-07-25 13:35:20,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-07-25 13:35:20,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-07-25 13:35:20,842 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-07-25 13:35:20,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:20,842 INFO L472 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-07-25 13:35:20,843 INFO L473 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-07-25 13:35:20,843 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-07-25 13:35:20,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-07-25 13:35:20,843 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:20,843 INFO L354 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2018-07-25 13:35:20,844 INFO L415 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:20,844 INFO L82 PathProgramCache]: Analyzing trace with hash 667835334, now seen corresponding path program 43 times [2018-07-25 13:35:20,844 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:20,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:21,174 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:21,175 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:21,175 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-07-25 13:35:21,175 INFO L451 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-07-25 13:35:21,176 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-07-25 13:35:21,177 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-07-25 13:35:21,177 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2018-07-25 13:35:21,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:21,223 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-07-25 13:35:21,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-07-25 13:35:21,224 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2018-07-25 13:35:21,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:21,224 INFO L225 Difference]: With dead ends: 50 [2018-07-25 13:35:21,225 INFO L226 Difference]: Without dead ends: 48 [2018-07-25 13:35:21,226 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-07-25 13:35:21,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-07-25 13:35:21,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-07-25 13:35:21,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-07-25 13:35:21,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-07-25 13:35:21,232 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2018-07-25 13:35:21,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:21,233 INFO L472 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-07-25 13:35:21,233 INFO L473 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-07-25 13:35:21,233 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-07-25 13:35:21,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-07-25 13:35:21,233 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:21,234 INFO L354 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2018-07-25 13:35:21,234 INFO L415 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:21,234 INFO L82 PathProgramCache]: Analyzing trace with hash -771944992, now seen corresponding path program 44 times [2018-07-25 13:35:21,234 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:21,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:21,595 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:21,595 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:21,596 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-07-25 13:35:21,596 INFO L451 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-07-25 13:35:21,597 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-07-25 13:35:21,597 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-07-25 13:35:21,598 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2018-07-25 13:35:21,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:21,643 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-07-25 13:35:21,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-07-25 13:35:21,643 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2018-07-25 13:35:21,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:21,644 INFO L225 Difference]: With dead ends: 51 [2018-07-25 13:35:21,644 INFO L226 Difference]: Without dead ends: 49 [2018-07-25 13:35:21,645 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-07-25 13:35:21,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-07-25 13:35:21,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-07-25 13:35:21,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-07-25 13:35:21,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-07-25 13:35:21,652 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2018-07-25 13:35:21,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:21,652 INFO L472 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-07-25 13:35:21,652 INFO L473 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-07-25 13:35:21,652 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-07-25 13:35:21,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-07-25 13:35:21,653 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:21,653 INFO L354 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2018-07-25 13:35:21,653 INFO L415 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:21,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1839505158, now seen corresponding path program 45 times [2018-07-25 13:35:21,654 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:21,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:22,026 INFO L134 CoverageAnalysis]: Checked inductivity of 1035 backedges. 0 proven. 1035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:22,027 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:22,027 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-07-25 13:35:22,027 INFO L451 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-07-25 13:35:22,028 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-07-25 13:35:22,028 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-07-25 13:35:22,028 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2018-07-25 13:35:22,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:22,065 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-07-25 13:35:22,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-07-25 13:35:22,065 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2018-07-25 13:35:22,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:22,066 INFO L225 Difference]: With dead ends: 52 [2018-07-25 13:35:22,066 INFO L226 Difference]: Without dead ends: 50 [2018-07-25 13:35:22,067 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-07-25 13:35:22,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-07-25 13:35:22,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-07-25 13:35:22,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-07-25 13:35:22,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-07-25 13:35:22,074 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2018-07-25 13:35:22,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:22,074 INFO L472 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-07-25 13:35:22,075 INFO L473 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-07-25 13:35:22,075 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-07-25 13:35:22,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-07-25 13:35:22,075 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:22,075 INFO L354 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2018-07-25 13:35:22,076 INFO L415 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:22,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1190081184, now seen corresponding path program 46 times [2018-07-25 13:35:22,076 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:22,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:22,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:22,470 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:22,470 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-07-25 13:35:22,470 INFO L451 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-07-25 13:35:22,471 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-07-25 13:35:22,472 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-07-25 13:35:22,472 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2018-07-25 13:35:22,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:22,512 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-07-25 13:35:22,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-07-25 13:35:22,513 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2018-07-25 13:35:22,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:22,513 INFO L225 Difference]: With dead ends: 53 [2018-07-25 13:35:22,514 INFO L226 Difference]: Without dead ends: 51 [2018-07-25 13:35:22,515 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-07-25 13:35:22,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-07-25 13:35:22,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-07-25 13:35:22,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-07-25 13:35:22,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-07-25 13:35:22,523 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2018-07-25 13:35:22,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:22,523 INFO L472 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-07-25 13:35:22,523 INFO L473 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-07-25 13:35:22,524 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-07-25 13:35:22,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-07-25 13:35:22,524 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:22,524 INFO L354 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2018-07-25 13:35:22,525 INFO L415 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:22,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1762192826, now seen corresponding path program 47 times [2018-07-25 13:35:22,525 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:22,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:23,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1128 backedges. 0 proven. 1128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:23,023 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:23,023 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-07-25 13:35:23,024 INFO L451 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-07-25 13:35:23,024 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-07-25 13:35:23,025 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-07-25 13:35:23,025 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2018-07-25 13:35:23,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:23,061 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-07-25 13:35:23,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-07-25 13:35:23,061 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2018-07-25 13:35:23,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:23,062 INFO L225 Difference]: With dead ends: 54 [2018-07-25 13:35:23,062 INFO L226 Difference]: Without dead ends: 52 [2018-07-25 13:35:23,063 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-07-25 13:35:23,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-07-25 13:35:23,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-07-25 13:35:23,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-07-25 13:35:23,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-07-25 13:35:23,071 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2018-07-25 13:35:23,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:23,072 INFO L472 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-07-25 13:35:23,072 INFO L473 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-07-25 13:35:23,072 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-07-25 13:35:23,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-07-25 13:35:23,073 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:23,073 INFO L354 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2018-07-25 13:35:23,073 INFO L415 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:23,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1206593376, now seen corresponding path program 48 times [2018-07-25 13:35:23,074 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:23,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:23,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:23,436 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:23,436 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-07-25 13:35:23,436 INFO L451 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-07-25 13:35:23,437 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-07-25 13:35:23,437 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-07-25 13:35:23,438 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2018-07-25 13:35:23,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:23,485 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-07-25 13:35:23,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-07-25 13:35:23,485 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2018-07-25 13:35:23,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:23,486 INFO L225 Difference]: With dead ends: 55 [2018-07-25 13:35:23,486 INFO L226 Difference]: Without dead ends: 53 [2018-07-25 13:35:23,490 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-07-25 13:35:23,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-07-25 13:35:23,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-07-25 13:35:23,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-07-25 13:35:23,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-07-25 13:35:23,500 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2018-07-25 13:35:23,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:23,500 INFO L472 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-07-25 13:35:23,500 INFO L473 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-07-25 13:35:23,500 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-07-25 13:35:23,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-07-25 13:35:23,501 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:23,501 INFO L354 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2018-07-25 13:35:23,501 INFO L415 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:23,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1250314874, now seen corresponding path program 49 times [2018-07-25 13:35:23,504 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:23,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:23,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:23,885 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:23,885 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-07-25 13:35:23,885 INFO L451 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-07-25 13:35:23,886 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-07-25 13:35:23,887 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-07-25 13:35:23,887 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2018-07-25 13:35:23,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:23,938 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-07-25 13:35:23,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-07-25 13:35:23,938 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2018-07-25 13:35:23,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:23,939 INFO L225 Difference]: With dead ends: 56 [2018-07-25 13:35:23,939 INFO L226 Difference]: Without dead ends: 54 [2018-07-25 13:35:23,940 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-07-25 13:35:23,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-07-25 13:35:23,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-07-25 13:35:23,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-07-25 13:35:23,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-07-25 13:35:23,947 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2018-07-25 13:35:23,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:23,948 INFO L472 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-07-25 13:35:23,948 INFO L473 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-07-25 13:35:23,948 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-07-25 13:35:23,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-07-25 13:35:23,949 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:23,949 INFO L354 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2018-07-25 13:35:23,949 INFO L415 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:23,949 INFO L82 PathProgramCache]: Analyzing trace with hash -105059296, now seen corresponding path program 50 times [2018-07-25 13:35:23,949 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:23,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:24,356 INFO L134 CoverageAnalysis]: Checked inductivity of 1275 backedges. 0 proven. 1275 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:24,357 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:24,357 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-07-25 13:35:24,357 INFO L451 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-07-25 13:35:24,358 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-07-25 13:35:24,358 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-07-25 13:35:24,359 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2018-07-25 13:35:24,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:24,412 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-07-25 13:35:24,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-07-25 13:35:24,413 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2018-07-25 13:35:24,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:24,414 INFO L225 Difference]: With dead ends: 57 [2018-07-25 13:35:24,414 INFO L226 Difference]: Without dead ends: 55 [2018-07-25 13:35:24,415 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-07-25 13:35:24,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-07-25 13:35:24,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-07-25 13:35:24,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-07-25 13:35:24,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-07-25 13:35:24,423 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2018-07-25 13:35:24,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:24,423 INFO L472 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-07-25 13:35:24,423 INFO L473 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-07-25 13:35:24,423 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-07-25 13:35:24,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-07-25 13:35:24,424 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:24,424 INFO L354 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2018-07-25 13:35:24,424 INFO L415 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:24,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1038125254, now seen corresponding path program 51 times [2018-07-25 13:35:24,425 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:24,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:24,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1326 backedges. 0 proven. 1326 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:24,846 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:24,846 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-07-25 13:35:24,847 INFO L451 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-07-25 13:35:24,847 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-07-25 13:35:24,848 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-07-25 13:35:24,848 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2018-07-25 13:35:24,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:24,885 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-07-25 13:35:24,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-07-25 13:35:24,885 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2018-07-25 13:35:24,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:24,886 INFO L225 Difference]: With dead ends: 58 [2018-07-25 13:35:24,886 INFO L226 Difference]: Without dead ends: 56 [2018-07-25 13:35:24,887 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-07-25 13:35:24,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-07-25 13:35:24,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-07-25 13:35:24,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-07-25 13:35:24,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-07-25 13:35:24,894 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2018-07-25 13:35:24,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:24,895 INFO L472 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-07-25 13:35:24,895 INFO L473 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-07-25 13:35:24,895 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-07-25 13:35:24,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-07-25 13:35:24,895 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:24,896 INFO L354 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2018-07-25 13:35:24,896 INFO L415 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:24,896 INFO L82 PathProgramCache]: Analyzing trace with hash 2117107936, now seen corresponding path program 52 times [2018-07-25 13:35:24,896 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:24,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:25,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1378 backedges. 0 proven. 1378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:25,302 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:25,302 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-07-25 13:35:25,303 INFO L451 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-07-25 13:35:25,303 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-07-25 13:35:25,304 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-07-25 13:35:25,304 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2018-07-25 13:35:25,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:25,356 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-07-25 13:35:25,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-07-25 13:35:25,356 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2018-07-25 13:35:25,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:25,356 INFO L225 Difference]: With dead ends: 59 [2018-07-25 13:35:25,357 INFO L226 Difference]: Without dead ends: 57 [2018-07-25 13:35:25,357 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-07-25 13:35:25,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-07-25 13:35:25,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-07-25 13:35:25,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-07-25 13:35:25,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-07-25 13:35:25,365 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2018-07-25 13:35:25,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:25,365 INFO L472 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-07-25 13:35:25,365 INFO L473 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-07-25 13:35:25,366 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-07-25 13:35:25,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-07-25 13:35:25,366 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:25,366 INFO L354 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2018-07-25 13:35:25,366 INFO L415 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:25,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1205832710, now seen corresponding path program 53 times [2018-07-25 13:35:25,367 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:25,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:25,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1431 backedges. 0 proven. 1431 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:25,809 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:25,810 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-07-25 13:35:25,810 INFO L451 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-07-25 13:35:25,811 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-07-25 13:35:25,811 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-07-25 13:35:25,811 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2018-07-25 13:35:25,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:25,862 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-07-25 13:35:25,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-07-25 13:35:25,863 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2018-07-25 13:35:25,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:25,863 INFO L225 Difference]: With dead ends: 60 [2018-07-25 13:35:25,863 INFO L226 Difference]: Without dead ends: 58 [2018-07-25 13:35:25,864 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-07-25 13:35:25,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-07-25 13:35:25,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-07-25 13:35:25,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-07-25 13:35:25,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-07-25 13:35:25,872 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2018-07-25 13:35:25,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:25,872 INFO L472 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-07-25 13:35:25,872 INFO L473 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-07-25 13:35:25,873 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-07-25 13:35:25,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-07-25 13:35:25,873 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:25,873 INFO L354 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2018-07-25 13:35:25,874 INFO L415 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:25,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1273895520, now seen corresponding path program 54 times [2018-07-25 13:35:25,874 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:25,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:26,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1485 backedges. 0 proven. 1485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:26,309 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:26,309 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-07-25 13:35:26,310 INFO L451 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-07-25 13:35:26,311 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-07-25 13:35:26,311 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-07-25 13:35:26,312 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2018-07-25 13:35:26,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:26,366 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-07-25 13:35:26,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-07-25 13:35:26,367 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2018-07-25 13:35:26,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:26,367 INFO L225 Difference]: With dead ends: 61 [2018-07-25 13:35:26,367 INFO L226 Difference]: Without dead ends: 59 [2018-07-25 13:35:26,369 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-07-25 13:35:26,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-07-25 13:35:26,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-07-25 13:35:26,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-07-25 13:35:26,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-07-25 13:35:26,377 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2018-07-25 13:35:26,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:26,377 INFO L472 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-07-25 13:35:26,377 INFO L473 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-07-25 13:35:26,377 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-07-25 13:35:26,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-07-25 13:35:26,378 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:26,378 INFO L354 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2018-07-25 13:35:26,380 INFO L415 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:26,380 INFO L82 PathProgramCache]: Analyzing trace with hash -836059322, now seen corresponding path program 55 times [2018-07-25 13:35:26,381 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:26,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:26,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1540 backedges. 0 proven. 1540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:26,790 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:26,790 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-07-25 13:35:26,791 INFO L451 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-07-25 13:35:26,791 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-07-25 13:35:26,792 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-07-25 13:35:26,792 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2018-07-25 13:35:26,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:26,833 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-07-25 13:35:26,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-07-25 13:35:26,834 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2018-07-25 13:35:26,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:26,834 INFO L225 Difference]: With dead ends: 62 [2018-07-25 13:35:26,834 INFO L226 Difference]: Without dead ends: 60 [2018-07-25 13:35:26,835 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-07-25 13:35:26,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-07-25 13:35:26,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-07-25 13:35:26,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-07-25 13:35:26,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-07-25 13:35:26,842 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2018-07-25 13:35:26,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:26,842 INFO L472 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-07-25 13:35:26,843 INFO L473 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-07-25 13:35:26,843 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-07-25 13:35:26,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-07-25 13:35:26,843 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:26,843 INFO L354 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2018-07-25 13:35:26,844 INFO L415 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:26,844 INFO L82 PathProgramCache]: Analyzing trace with hash -148039072, now seen corresponding path program 56 times [2018-07-25 13:35:26,844 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:26,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:27,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:27,271 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:27,271 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-07-25 13:35:27,271 INFO L451 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-07-25 13:35:27,272 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-07-25 13:35:27,272 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-07-25 13:35:27,273 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2018-07-25 13:35:27,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:27,333 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-07-25 13:35:27,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-07-25 13:35:27,333 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2018-07-25 13:35:27,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:27,334 INFO L225 Difference]: With dead ends: 63 [2018-07-25 13:35:27,334 INFO L226 Difference]: Without dead ends: 61 [2018-07-25 13:35:27,335 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-07-25 13:35:27,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-07-25 13:35:27,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-07-25 13:35:27,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-07-25 13:35:27,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-07-25 13:35:27,342 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2018-07-25 13:35:27,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:27,343 INFO L472 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-07-25 13:35:27,343 INFO L473 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-07-25 13:35:27,343 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-07-25 13:35:27,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-07-25 13:35:27,343 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:27,344 INFO L354 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2018-07-25 13:35:27,344 INFO L415 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:27,344 INFO L82 PathProgramCache]: Analyzing trace with hash -294247802, now seen corresponding path program 57 times [2018-07-25 13:35:27,344 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:27,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:27,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:27,819 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:27,819 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-07-25 13:35:27,819 INFO L451 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-07-25 13:35:27,820 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-07-25 13:35:27,821 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-07-25 13:35:27,821 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2018-07-25 13:35:27,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:27,890 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-07-25 13:35:27,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-07-25 13:35:27,890 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2018-07-25 13:35:27,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:27,891 INFO L225 Difference]: With dead ends: 64 [2018-07-25 13:35:27,891 INFO L226 Difference]: Without dead ends: 62 [2018-07-25 13:35:27,892 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-07-25 13:35:27,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-07-25 13:35:27,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-07-25 13:35:27,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-07-25 13:35:27,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-07-25 13:35:27,900 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2018-07-25 13:35:27,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:27,900 INFO L472 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-07-25 13:35:27,900 INFO L473 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-07-25 13:35:27,900 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-07-25 13:35:27,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-07-25 13:35:27,901 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:27,901 INFO L354 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2018-07-25 13:35:27,901 INFO L415 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:27,901 INFO L82 PathProgramCache]: Analyzing trace with hash -531751136, now seen corresponding path program 58 times [2018-07-25 13:35:27,901 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:27,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:28,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1711 backedges. 0 proven. 1711 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:28,416 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:28,416 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-07-25 13:35:28,417 INFO L451 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-07-25 13:35:28,418 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-07-25 13:35:28,418 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-07-25 13:35:28,419 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2018-07-25 13:35:28,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:28,483 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-07-25 13:35:28,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-07-25 13:35:28,484 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2018-07-25 13:35:28,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:28,484 INFO L225 Difference]: With dead ends: 65 [2018-07-25 13:35:28,484 INFO L226 Difference]: Without dead ends: 63 [2018-07-25 13:35:28,485 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-07-25 13:35:28,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-07-25 13:35:28,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-07-25 13:35:28,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-07-25 13:35:28,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-07-25 13:35:28,493 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2018-07-25 13:35:28,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:28,494 INFO L472 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-07-25 13:35:28,494 INFO L473 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-07-25 13:35:28,494 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-07-25 13:35:28,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-07-25 13:35:28,494 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:28,495 INFO L354 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2018-07-25 13:35:28,495 INFO L415 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:28,495 INFO L82 PathProgramCache]: Analyzing trace with hash 695580102, now seen corresponding path program 59 times [2018-07-25 13:35:28,495 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:28,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:29,039 INFO L134 CoverageAnalysis]: Checked inductivity of 1770 backedges. 0 proven. 1770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:29,040 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:29,040 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-07-25 13:35:29,040 INFO L451 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-07-25 13:35:29,041 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-07-25 13:35:29,041 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-07-25 13:35:29,042 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2018-07-25 13:35:29,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:29,098 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-07-25 13:35:29,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-07-25 13:35:29,098 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2018-07-25 13:35:29,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:29,099 INFO L225 Difference]: With dead ends: 66 [2018-07-25 13:35:29,099 INFO L226 Difference]: Without dead ends: 64 [2018-07-25 13:35:29,100 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-07-25 13:35:29,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-07-25 13:35:29,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-07-25 13:35:29,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-07-25 13:35:29,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-07-25 13:35:29,107 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2018-07-25 13:35:29,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:29,108 INFO L472 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-07-25 13:35:29,108 INFO L473 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-07-25 13:35:29,108 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-07-25 13:35:29,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-07-25 13:35:29,108 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:29,109 INFO L354 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2018-07-25 13:35:29,109 INFO L415 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:29,109 INFO L82 PathProgramCache]: Analyzing trace with hash 88142816, now seen corresponding path program 60 times [2018-07-25 13:35:29,109 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:29,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:29,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1830 backedges. 0 proven. 1830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:29,575 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:29,576 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-07-25 13:35:29,576 INFO L451 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-07-25 13:35:29,577 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-07-25 13:35:29,578 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-07-25 13:35:29,578 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2018-07-25 13:35:29,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:29,641 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-07-25 13:35:29,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-07-25 13:35:29,641 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2018-07-25 13:35:29,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:29,642 INFO L225 Difference]: With dead ends: 67 [2018-07-25 13:35:29,642 INFO L226 Difference]: Without dead ends: 65 [2018-07-25 13:35:29,643 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-07-25 13:35:29,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-07-25 13:35:29,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-07-25 13:35:29,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-07-25 13:35:29,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-07-25 13:35:29,651 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2018-07-25 13:35:29,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:29,651 INFO L472 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-07-25 13:35:29,651 INFO L473 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-07-25 13:35:29,652 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-07-25 13:35:29,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-07-25 13:35:29,652 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:29,652 INFO L354 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2018-07-25 13:35:29,653 INFO L415 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:29,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1562543866, now seen corresponding path program 61 times [2018-07-25 13:35:29,653 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:29,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:30,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 0 proven. 1891 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:30,115 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:30,115 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-07-25 13:35:30,115 INFO L451 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-07-25 13:35:30,116 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-07-25 13:35:30,117 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-07-25 13:35:30,117 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2018-07-25 13:35:30,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:30,168 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-07-25 13:35:30,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-07-25 13:35:30,169 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2018-07-25 13:35:30,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:30,169 INFO L225 Difference]: With dead ends: 68 [2018-07-25 13:35:30,170 INFO L226 Difference]: Without dead ends: 66 [2018-07-25 13:35:30,171 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-07-25 13:35:30,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-07-25 13:35:30,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-07-25 13:35:30,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-07-25 13:35:30,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-07-25 13:35:30,180 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2018-07-25 13:35:30,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:30,180 INFO L472 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-07-25 13:35:30,180 INFO L473 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-07-25 13:35:30,180 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-07-25 13:35:30,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-07-25 13:35:30,181 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:30,181 INFO L354 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2018-07-25 13:35:30,181 INFO L415 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:30,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1194223456, now seen corresponding path program 62 times [2018-07-25 13:35:30,182 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:30,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:30,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:30,679 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:30,679 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-07-25 13:35:30,679 INFO L451 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-07-25 13:35:30,680 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-07-25 13:35:30,681 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-07-25 13:35:30,682 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2018-07-25 13:35:30,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:30,753 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-07-25 13:35:30,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-07-25 13:35:30,754 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2018-07-25 13:35:30,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:30,754 INFO L225 Difference]: With dead ends: 69 [2018-07-25 13:35:30,755 INFO L226 Difference]: Without dead ends: 67 [2018-07-25 13:35:30,756 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-07-25 13:35:30,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-07-25 13:35:30,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-07-25 13:35:30,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-07-25 13:35:30,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-07-25 13:35:30,764 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2018-07-25 13:35:30,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:30,765 INFO L472 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-07-25 13:35:30,765 INFO L473 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-07-25 13:35:30,765 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-07-25 13:35:30,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-07-25 13:35:30,765 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:30,766 INFO L354 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2018-07-25 13:35:30,766 INFO L415 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:30,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1633774662, now seen corresponding path program 63 times [2018-07-25 13:35:30,766 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:30,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:31,276 INFO L134 CoverageAnalysis]: Checked inductivity of 2016 backedges. 0 proven. 2016 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:31,276 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:31,277 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-07-25 13:35:31,277 INFO L451 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-07-25 13:35:31,280 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-07-25 13:35:31,280 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-07-25 13:35:31,281 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2018-07-25 13:35:31,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:31,335 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-07-25 13:35:31,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-07-25 13:35:31,335 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2018-07-25 13:35:31,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:31,336 INFO L225 Difference]: With dead ends: 70 [2018-07-25 13:35:31,336 INFO L226 Difference]: Without dead ends: 68 [2018-07-25 13:35:31,337 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-07-25 13:35:31,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-07-25 13:35:31,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-07-25 13:35:31,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-07-25 13:35:31,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-07-25 13:35:31,347 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2018-07-25 13:35:31,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:31,348 INFO L472 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-07-25 13:35:31,348 INFO L473 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-07-25 13:35:31,348 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-07-25 13:35:31,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-07-25 13:35:31,349 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:31,349 INFO L354 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2018-07-25 13:35:31,350 INFO L415 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:31,350 INFO L82 PathProgramCache]: Analyzing trace with hash -892596896, now seen corresponding path program 64 times [2018-07-25 13:35:31,350 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:31,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:31,856 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:31,856 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:31,856 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-07-25 13:35:31,857 INFO L451 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-07-25 13:35:31,857 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-07-25 13:35:31,858 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-07-25 13:35:31,858 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2018-07-25 13:35:31,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:31,937 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-07-25 13:35:31,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-07-25 13:35:31,938 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2018-07-25 13:35:31,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:31,938 INFO L225 Difference]: With dead ends: 71 [2018-07-25 13:35:31,938 INFO L226 Difference]: Without dead ends: 69 [2018-07-25 13:35:31,939 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-07-25 13:35:31,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-07-25 13:35:31,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-07-25 13:35:31,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-07-25 13:35:31,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-07-25 13:35:31,946 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2018-07-25 13:35:31,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:31,947 INFO L472 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-07-25 13:35:31,947 INFO L473 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-07-25 13:35:31,947 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-07-25 13:35:31,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-07-25 13:35:31,947 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:31,948 INFO L354 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2018-07-25 13:35:31,948 INFO L415 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:31,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1900703866, now seen corresponding path program 65 times [2018-07-25 13:35:31,948 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:32,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:32,353 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:32,353 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:32,354 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-07-25 13:35:32,354 INFO L451 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-07-25 13:35:32,354 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-07-25 13:35:32,355 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-07-25 13:35:32,355 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2018-07-25 13:35:32,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:32,423 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-07-25 13:35:32,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-07-25 13:35:32,424 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2018-07-25 13:35:32,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:32,424 INFO L225 Difference]: With dead ends: 72 [2018-07-25 13:35:32,424 INFO L226 Difference]: Without dead ends: 70 [2018-07-25 13:35:32,425 INFO L574 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-07-25 13:35:32,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-07-25 13:35:32,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-07-25 13:35:32,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-07-25 13:35:32,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-07-25 13:35:32,432 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2018-07-25 13:35:32,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:32,433 INFO L472 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-07-25 13:35:32,433 INFO L473 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-07-25 13:35:32,433 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-07-25 13:35:32,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-07-25 13:35:32,434 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:32,434 INFO L354 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2018-07-25 13:35:32,434 INFO L415 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:32,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1207718432, now seen corresponding path program 66 times [2018-07-25 13:35:32,434 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:32,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:32,878 INFO L134 CoverageAnalysis]: Checked inductivity of 2211 backedges. 0 proven. 2211 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:32,878 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:32,878 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-07-25 13:35:32,879 INFO L451 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-07-25 13:35:32,879 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-07-25 13:35:32,879 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-07-25 13:35:32,879 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2018-07-25 13:35:32,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:32,941 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-07-25 13:35:32,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-07-25 13:35:32,941 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2018-07-25 13:35:32,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:32,942 INFO L225 Difference]: With dead ends: 73 [2018-07-25 13:35:32,942 INFO L226 Difference]: Without dead ends: 71 [2018-07-25 13:35:32,943 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-07-25 13:35:32,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-07-25 13:35:32,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-07-25 13:35:32,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-07-25 13:35:32,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-07-25 13:35:32,950 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2018-07-25 13:35:32,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:32,951 INFO L472 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-07-25 13:35:32,951 INFO L473 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-07-25 13:35:32,951 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-07-25 13:35:32,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-07-25 13:35:32,952 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:32,952 INFO L354 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2018-07-25 13:35:32,952 INFO L415 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:32,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1215438138, now seen corresponding path program 67 times [2018-07-25 13:35:32,952 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:33,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:33,457 INFO L134 CoverageAnalysis]: Checked inductivity of 2278 backedges. 0 proven. 2278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:33,458 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:33,458 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-07-25 13:35:33,458 INFO L451 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-07-25 13:35:33,459 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-07-25 13:35:33,459 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-07-25 13:35:33,459 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2018-07-25 13:35:33,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:33,503 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-07-25 13:35:33,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-07-25 13:35:33,503 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2018-07-25 13:35:33,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:33,504 INFO L225 Difference]: With dead ends: 74 [2018-07-25 13:35:33,504 INFO L226 Difference]: Without dead ends: 72 [2018-07-25 13:35:33,504 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-07-25 13:35:33,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-07-25 13:35:33,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-07-25 13:35:33,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-07-25 13:35:33,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-07-25 13:35:33,512 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2018-07-25 13:35:33,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:33,512 INFO L472 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-07-25 13:35:33,512 INFO L473 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-07-25 13:35:33,512 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-07-25 13:35:33,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-07-25 13:35:33,513 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:33,513 INFO L354 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2018-07-25 13:35:33,513 INFO L415 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:33,513 INFO L82 PathProgramCache]: Analyzing trace with hash 976119520, now seen corresponding path program 68 times [2018-07-25 13:35:33,514 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:33,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:34,062 INFO L134 CoverageAnalysis]: Checked inductivity of 2346 backedges. 0 proven. 2346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:34,063 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:34,063 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-07-25 13:35:34,063 INFO L451 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-07-25 13:35:34,064 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-07-25 13:35:34,064 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-07-25 13:35:34,065 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2018-07-25 13:35:34,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:34,125 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-07-25 13:35:34,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-07-25 13:35:34,125 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2018-07-25 13:35:34,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:34,126 INFO L225 Difference]: With dead ends: 75 [2018-07-25 13:35:34,126 INFO L226 Difference]: Without dead ends: 73 [2018-07-25 13:35:34,127 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-07-25 13:35:34,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-07-25 13:35:34,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-07-25 13:35:34,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-07-25 13:35:34,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-07-25 13:35:34,136 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2018-07-25 13:35:34,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:34,136 INFO L472 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-07-25 13:35:34,136 INFO L473 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-07-25 13:35:34,137 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-07-25 13:35:34,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-07-25 13:35:34,137 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:34,137 INFO L354 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2018-07-25 13:35:34,138 INFO L415 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:34,138 INFO L82 PathProgramCache]: Analyzing trace with hash 194930182, now seen corresponding path program 69 times [2018-07-25 13:35:34,138 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:34,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:34,787 INFO L134 CoverageAnalysis]: Checked inductivity of 2415 backedges. 0 proven. 2415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:34,787 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:34,787 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-07-25 13:35:34,788 INFO L451 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-07-25 13:35:34,788 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-07-25 13:35:34,788 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-07-25 13:35:34,788 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2018-07-25 13:35:34,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:34,859 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-07-25 13:35:34,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-07-25 13:35:34,860 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2018-07-25 13:35:34,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:34,860 INFO L225 Difference]: With dead ends: 76 [2018-07-25 13:35:34,861 INFO L226 Difference]: Without dead ends: 74 [2018-07-25 13:35:34,861 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-07-25 13:35:34,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-07-25 13:35:34,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-07-25 13:35:34,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-07-25 13:35:34,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-07-25 13:35:34,869 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2018-07-25 13:35:34,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:34,869 INFO L472 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-07-25 13:35:34,869 INFO L473 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-07-25 13:35:34,869 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-07-25 13:35:34,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-07-25 13:35:34,870 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:34,870 INFO L354 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2018-07-25 13:35:34,871 INFO L415 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:34,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1747864480, now seen corresponding path program 70 times [2018-07-25 13:35:34,871 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:34,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:35,371 INFO L134 CoverageAnalysis]: Checked inductivity of 2485 backedges. 0 proven. 2485 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:35,371 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:35,371 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-07-25 13:35:35,371 INFO L451 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-07-25 13:35:35,372 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-07-25 13:35:35,372 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-07-25 13:35:35,373 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2018-07-25 13:35:35,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:35,447 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-07-25 13:35:35,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-07-25 13:35:35,447 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2018-07-25 13:35:35,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:35,448 INFO L225 Difference]: With dead ends: 77 [2018-07-25 13:35:35,448 INFO L226 Difference]: Without dead ends: 75 [2018-07-25 13:35:35,449 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-07-25 13:35:35,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-07-25 13:35:35,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-07-25 13:35:35,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-07-25 13:35:35,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-07-25 13:35:35,456 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2018-07-25 13:35:35,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:35,456 INFO L472 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-07-25 13:35:35,456 INFO L473 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-07-25 13:35:35,456 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-07-25 13:35:35,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-07-25 13:35:35,457 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:35,457 INFO L354 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2018-07-25 13:35:35,457 INFO L415 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:35,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1650779834, now seen corresponding path program 71 times [2018-07-25 13:35:35,458 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:35,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:35,868 INFO L134 CoverageAnalysis]: Checked inductivity of 2556 backedges. 0 proven. 2556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:35,868 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:35,869 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-07-25 13:35:35,869 INFO L451 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-07-25 13:35:35,870 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-07-25 13:35:35,870 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-07-25 13:35:35,870 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2018-07-25 13:35:35,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:35,948 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-07-25 13:35:35,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-07-25 13:35:35,948 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2018-07-25 13:35:35,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:35,949 INFO L225 Difference]: With dead ends: 78 [2018-07-25 13:35:35,949 INFO L226 Difference]: Without dead ends: 76 [2018-07-25 13:35:35,950 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-07-25 13:35:35,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-07-25 13:35:35,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-07-25 13:35:35,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-07-25 13:35:35,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-07-25 13:35:35,957 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2018-07-25 13:35:35,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:35,958 INFO L472 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-07-25 13:35:35,958 INFO L473 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-07-25 13:35:35,958 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-07-25 13:35:35,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-07-25 13:35:35,958 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:35,958 INFO L354 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2018-07-25 13:35:35,959 INFO L415 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:35,959 INFO L82 PathProgramCache]: Analyzing trace with hash 365428832, now seen corresponding path program 72 times [2018-07-25 13:35:35,959 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:36,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:36,452 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:36,452 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:36,452 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-07-25 13:35:36,453 INFO L451 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-07-25 13:35:36,453 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-07-25 13:35:36,453 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-07-25 13:35:36,454 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2018-07-25 13:35:36,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:36,510 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-07-25 13:35:36,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-07-25 13:35:36,510 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2018-07-25 13:35:36,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:36,511 INFO L225 Difference]: With dead ends: 79 [2018-07-25 13:35:36,511 INFO L226 Difference]: Without dead ends: 77 [2018-07-25 13:35:36,512 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-07-25 13:35:36,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-07-25 13:35:36,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-07-25 13:35:36,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-07-25 13:35:36,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-07-25 13:35:36,519 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2018-07-25 13:35:36,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:36,519 INFO L472 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-07-25 13:35:36,519 INFO L473 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-07-25 13:35:36,519 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-07-25 13:35:36,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-07-25 13:35:36,520 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:36,520 INFO L354 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2018-07-25 13:35:36,520 INFO L415 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:36,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1556611962, now seen corresponding path program 73 times [2018-07-25 13:35:36,520 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:36,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:37,116 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:37,116 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:37,116 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-07-25 13:35:37,117 INFO L451 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-07-25 13:35:37,118 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-07-25 13:35:37,118 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-07-25 13:35:37,118 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2018-07-25 13:35:37,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:37,186 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-07-25 13:35:37,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-07-25 13:35:37,187 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2018-07-25 13:35:37,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:37,187 INFO L225 Difference]: With dead ends: 80 [2018-07-25 13:35:37,187 INFO L226 Difference]: Without dead ends: 78 [2018-07-25 13:35:37,188 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-07-25 13:35:37,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-07-25 13:35:37,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-07-25 13:35:37,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-07-25 13:35:37,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-07-25 13:35:37,193 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2018-07-25 13:35:37,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:37,193 INFO L472 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-07-25 13:35:37,193 INFO L473 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-07-25 13:35:37,194 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-07-25 13:35:37,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-07-25 13:35:37,194 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:37,194 INFO L354 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2018-07-25 13:35:37,194 INFO L415 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:37,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1010334432, now seen corresponding path program 74 times [2018-07-25 13:35:37,195 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:37,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:37,657 INFO L134 CoverageAnalysis]: Checked inductivity of 2775 backedges. 0 proven. 2775 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:37,658 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:37,658 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-07-25 13:35:37,658 INFO L451 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-07-25 13:35:37,659 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-07-25 13:35:37,659 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-07-25 13:35:37,660 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2018-07-25 13:35:37,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:37,711 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-07-25 13:35:37,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-07-25 13:35:37,711 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2018-07-25 13:35:37,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:37,712 INFO L225 Difference]: With dead ends: 81 [2018-07-25 13:35:37,712 INFO L226 Difference]: Without dead ends: 79 [2018-07-25 13:35:37,712 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-07-25 13:35:37,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-07-25 13:35:37,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-07-25 13:35:37,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-07-25 13:35:37,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-07-25 13:35:37,720 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2018-07-25 13:35:37,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:37,720 INFO L472 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-07-25 13:35:37,720 INFO L473 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-07-25 13:35:37,720 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-07-25 13:35:37,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-07-25 13:35:37,721 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:37,721 INFO L354 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2018-07-25 13:35:37,721 INFO L415 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:37,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1255600186, now seen corresponding path program 75 times [2018-07-25 13:35:37,722 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:37,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:38,325 INFO L134 CoverageAnalysis]: Checked inductivity of 2850 backedges. 0 proven. 2850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:38,325 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:38,325 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-07-25 13:35:38,326 INFO L451 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-07-25 13:35:38,327 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-07-25 13:35:38,327 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-07-25 13:35:38,327 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2018-07-25 13:35:38,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:38,431 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-07-25 13:35:38,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-07-25 13:35:38,431 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2018-07-25 13:35:38,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:38,432 INFO L225 Difference]: With dead ends: 82 [2018-07-25 13:35:38,432 INFO L226 Difference]: Without dead ends: 80 [2018-07-25 13:35:38,432 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-07-25 13:35:38,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-07-25 13:35:38,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-07-25 13:35:38,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-07-25 13:35:38,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-07-25 13:35:38,441 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2018-07-25 13:35:38,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:38,441 INFO L472 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-07-25 13:35:38,442 INFO L473 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-07-25 13:35:38,442 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-07-25 13:35:38,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-07-25 13:35:38,442 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:38,442 INFO L354 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2018-07-25 13:35:38,443 INFO L415 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:38,443 INFO L82 PathProgramCache]: Analyzing trace with hash -268903968, now seen corresponding path program 76 times [2018-07-25 13:35:38,443 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:38,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:39,043 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:39,043 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:39,043 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-07-25 13:35:39,043 INFO L451 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-07-25 13:35:39,044 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-07-25 13:35:39,044 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-07-25 13:35:39,044 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2018-07-25 13:35:39,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:39,079 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-07-25 13:35:39,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-07-25 13:35:39,079 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2018-07-25 13:35:39,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:39,080 INFO L225 Difference]: With dead ends: 83 [2018-07-25 13:35:39,080 INFO L226 Difference]: Without dead ends: 81 [2018-07-25 13:35:39,080 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-07-25 13:35:39,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-07-25 13:35:39,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-07-25 13:35:39,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-07-25 13:35:39,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-07-25 13:35:39,088 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2018-07-25 13:35:39,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:39,089 INFO L472 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-07-25 13:35:39,089 INFO L473 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-07-25 13:35:39,089 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-07-25 13:35:39,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-07-25 13:35:39,089 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:39,089 INFO L354 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2018-07-25 13:35:39,090 INFO L415 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:39,090 INFO L82 PathProgramCache]: Analyzing trace with hash 253907718, now seen corresponding path program 77 times [2018-07-25 13:35:39,090 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:39,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:39,760 INFO L134 CoverageAnalysis]: Checked inductivity of 3003 backedges. 0 proven. 3003 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:39,761 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:39,761 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-07-25 13:35:39,761 INFO L451 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-07-25 13:35:39,762 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-07-25 13:35:39,762 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-07-25 13:35:39,763 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2018-07-25 13:35:39,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:39,828 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-07-25 13:35:39,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-07-25 13:35:39,829 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2018-07-25 13:35:39,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:39,830 INFO L225 Difference]: With dead ends: 84 [2018-07-25 13:35:39,830 INFO L226 Difference]: Without dead ends: 82 [2018-07-25 13:35:39,831 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-07-25 13:35:39,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-07-25 13:35:39,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-07-25 13:35:39,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-07-25 13:35:39,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-07-25 13:35:39,839 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2018-07-25 13:35:39,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:39,840 INFO L472 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-07-25 13:35:39,840 INFO L473 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-07-25 13:35:39,840 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-07-25 13:35:39,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-07-25 13:35:39,840 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:39,841 INFO L354 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2018-07-25 13:35:39,841 INFO L415 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:39,841 INFO L82 PathProgramCache]: Analyzing trace with hash -718799200, now seen corresponding path program 78 times [2018-07-25 13:35:39,843 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:39,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:40,669 INFO L134 CoverageAnalysis]: Checked inductivity of 3081 backedges. 0 proven. 3081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:40,669 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:40,669 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-07-25 13:35:40,670 INFO L451 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-07-25 13:35:40,671 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-07-25 13:35:40,671 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-07-25 13:35:40,671 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2018-07-25 13:35:40,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:40,787 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-07-25 13:35:40,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-07-25 13:35:40,788 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2018-07-25 13:35:40,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:40,789 INFO L225 Difference]: With dead ends: 85 [2018-07-25 13:35:40,789 INFO L226 Difference]: Without dead ends: 83 [2018-07-25 13:35:40,790 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-07-25 13:35:40,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-07-25 13:35:40,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-07-25 13:35:40,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-07-25 13:35:40,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-07-25 13:35:40,800 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2018-07-25 13:35:40,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:40,800 INFO L472 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-07-25 13:35:40,800 INFO L473 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-07-25 13:35:40,801 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-07-25 13:35:40,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-07-25 13:35:40,801 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:40,801 INFO L354 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2018-07-25 13:35:40,802 INFO L415 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:40,802 INFO L82 PathProgramCache]: Analyzing trace with hash -807942586, now seen corresponding path program 79 times [2018-07-25 13:35:40,802 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:40,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:41,380 INFO L134 CoverageAnalysis]: Checked inductivity of 3160 backedges. 0 proven. 3160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:41,381 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:41,381 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-07-25 13:35:41,381 INFO L451 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-07-25 13:35:41,382 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-07-25 13:35:41,383 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-07-25 13:35:41,383 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2018-07-25 13:35:41,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:41,476 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-07-25 13:35:41,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-07-25 13:35:41,476 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2018-07-25 13:35:41,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:41,477 INFO L225 Difference]: With dead ends: 86 [2018-07-25 13:35:41,477 INFO L226 Difference]: Without dead ends: 84 [2018-07-25 13:35:41,478 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-07-25 13:35:41,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-07-25 13:35:41,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-07-25 13:35:41,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-07-25 13:35:41,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-07-25 13:35:41,487 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2018-07-25 13:35:41,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:41,488 INFO L472 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-07-25 13:35:41,488 INFO L473 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-07-25 13:35:41,488 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-07-25 13:35:41,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-07-25 13:35:41,488 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:41,489 INFO L354 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2018-07-25 13:35:41,489 INFO L415 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:41,489 INFO L82 PathProgramCache]: Analyzing trace with hash 723579744, now seen corresponding path program 80 times [2018-07-25 13:35:41,489 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:41,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:42,034 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:42,034 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:42,034 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-07-25 13:35:42,034 INFO L451 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-07-25 13:35:42,035 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-07-25 13:35:42,035 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-07-25 13:35:42,035 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2018-07-25 13:35:42,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:42,081 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-07-25 13:35:42,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-07-25 13:35:42,082 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2018-07-25 13:35:42,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:42,082 INFO L225 Difference]: With dead ends: 87 [2018-07-25 13:35:42,083 INFO L226 Difference]: Without dead ends: 85 [2018-07-25 13:35:42,083 INFO L574 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-07-25 13:35:42,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-07-25 13:35:42,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-07-25 13:35:42,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-07-25 13:35:42,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-07-25 13:35:42,091 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2018-07-25 13:35:42,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:42,092 INFO L472 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-07-25 13:35:42,092 INFO L473 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-07-25 13:35:42,092 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-07-25 13:35:42,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-07-25 13:35:42,092 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:42,092 INFO L354 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2018-07-25 13:35:42,093 INFO L415 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:42,093 INFO L82 PathProgramCache]: Analyzing trace with hash 956131718, now seen corresponding path program 81 times [2018-07-25 13:35:42,093 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:42,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:42,826 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:42,826 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:42,826 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-07-25 13:35:42,827 INFO L451 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-07-25 13:35:42,828 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-07-25 13:35:42,829 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-07-25 13:35:42,829 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2018-07-25 13:35:42,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:42,933 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-07-25 13:35:42,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-07-25 13:35:42,933 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2018-07-25 13:35:42,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:42,934 INFO L225 Difference]: With dead ends: 88 [2018-07-25 13:35:42,934 INFO L226 Difference]: Without dead ends: 86 [2018-07-25 13:35:42,935 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-07-25 13:35:42,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-07-25 13:35:42,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-07-25 13:35:42,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-07-25 13:35:42,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-07-25 13:35:42,946 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2018-07-25 13:35:42,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:42,946 INFO L472 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-07-25 13:35:42,946 INFO L473 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-07-25 13:35:42,946 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-07-25 13:35:42,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-07-25 13:35:42,947 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:42,947 INFO L354 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2018-07-25 13:35:42,947 INFO L415 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:42,948 INFO L82 PathProgramCache]: Analyzing trace with hash -424691680, now seen corresponding path program 82 times [2018-07-25 13:35:42,948 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:43,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:43,754 INFO L134 CoverageAnalysis]: Checked inductivity of 3403 backedges. 0 proven. 3403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:43,754 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:43,754 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-07-25 13:35:43,755 INFO L451 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-07-25 13:35:43,756 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-07-25 13:35:43,756 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-07-25 13:35:43,756 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2018-07-25 13:35:43,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:43,874 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-07-25 13:35:43,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-07-25 13:35:43,874 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2018-07-25 13:35:43,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:43,875 INFO L225 Difference]: With dead ends: 89 [2018-07-25 13:35:43,875 INFO L226 Difference]: Without dead ends: 87 [2018-07-25 13:35:43,876 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-07-25 13:35:43,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-07-25 13:35:43,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-07-25 13:35:43,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-07-25 13:35:43,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-07-25 13:35:43,885 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2018-07-25 13:35:43,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:43,885 INFO L472 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-07-25 13:35:43,885 INFO L473 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-07-25 13:35:43,885 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-07-25 13:35:43,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-07-25 13:35:43,886 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:43,886 INFO L354 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2018-07-25 13:35:43,886 INFO L415 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:43,886 INFO L82 PathProgramCache]: Analyzing trace with hash -280544058, now seen corresponding path program 83 times [2018-07-25 13:35:43,886 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:43,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:44,406 INFO L134 CoverageAnalysis]: Checked inductivity of 3486 backedges. 0 proven. 3486 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:44,407 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:44,407 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-07-25 13:35:44,407 INFO L451 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-07-25 13:35:44,408 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-07-25 13:35:44,408 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-07-25 13:35:44,409 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2018-07-25 13:35:44,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:44,467 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-07-25 13:35:44,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-07-25 13:35:44,467 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2018-07-25 13:35:44,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:44,468 INFO L225 Difference]: With dead ends: 90 [2018-07-25 13:35:44,468 INFO L226 Difference]: Without dead ends: 88 [2018-07-25 13:35:44,469 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-07-25 13:35:44,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-07-25 13:35:44,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-07-25 13:35:44,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-07-25 13:35:44,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-07-25 13:35:44,477 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2018-07-25 13:35:44,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:44,477 INFO L472 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-07-25 13:35:44,477 INFO L473 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-07-25 13:35:44,478 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-07-25 13:35:44,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-07-25 13:35:44,478 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:44,478 INFO L354 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2018-07-25 13:35:44,478 INFO L415 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:44,479 INFO L82 PathProgramCache]: Analyzing trace with hash -106935072, now seen corresponding path program 84 times [2018-07-25 13:35:44,479 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:44,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:44,943 INFO L134 CoverageAnalysis]: Checked inductivity of 3570 backedges. 0 proven. 3570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:44,943 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:44,943 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-07-25 13:35:44,944 INFO L451 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-07-25 13:35:44,944 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-07-25 13:35:44,945 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-07-25 13:35:44,945 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2018-07-25 13:35:45,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:45,033 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-07-25 13:35:45,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-07-25 13:35:45,034 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2018-07-25 13:35:45,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:45,034 INFO L225 Difference]: With dead ends: 91 [2018-07-25 13:35:45,035 INFO L226 Difference]: Without dead ends: 89 [2018-07-25 13:35:45,035 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-07-25 13:35:45,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-07-25 13:35:45,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-07-25 13:35:45,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-07-25 13:35:45,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-07-25 13:35:45,044 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2018-07-25 13:35:45,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:45,044 INFO L472 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-07-25 13:35:45,044 INFO L473 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-07-25 13:35:45,044 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-07-25 13:35:45,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-07-25 13:35:45,045 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:45,045 INFO L354 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2018-07-25 13:35:45,045 INFO L415 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:45,045 INFO L82 PathProgramCache]: Analyzing trace with hash 979976198, now seen corresponding path program 85 times [2018-07-25 13:35:45,045 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:45,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:45,571 INFO L134 CoverageAnalysis]: Checked inductivity of 3655 backedges. 0 proven. 3655 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:45,572 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:45,572 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-07-25 13:35:45,572 INFO L451 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-07-25 13:35:45,573 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-07-25 13:35:45,573 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-07-25 13:35:45,574 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. [2018-07-25 13:35:45,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:45,621 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-07-25 13:35:45,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-07-25 13:35:45,622 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 88 [2018-07-25 13:35:45,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:45,623 INFO L225 Difference]: With dead ends: 92 [2018-07-25 13:35:45,623 INFO L226 Difference]: Without dead ends: 90 [2018-07-25 13:35:45,623 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-07-25 13:35:45,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-07-25 13:35:45,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-07-25 13:35:45,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-07-25 13:35:45,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-07-25 13:35:45,632 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 88 [2018-07-25 13:35:45,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:45,632 INFO L472 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-07-25 13:35:45,632 INFO L473 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-07-25 13:35:45,632 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-07-25 13:35:45,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-07-25 13:35:45,633 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:45,633 INFO L354 BasicCegarLoop]: trace histogram [86, 1, 1, 1] [2018-07-25 13:35:45,633 INFO L415 AbstractCegarLoop]: === Iteration 87 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:45,634 INFO L82 PathProgramCache]: Analyzing trace with hash 314487200, now seen corresponding path program 86 times [2018-07-25 13:35:45,634 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:45,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:46,171 INFO L134 CoverageAnalysis]: Checked inductivity of 3741 backedges. 0 proven. 3741 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:46,172 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:46,172 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-07-25 13:35:46,172 INFO L451 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-07-25 13:35:46,173 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-07-25 13:35:46,174 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-07-25 13:35:46,174 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 89 states. [2018-07-25 13:35:46,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:46,292 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-07-25 13:35:46,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-07-25 13:35:46,292 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 89 [2018-07-25 13:35:46,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:46,293 INFO L225 Difference]: With dead ends: 93 [2018-07-25 13:35:46,294 INFO L226 Difference]: Without dead ends: 91 [2018-07-25 13:35:46,294 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-07-25 13:35:46,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-07-25 13:35:46,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-07-25 13:35:46,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-07-25 13:35:46,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-07-25 13:35:46,303 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 89 [2018-07-25 13:35:46,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:46,303 INFO L472 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-07-25 13:35:46,304 INFO L473 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-07-25 13:35:46,304 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-07-25 13:35:46,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-07-25 13:35:46,304 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:46,304 INFO L354 BasicCegarLoop]: trace histogram [87, 1, 1, 1] [2018-07-25 13:35:46,304 INFO L415 AbstractCegarLoop]: === Iteration 88 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:46,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1159164742, now seen corresponding path program 87 times [2018-07-25 13:35:46,305 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:46,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:46,957 INFO L134 CoverageAnalysis]: Checked inductivity of 3828 backedges. 0 proven. 3828 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:46,957 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:46,958 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-07-25 13:35:46,958 INFO L451 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-07-25 13:35:46,959 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-07-25 13:35:46,959 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-07-25 13:35:46,959 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 90 states. [2018-07-25 13:35:47,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:47,006 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-07-25 13:35:47,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-07-25 13:35:47,006 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 90 [2018-07-25 13:35:47,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:47,007 INFO L225 Difference]: With dead ends: 94 [2018-07-25 13:35:47,007 INFO L226 Difference]: Without dead ends: 92 [2018-07-25 13:35:47,007 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-07-25 13:35:47,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-07-25 13:35:47,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-07-25 13:35:47,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-07-25 13:35:47,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-07-25 13:35:47,017 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 90 [2018-07-25 13:35:47,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:47,017 INFO L472 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-07-25 13:35:47,017 INFO L473 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-07-25 13:35:47,017 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-07-25 13:35:47,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-07-25 13:35:47,018 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:47,018 INFO L354 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2018-07-25 13:35:47,018 INFO L415 AbstractCegarLoop]: === Iteration 89 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:47,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1574364768, now seen corresponding path program 88 times [2018-07-25 13:35:47,019 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:47,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:47,518 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:47,519 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:47,519 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-07-25 13:35:47,519 INFO L451 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-07-25 13:35:47,520 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-07-25 13:35:47,521 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-07-25 13:35:47,521 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2018-07-25 13:35:47,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:47,637 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-07-25 13:35:47,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-07-25 13:35:47,638 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2018-07-25 13:35:47,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:47,639 INFO L225 Difference]: With dead ends: 95 [2018-07-25 13:35:47,639 INFO L226 Difference]: Without dead ends: 93 [2018-07-25 13:35:47,639 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-07-25 13:35:47,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-07-25 13:35:47,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-07-25 13:35:47,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-07-25 13:35:47,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-07-25 13:35:47,648 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 91 [2018-07-25 13:35:47,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:47,648 INFO L472 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-07-25 13:35:47,648 INFO L473 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-07-25 13:35:47,648 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-07-25 13:35:47,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-07-25 13:35:47,649 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:47,649 INFO L354 BasicCegarLoop]: trace histogram [89, 1, 1, 1] [2018-07-25 13:35:47,649 INFO L415 AbstractCegarLoop]: === Iteration 90 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:47,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1560663686, now seen corresponding path program 89 times [2018-07-25 13:35:47,650 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:47,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:48,191 INFO L134 CoverageAnalysis]: Checked inductivity of 4005 backedges. 0 proven. 4005 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:48,191 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:48,192 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-07-25 13:35:48,192 INFO L451 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-07-25 13:35:48,193 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-07-25 13:35:48,193 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-07-25 13:35:48,193 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 92 states. [2018-07-25 13:35:48,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:48,269 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-07-25 13:35:48,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-07-25 13:35:48,269 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 92 [2018-07-25 13:35:48,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:48,269 INFO L225 Difference]: With dead ends: 96 [2018-07-25 13:35:48,270 INFO L226 Difference]: Without dead ends: 94 [2018-07-25 13:35:48,270 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-07-25 13:35:48,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-07-25 13:35:48,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-07-25 13:35:48,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-07-25 13:35:48,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-07-25 13:35:48,279 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 92 [2018-07-25 13:35:48,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:48,280 INFO L472 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-07-25 13:35:48,280 INFO L473 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-07-25 13:35:48,280 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-07-25 13:35:48,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-07-25 13:35:48,281 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:48,281 INFO L354 BasicCegarLoop]: trace histogram [90, 1, 1, 1] [2018-07-25 13:35:48,281 INFO L415 AbstractCegarLoop]: === Iteration 91 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:48,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1135930144, now seen corresponding path program 90 times [2018-07-25 13:35:48,281 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:48,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:48,899 INFO L134 CoverageAnalysis]: Checked inductivity of 4095 backedges. 0 proven. 4095 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:48,900 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:48,900 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-07-25 13:35:48,900 INFO L451 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-07-25 13:35:48,901 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-07-25 13:35:48,901 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-07-25 13:35:48,901 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 93 states. [2018-07-25 13:35:48,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:48,950 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-07-25 13:35:48,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-07-25 13:35:48,950 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 93 [2018-07-25 13:35:48,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:48,950 INFO L225 Difference]: With dead ends: 97 [2018-07-25 13:35:48,951 INFO L226 Difference]: Without dead ends: 95 [2018-07-25 13:35:48,951 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-07-25 13:35:48,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-07-25 13:35:48,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-07-25 13:35:48,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-07-25 13:35:48,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-07-25 13:35:48,960 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 93 [2018-07-25 13:35:48,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:48,961 INFO L472 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-07-25 13:35:48,961 INFO L473 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-07-25 13:35:48,961 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-07-25 13:35:48,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-07-25 13:35:48,961 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:48,962 INFO L354 BasicCegarLoop]: trace histogram [91, 1, 1, 1] [2018-07-25 13:35:48,962 INFO L415 AbstractCegarLoop]: === Iteration 92 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:48,962 INFO L82 PathProgramCache]: Analyzing trace with hash 854092230, now seen corresponding path program 91 times [2018-07-25 13:35:48,962 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:49,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:49,596 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:49,597 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:49,597 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-07-25 13:35:49,597 INFO L451 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-07-25 13:35:49,598 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-07-25 13:35:49,598 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-07-25 13:35:49,598 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 94 states. [2018-07-25 13:35:49,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:49,657 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-07-25 13:35:49,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-07-25 13:35:49,657 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 94 [2018-07-25 13:35:49,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:49,658 INFO L225 Difference]: With dead ends: 98 [2018-07-25 13:35:49,658 INFO L226 Difference]: Without dead ends: 96 [2018-07-25 13:35:49,658 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-07-25 13:35:49,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-07-25 13:35:49,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2018-07-25 13:35:49,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-07-25 13:35:49,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-07-25 13:35:49,666 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 94 [2018-07-25 13:35:49,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:49,666 INFO L472 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-07-25 13:35:49,666 INFO L473 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-07-25 13:35:49,666 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-07-25 13:35:49,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-07-25 13:35:49,667 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:49,667 INFO L354 BasicCegarLoop]: trace histogram [92, 1, 1, 1] [2018-07-25 13:35:49,667 INFO L415 AbstractCegarLoop]: === Iteration 93 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:49,668 INFO L82 PathProgramCache]: Analyzing trace with hash 707051488, now seen corresponding path program 92 times [2018-07-25 13:35:49,668 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:49,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:50,271 INFO L134 CoverageAnalysis]: Checked inductivity of 4278 backedges. 0 proven. 4278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:50,271 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:50,271 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-07-25 13:35:50,271 INFO L451 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-07-25 13:35:50,272 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-07-25 13:35:50,272 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-07-25 13:35:50,273 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 95 states. [2018-07-25 13:35:50,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:50,360 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-07-25 13:35:50,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-07-25 13:35:50,360 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 95 [2018-07-25 13:35:50,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:50,361 INFO L225 Difference]: With dead ends: 99 [2018-07-25 13:35:50,361 INFO L226 Difference]: Without dead ends: 97 [2018-07-25 13:35:50,361 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-07-25 13:35:50,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-07-25 13:35:50,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-07-25 13:35:50,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-07-25 13:35:50,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-07-25 13:35:50,367 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 95 [2018-07-25 13:35:50,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:50,367 INFO L472 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-07-25 13:35:50,367 INFO L473 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-07-25 13:35:50,367 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-07-25 13:35:50,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-07-25 13:35:50,368 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:50,368 INFO L354 BasicCegarLoop]: trace histogram [93, 1, 1, 1] [2018-07-25 13:35:50,368 INFO L415 AbstractCegarLoop]: === Iteration 94 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:50,368 INFO L82 PathProgramCache]: Analyzing trace with hash 443755782, now seen corresponding path program 93 times [2018-07-25 13:35:50,368 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:50,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:50,927 INFO L134 CoverageAnalysis]: Checked inductivity of 4371 backedges. 0 proven. 4371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:50,927 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:50,927 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-07-25 13:35:50,927 INFO L451 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-07-25 13:35:50,928 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-07-25 13:35:50,928 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-07-25 13:35:50,929 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 96 states. [2018-07-25 13:35:51,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:51,035 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-07-25 13:35:51,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-07-25 13:35:51,035 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 96 [2018-07-25 13:35:51,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:51,036 INFO L225 Difference]: With dead ends: 100 [2018-07-25 13:35:51,036 INFO L226 Difference]: Without dead ends: 98 [2018-07-25 13:35:51,037 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-07-25 13:35:51,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-07-25 13:35:51,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2018-07-25 13:35:51,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-07-25 13:35:51,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-07-25 13:35:51,044 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 96 [2018-07-25 13:35:51,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:51,045 INFO L472 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-07-25 13:35:51,045 INFO L473 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-07-25 13:35:51,045 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-07-25 13:35:51,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-07-25 13:35:51,045 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:51,046 INFO L354 BasicCegarLoop]: trace histogram [94, 1, 1, 1] [2018-07-25 13:35:51,046 INFO L415 AbstractCegarLoop]: === Iteration 95 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:51,046 INFO L82 PathProgramCache]: Analyzing trace with hash 871523488, now seen corresponding path program 94 times [2018-07-25 13:35:51,046 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:51,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:51,645 INFO L134 CoverageAnalysis]: Checked inductivity of 4465 backedges. 0 proven. 4465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:51,645 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:51,645 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-07-25 13:35:51,646 INFO L451 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-07-25 13:35:51,647 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-07-25 13:35:51,647 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-07-25 13:35:51,647 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 97 states. [2018-07-25 13:35:51,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:51,714 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-07-25 13:35:51,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-07-25 13:35:51,714 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 97 [2018-07-25 13:35:51,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:51,715 INFO L225 Difference]: With dead ends: 101 [2018-07-25 13:35:51,715 INFO L226 Difference]: Without dead ends: 99 [2018-07-25 13:35:51,716 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-07-25 13:35:51,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-07-25 13:35:51,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-07-25 13:35:51,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-07-25 13:35:51,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-07-25 13:35:51,725 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 97 [2018-07-25 13:35:51,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:51,725 INFO L472 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-07-25 13:35:51,725 INFO L473 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-07-25 13:35:51,725 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-07-25 13:35:51,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-07-25 13:35:51,726 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:51,726 INFO L354 BasicCegarLoop]: trace histogram [95, 1, 1, 1] [2018-07-25 13:35:51,726 INFO L415 AbstractCegarLoop]: === Iteration 96 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:51,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1247420486, now seen corresponding path program 95 times [2018-07-25 13:35:51,726 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:51,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:52,644 INFO L134 CoverageAnalysis]: Checked inductivity of 4560 backedges. 0 proven. 4560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:52,645 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:52,645 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-07-25 13:35:52,645 INFO L451 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-07-25 13:35:52,646 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-07-25 13:35:52,646 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-07-25 13:35:52,647 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 98 states. [2018-07-25 13:35:52,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:52,699 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-07-25 13:35:52,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-07-25 13:35:52,699 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 98 [2018-07-25 13:35:52,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:52,700 INFO L225 Difference]: With dead ends: 102 [2018-07-25 13:35:52,700 INFO L226 Difference]: Without dead ends: 100 [2018-07-25 13:35:52,700 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-07-25 13:35:52,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-07-25 13:35:52,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2018-07-25 13:35:52,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-07-25 13:35:52,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-07-25 13:35:52,706 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 98 [2018-07-25 13:35:52,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:52,707 INFO L472 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-07-25 13:35:52,707 INFO L473 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-07-25 13:35:52,707 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-07-25 13:35:52,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-07-25 13:35:52,708 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:52,708 INFO L354 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2018-07-25 13:35:52,708 INFO L415 AbstractCegarLoop]: === Iteration 97 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:52,708 INFO L82 PathProgramCache]: Analyzing trace with hash 15325536, now seen corresponding path program 96 times [2018-07-25 13:35:52,708 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:52,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:53,286 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:53,286 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:53,286 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-07-25 13:35:53,287 INFO L451 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-07-25 13:35:53,287 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-07-25 13:35:53,288 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-07-25 13:35:53,288 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2018-07-25 13:35:53,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:53,349 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-07-25 13:35:53,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-07-25 13:35:53,350 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2018-07-25 13:35:53,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:53,350 INFO L225 Difference]: With dead ends: 103 [2018-07-25 13:35:53,350 INFO L226 Difference]: Without dead ends: 101 [2018-07-25 13:35:53,351 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-07-25 13:35:53,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-07-25 13:35:53,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-07-25 13:35:53,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-07-25 13:35:53,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-07-25 13:35:53,357 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 99 [2018-07-25 13:35:53,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:53,357 INFO L472 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-07-25 13:35:53,357 INFO L473 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-07-25 13:35:53,357 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-07-25 13:35:53,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-07-25 13:35:53,358 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:53,358 INFO L354 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2018-07-25 13:35:53,358 INFO L415 AbstractCegarLoop]: === Iteration 98 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:53,358 INFO L82 PathProgramCache]: Analyzing trace with hash 475087750, now seen corresponding path program 97 times [2018-07-25 13:35:53,358 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:53,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:54,281 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:54,282 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:54,282 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-07-25 13:35:54,282 INFO L451 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-07-25 13:35:54,283 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-07-25 13:35:54,284 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-07-25 13:35:54,284 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 100 states. [2018-07-25 13:35:54,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:54,345 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-07-25 13:35:54,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-07-25 13:35:54,345 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 100 [2018-07-25 13:35:54,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:54,346 INFO L225 Difference]: With dead ends: 104 [2018-07-25 13:35:54,346 INFO L226 Difference]: Without dead ends: 102 [2018-07-25 13:35:54,346 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-07-25 13:35:54,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-07-25 13:35:54,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2018-07-25 13:35:54,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-07-25 13:35:54,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-07-25 13:35:54,354 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 100 [2018-07-25 13:35:54,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:54,354 INFO L472 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-07-25 13:35:54,355 INFO L473 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-07-25 13:35:54,355 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-07-25 13:35:54,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-07-25 13:35:54,355 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:54,355 INFO L354 BasicCegarLoop]: trace histogram [98, 1, 1, 1] [2018-07-25 13:35:54,355 INFO L415 AbstractCegarLoop]: === Iteration 99 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:54,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1842814496, now seen corresponding path program 98 times [2018-07-25 13:35:54,356 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:54,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:54,962 INFO L134 CoverageAnalysis]: Checked inductivity of 4851 backedges. 0 proven. 4851 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:54,962 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:54,962 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-07-25 13:35:54,962 INFO L451 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-07-25 13:35:54,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-07-25 13:35:54,964 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-07-25 13:35:54,964 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 101 states. [2018-07-25 13:35:55,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:55,038 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-07-25 13:35:55,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-07-25 13:35:55,038 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 101 [2018-07-25 13:35:55,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:55,039 INFO L225 Difference]: With dead ends: 105 [2018-07-25 13:35:55,039 INFO L226 Difference]: Without dead ends: 103 [2018-07-25 13:35:55,040 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-07-25 13:35:55,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-07-25 13:35:55,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-07-25 13:35:55,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-07-25 13:35:55,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-07-25 13:35:55,050 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 101 [2018-07-25 13:35:55,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:55,050 INFO L472 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-07-25 13:35:55,050 INFO L473 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-07-25 13:35:55,050 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-07-25 13:35:55,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-07-25 13:35:55,051 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:55,051 INFO L354 BasicCegarLoop]: trace histogram [99, 1, 1, 1] [2018-07-25 13:35:55,051 INFO L415 AbstractCegarLoop]: === Iteration 100 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:55,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1292670662, now seen corresponding path program 99 times [2018-07-25 13:35:55,052 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:55,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:55,840 INFO L134 CoverageAnalysis]: Checked inductivity of 4950 backedges. 0 proven. 4950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:55,840 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:55,840 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-07-25 13:35:55,840 INFO L451 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-07-25 13:35:55,841 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-07-25 13:35:55,842 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-07-25 13:35:55,842 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 102 states. [2018-07-25 13:35:55,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:55,918 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-07-25 13:35:55,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-07-25 13:35:55,918 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 102 [2018-07-25 13:35:55,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:55,919 INFO L225 Difference]: With dead ends: 106 [2018-07-25 13:35:55,919 INFO L226 Difference]: Without dead ends: 104 [2018-07-25 13:35:55,919 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-07-25 13:35:55,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-07-25 13:35:55,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2018-07-25 13:35:55,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-07-25 13:35:55,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-07-25 13:35:55,926 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 102 [2018-07-25 13:35:55,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:55,926 INFO L472 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-07-25 13:35:55,926 INFO L473 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-07-25 13:35:55,926 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-07-25 13:35:55,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-07-25 13:35:55,927 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:55,927 INFO L354 BasicCegarLoop]: trace histogram [100, 1, 1, 1] [2018-07-25 13:35:55,927 INFO L415 AbstractCegarLoop]: === Iteration 101 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:55,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1418080992, now seen corresponding path program 100 times [2018-07-25 13:35:55,927 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:56,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:56,599 INFO L134 CoverageAnalysis]: Checked inductivity of 5050 backedges. 0 proven. 5050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:56,599 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:56,599 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-07-25 13:35:56,599 INFO L451 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-07-25 13:35:56,600 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-07-25 13:35:56,601 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-07-25 13:35:56,601 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 103 states. [2018-07-25 13:35:56,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:56,684 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-07-25 13:35:56,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-07-25 13:35:56,684 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 103 [2018-07-25 13:35:56,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:56,685 INFO L225 Difference]: With dead ends: 107 [2018-07-25 13:35:56,685 INFO L226 Difference]: Without dead ends: 105 [2018-07-25 13:35:56,686 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-07-25 13:35:56,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-07-25 13:35:56,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-07-25 13:35:56,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-07-25 13:35:56,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-07-25 13:35:56,694 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 103 [2018-07-25 13:35:56,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:56,695 INFO L472 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-07-25 13:35:56,695 INFO L473 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-07-25 13:35:56,695 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-07-25 13:35:56,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-07-25 13:35:56,695 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:56,696 INFO L354 BasicCegarLoop]: trace histogram [101, 1, 1, 1] [2018-07-25 13:35:56,696 INFO L415 AbstractCegarLoop]: === Iteration 102 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:56,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1010833926, now seen corresponding path program 101 times [2018-07-25 13:35:56,696 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:56,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:57,365 INFO L134 CoverageAnalysis]: Checked inductivity of 5151 backedges. 0 proven. 5151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:57,366 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:57,366 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-07-25 13:35:57,366 INFO L451 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-07-25 13:35:57,367 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-07-25 13:35:57,368 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-07-25 13:35:57,368 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 104 states. [2018-07-25 13:35:57,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:57,455 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-07-25 13:35:57,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-07-25 13:35:57,455 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 104 [2018-07-25 13:35:57,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:57,456 INFO L225 Difference]: With dead ends: 108 [2018-07-25 13:35:57,456 INFO L226 Difference]: Without dead ends: 106 [2018-07-25 13:35:57,457 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-07-25 13:35:57,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-07-25 13:35:57,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-07-25 13:35:57,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-07-25 13:35:57,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-07-25 13:35:57,466 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 104 [2018-07-25 13:35:57,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:57,466 INFO L472 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-07-25 13:35:57,466 INFO L473 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-07-25 13:35:57,466 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-07-25 13:35:57,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-07-25 13:35:57,466 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:57,467 INFO L354 BasicCegarLoop]: trace histogram [102, 1, 1, 1] [2018-07-25 13:35:57,467 INFO L415 AbstractCegarLoop]: === Iteration 103 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:57,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1271076768, now seen corresponding path program 102 times [2018-07-25 13:35:57,467 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:57,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:58,154 INFO L134 CoverageAnalysis]: Checked inductivity of 5253 backedges. 0 proven. 5253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:58,155 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:58,155 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2018-07-25 13:35:58,155 INFO L451 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-07-25 13:35:58,156 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-07-25 13:35:58,156 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2018-07-25 13:35:58,156 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 105 states. [2018-07-25 13:35:58,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:58,284 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-07-25 13:35:58,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-07-25 13:35:58,284 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 105 [2018-07-25 13:35:58,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:58,285 INFO L225 Difference]: With dead ends: 109 [2018-07-25 13:35:58,285 INFO L226 Difference]: Without dead ends: 107 [2018-07-25 13:35:58,286 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2018-07-25 13:35:58,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-07-25 13:35:58,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-07-25 13:35:58,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-07-25 13:35:58,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-07-25 13:35:58,296 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 105 [2018-07-25 13:35:58,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:58,296 INFO L472 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-07-25 13:35:58,297 INFO L473 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-07-25 13:35:58,297 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-07-25 13:35:58,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-07-25 13:35:58,297 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:58,297 INFO L354 BasicCegarLoop]: trace histogram [103, 1, 1, 1] [2018-07-25 13:35:58,298 INFO L415 AbstractCegarLoop]: === Iteration 104 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:58,298 INFO L82 PathProgramCache]: Analyzing trace with hash 748670278, now seen corresponding path program 103 times [2018-07-25 13:35:58,298 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:58,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:59,463 INFO L134 CoverageAnalysis]: Checked inductivity of 5356 backedges. 0 proven. 5356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:35:59,464 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:59,464 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-07-25 13:35:59,464 INFO L451 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-07-25 13:35:59,465 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-07-25 13:35:59,465 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-07-25 13:35:59,465 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 106 states. [2018-07-25 13:35:59,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:59,575 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2018-07-25 13:35:59,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-07-25 13:35:59,575 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 106 [2018-07-25 13:35:59,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:59,575 INFO L225 Difference]: With dead ends: 110 [2018-07-25 13:35:59,575 INFO L226 Difference]: Without dead ends: 108 [2018-07-25 13:35:59,576 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-07-25 13:35:59,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-07-25 13:35:59,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-07-25 13:35:59,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-07-25 13:35:59,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-07-25 13:35:59,586 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 106 [2018-07-25 13:35:59,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:59,586 INFO L472 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-07-25 13:35:59,586 INFO L473 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-07-25 13:35:59,587 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-07-25 13:35:59,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-07-25 13:35:59,587 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:59,587 INFO L354 BasicCegarLoop]: trace histogram [104, 1, 1, 1] [2018-07-25 13:35:59,587 INFO L415 AbstractCegarLoop]: === Iteration 105 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:59,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1733938272, now seen corresponding path program 104 times [2018-07-25 13:35:59,588 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:59,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:00,263 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:00,263 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:00,263 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2018-07-25 13:36:00,264 INFO L451 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-07-25 13:36:00,265 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-07-25 13:36:00,266 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2018-07-25 13:36:00,266 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 107 states. [2018-07-25 13:36:00,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:00,337 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-07-25 13:36:00,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-07-25 13:36:00,337 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 107 [2018-07-25 13:36:00,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:00,338 INFO L225 Difference]: With dead ends: 111 [2018-07-25 13:36:00,338 INFO L226 Difference]: Without dead ends: 109 [2018-07-25 13:36:00,339 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2018-07-25 13:36:00,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-07-25 13:36:00,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-07-25 13:36:00,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-07-25 13:36:00,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-07-25 13:36:00,349 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 107 [2018-07-25 13:36:00,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:00,350 INFO L472 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-07-25 13:36:00,350 INFO L473 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-07-25 13:36:00,350 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-07-25 13:36:00,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-07-25 13:36:00,351 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:00,351 INFO L354 BasicCegarLoop]: trace histogram [105, 1, 1, 1] [2018-07-25 13:36:00,351 INFO L415 AbstractCegarLoop]: === Iteration 106 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:36:00,351 INFO L82 PathProgramCache]: Analyzing trace with hash -2082492282, now seen corresponding path program 105 times [2018-07-25 13:36:00,351 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:00,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:01,121 INFO L134 CoverageAnalysis]: Checked inductivity of 5565 backedges. 0 proven. 5565 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:01,121 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:01,121 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-07-25 13:36:01,122 INFO L451 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-07-25 13:36:01,122 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-07-25 13:36:01,123 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-07-25 13:36:01,123 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 108 states. [2018-07-25 13:36:01,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:01,197 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2018-07-25 13:36:01,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-07-25 13:36:01,197 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 108 [2018-07-25 13:36:01,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:01,198 INFO L225 Difference]: With dead ends: 112 [2018-07-25 13:36:01,198 INFO L226 Difference]: Without dead ends: 110 [2018-07-25 13:36:01,199 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-07-25 13:36:01,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-07-25 13:36:01,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-07-25 13:36:01,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-07-25 13:36:01,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-07-25 13:36:01,210 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 108 [2018-07-25 13:36:01,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:01,210 INFO L472 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-07-25 13:36:01,210 INFO L473 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-07-25 13:36:01,210 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-07-25 13:36:01,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-07-25 13:36:01,211 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:01,211 INFO L354 BasicCegarLoop]: trace histogram [106, 1, 1, 1] [2018-07-25 13:36:01,211 INFO L415 AbstractCegarLoop]: === Iteration 107 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:36:01,212 INFO L82 PathProgramCache]: Analyzing trace with hash -132755168, now seen corresponding path program 106 times [2018-07-25 13:36:01,212 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:01,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:02,287 INFO L134 CoverageAnalysis]: Checked inductivity of 5671 backedges. 0 proven. 5671 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:02,287 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:02,287 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2018-07-25 13:36:02,288 INFO L451 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-07-25 13:36:02,288 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-07-25 13:36:02,289 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2018-07-25 13:36:02,289 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 109 states. [2018-07-25 13:36:02,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:02,403 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-07-25 13:36:02,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-07-25 13:36:02,403 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 109 [2018-07-25 13:36:02,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:02,404 INFO L225 Difference]: With dead ends: 113 [2018-07-25 13:36:02,404 INFO L226 Difference]: Without dead ends: 111 [2018-07-25 13:36:02,405 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2018-07-25 13:36:02,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-07-25 13:36:02,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-07-25 13:36:02,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-07-25 13:36:02,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-07-25 13:36:02,413 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 109 [2018-07-25 13:36:02,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:02,413 INFO L472 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-07-25 13:36:02,413 INFO L473 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-07-25 13:36:02,413 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-07-25 13:36:02,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-07-25 13:36:02,414 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:02,414 INFO L354 BasicCegarLoop]: trace histogram [107, 1, 1, 1] [2018-07-25 13:36:02,414 INFO L415 AbstractCegarLoop]: === Iteration 108 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:36:02,414 INFO L82 PathProgramCache]: Analyzing trace with hash 179553222, now seen corresponding path program 107 times [2018-07-25 13:36:02,414 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:02,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:03,196 INFO L134 CoverageAnalysis]: Checked inductivity of 5778 backedges. 0 proven. 5778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:03,196 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:03,196 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-07-25 13:36:03,196 INFO L451 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-07-25 13:36:03,197 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-07-25 13:36:03,198 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-07-25 13:36:03,198 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 110 states. [2018-07-25 13:36:03,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:03,323 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-07-25 13:36:03,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-07-25 13:36:03,323 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 110 [2018-07-25 13:36:03,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:03,323 INFO L225 Difference]: With dead ends: 114 [2018-07-25 13:36:03,324 INFO L226 Difference]: Without dead ends: 112 [2018-07-25 13:36:03,324 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-07-25 13:36:03,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-07-25 13:36:03,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2018-07-25 13:36:03,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-07-25 13:36:03,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-07-25 13:36:03,334 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 110 [2018-07-25 13:36:03,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:03,334 INFO L472 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-07-25 13:36:03,334 INFO L473 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-07-25 13:36:03,334 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-07-25 13:36:03,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-07-25 13:36:03,335 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:03,335 INFO L354 BasicCegarLoop]: trace histogram [108, 1, 1, 1] [2018-07-25 13:36:03,335 INFO L415 AbstractCegarLoop]: === Iteration 109 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:36:03,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1271178720, now seen corresponding path program 108 times [2018-07-25 13:36:03,335 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:03,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:04,084 INFO L134 CoverageAnalysis]: Checked inductivity of 5886 backedges. 0 proven. 5886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:04,084 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:04,084 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2018-07-25 13:36:04,084 INFO L451 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-07-25 13:36:04,086 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-07-25 13:36:04,086 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2018-07-25 13:36:04,087 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 111 states. [2018-07-25 13:36:04,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:04,201 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-07-25 13:36:04,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-07-25 13:36:04,202 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 111 [2018-07-25 13:36:04,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:04,202 INFO L225 Difference]: With dead ends: 115 [2018-07-25 13:36:04,202 INFO L226 Difference]: Without dead ends: 113 [2018-07-25 13:36:04,203 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2018-07-25 13:36:04,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-07-25 13:36:04,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-07-25 13:36:04,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-07-25 13:36:04,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-07-25 13:36:04,214 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 111 [2018-07-25 13:36:04,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:04,214 INFO L472 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-07-25 13:36:04,214 INFO L473 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-07-25 13:36:04,214 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-07-25 13:36:04,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-07-25 13:36:04,215 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:04,215 INFO L354 BasicCegarLoop]: trace histogram [109, 1, 1, 1] [2018-07-25 13:36:04,215 INFO L415 AbstractCegarLoop]: === Iteration 110 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:36:04,215 INFO L82 PathProgramCache]: Analyzing trace with hash 751830790, now seen corresponding path program 109 times [2018-07-25 13:36:04,216 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:04,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:04,989 INFO L134 CoverageAnalysis]: Checked inductivity of 5995 backedges. 0 proven. 5995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:04,990 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:04,990 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-07-25 13:36:04,990 INFO L451 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-07-25 13:36:04,991 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-07-25 13:36:04,991 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-07-25 13:36:04,991 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 112 states. [2018-07-25 13:36:05,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:05,136 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2018-07-25 13:36:05,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-07-25 13:36:05,136 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 112 [2018-07-25 13:36:05,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:05,137 INFO L225 Difference]: With dead ends: 116 [2018-07-25 13:36:05,137 INFO L226 Difference]: Without dead ends: 114 [2018-07-25 13:36:05,138 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-07-25 13:36:05,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-07-25 13:36:05,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-07-25 13:36:05,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-07-25 13:36:05,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2018-07-25 13:36:05,144 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 112 [2018-07-25 13:36:05,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:05,144 INFO L472 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2018-07-25 13:36:05,144 INFO L473 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-07-25 13:36:05,144 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2018-07-25 13:36:05,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-07-25 13:36:05,145 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:05,145 INFO L354 BasicCegarLoop]: trace histogram [110, 1, 1, 1] [2018-07-25 13:36:05,145 INFO L415 AbstractCegarLoop]: === Iteration 111 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:36:05,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1831914144, now seen corresponding path program 110 times [2018-07-25 13:36:05,146 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:05,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:06,011 INFO L134 CoverageAnalysis]: Checked inductivity of 6105 backedges. 0 proven. 6105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:06,012 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:06,012 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2018-07-25 13:36:06,012 INFO L451 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-07-25 13:36:06,013 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-07-25 13:36:06,014 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2018-07-25 13:36:06,014 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 113 states. [2018-07-25 13:36:06,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:06,083 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-07-25 13:36:06,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-07-25 13:36:06,083 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 113 [2018-07-25 13:36:06,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:06,083 INFO L225 Difference]: With dead ends: 117 [2018-07-25 13:36:06,083 INFO L226 Difference]: Without dead ends: 115 [2018-07-25 13:36:06,084 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2018-07-25 13:36:06,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-07-25 13:36:06,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-07-25 13:36:06,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-07-25 13:36:06,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-07-25 13:36:06,090 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 113 [2018-07-25 13:36:06,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:06,090 INFO L472 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-07-25 13:36:06,090 INFO L473 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-07-25 13:36:06,091 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-07-25 13:36:06,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-07-25 13:36:06,091 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:06,091 INFO L354 BasicCegarLoop]: trace histogram [111, 1, 1, 1] [2018-07-25 13:36:06,091 INFO L415 AbstractCegarLoop]: === Iteration 112 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:36:06,091 INFO L82 PathProgramCache]: Analyzing trace with hash 954759750, now seen corresponding path program 111 times [2018-07-25 13:36:06,091 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:06,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:07,026 INFO L134 CoverageAnalysis]: Checked inductivity of 6216 backedges. 0 proven. 6216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:07,026 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:07,026 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-07-25 13:36:07,026 INFO L451 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-07-25 13:36:07,027 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-07-25 13:36:07,027 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-07-25 13:36:07,028 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 114 states. [2018-07-25 13:36:07,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:07,168 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2018-07-25 13:36:07,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-07-25 13:36:07,168 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 114 [2018-07-25 13:36:07,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:07,168 INFO L225 Difference]: With dead ends: 118 [2018-07-25 13:36:07,168 INFO L226 Difference]: Without dead ends: 116 [2018-07-25 13:36:07,169 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-07-25 13:36:07,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-07-25 13:36:07,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2018-07-25 13:36:07,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-07-25 13:36:07,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2018-07-25 13:36:07,175 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 114 [2018-07-25 13:36:07,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:07,175 INFO L472 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2018-07-25 13:36:07,175 INFO L473 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-07-25 13:36:07,175 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2018-07-25 13:36:07,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-07-25 13:36:07,176 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:07,176 INFO L354 BasicCegarLoop]: trace histogram [112, 1, 1, 1] [2018-07-25 13:36:07,176 INFO L415 AbstractCegarLoop]: === Iteration 113 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:36:07,176 INFO L82 PathProgramCache]: Analyzing trace with hash -467222688, now seen corresponding path program 112 times [2018-07-25 13:36:07,176 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:07,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:08,027 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:08,027 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:08,027 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2018-07-25 13:36:08,027 INFO L451 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-07-25 13:36:08,028 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-07-25 13:36:08,029 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2018-07-25 13:36:08,029 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 115 states. [2018-07-25 13:36:08,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:08,151 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-07-25 13:36:08,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-07-25 13:36:08,151 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 115 [2018-07-25 13:36:08,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:08,151 INFO L225 Difference]: With dead ends: 119 [2018-07-25 13:36:08,151 INFO L226 Difference]: Without dead ends: 117 [2018-07-25 13:36:08,152 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2018-07-25 13:36:08,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-07-25 13:36:08,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-07-25 13:36:08,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-07-25 13:36:08,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-07-25 13:36:08,159 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 115 [2018-07-25 13:36:08,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:08,159 INFO L472 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-07-25 13:36:08,159 INFO L473 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-07-25 13:36:08,159 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-07-25 13:36:08,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-07-25 13:36:08,159 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:08,160 INFO L354 BasicCegarLoop]: trace histogram [113, 1, 1, 1] [2018-07-25 13:36:08,160 INFO L415 AbstractCegarLoop]: === Iteration 114 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:36:08,160 INFO L82 PathProgramCache]: Analyzing trace with hash -1599005306, now seen corresponding path program 113 times [2018-07-25 13:36:08,160 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:08,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:08,996 INFO L134 CoverageAnalysis]: Checked inductivity of 6441 backedges. 0 proven. 6441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:08,996 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:08,996 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-07-25 13:36:08,996 INFO L451 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-07-25 13:36:08,997 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-07-25 13:36:08,998 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-07-25 13:36:08,998 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 116 states. [2018-07-25 13:36:09,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:09,099 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2018-07-25 13:36:09,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-07-25 13:36:09,099 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 116 [2018-07-25 13:36:09,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:09,100 INFO L225 Difference]: With dead ends: 120 [2018-07-25 13:36:09,100 INFO L226 Difference]: Without dead ends: 118 [2018-07-25 13:36:09,101 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-07-25 13:36:09,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-07-25 13:36:09,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-07-25 13:36:09,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-07-25 13:36:09,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2018-07-25 13:36:09,111 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 116 [2018-07-25 13:36:09,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:09,112 INFO L472 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2018-07-25 13:36:09,112 INFO L473 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-07-25 13:36:09,112 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2018-07-25 13:36:09,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-07-25 13:36:09,112 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:09,112 INFO L354 BasicCegarLoop]: trace histogram [114, 1, 1, 1] [2018-07-25 13:36:09,113 INFO L415 AbstractCegarLoop]: === Iteration 115 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:36:09,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1970439200, now seen corresponding path program 114 times [2018-07-25 13:36:09,113 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:09,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:10,044 INFO L134 CoverageAnalysis]: Checked inductivity of 6555 backedges. 0 proven. 6555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:10,044 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:10,044 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2018-07-25 13:36:10,044 INFO L451 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-07-25 13:36:10,045 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-07-25 13:36:10,046 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2018-07-25 13:36:10,046 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 117 states. [2018-07-25 13:36:10,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:10,172 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-07-25 13:36:10,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-07-25 13:36:10,172 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 117 [2018-07-25 13:36:10,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:10,173 INFO L225 Difference]: With dead ends: 121 [2018-07-25 13:36:10,173 INFO L226 Difference]: Without dead ends: 119 [2018-07-25 13:36:10,174 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2018-07-25 13:36:10,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-07-25 13:36:10,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-07-25 13:36:10,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-07-25 13:36:10,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2018-07-25 13:36:10,181 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 117 [2018-07-25 13:36:10,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:10,181 INFO L472 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2018-07-25 13:36:10,181 INFO L473 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-07-25 13:36:10,181 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2018-07-25 13:36:10,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-07-25 13:36:10,181 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:10,182 INFO L354 BasicCegarLoop]: trace histogram [115, 1, 1, 1] [2018-07-25 13:36:10,182 INFO L415 AbstractCegarLoop]: === Iteration 116 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:36:10,182 INFO L82 PathProgramCache]: Analyzing trace with hash 954069190, now seen corresponding path program 115 times [2018-07-25 13:36:10,182 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:10,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:11,024 INFO L134 CoverageAnalysis]: Checked inductivity of 6670 backedges. 0 proven. 6670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:11,024 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:11,024 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-07-25 13:36:11,024 INFO L451 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-07-25 13:36:11,025 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-07-25 13:36:11,026 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-07-25 13:36:11,026 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 118 states. [2018-07-25 13:36:11,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:11,147 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2018-07-25 13:36:11,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-07-25 13:36:11,147 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 118 [2018-07-25 13:36:11,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:11,148 INFO L225 Difference]: With dead ends: 122 [2018-07-25 13:36:11,148 INFO L226 Difference]: Without dead ends: 120 [2018-07-25 13:36:11,148 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-07-25 13:36:11,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-07-25 13:36:11,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-07-25 13:36:11,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-07-25 13:36:11,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2018-07-25 13:36:11,155 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 118 [2018-07-25 13:36:11,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:11,155 INFO L472 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2018-07-25 13:36:11,155 INFO L473 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-07-25 13:36:11,155 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2018-07-25 13:36:11,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-07-25 13:36:11,156 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:11,156 INFO L354 BasicCegarLoop]: trace histogram [116, 1, 1, 1] [2018-07-25 13:36:11,156 INFO L415 AbstractCegarLoop]: === Iteration 117 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:36:11,156 INFO L82 PathProgramCache]: Analyzing trace with hash -488630048, now seen corresponding path program 116 times [2018-07-25 13:36:11,156 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:11,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:12,010 INFO L134 CoverageAnalysis]: Checked inductivity of 6786 backedges. 0 proven. 6786 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:12,010 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:12,010 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2018-07-25 13:36:12,011 INFO L451 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-07-25 13:36:12,012 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-07-25 13:36:12,012 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2018-07-25 13:36:12,012 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 119 states. [2018-07-25 13:36:12,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:12,125 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-07-25 13:36:12,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-07-25 13:36:12,125 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 119 [2018-07-25 13:36:12,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:12,126 INFO L225 Difference]: With dead ends: 123 [2018-07-25 13:36:12,126 INFO L226 Difference]: Without dead ends: 121 [2018-07-25 13:36:12,127 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2018-07-25 13:36:12,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-07-25 13:36:12,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-07-25 13:36:12,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-07-25 13:36:12,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-07-25 13:36:12,133 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 119 [2018-07-25 13:36:12,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:12,133 INFO L472 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-07-25 13:36:12,133 INFO L473 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-07-25 13:36:12,133 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-07-25 13:36:12,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-07-25 13:36:12,134 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:12,134 INFO L354 BasicCegarLoop]: trace histogram [117, 1, 1, 1] [2018-07-25 13:36:12,134 INFO L415 AbstractCegarLoop]: === Iteration 118 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:36:12,135 INFO L82 PathProgramCache]: Analyzing trace with hash 2032333830, now seen corresponding path program 117 times [2018-07-25 13:36:12,135 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:12,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:13,184 INFO L134 CoverageAnalysis]: Checked inductivity of 6903 backedges. 0 proven. 6903 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:13,184 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:13,184 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-07-25 13:36:13,185 INFO L451 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-07-25 13:36:13,186 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-07-25 13:36:13,187 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-07-25 13:36:13,187 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 120 states. [2018-07-25 13:36:13,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:13,344 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2018-07-25 13:36:13,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-07-25 13:36:13,344 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 120 [2018-07-25 13:36:13,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:13,345 INFO L225 Difference]: With dead ends: 124 [2018-07-25 13:36:13,345 INFO L226 Difference]: Without dead ends: 122 [2018-07-25 13:36:13,346 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-07-25 13:36:13,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-07-25 13:36:13,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-07-25 13:36:13,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-07-25 13:36:13,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2018-07-25 13:36:13,355 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 120 [2018-07-25 13:36:13,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:13,356 INFO L472 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2018-07-25 13:36:13,356 INFO L473 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-07-25 13:36:13,356 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2018-07-25 13:36:13,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-07-25 13:36:13,356 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:13,357 INFO L354 BasicCegarLoop]: trace histogram [118, 1, 1, 1] [2018-07-25 13:36:13,357 INFO L415 AbstractCegarLoop]: === Iteration 119 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:36:13,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1422164576, now seen corresponding path program 118 times [2018-07-25 13:36:13,357 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:13,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:14,407 INFO L134 CoverageAnalysis]: Checked inductivity of 7021 backedges. 0 proven. 7021 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:14,407 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:14,407 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [120] total 120 [2018-07-25 13:36:14,407 INFO L451 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-07-25 13:36:14,408 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-07-25 13:36:14,408 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7260, Invalid=7260, Unknown=0, NotChecked=0, Total=14520 [2018-07-25 13:36:14,409 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 121 states. [2018-07-25 13:36:14,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:14,551 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2018-07-25 13:36:14,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-07-25 13:36:14,551 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 121 [2018-07-25 13:36:14,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:14,552 INFO L225 Difference]: With dead ends: 125 [2018-07-25 13:36:14,552 INFO L226 Difference]: Without dead ends: 123 [2018-07-25 13:36:14,552 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=7260, Invalid=7260, Unknown=0, NotChecked=0, Total=14520 [2018-07-25 13:36:14,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-07-25 13:36:14,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-07-25 13:36:14,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-07-25 13:36:14,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-07-25 13:36:14,558 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 121 [2018-07-25 13:36:14,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:14,558 INFO L472 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-07-25 13:36:14,558 INFO L473 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-07-25 13:36:14,558 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-07-25 13:36:14,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-07-25 13:36:14,559 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:14,559 INFO L354 BasicCegarLoop]: trace histogram [119, 1, 1, 1] [2018-07-25 13:36:14,559 INFO L415 AbstractCegarLoop]: === Iteration 120 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:36:14,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1137432762, now seen corresponding path program 119 times [2018-07-25 13:36:14,559 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:14,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:15,520 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:15,520 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:15,520 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-07-25 13:36:15,521 INFO L451 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-07-25 13:36:15,522 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-07-25 13:36:15,522 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-07-25 13:36:15,522 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 122 states. [2018-07-25 13:36:15,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:15,607 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2018-07-25 13:36:15,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-07-25 13:36:15,607 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 122 [2018-07-25 13:36:15,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:15,608 INFO L225 Difference]: With dead ends: 126 [2018-07-25 13:36:15,608 INFO L226 Difference]: Without dead ends: 124 [2018-07-25 13:36:15,609 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-07-25 13:36:15,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-07-25 13:36:15,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2018-07-25 13:36:15,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-07-25 13:36:15,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2018-07-25 13:36:15,615 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 122 [2018-07-25 13:36:15,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:15,615 INFO L472 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2018-07-25 13:36:15,615 INFO L473 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-07-25 13:36:15,615 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2018-07-25 13:36:15,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-07-25 13:36:15,616 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:15,616 INFO L354 BasicCegarLoop]: trace histogram [120, 1, 1, 1] [2018-07-25 13:36:15,616 INFO L415 AbstractCegarLoop]: === Iteration 121 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:36:15,617 INFO L82 PathProgramCache]: Analyzing trace with hash -900681120, now seen corresponding path program 120 times [2018-07-25 13:36:15,617 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:15,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:16,554 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:16,555 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:16,555 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [122] total 122 [2018-07-25 13:36:16,555 INFO L451 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-07-25 13:36:16,556 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-07-25 13:36:16,556 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7503, Invalid=7503, Unknown=0, NotChecked=0, Total=15006 [2018-07-25 13:36:16,556 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 123 states. [2018-07-25 13:36:16,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:16,704 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-07-25 13:36:16,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-07-25 13:36:16,704 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 123 [2018-07-25 13:36:16,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:16,704 INFO L225 Difference]: With dead ends: 127 [2018-07-25 13:36:16,704 INFO L226 Difference]: Without dead ends: 125 [2018-07-25 13:36:16,705 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=7503, Invalid=7503, Unknown=0, NotChecked=0, Total=15006 [2018-07-25 13:36:16,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-07-25 13:36:16,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-07-25 13:36:16,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-07-25 13:36:16,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-07-25 13:36:16,715 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 123 [2018-07-25 13:36:16,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:16,715 INFO L472 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-07-25 13:36:16,715 INFO L473 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-07-25 13:36:16,716 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-07-25 13:36:16,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-07-25 13:36:16,716 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:16,716 INFO L354 BasicCegarLoop]: trace histogram [121, 1, 1, 1] [2018-07-25 13:36:16,716 INFO L415 AbstractCegarLoop]: === Iteration 122 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:36:16,717 INFO L82 PathProgramCache]: Analyzing trace with hash 2143652486, now seen corresponding path program 121 times [2018-07-25 13:36:16,717 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:16,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:17,689 INFO L134 CoverageAnalysis]: Checked inductivity of 7381 backedges. 0 proven. 7381 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:17,689 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:17,689 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-07-25 13:36:17,689 INFO L451 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-07-25 13:36:17,690 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-07-25 13:36:17,691 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-07-25 13:36:17,691 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 124 states. [2018-07-25 13:36:17,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:17,777 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2018-07-25 13:36:17,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2018-07-25 13:36:17,777 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 124 [2018-07-25 13:36:17,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:17,778 INFO L225 Difference]: With dead ends: 128 [2018-07-25 13:36:17,778 INFO L226 Difference]: Without dead ends: 126 [2018-07-25 13:36:17,779 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-07-25 13:36:17,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-07-25 13:36:17,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-07-25 13:36:17,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-07-25 13:36:17,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2018-07-25 13:36:17,785 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 124 [2018-07-25 13:36:17,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:17,785 INFO L472 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2018-07-25 13:36:17,786 INFO L473 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-07-25 13:36:17,786 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2018-07-25 13:36:17,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-07-25 13:36:17,786 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:17,786 INFO L354 BasicCegarLoop]: trace histogram [122, 1, 1, 1] [2018-07-25 13:36:17,786 INFO L415 AbstractCegarLoop]: === Iteration 123 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:36:17,786 INFO L82 PathProgramCache]: Analyzing trace with hash 2028713760, now seen corresponding path program 122 times [2018-07-25 13:36:17,786 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:17,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:18,735 INFO L134 CoverageAnalysis]: Checked inductivity of 7503 backedges. 0 proven. 7503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:18,735 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:18,736 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [124] total 124 [2018-07-25 13:36:18,736 INFO L451 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-07-25 13:36:18,737 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-07-25 13:36:18,737 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7750, Invalid=7750, Unknown=0, NotChecked=0, Total=15500 [2018-07-25 13:36:18,737 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 125 states. [2018-07-25 13:36:18,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:18,918 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-07-25 13:36:18,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-07-25 13:36:18,918 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 125 [2018-07-25 13:36:18,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:18,919 INFO L225 Difference]: With dead ends: 129 [2018-07-25 13:36:18,919 INFO L226 Difference]: Without dead ends: 127 [2018-07-25 13:36:18,920 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=7750, Invalid=7750, Unknown=0, NotChecked=0, Total=15500 [2018-07-25 13:36:18,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-07-25 13:36:18,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-07-25 13:36:18,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-07-25 13:36:18,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2018-07-25 13:36:18,926 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 125 [2018-07-25 13:36:18,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:18,926 INFO L472 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2018-07-25 13:36:18,926 INFO L473 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-07-25 13:36:18,926 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2018-07-25 13:36:18,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-07-25 13:36:18,927 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:18,927 INFO L354 BasicCegarLoop]: trace histogram [123, 1, 1, 1] [2018-07-25 13:36:18,927 INFO L415 AbstractCegarLoop]: === Iteration 124 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:36:18,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1534386746, now seen corresponding path program 123 times [2018-07-25 13:36:18,927 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:19,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:19,879 INFO L134 CoverageAnalysis]: Checked inductivity of 7626 backedges. 0 proven. 7626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:19,879 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:19,879 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-07-25 13:36:19,879 INFO L451 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-07-25 13:36:19,880 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-07-25 13:36:19,881 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-07-25 13:36:19,881 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 126 states. [2018-07-25 13:36:19,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:19,987 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2018-07-25 13:36:19,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-07-25 13:36:19,988 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 126 [2018-07-25 13:36:19,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:19,988 INFO L225 Difference]: With dead ends: 130 [2018-07-25 13:36:19,988 INFO L226 Difference]: Without dead ends: 128 [2018-07-25 13:36:19,989 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-07-25 13:36:19,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-07-25 13:36:19,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2018-07-25 13:36:19,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-07-25 13:36:19,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2018-07-25 13:36:19,996 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 126 [2018-07-25 13:36:19,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:19,996 INFO L472 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2018-07-25 13:36:19,996 INFO L473 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-07-25 13:36:19,996 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2018-07-25 13:36:19,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-07-25 13:36:19,996 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:19,996 INFO L354 BasicCegarLoop]: trace histogram [124, 1, 1, 1] [2018-07-25 13:36:19,997 INFO L415 AbstractCegarLoop]: === Iteration 125 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:36:19,997 INFO L82 PathProgramCache]: Analyzing trace with hash -321352736, now seen corresponding path program 124 times [2018-07-25 13:36:19,997 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:20,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:20,991 INFO L134 CoverageAnalysis]: Checked inductivity of 7750 backedges. 0 proven. 7750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:20,991 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:20,991 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [126] total 126 [2018-07-25 13:36:20,991 INFO L451 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-07-25 13:36:20,992 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-07-25 13:36:20,993 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8001, Invalid=8001, Unknown=0, NotChecked=0, Total=16002 [2018-07-25 13:36:20,993 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 127 states. [2018-07-25 13:36:21,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:21,190 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-07-25 13:36:21,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-07-25 13:36:21,190 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 127 [2018-07-25 13:36:21,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:21,190 INFO L225 Difference]: With dead ends: 131 [2018-07-25 13:36:21,190 INFO L226 Difference]: Without dead ends: 129 [2018-07-25 13:36:21,191 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=8001, Invalid=8001, Unknown=0, NotChecked=0, Total=16002 [2018-07-25 13:36:21,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-07-25 13:36:21,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-07-25 13:36:21,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-07-25 13:36:21,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-07-25 13:36:21,198 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 127 [2018-07-25 13:36:21,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:21,198 INFO L472 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-07-25 13:36:21,198 INFO L473 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-07-25 13:36:21,198 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-07-25 13:36:21,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-07-25 13:36:21,199 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:21,199 INFO L354 BasicCegarLoop]: trace histogram [125, 1, 1, 1] [2018-07-25 13:36:21,199 INFO L415 AbstractCegarLoop]: === Iteration 126 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:36:21,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1372004090, now seen corresponding path program 125 times [2018-07-25 13:36:21,200 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:21,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:22,218 INFO L134 CoverageAnalysis]: Checked inductivity of 7875 backedges. 0 proven. 7875 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:22,218 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:22,219 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-07-25 13:36:22,219 INFO L451 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-07-25 13:36:22,220 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-07-25 13:36:22,221 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-07-25 13:36:22,221 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 128 states. [2018-07-25 13:36:22,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:22,311 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2018-07-25 13:36:22,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-07-25 13:36:22,311 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 128 [2018-07-25 13:36:22,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:22,312 INFO L225 Difference]: With dead ends: 132 [2018-07-25 13:36:22,312 INFO L226 Difference]: Without dead ends: 130 [2018-07-25 13:36:22,313 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-07-25 13:36:22,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-07-25 13:36:22,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2018-07-25 13:36:22,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-07-25 13:36:22,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2018-07-25 13:36:22,321 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 128 [2018-07-25 13:36:22,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:22,321 INFO L472 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2018-07-25 13:36:22,321 INFO L473 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-07-25 13:36:22,322 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2018-07-25 13:36:22,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-07-25 13:36:22,322 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:22,322 INFO L354 BasicCegarLoop]: trace histogram [126, 1, 1, 1] [2018-07-25 13:36:22,322 INFO L415 AbstractCegarLoop]: === Iteration 127 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:36:22,323 INFO L82 PathProgramCache]: Analyzing trace with hash 417542304, now seen corresponding path program 126 times [2018-07-25 13:36:22,323 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:22,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:23,383 INFO L134 CoverageAnalysis]: Checked inductivity of 8001 backedges. 0 proven. 8001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:23,384 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:23,384 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [128] total 128 [2018-07-25 13:36:23,384 INFO L451 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-07-25 13:36:23,385 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-07-25 13:36:23,386 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8256, Invalid=8256, Unknown=0, NotChecked=0, Total=16512 [2018-07-25 13:36:23,386 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 129 states. [2018-07-25 13:36:23,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:23,563 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2018-07-25 13:36:23,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-07-25 13:36:23,564 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 129 [2018-07-25 13:36:23,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:23,564 INFO L225 Difference]: With dead ends: 133 [2018-07-25 13:36:23,564 INFO L226 Difference]: Without dead ends: 131 [2018-07-25 13:36:23,565 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=8256, Invalid=8256, Unknown=0, NotChecked=0, Total=16512 [2018-07-25 13:36:23,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-07-25 13:36:23,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-07-25 13:36:23,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-07-25 13:36:23,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-07-25 13:36:23,572 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 129 [2018-07-25 13:36:23,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:23,572 INFO L472 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-07-25 13:36:23,572 INFO L473 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-07-25 13:36:23,572 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-07-25 13:36:23,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-07-25 13:36:23,572 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:23,573 INFO L354 BasicCegarLoop]: trace histogram [127, 1, 1, 1] [2018-07-25 13:36:23,573 INFO L415 AbstractCegarLoop]: === Iteration 128 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:36:23,573 INFO L82 PathProgramCache]: Analyzing trace with hash 58905670, now seen corresponding path program 127 times [2018-07-25 13:36:23,573 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:23,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:24,764 INFO L134 CoverageAnalysis]: Checked inductivity of 8128 backedges. 0 proven. 8128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:24,764 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:24,764 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-07-25 13:36:24,765 INFO L451 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-07-25 13:36:24,766 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-07-25 13:36:24,767 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-07-25 13:36:24,767 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 130 states. [2018-07-25 13:36:24,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:24,869 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2018-07-25 13:36:24,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-07-25 13:36:24,869 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 130 [2018-07-25 13:36:24,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:24,870 INFO L225 Difference]: With dead ends: 134 [2018-07-25 13:36:24,870 INFO L226 Difference]: Without dead ends: 132 [2018-07-25 13:36:24,871 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-07-25 13:36:24,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-07-25 13:36:24,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-07-25 13:36:24,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-07-25 13:36:24,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2018-07-25 13:36:24,880 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 130 [2018-07-25 13:36:24,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:24,880 INFO L472 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2018-07-25 13:36:24,880 INFO L473 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-07-25 13:36:24,880 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2018-07-25 13:36:24,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-07-25 13:36:24,881 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:24,881 INFO L354 BasicCegarLoop]: trace histogram [128, 1, 1, 1] [2018-07-25 13:36:24,881 INFO L415 AbstractCegarLoop]: === Iteration 129 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:36:24,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1826071904, now seen corresponding path program 128 times [2018-07-25 13:36:24,882 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:25,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:26,009 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:26,010 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:26,010 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [130] total 130 [2018-07-25 13:36:26,010 INFO L451 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-07-25 13:36:26,012 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-07-25 13:36:26,012 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8515, Invalid=8515, Unknown=0, NotChecked=0, Total=17030 [2018-07-25 13:36:26,012 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 131 states. [2018-07-25 13:36:26,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:26,199 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-07-25 13:36:26,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-07-25 13:36:26,199 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 131 [2018-07-25 13:36:26,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:26,199 INFO L225 Difference]: With dead ends: 135 [2018-07-25 13:36:26,200 INFO L226 Difference]: Without dead ends: 133 [2018-07-25 13:36:26,201 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=8515, Invalid=8515, Unknown=0, NotChecked=0, Total=17030 [2018-07-25 13:36:26,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-07-25 13:36:26,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-07-25 13:36:26,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-07-25 13:36:26,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-07-25 13:36:26,208 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 131 [2018-07-25 13:36:26,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:26,208 INFO L472 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-07-25 13:36:26,208 INFO L473 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-07-25 13:36:26,208 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-07-25 13:36:26,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-07-25 13:36:26,209 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:26,209 INFO L354 BasicCegarLoop]: trace histogram [129, 1, 1, 1] [2018-07-25 13:36:26,209 INFO L415 AbstractCegarLoop]: === Iteration 130 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:36:26,209 INFO L82 PathProgramCache]: Analyzing trace with hash 773650310, now seen corresponding path program 129 times [2018-07-25 13:36:26,209 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:26,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:27,243 INFO L134 CoverageAnalysis]: Checked inductivity of 8385 backedges. 0 proven. 8385 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:27,244 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:27,244 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-07-25 13:36:27,244 INFO L451 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-07-25 13:36:27,246 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-07-25 13:36:27,246 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-07-25 13:36:27,246 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 132 states. [2018-07-25 13:36:27,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:27,442 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2018-07-25 13:36:27,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-07-25 13:36:27,443 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 132 [2018-07-25 13:36:27,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:27,443 INFO L225 Difference]: With dead ends: 136 [2018-07-25 13:36:27,443 INFO L226 Difference]: Without dead ends: 134 [2018-07-25 13:36:27,444 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-07-25 13:36:27,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-07-25 13:36:27,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2018-07-25 13:36:27,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-07-25 13:36:27,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 134 transitions. [2018-07-25 13:36:27,451 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 134 transitions. Word has length 132 [2018-07-25 13:36:27,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:27,451 INFO L472 AbstractCegarLoop]: Abstraction has 134 states and 134 transitions. [2018-07-25 13:36:27,451 INFO L473 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-07-25 13:36:27,451 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2018-07-25 13:36:27,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-07-25 13:36:27,452 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:27,452 INFO L354 BasicCegarLoop]: trace histogram [130, 1, 1, 1] [2018-07-25 13:36:27,452 INFO L415 AbstractCegarLoop]: === Iteration 131 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:36:27,452 INFO L82 PathProgramCache]: Analyzing trace with hash -1786648032, now seen corresponding path program 130 times [2018-07-25 13:36:27,452 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:27,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:28,555 INFO L134 CoverageAnalysis]: Checked inductivity of 8515 backedges. 0 proven. 8515 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:28,555 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:28,555 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [132] total 132 [2018-07-25 13:36:28,555 INFO L451 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-07-25 13:36:28,556 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-07-25 13:36:28,557 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8778, Invalid=8778, Unknown=0, NotChecked=0, Total=17556 [2018-07-25 13:36:28,557 INFO L87 Difference]: Start difference. First operand 134 states and 134 transitions. Second operand 133 states. [2018-07-25 13:36:28,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:28,697 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2018-07-25 13:36:28,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-07-25 13:36:28,698 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 133 [2018-07-25 13:36:28,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:28,698 INFO L225 Difference]: With dead ends: 137 [2018-07-25 13:36:28,698 INFO L226 Difference]: Without dead ends: 135 [2018-07-25 13:36:28,699 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=8778, Invalid=8778, Unknown=0, NotChecked=0, Total=17556 [2018-07-25 13:36:28,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-07-25 13:36:28,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-07-25 13:36:28,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-07-25 13:36:28,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2018-07-25 13:36:28,706 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 133 [2018-07-25 13:36:28,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:28,706 INFO L472 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2018-07-25 13:36:28,706 INFO L473 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-07-25 13:36:28,707 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2018-07-25 13:36:28,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-07-25 13:36:28,707 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:28,707 INFO L354 BasicCegarLoop]: trace histogram [131, 1, 1, 1] [2018-07-25 13:36:28,707 INFO L415 AbstractCegarLoop]: === Iteration 132 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:36:28,707 INFO L82 PathProgramCache]: Analyzing trace with hash 448481990, now seen corresponding path program 131 times [2018-07-25 13:36:28,707 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:28,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:29,831 INFO L134 CoverageAnalysis]: Checked inductivity of 8646 backedges. 0 proven. 8646 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:29,832 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:29,832 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-07-25 13:36:29,832 INFO L451 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-07-25 13:36:29,833 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-07-25 13:36:29,834 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-07-25 13:36:29,834 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 134 states. [2018-07-25 13:36:30,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:30,053 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2018-07-25 13:36:30,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-07-25 13:36:30,053 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 134 [2018-07-25 13:36:30,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:30,054 INFO L225 Difference]: With dead ends: 138 [2018-07-25 13:36:30,054 INFO L226 Difference]: Without dead ends: 136 [2018-07-25 13:36:30,055 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-07-25 13:36:30,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-07-25 13:36:30,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-07-25 13:36:30,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-07-25 13:36:30,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2018-07-25 13:36:30,066 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 134 [2018-07-25 13:36:30,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:30,066 INFO L472 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2018-07-25 13:36:30,067 INFO L473 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-07-25 13:36:30,067 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2018-07-25 13:36:30,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-07-25 13:36:30,067 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:30,067 INFO L354 BasicCegarLoop]: trace histogram [132, 1, 1, 1] [2018-07-25 13:36:30,068 INFO L415 AbstractCegarLoop]: === Iteration 133 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:36:30,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1018035936, now seen corresponding path program 132 times [2018-07-25 13:36:30,068 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:30,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:31,159 INFO L134 CoverageAnalysis]: Checked inductivity of 8778 backedges. 0 proven. 8778 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:31,159 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:31,159 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [134] total 134 [2018-07-25 13:36:31,159 INFO L451 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-07-25 13:36:31,161 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-07-25 13:36:31,161 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9045, Invalid=9045, Unknown=0, NotChecked=0, Total=18090 [2018-07-25 13:36:31,162 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 135 states. [2018-07-25 13:36:31,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:31,351 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-07-25 13:36:31,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-07-25 13:36:31,351 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 135 [2018-07-25 13:36:31,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:31,352 INFO L225 Difference]: With dead ends: 139 [2018-07-25 13:36:31,352 INFO L226 Difference]: Without dead ends: 137 [2018-07-25 13:36:31,353 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=9045, Invalid=9045, Unknown=0, NotChecked=0, Total=18090 [2018-07-25 13:36:31,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-07-25 13:36:31,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-07-25 13:36:31,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-07-25 13:36:31,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-07-25 13:36:31,364 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 135 [2018-07-25 13:36:31,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:31,364 INFO L472 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-07-25 13:36:31,364 INFO L473 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-07-25 13:36:31,364 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-07-25 13:36:31,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-07-25 13:36:31,365 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:31,365 INFO L354 BasicCegarLoop]: trace histogram [133, 1, 1, 1] [2018-07-25 13:36:31,365 INFO L415 AbstractCegarLoop]: === Iteration 134 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:36:31,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1494339078, now seen corresponding path program 133 times [2018-07-25 13:36:31,366 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:31,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:32,502 INFO L134 CoverageAnalysis]: Checked inductivity of 8911 backedges. 0 proven. 8911 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:32,503 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:32,503 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-07-25 13:36:32,503 INFO L451 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-07-25 13:36:32,505 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-07-25 13:36:32,506 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-07-25 13:36:32,506 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 136 states. [2018-07-25 13:36:32,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:32,668 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2018-07-25 13:36:32,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2018-07-25 13:36:32,668 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 136 [2018-07-25 13:36:32,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:32,669 INFO L225 Difference]: With dead ends: 140 [2018-07-25 13:36:32,669 INFO L226 Difference]: Without dead ends: 138 [2018-07-25 13:36:32,670 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-07-25 13:36:32,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-07-25 13:36:32,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2018-07-25 13:36:32,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-07-25 13:36:32,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2018-07-25 13:36:32,681 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 136 [2018-07-25 13:36:32,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:32,681 INFO L472 AbstractCegarLoop]: Abstraction has 138 states and 138 transitions. [2018-07-25 13:36:32,681 INFO L473 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-07-25 13:36:32,681 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2018-07-25 13:36:32,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-07-25 13:36:32,682 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:32,682 INFO L354 BasicCegarLoop]: trace histogram [134, 1, 1, 1] [2018-07-25 13:36:32,682 INFO L415 AbstractCegarLoop]: === Iteration 135 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:36:32,683 INFO L82 PathProgramCache]: Analyzing trace with hash -920132704, now seen corresponding path program 134 times [2018-07-25 13:36:32,683 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:32,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:33,849 INFO L134 CoverageAnalysis]: Checked inductivity of 9045 backedges. 0 proven. 9045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:33,849 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:33,850 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [136] total 136 [2018-07-25 13:36:33,850 INFO L451 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-07-25 13:36:33,851 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-07-25 13:36:33,852 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9316, Invalid=9316, Unknown=0, NotChecked=0, Total=18632 [2018-07-25 13:36:33,852 INFO L87 Difference]: Start difference. First operand 138 states and 138 transitions. Second operand 137 states. [2018-07-25 13:36:34,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:34,084 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-07-25 13:36:34,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2018-07-25 13:36:34,084 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 137 [2018-07-25 13:36:34,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:34,085 INFO L225 Difference]: With dead ends: 141 [2018-07-25 13:36:34,085 INFO L226 Difference]: Without dead ends: 139 [2018-07-25 13:36:34,085 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=9316, Invalid=9316, Unknown=0, NotChecked=0, Total=18632 [2018-07-25 13:36:34,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-07-25 13:36:34,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-07-25 13:36:34,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-07-25 13:36:34,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2018-07-25 13:36:34,092 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 137 [2018-07-25 13:36:34,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:34,092 INFO L472 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2018-07-25 13:36:34,092 INFO L473 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-07-25 13:36:34,093 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2018-07-25 13:36:34,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-07-25 13:36:34,093 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:34,093 INFO L354 BasicCegarLoop]: trace histogram [135, 1, 1, 1] [2018-07-25 13:36:34,093 INFO L415 AbstractCegarLoop]: === Iteration 136 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:36:34,093 INFO L82 PathProgramCache]: Analyzing trace with hash 1540653382, now seen corresponding path program 135 times [2018-07-25 13:36:34,093 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:34,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:35,268 INFO L134 CoverageAnalysis]: Checked inductivity of 9180 backedges. 0 proven. 9180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:35,268 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:35,268 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2018-07-25 13:36:35,269 INFO L451 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-07-25 13:36:35,270 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-07-25 13:36:35,271 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-07-25 13:36:35,271 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 138 states. [2018-07-25 13:36:35,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:35,556 INFO L93 Difference]: Finished difference Result 142 states and 142 transitions. [2018-07-25 13:36:35,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-07-25 13:36:35,557 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 138 [2018-07-25 13:36:35,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:35,557 INFO L225 Difference]: With dead ends: 142 [2018-07-25 13:36:35,557 INFO L226 Difference]: Without dead ends: 140 [2018-07-25 13:36:35,558 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-07-25 13:36:35,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-07-25 13:36:35,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-07-25 13:36:35,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-07-25 13:36:35,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 140 transitions. [2018-07-25 13:36:35,566 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 140 transitions. Word has length 138 [2018-07-25 13:36:35,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:35,566 INFO L472 AbstractCegarLoop]: Abstraction has 140 states and 140 transitions. [2018-07-25 13:36:35,566 INFO L473 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-07-25 13:36:35,566 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 140 transitions. [2018-07-25 13:36:35,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-07-25 13:36:35,567 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:35,567 INFO L354 BasicCegarLoop]: trace histogram [136, 1, 1, 1] [2018-07-25 13:36:35,567 INFO L415 AbstractCegarLoop]: === Iteration 137 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:36:35,567 INFO L82 PathProgramCache]: Analyzing trace with hash 515610720, now seen corresponding path program 136 times [2018-07-25 13:36:35,567 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:35,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:36,820 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:36,820 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:36,820 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [138] total 138 [2018-07-25 13:36:36,821 INFO L451 AbstractCegarLoop]: Interpolant automaton has 139 states [2018-07-25 13:36:36,822 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2018-07-25 13:36:36,822 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9591, Invalid=9591, Unknown=0, NotChecked=0, Total=19182 [2018-07-25 13:36:36,822 INFO L87 Difference]: Start difference. First operand 140 states and 140 transitions. Second operand 139 states. [2018-07-25 13:36:36,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:36,936 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-07-25 13:36:36,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2018-07-25 13:36:36,937 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 139 [2018-07-25 13:36:36,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:36,937 INFO L225 Difference]: With dead ends: 143 [2018-07-25 13:36:36,937 INFO L226 Difference]: Without dead ends: 141 [2018-07-25 13:36:36,938 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=9591, Invalid=9591, Unknown=0, NotChecked=0, Total=19182 [2018-07-25 13:36:36,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-07-25 13:36:36,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-07-25 13:36:36,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-07-25 13:36:36,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-07-25 13:36:36,945 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 139 [2018-07-25 13:36:36,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:36,945 INFO L472 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-07-25 13:36:36,945 INFO L473 AbstractCegarLoop]: Interpolant automaton has 139 states. [2018-07-25 13:36:36,945 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-07-25 13:36:36,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-07-25 13:36:36,945 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:36,946 INFO L354 BasicCegarLoop]: trace histogram [137, 1, 1, 1] [2018-07-25 13:36:36,946 INFO L415 AbstractCegarLoop]: === Iteration 138 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:36:36,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1195940730, now seen corresponding path program 137 times [2018-07-25 13:36:36,946 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:37,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:38,133 INFO L134 CoverageAnalysis]: Checked inductivity of 9453 backedges. 0 proven. 9453 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:38,133 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:38,133 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2018-07-25 13:36:38,134 INFO L451 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-07-25 13:36:38,136 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-07-25 13:36:38,137 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-07-25 13:36:38,137 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 140 states. [2018-07-25 13:36:38,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:38,361 INFO L93 Difference]: Finished difference Result 144 states and 144 transitions. [2018-07-25 13:36:38,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2018-07-25 13:36:38,361 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 140 [2018-07-25 13:36:38,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:38,362 INFO L225 Difference]: With dead ends: 144 [2018-07-25 13:36:38,362 INFO L226 Difference]: Without dead ends: 142 [2018-07-25 13:36:38,363 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-07-25 13:36:38,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-07-25 13:36:38,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2018-07-25 13:36:38,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-07-25 13:36:38,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2018-07-25 13:36:38,370 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 140 [2018-07-25 13:36:38,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:38,370 INFO L472 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2018-07-25 13:36:38,370 INFO L473 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-07-25 13:36:38,371 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2018-07-25 13:36:38,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-07-25 13:36:38,371 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:38,371 INFO L354 BasicCegarLoop]: trace histogram [138, 1, 1, 1] [2018-07-25 13:36:38,371 INFO L415 AbstractCegarLoop]: === Iteration 139 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:36:38,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1580539168, now seen corresponding path program 138 times [2018-07-25 13:36:38,371 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:38,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:39,783 INFO L134 CoverageAnalysis]: Checked inductivity of 9591 backedges. 0 proven. 9591 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:39,783 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:39,784 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [140] total 140 [2018-07-25 13:36:39,784 INFO L451 AbstractCegarLoop]: Interpolant automaton has 141 states [2018-07-25 13:36:39,785 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2018-07-25 13:36:39,786 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9870, Invalid=9870, Unknown=0, NotChecked=0, Total=19740 [2018-07-25 13:36:39,786 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand 141 states. [2018-07-25 13:36:40,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:40,034 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2018-07-25 13:36:40,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-07-25 13:36:40,034 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 141 [2018-07-25 13:36:40,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:40,035 INFO L225 Difference]: With dead ends: 145 [2018-07-25 13:36:40,035 INFO L226 Difference]: Without dead ends: 143 [2018-07-25 13:36:40,036 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=9870, Invalid=9870, Unknown=0, NotChecked=0, Total=19740 [2018-07-25 13:36:40,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-07-25 13:36:40,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-07-25 13:36:40,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-07-25 13:36:40,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-07-25 13:36:40,044 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 141 [2018-07-25 13:36:40,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:40,044 INFO L472 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-07-25 13:36:40,044 INFO L473 AbstractCegarLoop]: Interpolant automaton has 141 states. [2018-07-25 13:36:40,044 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-07-25 13:36:40,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-07-25 13:36:40,045 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:40,045 INFO L354 BasicCegarLoop]: trace histogram [139, 1, 1, 1] [2018-07-25 13:36:40,045 INFO L415 AbstractCegarLoop]: === Iteration 140 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:36:40,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1752070086, now seen corresponding path program 139 times [2018-07-25 13:36:40,045 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:40,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:41,290 INFO L134 CoverageAnalysis]: Checked inductivity of 9730 backedges. 0 proven. 9730 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:41,290 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:41,290 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141] total 141 [2018-07-25 13:36:41,291 INFO L451 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-07-25 13:36:41,292 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-07-25 13:36:41,293 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-07-25 13:36:41,293 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 142 states. [2018-07-25 13:36:41,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:41,613 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2018-07-25 13:36:41,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2018-07-25 13:36:41,613 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 142 [2018-07-25 13:36:41,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:41,613 INFO L225 Difference]: With dead ends: 146 [2018-07-25 13:36:41,613 INFO L226 Difference]: Without dead ends: 144 [2018-07-25 13:36:41,614 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-07-25 13:36:41,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-07-25 13:36:41,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2018-07-25 13:36:41,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-07-25 13:36:41,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 144 transitions. [2018-07-25 13:36:41,626 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 144 transitions. Word has length 142 [2018-07-25 13:36:41,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:41,626 INFO L472 AbstractCegarLoop]: Abstraction has 144 states and 144 transitions. [2018-07-25 13:36:41,626 INFO L473 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-07-25 13:36:41,626 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 144 transitions. [2018-07-25 13:36:41,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-07-25 13:36:41,627 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:41,627 INFO L354 BasicCegarLoop]: trace histogram [140, 1, 1, 1] [2018-07-25 13:36:41,627 INFO L415 AbstractCegarLoop]: === Iteration 141 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:36:41,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1520406048, now seen corresponding path program 140 times [2018-07-25 13:36:41,627 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:41,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:42,840 INFO L134 CoverageAnalysis]: Checked inductivity of 9870 backedges. 0 proven. 9870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:42,840 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:42,840 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [142] total 142 [2018-07-25 13:36:42,840 INFO L451 AbstractCegarLoop]: Interpolant automaton has 143 states [2018-07-25 13:36:42,842 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2018-07-25 13:36:42,843 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10153, Invalid=10153, Unknown=0, NotChecked=0, Total=20306 [2018-07-25 13:36:42,843 INFO L87 Difference]: Start difference. First operand 144 states and 144 transitions. Second operand 143 states. [2018-07-25 13:36:43,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:43,090 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-07-25 13:36:43,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-07-25 13:36:43,090 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 143 [2018-07-25 13:36:43,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:43,091 INFO L225 Difference]: With dead ends: 147 [2018-07-25 13:36:43,091 INFO L226 Difference]: Without dead ends: 145 [2018-07-25 13:36:43,092 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=10153, Invalid=10153, Unknown=0, NotChecked=0, Total=20306 [2018-07-25 13:36:43,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-07-25 13:36:43,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-07-25 13:36:43,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-07-25 13:36:43,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-07-25 13:36:43,100 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 143 [2018-07-25 13:36:43,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:43,100 INFO L472 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-07-25 13:36:43,100 INFO L473 AbstractCegarLoop]: Interpolant automaton has 143 states. [2018-07-25 13:36:43,100 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-07-25 13:36:43,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-07-25 13:36:43,101 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:43,101 INFO L354 BasicCegarLoop]: trace histogram [141, 1, 1, 1] [2018-07-25 13:36:43,101 INFO L415 AbstractCegarLoop]: === Iteration 142 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:36:43,102 INFO L82 PathProgramCache]: Analyzing trace with hash 112048902, now seen corresponding path program 141 times [2018-07-25 13:36:43,102 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:43,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:44,515 INFO L134 CoverageAnalysis]: Checked inductivity of 10011 backedges. 0 proven. 10011 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:44,516 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:44,516 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143] total 143 [2018-07-25 13:36:44,516 INFO L451 AbstractCegarLoop]: Interpolant automaton has 144 states [2018-07-25 13:36:44,518 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2018-07-25 13:36:44,519 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-07-25 13:36:44,519 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 144 states. [2018-07-25 13:36:44,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:44,703 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2018-07-25 13:36:44,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-07-25 13:36:44,703 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 144 [2018-07-25 13:36:44,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:44,703 INFO L225 Difference]: With dead ends: 148 [2018-07-25 13:36:44,703 INFO L226 Difference]: Without dead ends: 146 [2018-07-25 13:36:44,704 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-07-25 13:36:44,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-07-25 13:36:44,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-07-25 13:36:44,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-07-25 13:36:44,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2018-07-25 13:36:44,712 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 144 [2018-07-25 13:36:44,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:44,712 INFO L472 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2018-07-25 13:36:44,712 INFO L473 AbstractCegarLoop]: Interpolant automaton has 144 states. [2018-07-25 13:36:44,712 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2018-07-25 13:36:44,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-07-25 13:36:44,713 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:44,713 INFO L354 BasicCegarLoop]: trace histogram [142, 1, 1, 1] [2018-07-25 13:36:44,713 INFO L415 AbstractCegarLoop]: === Iteration 143 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:36:44,713 INFO L82 PathProgramCache]: Analyzing trace with hash -821455200, now seen corresponding path program 142 times [2018-07-25 13:36:44,713 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:44,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:46,094 INFO L134 CoverageAnalysis]: Checked inductivity of 10153 backedges. 0 proven. 10153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:46,095 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:46,095 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [144] total 144 [2018-07-25 13:36:46,095 INFO L451 AbstractCegarLoop]: Interpolant automaton has 145 states [2018-07-25 13:36:46,097 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2018-07-25 13:36:46,098 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10440, Invalid=10440, Unknown=0, NotChecked=0, Total=20880 [2018-07-25 13:36:46,098 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 145 states. [2018-07-25 13:36:46,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:46,271 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2018-07-25 13:36:46,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2018-07-25 13:36:46,272 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 145 [2018-07-25 13:36:46,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:46,272 INFO L225 Difference]: With dead ends: 149 [2018-07-25 13:36:46,272 INFO L226 Difference]: Without dead ends: 147 [2018-07-25 13:36:46,274 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=10440, Invalid=10440, Unknown=0, NotChecked=0, Total=20880 [2018-07-25 13:36:46,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-07-25 13:36:46,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-07-25 13:36:46,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-07-25 13:36:46,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-07-25 13:36:46,282 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 145 [2018-07-25 13:36:46,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:46,282 INFO L472 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-07-25 13:36:46,282 INFO L473 AbstractCegarLoop]: Interpolant automaton has 145 states. [2018-07-25 13:36:46,282 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-07-25 13:36:46,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-07-25 13:36:46,282 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:46,282 INFO L354 BasicCegarLoop]: trace histogram [143, 1, 1, 1] [2018-07-25 13:36:46,283 INFO L415 AbstractCegarLoop]: === Iteration 144 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:36:46,283 INFO L82 PathProgramCache]: Analyzing trace with hash 304688710, now seen corresponding path program 143 times [2018-07-25 13:36:46,283 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:46,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:47,753 INFO L134 CoverageAnalysis]: Checked inductivity of 10296 backedges. 0 proven. 10296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:47,753 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:47,753 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145] total 145 [2018-07-25 13:36:47,753 INFO L451 AbstractCegarLoop]: Interpolant automaton has 146 states [2018-07-25 13:36:47,755 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2018-07-25 13:36:47,756 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-07-25 13:36:47,756 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 146 states. [2018-07-25 13:36:48,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:48,075 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2018-07-25 13:36:48,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-07-25 13:36:48,075 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 146 [2018-07-25 13:36:48,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:48,075 INFO L225 Difference]: With dead ends: 150 [2018-07-25 13:36:48,076 INFO L226 Difference]: Without dead ends: 148 [2018-07-25 13:36:48,077 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-07-25 13:36:48,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-07-25 13:36:48,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-07-25 13:36:48,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-07-25 13:36:48,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2018-07-25 13:36:48,085 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 146 [2018-07-25 13:36:48,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:48,085 INFO L472 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2018-07-25 13:36:48,085 INFO L473 AbstractCegarLoop]: Interpolant automaton has 146 states. [2018-07-25 13:36:48,085 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2018-07-25 13:36:48,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-07-25 13:36:48,085 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:48,086 INFO L354 BasicCegarLoop]: trace histogram [144, 1, 1, 1] [2018-07-25 13:36:48,086 INFO L415 AbstractCegarLoop]: === Iteration 145 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:36:48,086 INFO L82 PathProgramCache]: Analyzing trace with hash 855411552, now seen corresponding path program 144 times [2018-07-25 13:36:48,086 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:48,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:49,555 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:49,555 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:49,555 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [146] total 146 [2018-07-25 13:36:49,556 INFO L451 AbstractCegarLoop]: Interpolant automaton has 147 states [2018-07-25 13:36:49,557 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2018-07-25 13:36:49,558 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10731, Invalid=10731, Unknown=0, NotChecked=0, Total=21462 [2018-07-25 13:36:49,558 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 147 states. [2018-07-25 13:36:49,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:49,862 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-07-25 13:36:49,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-07-25 13:36:49,862 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 147 [2018-07-25 13:36:49,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:49,863 INFO L225 Difference]: With dead ends: 151 [2018-07-25 13:36:49,863 INFO L226 Difference]: Without dead ends: 149 [2018-07-25 13:36:49,863 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=10731, Invalid=10731, Unknown=0, NotChecked=0, Total=21462 [2018-07-25 13:36:49,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-07-25 13:36:49,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-07-25 13:36:49,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-07-25 13:36:49,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-07-25 13:36:49,871 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 147 [2018-07-25 13:36:49,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:49,871 INFO L472 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2018-07-25 13:36:49,871 INFO L473 AbstractCegarLoop]: Interpolant automaton has 147 states. [2018-07-25 13:36:49,871 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-07-25 13:36:49,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-07-25 13:36:49,871 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:49,871 INFO L354 BasicCegarLoop]: trace histogram [145, 1, 1, 1] [2018-07-25 13:36:49,872 INFO L415 AbstractCegarLoop]: === Iteration 146 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:36:49,872 INFO L82 PathProgramCache]: Analyzing trace with hash 747950470, now seen corresponding path program 145 times [2018-07-25 13:36:49,872 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:50,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:51,165 INFO L134 CoverageAnalysis]: Checked inductivity of 10585 backedges. 0 proven. 10585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:51,165 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:51,165 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147] total 147 [2018-07-25 13:36:51,165 INFO L451 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-07-25 13:36:51,167 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-07-25 13:36:51,168 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-07-25 13:36:51,168 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 148 states. [2018-07-25 13:36:51,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:51,487 INFO L93 Difference]: Finished difference Result 152 states and 152 transitions. [2018-07-25 13:36:51,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2018-07-25 13:36:51,487 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 148 [2018-07-25 13:36:51,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:51,488 INFO L225 Difference]: With dead ends: 152 [2018-07-25 13:36:51,488 INFO L226 Difference]: Without dead ends: 150 [2018-07-25 13:36:51,489 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-07-25 13:36:51,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-07-25 13:36:51,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2018-07-25 13:36:51,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-07-25 13:36:51,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 150 transitions. [2018-07-25 13:36:51,496 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 150 transitions. Word has length 148 [2018-07-25 13:36:51,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:51,496 INFO L472 AbstractCegarLoop]: Abstraction has 150 states and 150 transitions. [2018-07-25 13:36:51,496 INFO L473 AbstractCegarLoop]: Interpolant automaton has 148 states. [2018-07-25 13:36:51,497 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 150 transitions. [2018-07-25 13:36:51,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-07-25 13:36:51,497 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:51,497 INFO L354 BasicCegarLoop]: trace histogram [146, 1, 1, 1] [2018-07-25 13:36:51,497 INFO L415 AbstractCegarLoop]: === Iteration 147 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:36:51,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1711624224, now seen corresponding path program 146 times [2018-07-25 13:36:51,498 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:51,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:52,883 INFO L134 CoverageAnalysis]: Checked inductivity of 10731 backedges. 0 proven. 10731 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:52,884 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:52,884 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [148] total 148 [2018-07-25 13:36:52,884 INFO L451 AbstractCegarLoop]: Interpolant automaton has 149 states [2018-07-25 13:36:52,885 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2018-07-25 13:36:52,886 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11026, Invalid=11026, Unknown=0, NotChecked=0, Total=22052 [2018-07-25 13:36:52,886 INFO L87 Difference]: Start difference. First operand 150 states and 150 transitions. Second operand 149 states. [2018-07-25 13:36:53,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:53,197 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-07-25 13:36:53,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2018-07-25 13:36:53,197 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 149 [2018-07-25 13:36:53,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:53,197 INFO L225 Difference]: With dead ends: 153 [2018-07-25 13:36:53,197 INFO L226 Difference]: Without dead ends: 151 [2018-07-25 13:36:53,198 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=11026, Invalid=11026, Unknown=0, NotChecked=0, Total=22052 [2018-07-25 13:36:53,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-07-25 13:36:53,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-07-25 13:36:53,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-07-25 13:36:53,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-07-25 13:36:53,210 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 149 [2018-07-25 13:36:53,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:53,211 INFO L472 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-07-25 13:36:53,211 INFO L473 AbstractCegarLoop]: Interpolant automaton has 149 states. [2018-07-25 13:36:53,211 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-07-25 13:36:53,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-07-25 13:36:53,211 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:53,211 INFO L354 BasicCegarLoop]: trace histogram [147, 1, 1, 1] [2018-07-25 13:36:53,212 INFO L415 AbstractCegarLoop]: === Iteration 148 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:36:53,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1520739526, now seen corresponding path program 147 times [2018-07-25 13:36:53,212 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:53,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:54,540 INFO L134 CoverageAnalysis]: Checked inductivity of 10878 backedges. 0 proven. 10878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:54,540 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:54,540 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [149] total 149 [2018-07-25 13:36:54,540 INFO L451 AbstractCegarLoop]: Interpolant automaton has 150 states [2018-07-25 13:36:54,542 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2018-07-25 13:36:54,543 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-07-25 13:36:54,543 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 150 states. [2018-07-25 13:36:54,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:54,871 INFO L93 Difference]: Finished difference Result 154 states and 154 transitions. [2018-07-25 13:36:54,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-07-25 13:36:54,871 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 150 [2018-07-25 13:36:54,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:54,872 INFO L225 Difference]: With dead ends: 154 [2018-07-25 13:36:54,872 INFO L226 Difference]: Without dead ends: 152 [2018-07-25 13:36:54,873 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=11175, Invalid=11175, Unknown=0, NotChecked=0, Total=22350 [2018-07-25 13:36:54,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-07-25 13:36:54,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-07-25 13:36:54,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-07-25 13:36:54,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2018-07-25 13:36:54,880 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 150 [2018-07-25 13:36:54,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:54,880 INFO L472 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2018-07-25 13:36:54,880 INFO L473 AbstractCegarLoop]: Interpolant automaton has 150 states. [2018-07-25 13:36:54,881 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2018-07-25 13:36:54,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-07-25 13:36:54,881 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:54,881 INFO L354 BasicCegarLoop]: trace histogram [148, 1, 1, 1] [2018-07-25 13:36:54,881 INFO L415 AbstractCegarLoop]: === Iteration 149 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:36:54,882 INFO L82 PathProgramCache]: Analyzing trace with hash -101718816, now seen corresponding path program 148 times [2018-07-25 13:36:54,882 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:55,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:56,334 INFO L134 CoverageAnalysis]: Checked inductivity of 11026 backedges. 0 proven. 11026 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:56,335 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:56,335 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [150] total 150 [2018-07-25 13:36:56,335 INFO L451 AbstractCegarLoop]: Interpolant automaton has 151 states [2018-07-25 13:36:56,337 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 151 interpolants. [2018-07-25 13:36:56,337 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11325, Invalid=11325, Unknown=0, NotChecked=0, Total=22650 [2018-07-25 13:36:56,337 INFO L87 Difference]: Start difference. First operand 152 states and 152 transitions. Second operand 151 states. [2018-07-25 13:36:56,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:56,725 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-07-25 13:36:56,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2018-07-25 13:36:56,725 INFO L78 Accepts]: Start accepts. Automaton has 151 states. Word has length 151 [2018-07-25 13:36:56,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:56,725 INFO L225 Difference]: With dead ends: 155 [2018-07-25 13:36:56,726 INFO L226 Difference]: Without dead ends: 153 [2018-07-25 13:36:56,726 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=11325, Invalid=11325, Unknown=0, NotChecked=0, Total=22650 [2018-07-25 13:36:56,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-07-25 13:36:56,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-07-25 13:36:56,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-07-25 13:36:56,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-07-25 13:36:56,734 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 151 [2018-07-25 13:36:56,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:56,734 INFO L472 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-07-25 13:36:56,734 INFO L473 AbstractCegarLoop]: Interpolant automaton has 151 states. [2018-07-25 13:36:56,734 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-07-25 13:36:56,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-07-25 13:36:56,735 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:56,735 INFO L354 BasicCegarLoop]: trace histogram [149, 1, 1, 1] [2018-07-25 13:36:56,735 INFO L415 AbstractCegarLoop]: === Iteration 150 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:36:56,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1141680134, now seen corresponding path program 149 times [2018-07-25 13:36:56,735 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:56,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:58,171 INFO L134 CoverageAnalysis]: Checked inductivity of 11175 backedges. 0 proven. 11175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:58,171 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:58,171 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [151] total 151 [2018-07-25 13:36:58,171 INFO L451 AbstractCegarLoop]: Interpolant automaton has 152 states [2018-07-25 13:36:58,173 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2018-07-25 13:36:58,174 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-07-25 13:36:58,174 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 152 states. [2018-07-25 13:36:58,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:36:58,555 INFO L93 Difference]: Finished difference Result 156 states and 156 transitions. [2018-07-25 13:36:58,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-07-25 13:36:58,555 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 152 [2018-07-25 13:36:58,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:36:58,556 INFO L225 Difference]: With dead ends: 156 [2018-07-25 13:36:58,556 INFO L226 Difference]: Without dead ends: 154 [2018-07-25 13:36:58,557 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=11476, Invalid=11476, Unknown=0, NotChecked=0, Total=22952 [2018-07-25 13:36:58,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-07-25 13:36:58,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-07-25 13:36:58,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-07-25 13:36:58,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 154 transitions. [2018-07-25 13:36:58,564 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 154 transitions. Word has length 152 [2018-07-25 13:36:58,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:36:58,564 INFO L472 AbstractCegarLoop]: Abstraction has 154 states and 154 transitions. [2018-07-25 13:36:58,564 INFO L473 AbstractCegarLoop]: Interpolant automaton has 152 states. [2018-07-25 13:36:58,565 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 154 transitions. [2018-07-25 13:36:58,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-07-25 13:36:58,565 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:36:58,565 INFO L354 BasicCegarLoop]: trace histogram [150, 1, 1, 1] [2018-07-25 13:36:58,565 INFO L415 AbstractCegarLoop]: === Iteration 151 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:36:58,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1032341920, now seen corresponding path program 150 times [2018-07-25 13:36:58,566 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:36:58,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:36:59,978 INFO L134 CoverageAnalysis]: Checked inductivity of 11325 backedges. 0 proven. 11325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:36:59,978 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:36:59,978 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [152] total 152 [2018-07-25 13:36:59,978 INFO L451 AbstractCegarLoop]: Interpolant automaton has 153 states [2018-07-25 13:36:59,980 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 153 interpolants. [2018-07-25 13:36:59,981 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11628, Invalid=11628, Unknown=0, NotChecked=0, Total=23256 [2018-07-25 13:36:59,981 INFO L87 Difference]: Start difference. First operand 154 states and 154 transitions. Second operand 153 states. [2018-07-25 13:37:00,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:37:00,338 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2018-07-25 13:37:00,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2018-07-25 13:37:00,338 INFO L78 Accepts]: Start accepts. Automaton has 153 states. Word has length 153 [2018-07-25 13:37:00,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:37:00,339 INFO L225 Difference]: With dead ends: 157 [2018-07-25 13:37:00,339 INFO L226 Difference]: Without dead ends: 155 [2018-07-25 13:37:00,340 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=11628, Invalid=11628, Unknown=0, NotChecked=0, Total=23256 [2018-07-25 13:37:00,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-07-25 13:37:00,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-07-25 13:37:00,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-07-25 13:37:00,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2018-07-25 13:37:00,347 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 153 [2018-07-25 13:37:00,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:37:00,347 INFO L472 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2018-07-25 13:37:00,348 INFO L473 AbstractCegarLoop]: Interpolant automaton has 153 states. [2018-07-25 13:37:00,348 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2018-07-25 13:37:00,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-07-25 13:37:00,348 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:37:00,348 INFO L354 BasicCegarLoop]: trace histogram [151, 1, 1, 1] [2018-07-25 13:37:00,348 INFO L415 AbstractCegarLoop]: === Iteration 152 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:37:00,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1937824582, now seen corresponding path program 151 times [2018-07-25 13:37:00,348 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:37:00,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:37:01,833 INFO L134 CoverageAnalysis]: Checked inductivity of 11476 backedges. 0 proven. 11476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:37:01,833 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:37:01,833 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [153] total 153 [2018-07-25 13:37:01,833 INFO L451 AbstractCegarLoop]: Interpolant automaton has 154 states [2018-07-25 13:37:01,835 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2018-07-25 13:37:01,836 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-07-25 13:37:01,836 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 154 states. [2018-07-25 13:37:02,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:37:02,214 INFO L93 Difference]: Finished difference Result 158 states and 158 transitions. [2018-07-25 13:37:02,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2018-07-25 13:37:02,214 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 154 [2018-07-25 13:37:02,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:37:02,215 INFO L225 Difference]: With dead ends: 158 [2018-07-25 13:37:02,215 INFO L226 Difference]: Without dead ends: 156 [2018-07-25 13:37:02,216 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=11781, Invalid=11781, Unknown=0, NotChecked=0, Total=23562 [2018-07-25 13:37:02,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-07-25 13:37:02,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-07-25 13:37:02,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-07-25 13:37:02,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2018-07-25 13:37:02,224 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 154 [2018-07-25 13:37:02,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:37:02,224 INFO L472 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2018-07-25 13:37:02,224 INFO L473 AbstractCegarLoop]: Interpolant automaton has 154 states. [2018-07-25 13:37:02,224 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2018-07-25 13:37:02,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-07-25 13:37:02,224 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:37:02,224 INFO L354 BasicCegarLoop]: trace histogram [152, 1, 1, 1] [2018-07-25 13:37:02,224 INFO L415 AbstractCegarLoop]: === Iteration 153 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:37:02,225 INFO L82 PathProgramCache]: Analyzing trace with hash -56983968, now seen corresponding path program 152 times [2018-07-25 13:37:02,225 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:37:02,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:37:03,664 INFO L134 CoverageAnalysis]: Checked inductivity of 11628 backedges. 0 proven. 11628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:37:03,665 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:37:03,665 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [154] total 154 [2018-07-25 13:37:03,665 INFO L451 AbstractCegarLoop]: Interpolant automaton has 155 states [2018-07-25 13:37:03,667 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2018-07-25 13:37:03,668 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11935, Invalid=11935, Unknown=0, NotChecked=0, Total=23870 [2018-07-25 13:37:03,668 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 155 states. [2018-07-25 13:37:04,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:37:04,049 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-07-25 13:37:04,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2018-07-25 13:37:04,049 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 155 [2018-07-25 13:37:04,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:37:04,050 INFO L225 Difference]: With dead ends: 159 [2018-07-25 13:37:04,050 INFO L226 Difference]: Without dead ends: 157 [2018-07-25 13:37:04,051 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=11935, Invalid=11935, Unknown=0, NotChecked=0, Total=23870 [2018-07-25 13:37:04,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-07-25 13:37:04,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-07-25 13:37:04,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-07-25 13:37:04,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-07-25 13:37:04,063 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 155 [2018-07-25 13:37:04,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:37:04,063 INFO L472 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-07-25 13:37:04,063 INFO L473 AbstractCegarLoop]: Interpolant automaton has 155 states. [2018-07-25 13:37:04,063 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-07-25 13:37:04,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-07-25 13:37:04,064 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:37:04,064 INFO L354 BasicCegarLoop]: trace histogram [153, 1, 1, 1] [2018-07-25 13:37:04,064 INFO L415 AbstractCegarLoop]: === Iteration 154 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:37:04,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1766506874, now seen corresponding path program 153 times [2018-07-25 13:37:04,065 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:37:04,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:37:05,566 INFO L134 CoverageAnalysis]: Checked inductivity of 11781 backedges. 0 proven. 11781 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:37:05,567 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:37:05,567 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [155] total 155 [2018-07-25 13:37:05,567 INFO L451 AbstractCegarLoop]: Interpolant automaton has 156 states [2018-07-25 13:37:05,569 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2018-07-25 13:37:05,569 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-07-25 13:37:05,569 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 156 states. [2018-07-25 13:37:05,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:37:05,956 INFO L93 Difference]: Finished difference Result 160 states and 160 transitions. [2018-07-25 13:37:05,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2018-07-25 13:37:05,956 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 156 [2018-07-25 13:37:05,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:37:05,956 INFO L225 Difference]: With dead ends: 160 [2018-07-25 13:37:05,956 INFO L226 Difference]: Without dead ends: 158 [2018-07-25 13:37:05,957 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=12090, Invalid=12090, Unknown=0, NotChecked=0, Total=24180 [2018-07-25 13:37:05,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-07-25 13:37:05,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2018-07-25 13:37:05,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-07-25 13:37:05,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 158 transitions. [2018-07-25 13:37:05,965 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 158 transitions. Word has length 156 [2018-07-25 13:37:05,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:37:05,965 INFO L472 AbstractCegarLoop]: Abstraction has 158 states and 158 transitions. [2018-07-25 13:37:05,965 INFO L473 AbstractCegarLoop]: Interpolant automaton has 156 states. [2018-07-25 13:37:05,965 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 158 transitions. [2018-07-25 13:37:05,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-07-25 13:37:05,966 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:37:05,966 INFO L354 BasicCegarLoop]: trace histogram [154, 1, 1, 1] [2018-07-25 13:37:05,966 INFO L415 AbstractCegarLoop]: === Iteration 155 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:37:05,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1072857888, now seen corresponding path program 154 times [2018-07-25 13:37:05,966 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:37:06,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:37:07,444 INFO L134 CoverageAnalysis]: Checked inductivity of 11935 backedges. 0 proven. 11935 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:37:07,445 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:37:07,445 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [156] total 156 [2018-07-25 13:37:07,445 INFO L451 AbstractCegarLoop]: Interpolant automaton has 157 states [2018-07-25 13:37:07,446 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 157 interpolants. [2018-07-25 13:37:07,447 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12246, Invalid=12246, Unknown=0, NotChecked=0, Total=24492 [2018-07-25 13:37:07,447 INFO L87 Difference]: Start difference. First operand 158 states and 158 transitions. Second operand 157 states. [2018-07-25 13:37:07,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:37:07,780 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2018-07-25 13:37:07,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2018-07-25 13:37:07,780 INFO L78 Accepts]: Start accepts. Automaton has 157 states. Word has length 157 [2018-07-25 13:37:07,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:37:07,780 INFO L225 Difference]: With dead ends: 161 [2018-07-25 13:37:07,781 INFO L226 Difference]: Without dead ends: 159 [2018-07-25 13:37:07,782 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=12246, Invalid=12246, Unknown=0, NotChecked=0, Total=24492 [2018-07-25 13:37:07,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-07-25 13:37:07,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-07-25 13:37:07,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-07-25 13:37:07,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2018-07-25 13:37:07,789 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 157 [2018-07-25 13:37:07,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:37:07,789 INFO L472 AbstractCegarLoop]: Abstraction has 159 states and 159 transitions. [2018-07-25 13:37:07,789 INFO L473 AbstractCegarLoop]: Interpolant automaton has 157 states. [2018-07-25 13:37:07,790 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 159 transitions. [2018-07-25 13:37:07,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-07-25 13:37:07,790 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:37:07,790 INFO L354 BasicCegarLoop]: trace histogram [155, 1, 1, 1] [2018-07-25 13:37:07,790 INFO L415 AbstractCegarLoop]: === Iteration 156 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:37:07,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1101147706, now seen corresponding path program 155 times [2018-07-25 13:37:07,790 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:37:07,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:37:09,295 INFO L134 CoverageAnalysis]: Checked inductivity of 12090 backedges. 0 proven. 12090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:37:09,295 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:37:09,295 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [157] total 157 [2018-07-25 13:37:09,296 INFO L451 AbstractCegarLoop]: Interpolant automaton has 158 states [2018-07-25 13:37:09,298 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2018-07-25 13:37:09,298 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-07-25 13:37:09,298 INFO L87 Difference]: Start difference. First operand 159 states and 159 transitions. Second operand 158 states. [2018-07-25 13:37:09,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:37:09,496 INFO L93 Difference]: Finished difference Result 162 states and 162 transitions. [2018-07-25 13:37:09,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2018-07-25 13:37:09,496 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 158 [2018-07-25 13:37:09,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:37:09,496 INFO L225 Difference]: With dead ends: 162 [2018-07-25 13:37:09,497 INFO L226 Difference]: Without dead ends: 160 [2018-07-25 13:37:09,497 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=12403, Invalid=12403, Unknown=0, NotChecked=0, Total=24806 [2018-07-25 13:37:09,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-07-25 13:37:09,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2018-07-25 13:37:09,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-07-25 13:37:09,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 160 transitions. [2018-07-25 13:37:09,505 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 160 transitions. Word has length 158 [2018-07-25 13:37:09,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:37:09,505 INFO L472 AbstractCegarLoop]: Abstraction has 160 states and 160 transitions. [2018-07-25 13:37:09,505 INFO L473 AbstractCegarLoop]: Interpolant automaton has 158 states. [2018-07-25 13:37:09,505 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 160 transitions. [2018-07-25 13:37:09,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-07-25 13:37:09,506 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:37:09,506 INFO L354 BasicCegarLoop]: trace histogram [156, 1, 1, 1] [2018-07-25 13:37:09,506 INFO L415 AbstractCegarLoop]: === Iteration 157 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:37:09,506 INFO L82 PathProgramCache]: Analyzing trace with hash 224155616, now seen corresponding path program 156 times [2018-07-25 13:37:09,506 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:37:09,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:37:11,010 INFO L134 CoverageAnalysis]: Checked inductivity of 12246 backedges. 0 proven. 12246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:37:11,011 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:37:11,011 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [158] total 158 [2018-07-25 13:37:11,011 INFO L451 AbstractCegarLoop]: Interpolant automaton has 159 states [2018-07-25 13:37:11,013 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 159 interpolants. [2018-07-25 13:37:11,014 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12561, Invalid=12561, Unknown=0, NotChecked=0, Total=25122 [2018-07-25 13:37:11,014 INFO L87 Difference]: Start difference. First operand 160 states and 160 transitions. Second operand 159 states. [2018-07-25 13:37:11,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:37:11,183 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-07-25 13:37:11,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2018-07-25 13:37:11,183 INFO L78 Accepts]: Start accepts. Automaton has 159 states. Word has length 159 [2018-07-25 13:37:11,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:37:11,184 INFO L225 Difference]: With dead ends: 163 [2018-07-25 13:37:11,184 INFO L226 Difference]: Without dead ends: 161 [2018-07-25 13:37:11,185 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=12561, Invalid=12561, Unknown=0, NotChecked=0, Total=25122 [2018-07-25 13:37:11,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-07-25 13:37:11,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-07-25 13:37:11,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-07-25 13:37:11,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-07-25 13:37:11,193 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 159 [2018-07-25 13:37:11,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:37:11,193 INFO L472 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-07-25 13:37:11,193 INFO L473 AbstractCegarLoop]: Interpolant automaton has 159 states. [2018-07-25 13:37:11,193 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-07-25 13:37:11,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-07-25 13:37:11,193 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:37:11,193 INFO L354 BasicCegarLoop]: trace histogram [157, 1, 1, 1] [2018-07-25 13:37:11,194 INFO L415 AbstractCegarLoop]: === Iteration 158 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:37:11,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1641114362, now seen corresponding path program 157 times [2018-07-25 13:37:11,194 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:37:11,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:37:12,751 INFO L134 CoverageAnalysis]: Checked inductivity of 12403 backedges. 0 proven. 12403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:37:12,752 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:37:12,752 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [159] total 159 [2018-07-25 13:37:12,752 INFO L451 AbstractCegarLoop]: Interpolant automaton has 160 states [2018-07-25 13:37:12,753 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2018-07-25 13:37:12,754 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-07-25 13:37:12,754 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 160 states. [2018-07-25 13:37:13,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:37:13,048 INFO L93 Difference]: Finished difference Result 164 states and 164 transitions. [2018-07-25 13:37:13,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2018-07-25 13:37:13,048 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 160 [2018-07-25 13:37:13,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:37:13,049 INFO L225 Difference]: With dead ends: 164 [2018-07-25 13:37:13,049 INFO L226 Difference]: Without dead ends: 162 [2018-07-25 13:37:13,050 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=12720, Invalid=12720, Unknown=0, NotChecked=0, Total=25440 [2018-07-25 13:37:13,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-07-25 13:37:13,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-07-25 13:37:13,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-07-25 13:37:13,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 162 transitions. [2018-07-25 13:37:13,057 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 162 transitions. Word has length 160 [2018-07-25 13:37:13,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:37:13,057 INFO L472 AbstractCegarLoop]: Abstraction has 162 states and 162 transitions. [2018-07-25 13:37:13,057 INFO L473 AbstractCegarLoop]: Interpolant automaton has 160 states. [2018-07-25 13:37:13,058 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2018-07-25 13:37:13,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-07-25 13:37:13,058 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:37:13,058 INFO L354 BasicCegarLoop]: trace histogram [158, 1, 1, 1] [2018-07-25 13:37:13,058 INFO L415 AbstractCegarLoop]: === Iteration 159 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:37:13,058 INFO L82 PathProgramCache]: Analyzing trace with hash 665058464, now seen corresponding path program 158 times [2018-07-25 13:37:13,058 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:37:13,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:37:14,623 INFO L134 CoverageAnalysis]: Checked inductivity of 12561 backedges. 0 proven. 12561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:37:14,624 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:37:14,624 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [160] total 160 [2018-07-25 13:37:14,624 INFO L451 AbstractCegarLoop]: Interpolant automaton has 161 states [2018-07-25 13:37:14,626 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 161 interpolants. [2018-07-25 13:37:14,627 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12880, Invalid=12880, Unknown=0, NotChecked=0, Total=25760 [2018-07-25 13:37:14,627 INFO L87 Difference]: Start difference. First operand 162 states and 162 transitions. Second operand 161 states. [2018-07-25 13:37:15,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:37:15,239 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2018-07-25 13:37:15,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2018-07-25 13:37:15,239 INFO L78 Accepts]: Start accepts. Automaton has 161 states. Word has length 161 [2018-07-25 13:37:15,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:37:15,239 INFO L225 Difference]: With dead ends: 165 [2018-07-25 13:37:15,240 INFO L226 Difference]: Without dead ends: 163 [2018-07-25 13:37:15,241 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=12880, Invalid=12880, Unknown=0, NotChecked=0, Total=25760 [2018-07-25 13:37:15,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-07-25 13:37:15,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-07-25 13:37:15,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-07-25 13:37:15,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2018-07-25 13:37:15,250 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 161 [2018-07-25 13:37:15,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:37:15,250 INFO L472 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2018-07-25 13:37:15,250 INFO L473 AbstractCegarLoop]: Interpolant automaton has 161 states. [2018-07-25 13:37:15,250 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2018-07-25 13:37:15,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-07-25 13:37:15,250 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:37:15,250 INFO L354 BasicCegarLoop]: trace histogram [159, 1, 1, 1] [2018-07-25 13:37:15,251 INFO L415 AbstractCegarLoop]: === Iteration 160 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:37:15,251 INFO L82 PathProgramCache]: Analyzing trace with hash -858027962, now seen corresponding path program 159 times [2018-07-25 13:37:15,251 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:37:15,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:37:16,842 INFO L134 CoverageAnalysis]: Checked inductivity of 12720 backedges. 0 proven. 12720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:37:16,843 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:37:16,843 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [161] total 161 [2018-07-25 13:37:16,843 INFO L451 AbstractCegarLoop]: Interpolant automaton has 162 states [2018-07-25 13:37:16,845 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2018-07-25 13:37:16,846 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-07-25 13:37:16,846 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 162 states. [2018-07-25 13:37:17,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:37:17,300 INFO L93 Difference]: Finished difference Result 166 states and 166 transitions. [2018-07-25 13:37:17,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2018-07-25 13:37:17,300 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 162 [2018-07-25 13:37:17,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:37:17,300 INFO L225 Difference]: With dead ends: 166 [2018-07-25 13:37:17,300 INFO L226 Difference]: Without dead ends: 164 [2018-07-25 13:37:17,301 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=13041, Invalid=13041, Unknown=0, NotChecked=0, Total=26082 [2018-07-25 13:37:17,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-07-25 13:37:17,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2018-07-25 13:37:17,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-07-25 13:37:17,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 164 transitions. [2018-07-25 13:37:17,314 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 164 transitions. Word has length 162 [2018-07-25 13:37:17,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:37:17,314 INFO L472 AbstractCegarLoop]: Abstraction has 164 states and 164 transitions. [2018-07-25 13:37:17,314 INFO L473 AbstractCegarLoop]: Interpolant automaton has 162 states. [2018-07-25 13:37:17,314 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 164 transitions. [2018-07-25 13:37:17,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-07-25 13:37:17,315 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:37:17,315 INFO L354 BasicCegarLoop]: trace histogram [160, 1, 1, 1] [2018-07-25 13:37:17,315 INFO L415 AbstractCegarLoop]: === Iteration 161 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:37:17,315 INFO L82 PathProgramCache]: Analyzing trace with hash -829066912, now seen corresponding path program 160 times [2018-07-25 13:37:17,315 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:37:17,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:37:18,921 INFO L134 CoverageAnalysis]: Checked inductivity of 12880 backedges. 0 proven. 12880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:37:18,921 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:37:18,922 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [162] total 162 [2018-07-25 13:37:18,922 INFO L451 AbstractCegarLoop]: Interpolant automaton has 163 states [2018-07-25 13:37:18,924 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 163 interpolants. [2018-07-25 13:37:18,925 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13203, Invalid=13203, Unknown=0, NotChecked=0, Total=26406 [2018-07-25 13:37:18,925 INFO L87 Difference]: Start difference. First operand 164 states and 164 transitions. Second operand 163 states. [2018-07-25 13:37:19,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:37:19,352 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-07-25 13:37:19,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2018-07-25 13:37:19,352 INFO L78 Accepts]: Start accepts. Automaton has 163 states. Word has length 163 [2018-07-25 13:37:19,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:37:19,353 INFO L225 Difference]: With dead ends: 167 [2018-07-25 13:37:19,353 INFO L226 Difference]: Without dead ends: 165 [2018-07-25 13:37:19,354 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=13203, Invalid=13203, Unknown=0, NotChecked=0, Total=26406 [2018-07-25 13:37:19,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-07-25 13:37:19,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-07-25 13:37:19,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-07-25 13:37:19,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-07-25 13:37:19,363 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 163 [2018-07-25 13:37:19,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:37:19,363 INFO L472 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-07-25 13:37:19,364 INFO L473 AbstractCegarLoop]: Interpolant automaton has 163 states. [2018-07-25 13:37:19,364 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-07-25 13:37:19,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-07-25 13:37:19,364 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:37:19,364 INFO L354 BasicCegarLoop]: trace histogram [161, 1, 1, 1] [2018-07-25 13:37:19,364 INFO L415 AbstractCegarLoop]: === Iteration 162 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:37:19,364 INFO L82 PathProgramCache]: Analyzing trace with hash 68725638, now seen corresponding path program 161 times [2018-07-25 13:37:19,365 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:37:19,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:37:20,968 INFO L134 CoverageAnalysis]: Checked inductivity of 13041 backedges. 0 proven. 13041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:37:20,968 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:37:20,968 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [163] total 163 [2018-07-25 13:37:20,969 INFO L451 AbstractCegarLoop]: Interpolant automaton has 164 states [2018-07-25 13:37:20,971 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2018-07-25 13:37:20,972 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-07-25 13:37:20,972 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 164 states. [2018-07-25 13:37:21,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:37:21,138 INFO L93 Difference]: Finished difference Result 168 states and 168 transitions. [2018-07-25 13:37:21,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2018-07-25 13:37:21,138 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 164 [2018-07-25 13:37:21,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:37:21,139 INFO L225 Difference]: With dead ends: 168 [2018-07-25 13:37:21,139 INFO L226 Difference]: Without dead ends: 166 [2018-07-25 13:37:21,141 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=13366, Invalid=13366, Unknown=0, NotChecked=0, Total=26732 [2018-07-25 13:37:21,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-07-25 13:37:21,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2018-07-25 13:37:21,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-07-25 13:37:21,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2018-07-25 13:37:21,154 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 164 [2018-07-25 13:37:21,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:37:21,154 INFO L472 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2018-07-25 13:37:21,154 INFO L473 AbstractCegarLoop]: Interpolant automaton has 164 states. [2018-07-25 13:37:21,154 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2018-07-25 13:37:21,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-07-25 13:37:21,155 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:37:21,155 INFO L354 BasicCegarLoop]: trace histogram [162, 1, 1, 1] [2018-07-25 13:37:21,155 INFO L415 AbstractCegarLoop]: === Iteration 163 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:37:21,156 INFO L82 PathProgramCache]: Analyzing trace with hash 2130490912, now seen corresponding path program 162 times [2018-07-25 13:37:21,156 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:37:21,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:37:22,956 INFO L134 CoverageAnalysis]: Checked inductivity of 13203 backedges. 0 proven. 13203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:37:22,956 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:37:22,957 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [164] total 164 [2018-07-25 13:37:22,957 INFO L451 AbstractCegarLoop]: Interpolant automaton has 165 states [2018-07-25 13:37:22,959 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 165 interpolants. [2018-07-25 13:37:22,959 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13530, Invalid=13530, Unknown=0, NotChecked=0, Total=27060 [2018-07-25 13:37:22,959 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 165 states. [2018-07-25 13:37:23,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:37:23,358 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2018-07-25 13:37:23,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2018-07-25 13:37:23,358 INFO L78 Accepts]: Start accepts. Automaton has 165 states. Word has length 165 [2018-07-25 13:37:23,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:37:23,359 INFO L225 Difference]: With dead ends: 169 [2018-07-25 13:37:23,359 INFO L226 Difference]: Without dead ends: 167 [2018-07-25 13:37:23,360 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=13530, Invalid=13530, Unknown=0, NotChecked=0, Total=27060 [2018-07-25 13:37:23,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-07-25 13:37:23,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-07-25 13:37:23,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-07-25 13:37:23,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2018-07-25 13:37:23,368 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 165 [2018-07-25 13:37:23,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:37:23,368 INFO L472 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2018-07-25 13:37:23,368 INFO L473 AbstractCegarLoop]: Interpolant automaton has 165 states. [2018-07-25 13:37:23,368 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2018-07-25 13:37:23,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-07-25 13:37:23,368 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:37:23,368 INFO L354 BasicCegarLoop]: trace histogram [163, 1, 1, 1] [2018-07-25 13:37:23,368 INFO L415 AbstractCegarLoop]: === Iteration 164 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:37:23,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1620704966, now seen corresponding path program 163 times [2018-07-25 13:37:23,369 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:37:23,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:37:25,225 INFO L134 CoverageAnalysis]: Checked inductivity of 13366 backedges. 0 proven. 13366 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:37:25,225 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:37:25,225 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [165] total 165 [2018-07-25 13:37:25,225 INFO L451 AbstractCegarLoop]: Interpolant automaton has 166 states [2018-07-25 13:37:25,227 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2018-07-25 13:37:25,228 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-07-25 13:37:25,228 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 166 states. [2018-07-25 13:37:25,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:37:25,740 INFO L93 Difference]: Finished difference Result 170 states and 170 transitions. [2018-07-25 13:37:25,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2018-07-25 13:37:25,740 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 166 [2018-07-25 13:37:25,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:37:25,741 INFO L225 Difference]: With dead ends: 170 [2018-07-25 13:37:25,741 INFO L226 Difference]: Without dead ends: 168 [2018-07-25 13:37:25,742 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=13695, Invalid=13695, Unknown=0, NotChecked=0, Total=27390 [2018-07-25 13:37:25,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-07-25 13:37:25,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2018-07-25 13:37:25,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-07-25 13:37:25,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 168 transitions. [2018-07-25 13:37:25,750 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 168 transitions. Word has length 166 [2018-07-25 13:37:25,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:37:25,750 INFO L472 AbstractCegarLoop]: Abstraction has 168 states and 168 transitions. [2018-07-25 13:37:25,750 INFO L473 AbstractCegarLoop]: Interpolant automaton has 166 states. [2018-07-25 13:37:25,750 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 168 transitions. [2018-07-25 13:37:25,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-07-25 13:37:25,751 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:37:25,751 INFO L354 BasicCegarLoop]: trace histogram [164, 1, 1, 1] [2018-07-25 13:37:25,751 INFO L415 AbstractCegarLoop]: === Iteration 165 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:37:25,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1297757472, now seen corresponding path program 164 times [2018-07-25 13:37:25,751 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:37:25,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:37:27,405 INFO L134 CoverageAnalysis]: Checked inductivity of 13530 backedges. 0 proven. 13530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:37:27,405 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:37:27,406 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [166] total 166 [2018-07-25 13:37:27,406 INFO L451 AbstractCegarLoop]: Interpolant automaton has 167 states [2018-07-25 13:37:27,408 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 167 interpolants. [2018-07-25 13:37:27,409 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13861, Invalid=13861, Unknown=0, NotChecked=0, Total=27722 [2018-07-25 13:37:27,409 INFO L87 Difference]: Start difference. First operand 168 states and 168 transitions. Second operand 167 states. [2018-07-25 13:37:27,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:37:27,758 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-07-25 13:37:27,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2018-07-25 13:37:27,759 INFO L78 Accepts]: Start accepts. Automaton has 167 states. Word has length 167 [2018-07-25 13:37:27,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:37:27,759 INFO L225 Difference]: With dead ends: 171 [2018-07-25 13:37:27,759 INFO L226 Difference]: Without dead ends: 169 [2018-07-25 13:37:27,760 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=13861, Invalid=13861, Unknown=0, NotChecked=0, Total=27722 [2018-07-25 13:37:27,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-07-25 13:37:27,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-07-25 13:37:27,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-07-25 13:37:27,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2018-07-25 13:37:27,768 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 167 [2018-07-25 13:37:27,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:37:27,769 INFO L472 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2018-07-25 13:37:27,769 INFO L473 AbstractCegarLoop]: Interpolant automaton has 167 states. [2018-07-25 13:37:27,769 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2018-07-25 13:37:27,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-07-25 13:37:27,769 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:37:27,769 INFO L354 BasicCegarLoop]: trace histogram [165, 1, 1, 1] [2018-07-25 13:37:27,769 INFO L415 AbstractCegarLoop]: === Iteration 166 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:37:27,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1575779834, now seen corresponding path program 165 times [2018-07-25 13:37:27,770 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:37:27,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:37:29,464 INFO L134 CoverageAnalysis]: Checked inductivity of 13695 backedges. 0 proven. 13695 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:37:29,465 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:37:29,465 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [167] total 167 [2018-07-25 13:37:29,465 INFO L451 AbstractCegarLoop]: Interpolant automaton has 168 states [2018-07-25 13:37:29,467 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2018-07-25 13:37:29,468 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-07-25 13:37:29,468 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 168 states. [2018-07-25 13:37:29,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:37:29,744 INFO L93 Difference]: Finished difference Result 172 states and 172 transitions. [2018-07-25 13:37:29,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2018-07-25 13:37:29,745 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 168 [2018-07-25 13:37:29,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:37:29,745 INFO L225 Difference]: With dead ends: 172 [2018-07-25 13:37:29,745 INFO L226 Difference]: Without dead ends: 170 [2018-07-25 13:37:29,746 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=14028, Invalid=14028, Unknown=0, NotChecked=0, Total=28056 [2018-07-25 13:37:29,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-07-25 13:37:29,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2018-07-25 13:37:29,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-07-25 13:37:29,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 170 transitions. [2018-07-25 13:37:29,758 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 170 transitions. Word has length 168 [2018-07-25 13:37:29,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:37:29,758 INFO L472 AbstractCegarLoop]: Abstraction has 170 states and 170 transitions. [2018-07-25 13:37:29,758 INFO L473 AbstractCegarLoop]: Interpolant automaton has 168 states. [2018-07-25 13:37:29,758 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 170 transitions. [2018-07-25 13:37:29,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-07-25 13:37:29,759 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:37:29,759 INFO L354 BasicCegarLoop]: trace histogram [166, 1, 1, 1] [2018-07-25 13:37:29,759 INFO L415 AbstractCegarLoop]: === Iteration 167 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:37:29,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1604538464, now seen corresponding path program 166 times [2018-07-25 13:37:29,760 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:37:30,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:37:31,533 INFO L134 CoverageAnalysis]: Checked inductivity of 13861 backedges. 0 proven. 13861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:37:31,534 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:37:31,534 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [168] total 168 [2018-07-25 13:37:31,534 INFO L451 AbstractCegarLoop]: Interpolant automaton has 169 states [2018-07-25 13:37:31,536 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 169 interpolants. [2018-07-25 13:37:31,537 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14196, Invalid=14196, Unknown=0, NotChecked=0, Total=28392 [2018-07-25 13:37:31,537 INFO L87 Difference]: Start difference. First operand 170 states and 170 transitions. Second operand 169 states. [2018-07-25 13:37:32,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:37:32,123 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2018-07-25 13:37:32,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2018-07-25 13:37:32,124 INFO L78 Accepts]: Start accepts. Automaton has 169 states. Word has length 169 [2018-07-25 13:37:32,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:37:32,124 INFO L225 Difference]: With dead ends: 173 [2018-07-25 13:37:32,124 INFO L226 Difference]: Without dead ends: 171 [2018-07-25 13:37:32,125 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=14196, Invalid=14196, Unknown=0, NotChecked=0, Total=28392 [2018-07-25 13:37:32,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-07-25 13:37:32,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-07-25 13:37:32,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-07-25 13:37:32,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-07-25 13:37:32,134 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 169 [2018-07-25 13:37:32,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:37:32,134 INFO L472 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-07-25 13:37:32,134 INFO L473 AbstractCegarLoop]: Interpolant automaton has 169 states. [2018-07-25 13:37:32,134 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-07-25 13:37:32,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-07-25 13:37:32,134 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:37:32,134 INFO L354 BasicCegarLoop]: trace histogram [167, 1, 1, 1] [2018-07-25 13:37:32,134 INFO L415 AbstractCegarLoop]: === Iteration 168 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:37:32,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1798911302, now seen corresponding path program 167 times [2018-07-25 13:37:32,135 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:37:32,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:37:33,884 INFO L134 CoverageAnalysis]: Checked inductivity of 14028 backedges. 0 proven. 14028 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:37:33,885 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:37:33,885 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [169] total 169 [2018-07-25 13:37:33,885 INFO L451 AbstractCegarLoop]: Interpolant automaton has 170 states [2018-07-25 13:37:33,887 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2018-07-25 13:37:33,888 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-07-25 13:37:33,888 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 170 states. [2018-07-25 13:37:34,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:37:34,251 INFO L93 Difference]: Finished difference Result 174 states and 174 transitions. [2018-07-25 13:37:34,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2018-07-25 13:37:34,251 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 170 [2018-07-25 13:37:34,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:37:34,252 INFO L225 Difference]: With dead ends: 174 [2018-07-25 13:37:34,252 INFO L226 Difference]: Without dead ends: 172 [2018-07-25 13:37:34,253 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=14365, Invalid=14365, Unknown=0, NotChecked=0, Total=28730 [2018-07-25 13:37:34,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-07-25 13:37:34,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2018-07-25 13:37:34,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-07-25 13:37:34,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2018-07-25 13:37:34,261 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 170 [2018-07-25 13:37:34,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:37:34,261 INFO L472 AbstractCegarLoop]: Abstraction has 172 states and 172 transitions. [2018-07-25 13:37:34,261 INFO L473 AbstractCegarLoop]: Interpolant automaton has 170 states. [2018-07-25 13:37:34,261 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 172 transitions. [2018-07-25 13:37:34,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-07-25 13:37:34,262 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:37:34,262 INFO L354 BasicCegarLoop]: trace histogram [168, 1, 1, 1] [2018-07-25 13:37:34,262 INFO L415 AbstractCegarLoop]: === Iteration 169 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:37:34,262 INFO L82 PathProgramCache]: Analyzing trace with hash -68328352, now seen corresponding path program 168 times [2018-07-25 13:37:34,262 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:37:34,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:37:36,100 INFO L134 CoverageAnalysis]: Checked inductivity of 14196 backedges. 0 proven. 14196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:37:36,101 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:37:36,101 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [170] total 170 [2018-07-25 13:37:36,101 INFO L451 AbstractCegarLoop]: Interpolant automaton has 171 states [2018-07-25 13:37:36,102 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 171 interpolants. [2018-07-25 13:37:36,103 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14535, Invalid=14535, Unknown=0, NotChecked=0, Total=29070 [2018-07-25 13:37:36,103 INFO L87 Difference]: Start difference. First operand 172 states and 172 transitions. Second operand 171 states. [2018-07-25 13:37:36,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:37:36,452 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-07-25 13:37:36,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2018-07-25 13:37:36,452 INFO L78 Accepts]: Start accepts. Automaton has 171 states. Word has length 171 [2018-07-25 13:37:36,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:37:36,452 INFO L225 Difference]: With dead ends: 175 [2018-07-25 13:37:36,452 INFO L226 Difference]: Without dead ends: 173 [2018-07-25 13:37:36,453 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=14535, Invalid=14535, Unknown=0, NotChecked=0, Total=29070 [2018-07-25 13:37:36,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-07-25 13:37:36,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-07-25 13:37:36,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-07-25 13:37:36,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-07-25 13:37:36,461 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 171 [2018-07-25 13:37:36,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:37:36,461 INFO L472 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-07-25 13:37:36,461 INFO L473 AbstractCegarLoop]: Interpolant automaton has 171 states. [2018-07-25 13:37:36,462 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-07-25 13:37:36,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-07-25 13:37:36,462 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:37:36,462 INFO L354 BasicCegarLoop]: trace histogram [169, 1, 1, 1] [2018-07-25 13:37:36,462 INFO L415 AbstractCegarLoop]: === Iteration 170 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:37:36,462 INFO L82 PathProgramCache]: Analyzing trace with hash -2118182778, now seen corresponding path program 169 times [2018-07-25 13:37:36,462 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:37:36,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:37:38,234 INFO L134 CoverageAnalysis]: Checked inductivity of 14365 backedges. 0 proven. 14365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:37:38,234 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:37:38,234 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [171] total 171 [2018-07-25 13:37:38,235 INFO L451 AbstractCegarLoop]: Interpolant automaton has 172 states [2018-07-25 13:37:38,237 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2018-07-25 13:37:38,238 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-07-25 13:37:38,238 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 172 states. [2018-07-25 13:37:38,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:37:38,826 INFO L93 Difference]: Finished difference Result 176 states and 176 transitions. [2018-07-25 13:37:38,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2018-07-25 13:37:38,826 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 172 [2018-07-25 13:37:38,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:37:38,827 INFO L225 Difference]: With dead ends: 176 [2018-07-25 13:37:38,827 INFO L226 Difference]: Without dead ends: 174 [2018-07-25 13:37:38,828 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=14706, Invalid=14706, Unknown=0, NotChecked=0, Total=29412 [2018-07-25 13:37:38,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-07-25 13:37:38,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2018-07-25 13:37:38,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-07-25 13:37:38,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 174 transitions. [2018-07-25 13:37:38,836 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 174 transitions. Word has length 172 [2018-07-25 13:37:38,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:37:38,836 INFO L472 AbstractCegarLoop]: Abstraction has 174 states and 174 transitions. [2018-07-25 13:37:38,836 INFO L473 AbstractCegarLoop]: Interpolant automaton has 172 states. [2018-07-25 13:37:38,836 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 174 transitions. [2018-07-25 13:37:38,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-07-25 13:37:38,837 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:37:38,837 INFO L354 BasicCegarLoop]: trace histogram [170, 1, 1, 1] [2018-07-25 13:37:38,837 INFO L415 AbstractCegarLoop]: === Iteration 171 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:37:38,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1239160544, now seen corresponding path program 170 times [2018-07-25 13:37:38,837 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:37:39,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:37:40,642 INFO L134 CoverageAnalysis]: Checked inductivity of 14535 backedges. 0 proven. 14535 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:37:40,642 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:37:40,642 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [172] total 172 [2018-07-25 13:37:40,643 INFO L451 AbstractCegarLoop]: Interpolant automaton has 173 states [2018-07-25 13:37:40,645 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 173 interpolants. [2018-07-25 13:37:40,645 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14878, Invalid=14878, Unknown=0, NotChecked=0, Total=29756 [2018-07-25 13:37:40,645 INFO L87 Difference]: Start difference. First operand 174 states and 174 transitions. Second operand 173 states. [2018-07-25 13:37:40,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:37:40,841 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2018-07-25 13:37:40,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2018-07-25 13:37:40,841 INFO L78 Accepts]: Start accepts. Automaton has 173 states. Word has length 173 [2018-07-25 13:37:40,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:37:40,842 INFO L225 Difference]: With dead ends: 177 [2018-07-25 13:37:40,842 INFO L226 Difference]: Without dead ends: 175 [2018-07-25 13:37:40,843 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=14878, Invalid=14878, Unknown=0, NotChecked=0, Total=29756 [2018-07-25 13:37:40,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-07-25 13:37:40,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-07-25 13:37:40,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-07-25 13:37:40,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2018-07-25 13:37:40,852 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 173 [2018-07-25 13:37:40,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:37:40,853 INFO L472 AbstractCegarLoop]: Abstraction has 175 states and 175 transitions. [2018-07-25 13:37:40,853 INFO L473 AbstractCegarLoop]: Interpolant automaton has 173 states. [2018-07-25 13:37:40,853 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 175 transitions. [2018-07-25 13:37:40,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-07-25 13:37:40,853 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:37:40,853 INFO L354 BasicCegarLoop]: trace histogram [171, 1, 1, 1] [2018-07-25 13:37:40,853 INFO L415 AbstractCegarLoop]: === Iteration 172 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:37:40,854 INFO L82 PathProgramCache]: Analyzing trace with hash 240724934, now seen corresponding path program 171 times [2018-07-25 13:37:40,854 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:37:41,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:37:42,652 INFO L134 CoverageAnalysis]: Checked inductivity of 14706 backedges. 0 proven. 14706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:37:42,652 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:37:42,653 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [173] total 173 [2018-07-25 13:37:42,653 INFO L451 AbstractCegarLoop]: Interpolant automaton has 174 states [2018-07-25 13:37:42,655 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2018-07-25 13:37:42,656 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-07-25 13:37:42,656 INFO L87 Difference]: Start difference. First operand 175 states and 175 transitions. Second operand 174 states. [2018-07-25 13:37:43,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:37:43,307 INFO L93 Difference]: Finished difference Result 178 states and 178 transitions. [2018-07-25 13:37:43,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2018-07-25 13:37:43,307 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 174 [2018-07-25 13:37:43,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:37:43,308 INFO L225 Difference]: With dead ends: 178 [2018-07-25 13:37:43,308 INFO L226 Difference]: Without dead ends: 176 [2018-07-25 13:37:43,310 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=15051, Invalid=15051, Unknown=0, NotChecked=0, Total=30102 [2018-07-25 13:37:43,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-07-25 13:37:43,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2018-07-25 13:37:43,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-07-25 13:37:43,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2018-07-25 13:37:43,319 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 174 [2018-07-25 13:37:43,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:37:43,319 INFO L472 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2018-07-25 13:37:43,319 INFO L473 AbstractCegarLoop]: Interpolant automaton has 174 states. [2018-07-25 13:37:43,319 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2018-07-25 13:37:43,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-07-25 13:37:43,319 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:37:43,319 INFO L354 BasicCegarLoop]: trace histogram [172, 1, 1, 1] [2018-07-25 13:37:43,320 INFO L415 AbstractCegarLoop]: === Iteration 173 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:37:43,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1127465504, now seen corresponding path program 172 times [2018-07-25 13:37:43,320 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:37:43,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:37:45,111 INFO L134 CoverageAnalysis]: Checked inductivity of 14878 backedges. 0 proven. 14878 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:37:45,111 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:37:45,111 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [174] total 174 [2018-07-25 13:37:45,112 INFO L451 AbstractCegarLoop]: Interpolant automaton has 175 states [2018-07-25 13:37:45,113 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 175 interpolants. [2018-07-25 13:37:45,114 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15225, Invalid=15225, Unknown=0, NotChecked=0, Total=30450 [2018-07-25 13:37:45,114 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 175 states. [2018-07-25 13:37:45,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:37:45,439 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-07-25 13:37:45,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2018-07-25 13:37:45,439 INFO L78 Accepts]: Start accepts. Automaton has 175 states. Word has length 175 [2018-07-25 13:37:45,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:37:45,440 INFO L225 Difference]: With dead ends: 179 [2018-07-25 13:37:45,440 INFO L226 Difference]: Without dead ends: 177 [2018-07-25 13:37:45,442 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=15225, Invalid=15225, Unknown=0, NotChecked=0, Total=30450 [2018-07-25 13:37:45,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-07-25 13:37:45,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-07-25 13:37:45,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-07-25 13:37:45,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-07-25 13:37:45,452 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 175 [2018-07-25 13:37:45,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:37:45,452 INFO L472 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-07-25 13:37:45,452 INFO L473 AbstractCegarLoop]: Interpolant automaton has 175 states. [2018-07-25 13:37:45,452 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-07-25 13:37:45,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-07-25 13:37:45,453 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:37:45,453 INFO L354 BasicCegarLoop]: trace histogram [173, 1, 1, 1] [2018-07-25 13:37:45,453 INFO L415 AbstractCegarLoop]: === Iteration 174 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:37:45,454 INFO L82 PathProgramCache]: Analyzing trace with hash -591696122, now seen corresponding path program 173 times [2018-07-25 13:37:45,454 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:37:45,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:37:47,323 INFO L134 CoverageAnalysis]: Checked inductivity of 15051 backedges. 0 proven. 15051 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:37:47,324 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:37:47,324 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [175] total 175 [2018-07-25 13:37:47,324 INFO L451 AbstractCegarLoop]: Interpolant automaton has 176 states [2018-07-25 13:37:47,326 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2018-07-25 13:37:47,327 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-07-25 13:37:47,327 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 176 states. [2018-07-25 13:37:47,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:37:47,929 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2018-07-25 13:37:47,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2018-07-25 13:37:47,929 INFO L78 Accepts]: Start accepts. Automaton has 176 states. Word has length 176 [2018-07-25 13:37:47,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:37:47,930 INFO L225 Difference]: With dead ends: 180 [2018-07-25 13:37:47,930 INFO L226 Difference]: Without dead ends: 178 [2018-07-25 13:37:47,931 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=15400, Invalid=15400, Unknown=0, NotChecked=0, Total=30800 [2018-07-25 13:37:47,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-07-25 13:37:47,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 178. [2018-07-25 13:37:47,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-07-25 13:37:47,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 178 transitions. [2018-07-25 13:37:47,940 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 178 transitions. Word has length 176 [2018-07-25 13:37:47,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:37:47,940 INFO L472 AbstractCegarLoop]: Abstraction has 178 states and 178 transitions. [2018-07-25 13:37:47,940 INFO L473 AbstractCegarLoop]: Interpolant automaton has 176 states. [2018-07-25 13:37:47,940 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 178 transitions. [2018-07-25 13:37:47,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-07-25 13:37:47,940 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:37:47,941 INFO L354 BasicCegarLoop]: trace histogram [174, 1, 1, 1] [2018-07-25 13:37:47,941 INFO L415 AbstractCegarLoop]: === Iteration 175 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:37:47,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1162714464, now seen corresponding path program 174 times [2018-07-25 13:37:47,941 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:37:48,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:37:49,834 INFO L134 CoverageAnalysis]: Checked inductivity of 15225 backedges. 0 proven. 15225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:37:49,835 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:37:49,835 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [176] total 176 [2018-07-25 13:37:49,835 INFO L451 AbstractCegarLoop]: Interpolant automaton has 177 states [2018-07-25 13:37:49,837 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 177 interpolants. [2018-07-25 13:37:49,838 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15576, Invalid=15576, Unknown=0, NotChecked=0, Total=31152 [2018-07-25 13:37:49,839 INFO L87 Difference]: Start difference. First operand 178 states and 178 transitions. Second operand 177 states. [2018-07-25 13:37:50,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:37:50,248 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2018-07-25 13:37:50,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2018-07-25 13:37:50,248 INFO L78 Accepts]: Start accepts. Automaton has 177 states. Word has length 177 [2018-07-25 13:37:50,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:37:50,249 INFO L225 Difference]: With dead ends: 181 [2018-07-25 13:37:50,249 INFO L226 Difference]: Without dead ends: 179 [2018-07-25 13:37:50,250 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=15576, Invalid=15576, Unknown=0, NotChecked=0, Total=31152 [2018-07-25 13:37:50,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-07-25 13:37:50,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-07-25 13:37:50,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-07-25 13:37:50,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2018-07-25 13:37:50,259 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 179 transitions. Word has length 177 [2018-07-25 13:37:50,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:37:50,259 INFO L472 AbstractCegarLoop]: Abstraction has 179 states and 179 transitions. [2018-07-25 13:37:50,259 INFO L473 AbstractCegarLoop]: Interpolant automaton has 177 states. [2018-07-25 13:37:50,259 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 179 transitions. [2018-07-25 13:37:50,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-07-25 13:37:50,259 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:37:50,259 INFO L354 BasicCegarLoop]: trace histogram [175, 1, 1, 1] [2018-07-25 13:37:50,260 INFO L415 AbstractCegarLoop]: === Iteration 176 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:37:50,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1684413882, now seen corresponding path program 175 times [2018-07-25 13:37:50,260 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:37:50,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:37:52,165 INFO L134 CoverageAnalysis]: Checked inductivity of 15400 backedges. 0 proven. 15400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:37:52,166 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:37:52,166 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [177] total 177 [2018-07-25 13:37:52,166 INFO L451 AbstractCegarLoop]: Interpolant automaton has 178 states [2018-07-25 13:37:52,168 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2018-07-25 13:37:52,168 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-07-25 13:37:52,168 INFO L87 Difference]: Start difference. First operand 179 states and 179 transitions. Second operand 178 states. [2018-07-25 13:37:52,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:37:52,747 INFO L93 Difference]: Finished difference Result 182 states and 182 transitions. [2018-07-25 13:37:52,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2018-07-25 13:37:52,748 INFO L78 Accepts]: Start accepts. Automaton has 178 states. Word has length 178 [2018-07-25 13:37:52,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:37:52,748 INFO L225 Difference]: With dead ends: 182 [2018-07-25 13:37:52,748 INFO L226 Difference]: Without dead ends: 180 [2018-07-25 13:37:52,749 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=15753, Invalid=15753, Unknown=0, NotChecked=0, Total=31506 [2018-07-25 13:37:52,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-07-25 13:37:52,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2018-07-25 13:37:52,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-07-25 13:37:52,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 180 transitions. [2018-07-25 13:37:52,757 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 180 transitions. Word has length 178 [2018-07-25 13:37:52,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:37:52,757 INFO L472 AbstractCegarLoop]: Abstraction has 180 states and 180 transitions. [2018-07-25 13:37:52,757 INFO L473 AbstractCegarLoop]: Interpolant automaton has 178 states. [2018-07-25 13:37:52,758 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 180 transitions. [2018-07-25 13:37:52,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-07-25 13:37:52,758 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:37:52,758 INFO L354 BasicCegarLoop]: trace histogram [176, 1, 1, 1] [2018-07-25 13:37:52,758 INFO L415 AbstractCegarLoop]: === Iteration 177 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:37:52,758 INFO L82 PathProgramCache]: Analyzing trace with hash -677226656, now seen corresponding path program 176 times [2018-07-25 13:37:52,758 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:37:52,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:37:54,624 INFO L134 CoverageAnalysis]: Checked inductivity of 15576 backedges. 0 proven. 15576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:37:54,624 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:37:54,624 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [178] total 178 [2018-07-25 13:37:54,624 INFO L451 AbstractCegarLoop]: Interpolant automaton has 179 states [2018-07-25 13:37:54,626 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 179 interpolants. [2018-07-25 13:37:54,627 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15931, Invalid=15931, Unknown=0, NotChecked=0, Total=31862 [2018-07-25 13:37:54,627 INFO L87 Difference]: Start difference. First operand 180 states and 180 transitions. Second operand 179 states. [2018-07-25 13:37:54,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:37:54,998 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-07-25 13:37:54,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 179 states. [2018-07-25 13:37:54,998 INFO L78 Accepts]: Start accepts. Automaton has 179 states. Word has length 179 [2018-07-25 13:37:54,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:37:54,999 INFO L225 Difference]: With dead ends: 183 [2018-07-25 13:37:54,999 INFO L226 Difference]: Without dead ends: 181 [2018-07-25 13:37:55,000 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=15931, Invalid=15931, Unknown=0, NotChecked=0, Total=31862 [2018-07-25 13:37:55,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-07-25 13:37:55,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-07-25 13:37:55,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-07-25 13:37:55,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-07-25 13:37:55,009 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 179 [2018-07-25 13:37:55,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:37:55,009 INFO L472 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-07-25 13:37:55,010 INFO L473 AbstractCegarLoop]: Interpolant automaton has 179 states. [2018-07-25 13:37:55,010 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-07-25 13:37:55,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-07-25 13:37:55,010 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:37:55,010 INFO L354 BasicCegarLoop]: trace histogram [177, 1, 1, 1] [2018-07-25 13:37:55,010 INFO L415 AbstractCegarLoop]: === Iteration 178 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:37:55,010 INFO L82 PathProgramCache]: Analyzing trace with hash 480806278, now seen corresponding path program 177 times [2018-07-25 13:37:55,010 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:37:55,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:37:57,022 INFO L134 CoverageAnalysis]: Checked inductivity of 15753 backedges. 0 proven. 15753 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:37:57,023 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:37:57,023 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [179] total 179 [2018-07-25 13:37:57,023 INFO L451 AbstractCegarLoop]: Interpolant automaton has 180 states [2018-07-25 13:37:57,025 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 180 interpolants. [2018-07-25 13:37:57,026 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-07-25 13:37:57,026 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 180 states. [2018-07-25 13:37:57,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:37:57,768 INFO L93 Difference]: Finished difference Result 184 states and 184 transitions. [2018-07-25 13:37:57,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2018-07-25 13:37:57,768 INFO L78 Accepts]: Start accepts. Automaton has 180 states. Word has length 180 [2018-07-25 13:37:57,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:37:57,769 INFO L225 Difference]: With dead ends: 184 [2018-07-25 13:37:57,769 INFO L226 Difference]: Without dead ends: 182 [2018-07-25 13:37:57,770 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=16110, Invalid=16110, Unknown=0, NotChecked=0, Total=32220 [2018-07-25 13:37:57,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-07-25 13:37:57,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-07-25 13:37:57,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-07-25 13:37:57,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 182 transitions. [2018-07-25 13:37:57,779 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 182 transitions. Word has length 180 [2018-07-25 13:37:57,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:37:57,779 INFO L472 AbstractCegarLoop]: Abstraction has 182 states and 182 transitions. [2018-07-25 13:37:57,779 INFO L473 AbstractCegarLoop]: Interpolant automaton has 180 states. [2018-07-25 13:37:57,780 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 182 transitions. [2018-07-25 13:37:57,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-07-25 13:37:57,780 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:37:57,780 INFO L354 BasicCegarLoop]: trace histogram [178, 1, 1, 1] [2018-07-25 13:37:57,780 INFO L415 AbstractCegarLoop]: === Iteration 179 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:37:57,780 INFO L82 PathProgramCache]: Analyzing trace with hash 2020088864, now seen corresponding path program 178 times [2018-07-25 13:37:57,780 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:37:58,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:37:59,791 INFO L134 CoverageAnalysis]: Checked inductivity of 15931 backedges. 0 proven. 15931 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:37:59,791 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:37:59,791 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [180] total 180 [2018-07-25 13:37:59,792 INFO L451 AbstractCegarLoop]: Interpolant automaton has 181 states [2018-07-25 13:37:59,793 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 181 interpolants. [2018-07-25 13:37:59,793 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16290, Invalid=16290, Unknown=0, NotChecked=0, Total=32580 [2018-07-25 13:37:59,794 INFO L87 Difference]: Start difference. First operand 182 states and 182 transitions. Second operand 181 states. [2018-07-25 13:38:00,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:38:00,034 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2018-07-25 13:38:00,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 181 states. [2018-07-25 13:38:00,034 INFO L78 Accepts]: Start accepts. Automaton has 181 states. Word has length 181 [2018-07-25 13:38:00,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:38:00,035 INFO L225 Difference]: With dead ends: 185 [2018-07-25 13:38:00,035 INFO L226 Difference]: Without dead ends: 183 [2018-07-25 13:38:00,036 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=16290, Invalid=16290, Unknown=0, NotChecked=0, Total=32580 [2018-07-25 13:38:00,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-07-25 13:38:00,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-07-25 13:38:00,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-07-25 13:38:00,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2018-07-25 13:38:00,045 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 181 [2018-07-25 13:38:00,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:38:00,045 INFO L472 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2018-07-25 13:38:00,045 INFO L473 AbstractCegarLoop]: Interpolant automaton has 181 states. [2018-07-25 13:38:00,045 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2018-07-25 13:38:00,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-07-25 13:38:00,046 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:38:00,046 INFO L354 BasicCegarLoop]: trace histogram [179, 1, 1, 1] [2018-07-25 13:38:00,046 INFO L415 AbstractCegarLoop]: === Iteration 180 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:38:00,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1801758522, now seen corresponding path program 179 times [2018-07-25 13:38:00,046 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:38:00,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:38:02,031 INFO L134 CoverageAnalysis]: Checked inductivity of 16110 backedges. 0 proven. 16110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:38:02,031 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:38:02,032 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [181] total 181 [2018-07-25 13:38:02,032 INFO L451 AbstractCegarLoop]: Interpolant automaton has 182 states [2018-07-25 13:38:02,034 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 182 interpolants. [2018-07-25 13:38:02,036 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-07-25 13:38:02,036 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 182 states. [2018-07-25 13:38:02,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:38:02,807 INFO L93 Difference]: Finished difference Result 186 states and 186 transitions. [2018-07-25 13:38:02,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2018-07-25 13:38:02,807 INFO L78 Accepts]: Start accepts. Automaton has 182 states. Word has length 182 [2018-07-25 13:38:02,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:38:02,808 INFO L225 Difference]: With dead ends: 186 [2018-07-25 13:38:02,808 INFO L226 Difference]: Without dead ends: 184 [2018-07-25 13:38:02,810 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=16471, Invalid=16471, Unknown=0, NotChecked=0, Total=32942 [2018-07-25 13:38:02,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-07-25 13:38:02,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2018-07-25 13:38:02,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-07-25 13:38:02,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 184 transitions. [2018-07-25 13:38:02,819 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 184 transitions. Word has length 182 [2018-07-25 13:38:02,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:38:02,819 INFO L472 AbstractCegarLoop]: Abstraction has 184 states and 184 transitions. [2018-07-25 13:38:02,819 INFO L473 AbstractCegarLoop]: Interpolant automaton has 182 states. [2018-07-25 13:38:02,819 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 184 transitions. [2018-07-25 13:38:02,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-07-25 13:38:02,820 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:38:02,820 INFO L354 BasicCegarLoop]: trace histogram [180, 1, 1, 1] [2018-07-25 13:38:02,820 INFO L415 AbstractCegarLoop]: === Iteration 181 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:38:02,820 INFO L82 PathProgramCache]: Analyzing trace with hash -19943200, now seen corresponding path program 180 times [2018-07-25 13:38:02,820 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:38:03,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:38:04,789 INFO L134 CoverageAnalysis]: Checked inductivity of 16290 backedges. 0 proven. 16290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:38:04,789 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:38:04,790 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [182] total 182 [2018-07-25 13:38:04,790 INFO L451 AbstractCegarLoop]: Interpolant automaton has 183 states [2018-07-25 13:38:04,792 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 183 interpolants. [2018-07-25 13:38:04,792 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16653, Invalid=16653, Unknown=0, NotChecked=0, Total=33306 [2018-07-25 13:38:04,793 INFO L87 Difference]: Start difference. First operand 184 states and 184 transitions. Second operand 183 states. [2018-07-25 13:38:05,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:38:05,144 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2018-07-25 13:38:05,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2018-07-25 13:38:05,144 INFO L78 Accepts]: Start accepts. Automaton has 183 states. Word has length 183 [2018-07-25 13:38:05,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:38:05,144 INFO L225 Difference]: With dead ends: 187 [2018-07-25 13:38:05,145 INFO L226 Difference]: Without dead ends: 185 [2018-07-25 13:38:05,146 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=16653, Invalid=16653, Unknown=0, NotChecked=0, Total=33306 [2018-07-25 13:38:05,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-07-25 13:38:05,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2018-07-25 13:38:05,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-07-25 13:38:05,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2018-07-25 13:38:05,161 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 183 [2018-07-25 13:38:05,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:38:05,161 INFO L472 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2018-07-25 13:38:05,161 INFO L473 AbstractCegarLoop]: Interpolant automaton has 183 states. [2018-07-25 13:38:05,161 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2018-07-25 13:38:05,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-07-25 13:38:05,162 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:38:05,162 INFO L354 BasicCegarLoop]: trace histogram [181, 1, 1, 1] [2018-07-25 13:38:05,162 INFO L415 AbstractCegarLoop]: === Iteration 182 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:38:05,163 INFO L82 PathProgramCache]: Analyzing trace with hash -618243066, now seen corresponding path program 181 times [2018-07-25 13:38:05,163 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:38:05,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:38:07,215 INFO L134 CoverageAnalysis]: Checked inductivity of 16471 backedges. 0 proven. 16471 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:38:07,216 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:38:07,216 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [183] total 183 [2018-07-25 13:38:07,216 INFO L451 AbstractCegarLoop]: Interpolant automaton has 184 states [2018-07-25 13:38:07,219 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 184 interpolants. [2018-07-25 13:38:07,220 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-07-25 13:38:07,220 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 184 states. [2018-07-25 13:38:07,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:38:07,772 INFO L93 Difference]: Finished difference Result 188 states and 188 transitions. [2018-07-25 13:38:07,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2018-07-25 13:38:07,772 INFO L78 Accepts]: Start accepts. Automaton has 184 states. Word has length 184 [2018-07-25 13:38:07,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:38:07,773 INFO L225 Difference]: With dead ends: 188 [2018-07-25 13:38:07,773 INFO L226 Difference]: Without dead ends: 186 [2018-07-25 13:38:07,774 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=16836, Invalid=16836, Unknown=0, NotChecked=0, Total=33672 [2018-07-25 13:38:07,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-07-25 13:38:07,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2018-07-25 13:38:07,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-07-25 13:38:07,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2018-07-25 13:38:07,783 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 184 [2018-07-25 13:38:07,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:38:07,783 INFO L472 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2018-07-25 13:38:07,783 INFO L473 AbstractCegarLoop]: Interpolant automaton has 184 states. [2018-07-25 13:38:07,783 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2018-07-25 13:38:07,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-07-25 13:38:07,784 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:38:07,784 INFO L354 BasicCegarLoop]: trace histogram [182, 1, 1, 1] [2018-07-25 13:38:07,784 INFO L415 AbstractCegarLoop]: === Iteration 183 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:38:07,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1985669728, now seen corresponding path program 182 times [2018-07-25 13:38:07,784 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:38:08,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:38:09,826 INFO L134 CoverageAnalysis]: Checked inductivity of 16653 backedges. 0 proven. 16653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:38:09,826 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:38:09,826 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [184] total 184 [2018-07-25 13:38:09,827 INFO L451 AbstractCegarLoop]: Interpolant automaton has 185 states [2018-07-25 13:38:09,829 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 185 interpolants. [2018-07-25 13:38:09,830 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17020, Invalid=17020, Unknown=0, NotChecked=0, Total=34040 [2018-07-25 13:38:09,830 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand 185 states. [2018-07-25 13:38:10,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:38:10,652 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2018-07-25 13:38:10,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2018-07-25 13:38:10,652 INFO L78 Accepts]: Start accepts. Automaton has 185 states. Word has length 185 [2018-07-25 13:38:10,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:38:10,653 INFO L225 Difference]: With dead ends: 189 [2018-07-25 13:38:10,653 INFO L226 Difference]: Without dead ends: 187 [2018-07-25 13:38:10,654 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 183 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=17020, Invalid=17020, Unknown=0, NotChecked=0, Total=34040 [2018-07-25 13:38:10,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-07-25 13:38:10,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-07-25 13:38:10,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-07-25 13:38:10,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2018-07-25 13:38:10,663 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 185 [2018-07-25 13:38:10,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:38:10,663 INFO L472 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2018-07-25 13:38:10,663 INFO L473 AbstractCegarLoop]: Interpolant automaton has 185 states. [2018-07-25 13:38:10,663 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2018-07-25 13:38:10,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-07-25 13:38:10,664 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:38:10,664 INFO L354 BasicCegarLoop]: trace histogram [183, 1, 1, 1] [2018-07-25 13:38:10,664 INFO L415 AbstractCegarLoop]: === Iteration 184 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:38:10,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1426223290, now seen corresponding path program 183 times [2018-07-25 13:38:10,664 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:38:10,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:38:12,730 INFO L134 CoverageAnalysis]: Checked inductivity of 16836 backedges. 0 proven. 16836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:38:12,731 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:38:12,731 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [185] total 185 [2018-07-25 13:38:12,731 INFO L451 AbstractCegarLoop]: Interpolant automaton has 186 states [2018-07-25 13:38:12,733 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 186 interpolants. [2018-07-25 13:38:12,734 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-07-25 13:38:12,734 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 186 states. [2018-07-25 13:38:13,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:38:13,012 INFO L93 Difference]: Finished difference Result 190 states and 190 transitions. [2018-07-25 13:38:13,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 186 states. [2018-07-25 13:38:13,012 INFO L78 Accepts]: Start accepts. Automaton has 186 states. Word has length 186 [2018-07-25 13:38:13,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:38:13,013 INFO L225 Difference]: With dead ends: 190 [2018-07-25 13:38:13,013 INFO L226 Difference]: Without dead ends: 188 [2018-07-25 13:38:13,014 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=17205, Invalid=17205, Unknown=0, NotChecked=0, Total=34410 [2018-07-25 13:38:13,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-07-25 13:38:13,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2018-07-25 13:38:13,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-07-25 13:38:13,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 188 transitions. [2018-07-25 13:38:13,023 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 188 transitions. Word has length 186 [2018-07-25 13:38:13,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:38:13,023 INFO L472 AbstractCegarLoop]: Abstraction has 188 states and 188 transitions. [2018-07-25 13:38:13,023 INFO L473 AbstractCegarLoop]: Interpolant automaton has 186 states. [2018-07-25 13:38:13,023 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 188 transitions. [2018-07-25 13:38:13,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-07-25 13:38:13,023 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:38:13,023 INFO L354 BasicCegarLoop]: trace histogram [184, 1, 1, 1] [2018-07-25 13:38:13,024 INFO L415 AbstractCegarLoop]: === Iteration 185 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:38:13,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1263252896, now seen corresponding path program 184 times [2018-07-25 13:38:13,024 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:38:13,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:38:15,158 INFO L134 CoverageAnalysis]: Checked inductivity of 17020 backedges. 0 proven. 17020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:38:15,158 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:38:15,158 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [186] total 186 [2018-07-25 13:38:15,158 INFO L451 AbstractCegarLoop]: Interpolant automaton has 187 states [2018-07-25 13:38:15,161 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 187 interpolants. [2018-07-25 13:38:15,162 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17391, Invalid=17391, Unknown=0, NotChecked=0, Total=34782 [2018-07-25 13:38:15,162 INFO L87 Difference]: Start difference. First operand 188 states and 188 transitions. Second operand 187 states. [2018-07-25 13:38:15,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:38:15,762 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-07-25 13:38:15,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 187 states. [2018-07-25 13:38:15,762 INFO L78 Accepts]: Start accepts. Automaton has 187 states. Word has length 187 [2018-07-25 13:38:15,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:38:15,763 INFO L225 Difference]: With dead ends: 191 [2018-07-25 13:38:15,763 INFO L226 Difference]: Without dead ends: 189 [2018-07-25 13:38:15,765 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=17391, Invalid=17391, Unknown=0, NotChecked=0, Total=34782 [2018-07-25 13:38:15,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-07-25 13:38:15,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2018-07-25 13:38:15,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-07-25 13:38:15,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2018-07-25 13:38:15,774 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 187 [2018-07-25 13:38:15,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:38:15,774 INFO L472 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2018-07-25 13:38:15,774 INFO L473 AbstractCegarLoop]: Interpolant automaton has 187 states. [2018-07-25 13:38:15,774 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2018-07-25 13:38:15,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-07-25 13:38:15,775 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:38:15,775 INFO L354 BasicCegarLoop]: trace histogram [185, 1, 1, 1] [2018-07-25 13:38:15,775 INFO L415 AbstractCegarLoop]: === Iteration 186 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:38:15,775 INFO L82 PathProgramCache]: Analyzing trace with hash -506137978, now seen corresponding path program 185 times [2018-07-25 13:38:15,775 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:38:16,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:38:17,929 INFO L134 CoverageAnalysis]: Checked inductivity of 17205 backedges. 0 proven. 17205 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:38:17,929 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:38:17,929 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [187] total 187 [2018-07-25 13:38:17,930 INFO L451 AbstractCegarLoop]: Interpolant automaton has 188 states [2018-07-25 13:38:17,932 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 188 interpolants. [2018-07-25 13:38:17,933 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-07-25 13:38:17,933 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 188 states. [2018-07-25 13:38:18,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:38:18,830 INFO L93 Difference]: Finished difference Result 192 states and 192 transitions. [2018-07-25 13:38:18,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 188 states. [2018-07-25 13:38:18,830 INFO L78 Accepts]: Start accepts. Automaton has 188 states. Word has length 188 [2018-07-25 13:38:18,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:38:18,831 INFO L225 Difference]: With dead ends: 192 [2018-07-25 13:38:18,831 INFO L226 Difference]: Without dead ends: 190 [2018-07-25 13:38:18,832 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=17578, Invalid=17578, Unknown=0, NotChecked=0, Total=35156 [2018-07-25 13:38:18,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-07-25 13:38:18,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2018-07-25 13:38:18,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-07-25 13:38:18,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 190 transitions. [2018-07-25 13:38:18,842 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 190 transitions. Word has length 188 [2018-07-25 13:38:18,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:38:18,842 INFO L472 AbstractCegarLoop]: Abstraction has 190 states and 190 transitions. [2018-07-25 13:38:18,842 INFO L473 AbstractCegarLoop]: Interpolant automaton has 188 states. [2018-07-25 13:38:18,842 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 190 transitions. [2018-07-25 13:38:18,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-07-25 13:38:18,843 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:38:18,843 INFO L354 BasicCegarLoop]: trace histogram [186, 1, 1, 1] [2018-07-25 13:38:18,843 INFO L415 AbstractCegarLoop]: === Iteration 187 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:38:18,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1489588000, now seen corresponding path program 186 times [2018-07-25 13:38:18,843 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:38:19,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:38:20,963 INFO L134 CoverageAnalysis]: Checked inductivity of 17391 backedges. 0 proven. 17391 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:38:20,964 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:38:20,964 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [188] total 188 [2018-07-25 13:38:20,964 INFO L451 AbstractCegarLoop]: Interpolant automaton has 189 states [2018-07-25 13:38:20,966 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 189 interpolants. [2018-07-25 13:38:20,967 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17766, Invalid=17766, Unknown=0, NotChecked=0, Total=35532 [2018-07-25 13:38:20,967 INFO L87 Difference]: Start difference. First operand 190 states and 190 transitions. Second operand 189 states. [2018-07-25 13:38:21,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:38:21,409 INFO L93 Difference]: Finished difference Result 193 states and 193 transitions. [2018-07-25 13:38:21,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 189 states. [2018-07-25 13:38:21,409 INFO L78 Accepts]: Start accepts. Automaton has 189 states. Word has length 189 [2018-07-25 13:38:21,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:38:21,409 INFO L225 Difference]: With dead ends: 193 [2018-07-25 13:38:21,409 INFO L226 Difference]: Without dead ends: 191 [2018-07-25 13:38:21,411 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 187 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=17766, Invalid=17766, Unknown=0, NotChecked=0, Total=35532 [2018-07-25 13:38:21,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-07-25 13:38:21,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-07-25 13:38:21,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-07-25 13:38:21,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2018-07-25 13:38:21,420 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 189 [2018-07-25 13:38:21,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:38:21,420 INFO L472 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2018-07-25 13:38:21,420 INFO L473 AbstractCegarLoop]: Interpolant automaton has 189 states. [2018-07-25 13:38:21,420 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2018-07-25 13:38:21,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-07-25 13:38:21,420 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:38:21,421 INFO L354 BasicCegarLoop]: trace histogram [187, 1, 1, 1] [2018-07-25 13:38:21,421 INFO L415 AbstractCegarLoop]: === Iteration 188 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:38:21,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1067416122, now seen corresponding path program 187 times [2018-07-25 13:38:21,421 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:38:21,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:38:23,551 INFO L134 CoverageAnalysis]: Checked inductivity of 17578 backedges. 0 proven. 17578 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:38:23,551 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:38:23,551 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [189] total 189 [2018-07-25 13:38:23,552 INFO L451 AbstractCegarLoop]: Interpolant automaton has 190 states [2018-07-25 13:38:23,554 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 190 interpolants. [2018-07-25 13:38:23,556 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-07-25 13:38:23,556 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 190 states. [2018-07-25 13:38:23,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:38:23,891 INFO L93 Difference]: Finished difference Result 194 states and 194 transitions. [2018-07-25 13:38:23,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2018-07-25 13:38:23,891 INFO L78 Accepts]: Start accepts. Automaton has 190 states. Word has length 190 [2018-07-25 13:38:23,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:38:23,892 INFO L225 Difference]: With dead ends: 194 [2018-07-25 13:38:23,892 INFO L226 Difference]: Without dead ends: 192 [2018-07-25 13:38:23,893 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=17955, Invalid=17955, Unknown=0, NotChecked=0, Total=35910 [2018-07-25 13:38:23,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-07-25 13:38:23,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2018-07-25 13:38:23,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-07-25 13:38:23,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 192 transitions. [2018-07-25 13:38:23,902 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 192 transitions. Word has length 190 [2018-07-25 13:38:23,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:38:23,903 INFO L472 AbstractCegarLoop]: Abstraction has 192 states and 192 transitions. [2018-07-25 13:38:23,903 INFO L473 AbstractCegarLoop]: Interpolant automaton has 190 states. [2018-07-25 13:38:23,903 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 192 transitions. [2018-07-25 13:38:23,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-07-25 13:38:23,903 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:38:23,903 INFO L354 BasicCegarLoop]: trace histogram [188, 1, 1, 1] [2018-07-25 13:38:23,903 INFO L415 AbstractCegarLoop]: === Iteration 189 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:38:23,904 INFO L82 PathProgramCache]: Analyzing trace with hash 1269834720, now seen corresponding path program 188 times [2018-07-25 13:38:23,904 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:38:24,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:38:26,407 INFO L134 CoverageAnalysis]: Checked inductivity of 17766 backedges. 0 proven. 17766 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:38:26,408 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:38:26,408 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [190] total 190 [2018-07-25 13:38:26,408 INFO L451 AbstractCegarLoop]: Interpolant automaton has 191 states [2018-07-25 13:38:26,411 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 191 interpolants. [2018-07-25 13:38:26,413 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18145, Invalid=18145, Unknown=0, NotChecked=0, Total=36290 [2018-07-25 13:38:26,413 INFO L87 Difference]: Start difference. First operand 192 states and 192 transitions. Second operand 191 states. [2018-07-25 13:38:27,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:38:27,472 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-07-25 13:38:27,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 191 states. [2018-07-25 13:38:27,472 INFO L78 Accepts]: Start accepts. Automaton has 191 states. Word has length 191 [2018-07-25 13:38:27,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:38:27,473 INFO L225 Difference]: With dead ends: 195 [2018-07-25 13:38:27,473 INFO L226 Difference]: Without dead ends: 193 [2018-07-25 13:38:27,475 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=18145, Invalid=18145, Unknown=0, NotChecked=0, Total=36290 [2018-07-25 13:38:27,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-07-25 13:38:27,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2018-07-25 13:38:27,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-07-25 13:38:27,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2018-07-25 13:38:27,491 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 191 [2018-07-25 13:38:27,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:38:27,491 INFO L472 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2018-07-25 13:38:27,491 INFO L473 AbstractCegarLoop]: Interpolant automaton has 191 states. [2018-07-25 13:38:27,492 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2018-07-25 13:38:27,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-07-25 13:38:27,492 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:38:27,492 INFO L354 BasicCegarLoop]: trace histogram [189, 1, 1, 1] [2018-07-25 13:38:27,493 INFO L415 AbstractCegarLoop]: === Iteration 190 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:38:27,493 INFO L82 PathProgramCache]: Analyzing trace with hash 710166790, now seen corresponding path program 189 times [2018-07-25 13:38:27,493 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:38:27,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:38:29,939 INFO L134 CoverageAnalysis]: Checked inductivity of 17955 backedges. 0 proven. 17955 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:38:29,939 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:38:29,939 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [191] total 191 [2018-07-25 13:38:29,940 INFO L451 AbstractCegarLoop]: Interpolant automaton has 192 states [2018-07-25 13:38:29,942 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 192 interpolants. [2018-07-25 13:38:29,943 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-07-25 13:38:29,943 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 192 states. [2018-07-25 13:38:30,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:38:30,870 INFO L93 Difference]: Finished difference Result 196 states and 196 transitions. [2018-07-25 13:38:30,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2018-07-25 13:38:30,870 INFO L78 Accepts]: Start accepts. Automaton has 192 states. Word has length 192 [2018-07-25 13:38:30,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:38:30,871 INFO L225 Difference]: With dead ends: 196 [2018-07-25 13:38:30,871 INFO L226 Difference]: Without dead ends: 194 [2018-07-25 13:38:30,872 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=18336, Invalid=18336, Unknown=0, NotChecked=0, Total=36672 [2018-07-25 13:38:30,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-07-25 13:38:30,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2018-07-25 13:38:30,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-07-25 13:38:30,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 194 transitions. [2018-07-25 13:38:30,885 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 194 transitions. Word has length 192 [2018-07-25 13:38:30,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:38:30,885 INFO L472 AbstractCegarLoop]: Abstraction has 194 states and 194 transitions. [2018-07-25 13:38:30,885 INFO L473 AbstractCegarLoop]: Interpolant automaton has 192 states. [2018-07-25 13:38:30,885 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 194 transitions. [2018-07-25 13:38:30,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-07-25 13:38:30,885 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:38:30,885 INFO L354 BasicCegarLoop]: trace histogram [190, 1, 1, 1] [2018-07-25 13:38:30,886 INFO L415 AbstractCegarLoop]: === Iteration 191 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:38:30,886 INFO L82 PathProgramCache]: Analyzing trace with hash 540330144, now seen corresponding path program 190 times [2018-07-25 13:38:30,886 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:38:31,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:38:33,082 INFO L134 CoverageAnalysis]: Checked inductivity of 18145 backedges. 0 proven. 18145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:38:33,082 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:38:33,082 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [192] total 192 [2018-07-25 13:38:33,083 INFO L451 AbstractCegarLoop]: Interpolant automaton has 193 states [2018-07-25 13:38:33,084 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 193 interpolants. [2018-07-25 13:38:33,085 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18528, Invalid=18528, Unknown=0, NotChecked=0, Total=37056 [2018-07-25 13:38:33,085 INFO L87 Difference]: Start difference. First operand 194 states and 194 transitions. Second operand 193 states. [2018-07-25 13:38:33,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:38:33,675 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2018-07-25 13:38:33,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 193 states. [2018-07-25 13:38:33,676 INFO L78 Accepts]: Start accepts. Automaton has 193 states. Word has length 193 [2018-07-25 13:38:33,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:38:33,676 INFO L225 Difference]: With dead ends: 197 [2018-07-25 13:38:33,676 INFO L226 Difference]: Without dead ends: 195 [2018-07-25 13:38:33,677 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=18528, Invalid=18528, Unknown=0, NotChecked=0, Total=37056 [2018-07-25 13:38:33,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-07-25 13:38:33,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2018-07-25 13:38:33,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-07-25 13:38:33,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 195 transitions. [2018-07-25 13:38:33,685 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 195 transitions. Word has length 193 [2018-07-25 13:38:33,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:38:33,686 INFO L472 AbstractCegarLoop]: Abstraction has 195 states and 195 transitions. [2018-07-25 13:38:33,686 INFO L473 AbstractCegarLoop]: Interpolant automaton has 193 states. [2018-07-25 13:38:33,686 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 195 transitions. [2018-07-25 13:38:33,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-07-25 13:38:33,686 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:38:33,686 INFO L354 BasicCegarLoop]: trace histogram [191, 1, 1, 1] [2018-07-25 13:38:33,686 INFO L415 AbstractCegarLoop]: === Iteration 192 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:38:33,687 INFO L82 PathProgramCache]: Analyzing trace with hash -429638586, now seen corresponding path program 191 times [2018-07-25 13:38:33,687 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:38:33,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:38:35,807 INFO L134 CoverageAnalysis]: Checked inductivity of 18336 backedges. 0 proven. 18336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:38:35,809 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:38:35,809 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [193] total 193 [2018-07-25 13:38:35,809 INFO L451 AbstractCegarLoop]: Interpolant automaton has 194 states [2018-07-25 13:38:35,812 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 194 interpolants. [2018-07-25 13:38:35,813 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-07-25 13:38:35,814 INFO L87 Difference]: Start difference. First operand 195 states and 195 transitions. Second operand 194 states. [2018-07-25 13:38:36,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:38:36,135 INFO L93 Difference]: Finished difference Result 198 states and 198 transitions. [2018-07-25 13:38:36,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 194 states. [2018-07-25 13:38:36,135 INFO L78 Accepts]: Start accepts. Automaton has 194 states. Word has length 194 [2018-07-25 13:38:36,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:38:36,135 INFO L225 Difference]: With dead ends: 198 [2018-07-25 13:38:36,135 INFO L226 Difference]: Without dead ends: 196 [2018-07-25 13:38:36,137 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=18721, Invalid=18721, Unknown=0, NotChecked=0, Total=37442 [2018-07-25 13:38:36,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-07-25 13:38:36,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2018-07-25 13:38:36,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-07-25 13:38:36,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2018-07-25 13:38:36,146 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 194 [2018-07-25 13:38:36,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:38:36,147 INFO L472 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2018-07-25 13:38:36,147 INFO L473 AbstractCegarLoop]: Interpolant automaton has 194 states. [2018-07-25 13:38:36,147 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2018-07-25 13:38:36,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-07-25 13:38:36,147 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:38:36,147 INFO L354 BasicCegarLoop]: trace histogram [192, 1, 1, 1] [2018-07-25 13:38:36,148 INFO L415 AbstractCegarLoop]: === Iteration 193 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:38:36,148 INFO L82 PathProgramCache]: Analyzing trace with hash -433898144, now seen corresponding path program 192 times [2018-07-25 13:38:36,148 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:38:36,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:38:38,290 INFO L134 CoverageAnalysis]: Checked inductivity of 18528 backedges. 0 proven. 18528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:38:38,291 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:38:38,291 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [194] total 194 [2018-07-25 13:38:38,291 INFO L451 AbstractCegarLoop]: Interpolant automaton has 195 states [2018-07-25 13:38:38,294 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 195 interpolants. [2018-07-25 13:38:38,295 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18915, Invalid=18915, Unknown=0, NotChecked=0, Total=37830 [2018-07-25 13:38:38,295 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 195 states. [2018-07-25 13:38:38,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:38:38,645 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2018-07-25 13:38:38,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2018-07-25 13:38:38,646 INFO L78 Accepts]: Start accepts. Automaton has 195 states. Word has length 195 [2018-07-25 13:38:38,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:38:38,646 INFO L225 Difference]: With dead ends: 199 [2018-07-25 13:38:38,646 INFO L226 Difference]: Without dead ends: 197 [2018-07-25 13:38:38,648 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=18915, Invalid=18915, Unknown=0, NotChecked=0, Total=37830 [2018-07-25 13:38:38,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-07-25 13:38:38,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2018-07-25 13:38:38,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-07-25 13:38:38,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2018-07-25 13:38:38,657 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 195 [2018-07-25 13:38:38,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:38:38,657 INFO L472 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2018-07-25 13:38:38,657 INFO L473 AbstractCegarLoop]: Interpolant automaton has 195 states. [2018-07-25 13:38:38,658 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2018-07-25 13:38:38,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-07-25 13:38:38,658 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:38:38,658 INFO L354 BasicCegarLoop]: trace histogram [193, 1, 1, 1] [2018-07-25 13:38:38,658 INFO L415 AbstractCegarLoop]: === Iteration 194 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:38:38,658 INFO L82 PathProgramCache]: Analyzing trace with hash -565944442, now seen corresponding path program 193 times [2018-07-25 13:38:38,658 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:38:38,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:38:40,883 INFO L134 CoverageAnalysis]: Checked inductivity of 18721 backedges. 0 proven. 18721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:38:40,884 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:38:40,884 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [195] total 195 [2018-07-25 13:38:40,884 INFO L451 AbstractCegarLoop]: Interpolant automaton has 196 states [2018-07-25 13:38:40,886 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 196 interpolants. [2018-07-25 13:38:40,887 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-07-25 13:38:40,887 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 196 states. [2018-07-25 13:38:41,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:38:41,703 INFO L93 Difference]: Finished difference Result 200 states and 200 transitions. [2018-07-25 13:38:41,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 196 states. [2018-07-25 13:38:41,703 INFO L78 Accepts]: Start accepts. Automaton has 196 states. Word has length 196 [2018-07-25 13:38:41,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:38:41,704 INFO L225 Difference]: With dead ends: 200 [2018-07-25 13:38:41,704 INFO L226 Difference]: Without dead ends: 198 [2018-07-25 13:38:41,705 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=19110, Invalid=19110, Unknown=0, NotChecked=0, Total=38220 [2018-07-25 13:38:41,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-07-25 13:38:41,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2018-07-25 13:38:41,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-07-25 13:38:41,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 198 transitions. [2018-07-25 13:38:41,721 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 198 transitions. Word has length 196 [2018-07-25 13:38:41,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:38:41,721 INFO L472 AbstractCegarLoop]: Abstraction has 198 states and 198 transitions. [2018-07-25 13:38:41,721 INFO L473 AbstractCegarLoop]: Interpolant automaton has 196 states. [2018-07-25 13:38:41,721 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 198 transitions. [2018-07-25 13:38:41,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-07-25 13:38:41,722 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:38:41,722 INFO L354 BasicCegarLoop]: trace histogram [194, 1, 1, 1] [2018-07-25 13:38:41,722 INFO L415 AbstractCegarLoop]: === Iteration 195 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:38:41,722 INFO L82 PathProgramCache]: Analyzing trace with hash -364412384, now seen corresponding path program 194 times [2018-07-25 13:38:41,722 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:38:42,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:38:44,307 INFO L134 CoverageAnalysis]: Checked inductivity of 18915 backedges. 0 proven. 18915 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:38:44,308 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:38:44,308 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [196] total 196 [2018-07-25 13:38:44,308 INFO L451 AbstractCegarLoop]: Interpolant automaton has 197 states [2018-07-25 13:38:44,311 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 197 interpolants. [2018-07-25 13:38:44,312 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19306, Invalid=19306, Unknown=0, NotChecked=0, Total=38612 [2018-07-25 13:38:44,312 INFO L87 Difference]: Start difference. First operand 198 states and 198 transitions. Second operand 197 states. [2018-07-25 13:38:45,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:38:45,317 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2018-07-25 13:38:45,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 197 states. [2018-07-25 13:38:45,317 INFO L78 Accepts]: Start accepts. Automaton has 197 states. Word has length 197 [2018-07-25 13:38:45,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:38:45,318 INFO L225 Difference]: With dead ends: 201 [2018-07-25 13:38:45,318 INFO L226 Difference]: Without dead ends: 199 [2018-07-25 13:38:45,318 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=19306, Invalid=19306, Unknown=0, NotChecked=0, Total=38612 [2018-07-25 13:38:45,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-07-25 13:38:45,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2018-07-25 13:38:45,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-07-25 13:38:45,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 199 transitions. [2018-07-25 13:38:45,327 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 199 transitions. Word has length 197 [2018-07-25 13:38:45,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:38:45,328 INFO L472 AbstractCegarLoop]: Abstraction has 199 states and 199 transitions. [2018-07-25 13:38:45,328 INFO L473 AbstractCegarLoop]: Interpolant automaton has 197 states. [2018-07-25 13:38:45,328 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 199 transitions. [2018-07-25 13:38:45,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-07-25 13:38:45,328 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:38:45,328 INFO L354 BasicCegarLoop]: trace histogram [195, 1, 1, 1] [2018-07-25 13:38:45,328 INFO L415 AbstractCegarLoop]: === Iteration 196 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:38:45,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1588114118, now seen corresponding path program 195 times [2018-07-25 13:38:45,329 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:38:45,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:38:47,516 INFO L134 CoverageAnalysis]: Checked inductivity of 19110 backedges. 0 proven. 19110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:38:47,517 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:38:47,517 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [197] total 197 [2018-07-25 13:38:47,517 INFO L451 AbstractCegarLoop]: Interpolant automaton has 198 states [2018-07-25 13:38:47,519 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 198 interpolants. [2018-07-25 13:38:47,520 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-07-25 13:38:47,520 INFO L87 Difference]: Start difference. First operand 199 states and 199 transitions. Second operand 198 states. [2018-07-25 13:38:48,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:38:48,701 INFO L93 Difference]: Finished difference Result 202 states and 202 transitions. [2018-07-25 13:38:48,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 198 states. [2018-07-25 13:38:48,702 INFO L78 Accepts]: Start accepts. Automaton has 198 states. Word has length 198 [2018-07-25 13:38:48,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:38:48,702 INFO L225 Difference]: With dead ends: 202 [2018-07-25 13:38:48,702 INFO L226 Difference]: Without dead ends: 200 [2018-07-25 13:38:48,704 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=19503, Invalid=19503, Unknown=0, NotChecked=0, Total=39006 [2018-07-25 13:38:48,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-07-25 13:38:48,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2018-07-25 13:38:48,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-07-25 13:38:48,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 200 transitions. [2018-07-25 13:38:48,714 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 200 transitions. Word has length 198 [2018-07-25 13:38:48,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:38:48,714 INFO L472 AbstractCegarLoop]: Abstraction has 200 states and 200 transitions. [2018-07-25 13:38:48,714 INFO L473 AbstractCegarLoop]: Interpolant automaton has 198 states. [2018-07-25 13:38:48,715 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 200 transitions. [2018-07-25 13:38:48,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-07-25 13:38:48,715 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:38:48,715 INFO L354 BasicCegarLoop]: trace histogram [196, 1, 1, 1] [2018-07-25 13:38:48,715 INFO L415 AbstractCegarLoop]: === Iteration 197 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:38:48,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1986893536, now seen corresponding path program 196 times [2018-07-25 13:38:48,715 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:38:49,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:38:51,223 INFO L134 CoverageAnalysis]: Checked inductivity of 19306 backedges. 0 proven. 19306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:38:51,224 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:38:51,224 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [198] total 198 [2018-07-25 13:38:51,224 INFO L451 AbstractCegarLoop]: Interpolant automaton has 199 states [2018-07-25 13:38:51,227 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 199 interpolants. [2018-07-25 13:38:51,228 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19701, Invalid=19701, Unknown=0, NotChecked=0, Total=39402 [2018-07-25 13:38:51,228 INFO L87 Difference]: Start difference. First operand 200 states and 200 transitions. Second operand 199 states. [2018-07-25 13:38:52,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:38:52,432 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2018-07-25 13:38:52,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 199 states. [2018-07-25 13:38:52,433 INFO L78 Accepts]: Start accepts. Automaton has 199 states. Word has length 199 [2018-07-25 13:38:52,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:38:52,433 INFO L225 Difference]: With dead ends: 203 [2018-07-25 13:38:52,434 INFO L226 Difference]: Without dead ends: 201 [2018-07-25 13:38:52,436 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=19701, Invalid=19701, Unknown=0, NotChecked=0, Total=39402 [2018-07-25 13:38:52,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-07-25 13:38:52,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2018-07-25 13:38:52,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-07-25 13:38:52,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2018-07-25 13:38:52,451 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 199 [2018-07-25 13:38:52,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:38:52,452 INFO L472 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2018-07-25 13:38:52,452 INFO L473 AbstractCegarLoop]: Interpolant automaton has 199 states. [2018-07-25 13:38:52,452 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2018-07-25 13:38:52,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-07-25 13:38:52,453 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:38:52,453 INFO L354 BasicCegarLoop]: trace histogram [197, 1, 1, 1] [2018-07-25 13:38:52,453 INFO L415 AbstractCegarLoop]: === Iteration 198 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:38:52,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1464153606, now seen corresponding path program 197 times [2018-07-25 13:38:52,453 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:38:52,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:38:55,080 INFO L134 CoverageAnalysis]: Checked inductivity of 19503 backedges. 0 proven. 19503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:38:55,080 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:38:55,080 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [199] total 199 [2018-07-25 13:38:55,081 INFO L451 AbstractCegarLoop]: Interpolant automaton has 200 states [2018-07-25 13:38:55,083 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 200 interpolants. [2018-07-25 13:38:55,084 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-07-25 13:38:55,084 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 200 states. [2018-07-25 13:38:56,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:38:56,301 INFO L93 Difference]: Finished difference Result 204 states and 204 transitions. [2018-07-25 13:38:56,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2018-07-25 13:38:56,302 INFO L78 Accepts]: Start accepts. Automaton has 200 states. Word has length 200 [2018-07-25 13:38:56,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:38:56,302 INFO L225 Difference]: With dead ends: 204 [2018-07-25 13:38:56,302 INFO L226 Difference]: Without dead ends: 202 [2018-07-25 13:38:56,304 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=19900, Invalid=19900, Unknown=0, NotChecked=0, Total=39800 [2018-07-25 13:38:56,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-07-25 13:38:56,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 202. [2018-07-25 13:38:56,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-07-25 13:38:56,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 202 transitions. [2018-07-25 13:38:56,314 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 202 transitions. Word has length 200 [2018-07-25 13:38:56,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:38:56,314 INFO L472 AbstractCegarLoop]: Abstraction has 202 states and 202 transitions. [2018-07-25 13:38:56,314 INFO L473 AbstractCegarLoop]: Interpolant automaton has 200 states. [2018-07-25 13:38:56,314 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 202 transitions. [2018-07-25 13:38:56,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-07-25 13:38:56,314 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:38:56,315 INFO L354 BasicCegarLoop]: trace histogram [198, 1, 1, 1] [2018-07-25 13:38:56,315 INFO L415 AbstractCegarLoop]: === Iteration 199 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:38:56,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1855882336, now seen corresponding path program 198 times [2018-07-25 13:38:56,315 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:38:56,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:38:58,909 INFO L134 CoverageAnalysis]: Checked inductivity of 19701 backedges. 0 proven. 19701 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:38:58,909 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:38:58,909 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [200] total 200 [2018-07-25 13:38:58,909 INFO L451 AbstractCegarLoop]: Interpolant automaton has 201 states [2018-07-25 13:38:58,911 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 201 interpolants. [2018-07-25 13:38:58,911 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20100, Invalid=20100, Unknown=0, NotChecked=0, Total=40200 [2018-07-25 13:38:58,912 INFO L87 Difference]: Start difference. First operand 202 states and 202 transitions. Second operand 201 states. [2018-07-25 13:38:59,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:38:59,773 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2018-07-25 13:38:59,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2018-07-25 13:38:59,773 INFO L78 Accepts]: Start accepts. Automaton has 201 states. Word has length 201 [2018-07-25 13:38:59,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:38:59,774 INFO L225 Difference]: With dead ends: 205 [2018-07-25 13:38:59,774 INFO L226 Difference]: Without dead ends: 203 [2018-07-25 13:38:59,775 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 199 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=20100, Invalid=20100, Unknown=0, NotChecked=0, Total=40200 [2018-07-25 13:38:59,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-07-25 13:38:59,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-07-25 13:38:59,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-07-25 13:38:59,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 203 transitions. [2018-07-25 13:38:59,784 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 203 transitions. Word has length 201 [2018-07-25 13:38:59,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:38:59,784 INFO L472 AbstractCegarLoop]: Abstraction has 203 states and 203 transitions. [2018-07-25 13:38:59,784 INFO L473 AbstractCegarLoop]: Interpolant automaton has 201 states. [2018-07-25 13:38:59,784 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 203 transitions. [2018-07-25 13:38:59,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-07-25 13:38:59,785 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:38:59,785 INFO L354 BasicCegarLoop]: trace histogram [199, 1, 1, 1] [2018-07-25 13:38:59,785 INFO L415 AbstractCegarLoop]: === Iteration 200 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:38:59,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1697781434, now seen corresponding path program 199 times [2018-07-25 13:38:59,785 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:39:00,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:39:02,075 INFO L134 CoverageAnalysis]: Checked inductivity of 19900 backedges. 0 proven. 19900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:39:02,075 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:39:02,075 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [201] total 201 [2018-07-25 13:39:02,075 INFO L451 AbstractCegarLoop]: Interpolant automaton has 202 states [2018-07-25 13:39:02,078 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 202 interpolants. [2018-07-25 13:39:02,079 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-07-25 13:39:02,079 INFO L87 Difference]: Start difference. First operand 203 states and 203 transitions. Second operand 202 states. [2018-07-25 13:39:02,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:39:02,929 INFO L93 Difference]: Finished difference Result 206 states and 206 transitions. [2018-07-25 13:39:02,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2018-07-25 13:39:02,929 INFO L78 Accepts]: Start accepts. Automaton has 202 states. Word has length 202 [2018-07-25 13:39:02,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:39:02,930 INFO L225 Difference]: With dead ends: 206 [2018-07-25 13:39:02,930 INFO L226 Difference]: Without dead ends: 204 [2018-07-25 13:39:02,931 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=20301, Invalid=20301, Unknown=0, NotChecked=0, Total=40602 [2018-07-25 13:39:02,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-07-25 13:39:02,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2018-07-25 13:39:02,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-07-25 13:39:02,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 204 transitions. [2018-07-25 13:39:02,941 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 204 transitions. Word has length 202 [2018-07-25 13:39:02,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:39:02,941 INFO L472 AbstractCegarLoop]: Abstraction has 204 states and 204 transitions. [2018-07-25 13:39:02,941 INFO L473 AbstractCegarLoop]: Interpolant automaton has 202 states. [2018-07-25 13:39:02,941 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 204 transitions. [2018-07-25 13:39:02,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-07-25 13:39:02,941 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:39:02,941 INFO L354 BasicCegarLoop]: trace histogram [200, 1, 1, 1] [2018-07-25 13:39:02,942 INFO L415 AbstractCegarLoop]: === Iteration 201 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:39:02,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1091620768, now seen corresponding path program 200 times [2018-07-25 13:39:02,942 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:39:03,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:39:05,280 INFO L134 CoverageAnalysis]: Checked inductivity of 20100 backedges. 0 proven. 20100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:39:05,281 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:39:05,281 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [202] total 202 [2018-07-25 13:39:05,281 INFO L451 AbstractCegarLoop]: Interpolant automaton has 203 states [2018-07-25 13:39:05,283 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 203 interpolants. [2018-07-25 13:39:05,284 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20503, Invalid=20503, Unknown=0, NotChecked=0, Total=41006 [2018-07-25 13:39:05,285 INFO L87 Difference]: Start difference. First operand 204 states and 204 transitions. Second operand 203 states. [2018-07-25 13:39:06,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:39:06,134 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2018-07-25 13:39:06,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 203 states. [2018-07-25 13:39:06,134 INFO L78 Accepts]: Start accepts. Automaton has 203 states. Word has length 203 [2018-07-25 13:39:06,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:39:06,135 INFO L225 Difference]: With dead ends: 207 [2018-07-25 13:39:06,135 INFO L226 Difference]: Without dead ends: 205 [2018-07-25 13:39:06,136 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=20503, Invalid=20503, Unknown=0, NotChecked=0, Total=41006 [2018-07-25 13:39:06,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-07-25 13:39:06,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2018-07-25 13:39:06,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-07-25 13:39:06,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2018-07-25 13:39:06,146 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 203 [2018-07-25 13:39:06,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:39:06,146 INFO L472 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2018-07-25 13:39:06,146 INFO L473 AbstractCegarLoop]: Interpolant automaton has 203 states. [2018-07-25 13:39:06,146 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2018-07-25 13:39:06,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-07-25 13:39:06,146 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:39:06,147 INFO L354 BasicCegarLoop]: trace histogram [201, 1, 1, 1] [2018-07-25 13:39:06,147 INFO L415 AbstractCegarLoop]: === Iteration 202 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:39:06,147 INFO L82 PathProgramCache]: Analyzing trace with hash 519490694, now seen corresponding path program 201 times [2018-07-25 13:39:06,147 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:39:06,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:39:08,497 INFO L134 CoverageAnalysis]: Checked inductivity of 20301 backedges. 0 proven. 20301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:39:08,497 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:39:08,497 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [203] total 203 [2018-07-25 13:39:08,497 INFO L451 AbstractCegarLoop]: Interpolant automaton has 204 states [2018-07-25 13:39:08,500 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 204 interpolants. [2018-07-25 13:39:08,501 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-07-25 13:39:08,501 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 204 states. [2018-07-25 13:39:09,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:39:09,513 INFO L93 Difference]: Finished difference Result 208 states and 208 transitions. [2018-07-25 13:39:09,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 204 states. [2018-07-25 13:39:09,513 INFO L78 Accepts]: Start accepts. Automaton has 204 states. Word has length 204 [2018-07-25 13:39:09,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:39:09,514 INFO L225 Difference]: With dead ends: 208 [2018-07-25 13:39:09,514 INFO L226 Difference]: Without dead ends: 206 [2018-07-25 13:39:09,515 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=20706, Invalid=20706, Unknown=0, NotChecked=0, Total=41412 [2018-07-25 13:39:09,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-07-25 13:39:09,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2018-07-25 13:39:09,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-07-25 13:39:09,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 206 transitions. [2018-07-25 13:39:09,524 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 206 transitions. Word has length 204 [2018-07-25 13:39:09,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:39:09,524 INFO L472 AbstractCegarLoop]: Abstraction has 206 states and 206 transitions. [2018-07-25 13:39:09,524 INFO L473 AbstractCegarLoop]: Interpolant automaton has 204 states. [2018-07-25 13:39:09,525 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 206 transitions. [2018-07-25 13:39:09,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-07-25 13:39:09,525 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:39:09,525 INFO L354 BasicCegarLoop]: trace histogram [202, 1, 1, 1] [2018-07-25 13:39:09,525 INFO L415 AbstractCegarLoop]: === Iteration 203 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:39:09,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1075661536, now seen corresponding path program 202 times [2018-07-25 13:39:09,525 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:39:09,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:39:11,961 INFO L134 CoverageAnalysis]: Checked inductivity of 20503 backedges. 0 proven. 20503 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:39:11,961 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:39:11,961 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [204] total 204 [2018-07-25 13:39:11,961 INFO L451 AbstractCegarLoop]: Interpolant automaton has 205 states [2018-07-25 13:39:11,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 205 interpolants. [2018-07-25 13:39:11,964 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20910, Invalid=20910, Unknown=0, NotChecked=0, Total=41820 [2018-07-25 13:39:11,964 INFO L87 Difference]: Start difference. First operand 206 states and 206 transitions. Second operand 205 states. [2018-07-25 13:39:12,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:39:12,914 INFO L93 Difference]: Finished difference Result 209 states and 209 transitions. [2018-07-25 13:39:12,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 205 states. [2018-07-25 13:39:12,914 INFO L78 Accepts]: Start accepts. Automaton has 205 states. Word has length 205 [2018-07-25 13:39:12,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:39:12,915 INFO L225 Difference]: With dead ends: 209 [2018-07-25 13:39:12,915 INFO L226 Difference]: Without dead ends: 207 [2018-07-25 13:39:12,916 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 203 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=20910, Invalid=20910, Unknown=0, NotChecked=0, Total=41820 [2018-07-25 13:39:12,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-07-25 13:39:12,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2018-07-25 13:39:12,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-07-25 13:39:12,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 207 transitions. [2018-07-25 13:39:12,925 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 207 transitions. Word has length 205 [2018-07-25 13:39:12,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:39:12,926 INFO L472 AbstractCegarLoop]: Abstraction has 207 states and 207 transitions. [2018-07-25 13:39:12,926 INFO L473 AbstractCegarLoop]: Interpolant automaton has 205 states. [2018-07-25 13:39:12,926 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 207 transitions. [2018-07-25 13:39:12,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-07-25 13:39:12,926 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:39:12,926 INFO L354 BasicCegarLoop]: trace histogram [203, 1, 1, 1] [2018-07-25 13:39:12,926 INFO L415 AbstractCegarLoop]: === Iteration 204 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:39:12,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1014226886, now seen corresponding path program 203 times [2018-07-25 13:39:12,927 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:39:13,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:39:15,547 INFO L134 CoverageAnalysis]: Checked inductivity of 20706 backedges. 0 proven. 20706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:39:15,547 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:39:15,547 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [205] total 205 [2018-07-25 13:39:15,548 INFO L451 AbstractCegarLoop]: Interpolant automaton has 206 states [2018-07-25 13:39:15,551 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 206 interpolants. [2018-07-25 13:39:15,552 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-07-25 13:39:15,552 INFO L87 Difference]: Start difference. First operand 207 states and 207 transitions. Second operand 206 states. [2018-07-25 13:39:16,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:39:16,937 INFO L93 Difference]: Finished difference Result 210 states and 210 transitions. [2018-07-25 13:39:16,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 206 states. [2018-07-25 13:39:16,937 INFO L78 Accepts]: Start accepts. Automaton has 206 states. Word has length 206 [2018-07-25 13:39:16,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:39:16,937 INFO L225 Difference]: With dead ends: 210 [2018-07-25 13:39:16,937 INFO L226 Difference]: Without dead ends: 208 [2018-07-25 13:39:16,938 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=21115, Invalid=21115, Unknown=0, NotChecked=0, Total=42230 [2018-07-25 13:39:16,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-07-25 13:39:16,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2018-07-25 13:39:16,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-07-25 13:39:16,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 208 transitions. [2018-07-25 13:39:16,949 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 208 transitions. Word has length 206 [2018-07-25 13:39:16,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:39:16,950 INFO L472 AbstractCegarLoop]: Abstraction has 208 states and 208 transitions. [2018-07-25 13:39:16,950 INFO L473 AbstractCegarLoop]: Interpolant automaton has 206 states. [2018-07-25 13:39:16,950 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 208 transitions. [2018-07-25 13:39:16,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-07-25 13:39:16,950 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:39:16,950 INFO L354 BasicCegarLoop]: trace histogram [204, 1, 1, 1] [2018-07-25 13:39:16,950 INFO L415 AbstractCegarLoop]: === Iteration 205 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:39:16,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1376258528, now seen corresponding path program 204 times [2018-07-25 13:39:16,951 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:39:17,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2018-07-25 13:39:18,403 WARN L541 AbstractCegarLoop]: Verification canceled [2018-07-25 13:39:18,410 WARN L202 ceAbstractionStarter]: Timeout [2018-07-25 13:39:18,410 INFO L202 PluginConnector]: Adding new model Sandman01.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.07 01:39:18 BoogieIcfgContainer [2018-07-25 13:39:18,410 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-25 13:39:18,411 INFO L168 Benchmark]: Toolchain (without parser) took 249299.27 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 1.9 GB). Free memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: -414.7 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-07-25 13:39:18,414 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 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-07-25 13:39:18,420 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.34 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-07-25 13:39:18,420 INFO L168 Benchmark]: Boogie Preprocessor took 31.40 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-07-25 13:39:18,420 INFO L168 Benchmark]: RCFGBuilder took 253.31 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-07-25 13:39:18,421 INFO L168 Benchmark]: TraceAbstraction took 248958.49 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 1.9 GB). Free memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: -425.3 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-07-25 13:39:18,425 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.22 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 50.34 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 31.40 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 253.31 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 248958.49 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 1.9 GB). Free memory was 1.5 GB in the beginning and 1.9 GB in the end (delta: -425.3 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 30]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 30). Cancelled while BasicCegarLoop was analyzing trace of length 208 with TraceHistMax 204, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 146 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. TIMEOUT Result, 248.8s OverallTime, 205 OverallIterations, 204 TraceHistogramMax, 45.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 614 SDtfs, 2 SDslu, 1 SDs, 0 SdLazy, 45441 SolverSat, 367 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 21114 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 20910 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 152.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=208occurred in iteration=204, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 204 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 24.4s SatisfiabilityAnalysisTime, 168.8s InterpolantComputationTime, 21318 NumberOfCodeBlocks, 21318 NumberOfCodeBlocksAsserted, 204 NumberOfCheckSat, 21114 ConstructedInterpolants, 0 QuantifiedInterpolants, 25886986 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 204 InterpolantComputations, 1 PerfectInterpolantSequences, 0/1414910 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/Sandman01.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-07-25_13-39-18-440.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Sandman01.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-25_13-39-18-440.csv Completed graceful shutdown