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/Luxembourg-ArraysIntegefied.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-e6fd87c [2018-07-25 13:31:14,288 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-25 13:31:14,291 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-25 13:31:14,304 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-25 13:31:14,304 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-25 13:31:14,305 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-25 13:31:14,307 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-25 13:31:14,308 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-25 13:31:14,310 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-25 13:31:14,311 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-25 13:31:14,312 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-25 13:31:14,312 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-25 13:31:14,313 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-25 13:31:14,314 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-25 13:31:14,315 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-25 13:31:14,316 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-25 13:31:14,317 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-25 13:31:14,318 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-25 13:31:14,320 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-25 13:31:14,322 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-25 13:31:14,323 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-25 13:31:14,324 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-25 13:31:14,327 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-25 13:31:14,327 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-25 13:31:14,327 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-25 13:31:14,328 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-25 13:31:14,329 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-25 13:31:14,330 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-25 13:31:14,331 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-25 13:31:14,334 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-25 13:31:14,334 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-25 13:31:14,335 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-25 13:31:14,335 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-25 13:31:14,335 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-25 13:31:14,338 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-25 13:31:14,338 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-25 13:31:14,339 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:31:14,356 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-25 13:31:14,356 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-25 13:31:14,358 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-25 13:31:14,358 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-25 13:31:14,358 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-25 13:31:14,359 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-25 13:31:14,359 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-25 13:31:14,359 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-25 13:31:14,410 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-25 13:31:14,426 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-25 13:31:14,432 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-25 13:31:14,433 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-25 13:31:14,434 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-25 13:31:14,435 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Luxembourg-ArraysIntegefied.bpl [2018-07-25 13:31:14,435 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/tooDifficultLoopInvariant/Luxembourg-ArraysIntegefied.bpl' [2018-07-25 13:31:14,493 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-25 13:31:14,495 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-07-25 13:31:14,496 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-25 13:31:14,496 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-25 13:31:14,496 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-25 13:31:14,513 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "Luxembourg-ArraysIntegefied.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:31:14" (1/1) ... [2018-07-25 13:31:14,523 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "Luxembourg-ArraysIntegefied.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:31:14" (1/1) ... [2018-07-25 13:31:14,527 WARN L165 Inliner]: Program contained no entry procedure! [2018-07-25 13:31:14,528 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-07-25 13:31:14,528 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-07-25 13:31:14,530 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-25 13:31:14,531 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-25 13:31:14,531 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-25 13:31:14,531 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-25 13:31:14,541 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "Luxembourg-ArraysIntegefied.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:31:14" (1/1) ... [2018-07-25 13:31:14,541 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "Luxembourg-ArraysIntegefied.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:31:14" (1/1) ... [2018-07-25 13:31:14,542 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "Luxembourg-ArraysIntegefied.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:31:14" (1/1) ... [2018-07-25 13:31:14,542 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "Luxembourg-ArraysIntegefied.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:31:14" (1/1) ... [2018-07-25 13:31:14,544 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "Luxembourg-ArraysIntegefied.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:31:14" (1/1) ... [2018-07-25 13:31:14,549 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "Luxembourg-ArraysIntegefied.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:31:14" (1/1) ... [2018-07-25 13:31:14,550 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "Luxembourg-ArraysIntegefied.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:31:14" (1/1) ... [2018-07-25 13:31:14,551 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-25 13:31:14,552 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-25 13:31:14,552 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-25 13:31:14,552 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-25 13:31:14,553 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Luxembourg-ArraysIntegefied.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:31:14" (1/1) ... [2018-07-25 13:31:14,636 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2018-07-25 13:31:14,636 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-07-25 13:31:14,636 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-07-25 13:31:14,867 INFO L270 CfgBuilder]: Using library mode [2018-07-25 13:31:14,868 INFO L202 PluginConnector]: Adding new model Luxembourg-ArraysIntegefied.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 01:31:14 BoogieIcfgContainer [2018-07-25 13:31:14,868 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-25 13:31:14,869 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-25 13:31:14,869 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-25 13:31:14,873 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-25 13:31:14,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Luxembourg-ArraysIntegefied.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:31:14" (1/2) ... [2018-07-25 13:31:14,875 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16eb8330 and model type Luxembourg-ArraysIntegefied.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.07 01:31:14, skipping insertion in model container [2018-07-25 13:31:14,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Luxembourg-ArraysIntegefied.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 01:31:14" (2/2) ... [2018-07-25 13:31:14,877 INFO L112 eAbstractionObserver]: Analyzing ICFG Luxembourg-ArraysIntegefied.bpl [2018-07-25 13:31:14,887 INFO L133 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-25 13:31:14,896 INFO L145 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-25 13:31:14,946 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-25 13:31:14,947 INFO L374 AbstractCegarLoop]: Interprodecural is true [2018-07-25 13:31:14,947 INFO L375 AbstractCegarLoop]: Hoare is true [2018-07-25 13:31:14,947 INFO L376 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-25 13:31:14,947 INFO L377 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-25 13:31:14,948 INFO L378 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-25 13:31:14,948 INFO L379 AbstractCegarLoop]: Difference is false [2018-07-25 13:31:14,948 INFO L380 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-25 13:31:14,948 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-25 13:31:14,964 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-07-25 13:31:14,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-07-25 13:31:14,973 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:14,974 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-07-25 13:31:14,976 INFO L415 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:14,985 INFO L82 PathProgramCache]: Analyzing trace with hash 75054, now seen corresponding path program 1 times [2018-07-25 13:31:14,992 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:15,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:15,133 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:31:15,138 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:31:15,138 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-25 13:31:15,144 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 13:31:15,161 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 13:31:15,162 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:31:15,168 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-07-25 13:31:15,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:15,216 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-07-25 13:31:15,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 13:31:15,221 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-07-25 13:31:15,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:15,238 INFO L225 Difference]: With dead ends: 13 [2018-07-25 13:31:15,239 INFO L226 Difference]: Without dead ends: 5 [2018-07-25 13:31:15,247 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:31:15,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-07-25 13:31:15,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-07-25 13:31:15,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-07-25 13:31:15,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-07-25 13:31:15,288 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-07-25 13:31:15,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:15,289 INFO L472 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-07-25 13:31:15,289 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 13:31:15,290 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-07-25 13:31:15,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-25 13:31:15,290 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:15,290 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-25 13:31:15,291 INFO L415 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:15,291 INFO L82 PathProgramCache]: Analyzing trace with hash 2342053, now seen corresponding path program 1 times [2018-07-25 13:31:15,291 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:15,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:15,357 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:31:15,359 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:15,360 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-07-25 13:31:15,365 INFO L451 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-25 13:31:15,365 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-25 13:31:15,366 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-25 13:31:15,369 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2018-07-25 13:31:15,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:15,432 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-07-25 13:31:15,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-25 13:31:15,432 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-07-25 13:31:15,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:15,433 INFO L225 Difference]: With dead ends: 8 [2018-07-25 13:31:15,433 INFO L226 Difference]: Without dead ends: 6 [2018-07-25 13:31:15,434 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-25 13:31:15,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-07-25 13:31:15,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-07-25 13:31:15,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-07-25 13:31:15,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-07-25 13:31:15,438 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-07-25 13:31:15,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:15,438 INFO L472 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-07-25 13:31:15,438 INFO L473 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-25 13:31:15,439 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-07-25 13:31:15,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-07-25 13:31:15,439 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:15,439 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-07-25 13:31:15,440 INFO L415 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:15,440 INFO L82 PathProgramCache]: Analyzing trace with hash 72619022, now seen corresponding path program 2 times [2018-07-25 13:31:15,440 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:15,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:15,523 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:31:15,524 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:15,524 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-25 13:31:15,524 INFO L451 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-25 13:31:15,525 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-25 13:31:15,525 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-25 13:31:15,532 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2018-07-25 13:31:15,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:15,638 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-07-25 13:31:15,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-25 13:31:15,639 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-07-25 13:31:15,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:15,640 INFO L225 Difference]: With dead ends: 9 [2018-07-25 13:31:15,640 INFO L226 Difference]: Without dead ends: 7 [2018-07-25 13:31:15,640 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:31:15,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-07-25 13:31:15,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-07-25 13:31:15,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-07-25 13:31:15,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-07-25 13:31:15,645 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-07-25 13:31:15,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:15,645 INFO L472 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-07-25 13:31:15,645 INFO L473 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-25 13:31:15,645 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-07-25 13:31:15,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 13:31:15,646 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:15,646 INFO L354 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-07-25 13:31:15,646 INFO L415 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:15,647 INFO L82 PathProgramCache]: Analyzing trace with hash -2043762235, now seen corresponding path program 3 times [2018-07-25 13:31:15,647 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:15,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:15,707 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:31:15,708 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:15,708 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-25 13:31:15,708 INFO L451 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-25 13:31:15,709 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-25 13:31:15,709 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-25 13:31:15,709 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-07-25 13:31:15,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:15,813 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-07-25 13:31:15,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-25 13:31:15,814 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-07-25 13:31:15,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:15,815 INFO L225 Difference]: With dead ends: 10 [2018-07-25 13:31:15,815 INFO L226 Difference]: Without dead ends: 8 [2018-07-25 13:31:15,817 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:31:15,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-07-25 13:31:15,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-07-25 13:31:15,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-07-25 13:31:15,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-07-25 13:31:15,828 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-07-25 13:31:15,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:15,831 INFO L472 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-07-25 13:31:15,832 INFO L473 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-25 13:31:15,832 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-07-25 13:31:15,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-07-25 13:31:15,832 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:15,833 INFO L354 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-07-25 13:31:15,833 INFO L415 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:15,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1067895534, now seen corresponding path program 4 times [2018-07-25 13:31:15,833 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:15,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:15,939 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:31:15,939 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:15,939 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 13:31:15,940 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:31:15,940 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:31:15,940 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:31:15,941 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2018-07-25 13:31:16,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:16,047 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-07-25 13:31:16,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-25 13:31:16,047 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-07-25 13:31:16,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:16,048 INFO L225 Difference]: With dead ends: 11 [2018-07-25 13:31:16,048 INFO L226 Difference]: Without dead ends: 9 [2018-07-25 13:31:16,049 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:31:16,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-07-25 13:31:16,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-07-25 13:31:16,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-07-25 13:31:16,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-07-25 13:31:16,062 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-07-25 13:31:16,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:16,062 INFO L472 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-07-25 13:31:16,063 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:31:16,063 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-07-25 13:31:16,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 13:31:16,063 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:16,064 INFO L354 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-07-25 13:31:16,064 INFO L415 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:16,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1254961435, now seen corresponding path program 5 times [2018-07-25 13:31:16,064 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:16,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:16,126 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:31:16,127 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:16,127 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:31:16,127 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:31:16,128 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:31:16,128 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:31:16,129 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2018-07-25 13:31:16,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:16,248 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-07-25 13:31:16,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-25 13:31:16,249 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-07-25 13:31:16,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:16,249 INFO L225 Difference]: With dead ends: 12 [2018-07-25 13:31:16,250 INFO L226 Difference]: Without dead ends: 10 [2018-07-25 13:31:16,251 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:31:16,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-07-25 13:31:16,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-07-25 13:31:16,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-07-25 13:31:16,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-07-25 13:31:16,256 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-07-25 13:31:16,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:16,257 INFO L472 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-07-25 13:31:16,257 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:31:16,257 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-07-25 13:31:16,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-07-25 13:31:16,258 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:16,258 INFO L354 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-07-25 13:31:16,258 INFO L415 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:16,258 INFO L82 PathProgramCache]: Analyzing trace with hash -249083442, now seen corresponding path program 6 times [2018-07-25 13:31:16,259 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:16,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:16,339 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:31:16,340 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:16,340 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 13:31:16,341 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:31:16,341 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:31:16,341 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:31:16,342 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2018-07-25 13:31:16,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:16,464 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-07-25 13:31:16,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-25 13:31:16,464 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-07-25 13:31:16,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:16,465 INFO L225 Difference]: With dead ends: 13 [2018-07-25 13:31:16,467 INFO L226 Difference]: Without dead ends: 11 [2018-07-25 13:31:16,468 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2018-07-25 13:31:16,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-07-25 13:31:16,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-07-25 13:31:16,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-07-25 13:31:16,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-07-25 13:31:16,476 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-07-25 13:31:16,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:16,478 INFO L472 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-07-25 13:31:16,478 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:31:16,478 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-07-25 13:31:16,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-25 13:31:16,479 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:16,479 INFO L354 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-07-25 13:31:16,480 INFO L415 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:16,481 INFO L82 PathProgramCache]: Analyzing trace with hash 868363269, now seen corresponding path program 7 times [2018-07-25 13:31:16,481 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:16,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:16,578 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:31:16,579 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:16,579 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 13:31:16,582 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 13:31:16,582 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 13:31:16,583 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:31:16,583 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2018-07-25 13:31:16,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:16,756 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-07-25 13:31:16,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 13:31:16,756 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-07-25 13:31:16,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:16,757 INFO L225 Difference]: With dead ends: 14 [2018-07-25 13:31:16,758 INFO L226 Difference]: Without dead ends: 12 [2018-07-25 13:31:16,758 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2018-07-25 13:31:16,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-07-25 13:31:16,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-07-25 13:31:16,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-07-25 13:31:16,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-07-25 13:31:16,769 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-07-25 13:31:16,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:16,770 INFO L472 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-07-25 13:31:16,770 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 13:31:16,772 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-07-25 13:31:16,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-07-25 13:31:16,772 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:16,773 INFO L354 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-07-25 13:31:16,773 INFO L415 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:16,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1149472942, now seen corresponding path program 8 times [2018-07-25 13:31:16,778 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:16,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:16,867 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:31:16,868 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:16,868 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:31:16,869 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:31:16,869 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:31:16,869 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:31:16,870 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2018-07-25 13:31:17,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:17,078 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-07-25 13:31:17,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 13:31:17,078 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2018-07-25 13:31:17,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:17,079 INFO L225 Difference]: With dead ends: 15 [2018-07-25 13:31:17,079 INFO L226 Difference]: Without dead ends: 13 [2018-07-25 13:31:17,080 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2018-07-25 13:31:17,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-07-25 13:31:17,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-07-25 13:31:17,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-07-25 13:31:17,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-07-25 13:31:17,087 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2018-07-25 13:31:17,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:17,088 INFO L472 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-07-25 13:31:17,088 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:31:17,089 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-07-25 13:31:17,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 13:31:17,089 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:17,089 INFO L354 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2018-07-25 13:31:17,090 INFO L415 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:17,090 INFO L82 PathProgramCache]: Analyzing trace with hash 1273938213, now seen corresponding path program 9 times [2018-07-25 13:31:17,090 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:17,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:17,194 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:31:17,195 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:17,195 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 13:31:17,195 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 13:31:17,196 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 13:31:17,196 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:31:17,197 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2018-07-25 13:31:17,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:17,423 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-07-25 13:31:17,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 13:31:17,424 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2018-07-25 13:31:17,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:17,425 INFO L225 Difference]: With dead ends: 16 [2018-07-25 13:31:17,426 INFO L226 Difference]: Without dead ends: 14 [2018-07-25 13:31:17,428 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2018-07-25 13:31:17,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-07-25 13:31:17,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-07-25 13:31:17,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-07-25 13:31:17,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-07-25 13:31:17,439 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2018-07-25 13:31:17,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:17,440 INFO L472 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-07-25 13:31:17,440 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 13:31:17,440 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-07-25 13:31:17,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-07-25 13:31:17,442 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:17,442 INFO L354 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2018-07-25 13:31:17,442 INFO L415 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:17,442 INFO L82 PathProgramCache]: Analyzing trace with hash 837394318, now seen corresponding path program 10 times [2018-07-25 13:31:17,443 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:17,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:17,547 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:31:17,548 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:17,548 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 13:31:17,548 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 13:31:17,549 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 13:31:17,549 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:31:17,549 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2018-07-25 13:31:17,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:17,852 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-07-25 13:31:17,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 13:31:17,855 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2018-07-25 13:31:17,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:17,856 INFO L225 Difference]: With dead ends: 17 [2018-07-25 13:31:17,856 INFO L226 Difference]: Without dead ends: 15 [2018-07-25 13:31:17,857 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=353, Unknown=0, NotChecked=0, Total=506 [2018-07-25 13:31:17,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-07-25 13:31:17,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-07-25 13:31:17,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-07-25 13:31:17,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-07-25 13:31:17,868 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2018-07-25 13:31:17,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:17,868 INFO L472 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-07-25 13:31:17,868 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 13:31:17,869 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-07-25 13:31:17,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-25 13:31:17,869 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:17,869 INFO L354 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2018-07-25 13:31:17,870 INFO L415 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:17,871 INFO L82 PathProgramCache]: Analyzing trace with hash 189435461, now seen corresponding path program 11 times [2018-07-25 13:31:17,872 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:17,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:17,981 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:31:17,982 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:17,982 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-25 13:31:17,982 INFO L451 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-25 13:31:17,983 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-25 13:31:17,984 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:31:17,984 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2018-07-25 13:31:18,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:18,273 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-07-25 13:31:18,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 13:31:18,274 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2018-07-25 13:31:18,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:18,275 INFO L225 Difference]: With dead ends: 18 [2018-07-25 13:31:18,275 INFO L226 Difference]: Without dead ends: 16 [2018-07-25 13:31:18,276 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=179, Invalid=421, Unknown=0, NotChecked=0, Total=600 [2018-07-25 13:31:18,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-07-25 13:31:18,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-07-25 13:31:18,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-07-25 13:31:18,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-07-25 13:31:18,289 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-07-25 13:31:18,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:18,289 INFO L472 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-07-25 13:31:18,290 INFO L473 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-25 13:31:18,290 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-07-25 13:31:18,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-07-25 13:31:18,291 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:18,292 INFO L354 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2018-07-25 13:31:18,292 INFO L415 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:18,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1577547374, now seen corresponding path program 12 times [2018-07-25 13:31:18,293 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:18,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:18,425 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:31:18,425 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:18,426 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-25 13:31:18,426 INFO L451 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-25 13:31:18,428 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-25 13:31:18,428 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-07-25 13:31:18,429 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2018-07-25 13:31:18,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:18,752 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-07-25 13:31:18,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 13:31:18,752 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2018-07-25 13:31:18,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:18,753 INFO L225 Difference]: With dead ends: 19 [2018-07-25 13:31:18,753 INFO L226 Difference]: Without dead ends: 17 [2018-07-25 13:31:18,754 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=207, Invalid=495, Unknown=0, NotChecked=0, Total=702 [2018-07-25 13:31:18,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-07-25 13:31:18,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-07-25 13:31:18,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-07-25 13:31:18,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-07-25 13:31:18,765 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2018-07-25 13:31:18,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:18,765 INFO L472 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-07-25 13:31:18,765 INFO L473 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-25 13:31:18,765 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-07-25 13:31:18,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 13:31:18,766 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:18,766 INFO L354 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2018-07-25 13:31:18,767 INFO L415 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:18,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1659343717, now seen corresponding path program 13 times [2018-07-25 13:31:18,767 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:18,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:18,887 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:31:18,887 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:18,888 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-25 13:31:18,888 INFO L451 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-25 13:31:18,888 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-25 13:31:18,889 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-07-25 13:31:18,889 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2018-07-25 13:31:19,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:19,277 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-07-25 13:31:19,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-25 13:31:19,278 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2018-07-25 13:31:19,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:19,278 INFO L225 Difference]: With dead ends: 20 [2018-07-25 13:31:19,279 INFO L226 Difference]: Without dead ends: 18 [2018-07-25 13:31:19,279 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=237, Invalid=575, Unknown=0, NotChecked=0, Total=812 [2018-07-25 13:31:19,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-07-25 13:31:19,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-07-25 13:31:19,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-07-25 13:31:19,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-07-25 13:31:19,288 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2018-07-25 13:31:19,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:19,288 INFO L472 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-07-25 13:31:19,288 INFO L473 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-25 13:31:19,288 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-07-25 13:31:19,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-07-25 13:31:19,289 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:19,289 INFO L354 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2018-07-25 13:31:19,289 INFO L415 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:19,290 INFO L82 PathProgramCache]: Analyzing trace with hash -99936946, now seen corresponding path program 14 times [2018-07-25 13:31:19,290 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:19,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:19,401 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:31:19,401 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:19,401 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-07-25 13:31:19,402 INFO L451 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-07-25 13:31:19,402 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-07-25 13:31:19,402 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-07-25 13:31:19,403 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2018-07-25 13:31:19,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:19,756 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-07-25 13:31:19,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-25 13:31:19,757 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2018-07-25 13:31:19,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:19,757 INFO L225 Difference]: With dead ends: 21 [2018-07-25 13:31:19,757 INFO L226 Difference]: Without dead ends: 19 [2018-07-25 13:31:19,760 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=269, Invalid=661, Unknown=0, NotChecked=0, Total=930 [2018-07-25 13:31:19,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-07-25 13:31:19,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-07-25 13:31:19,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-07-25 13:31:19,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-07-25 13:31:19,775 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2018-07-25 13:31:19,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:19,776 INFO L472 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-07-25 13:31:19,776 INFO L473 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-07-25 13:31:19,776 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-07-25 13:31:19,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 13:31:19,776 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:19,777 INFO L354 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2018-07-25 13:31:19,777 INFO L415 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:19,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1196937349, now seen corresponding path program 15 times [2018-07-25 13:31:19,779 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:19,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:19,928 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:31:19,929 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:19,929 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-07-25 13:31:19,932 INFO L451 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-07-25 13:31:19,933 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-07-25 13:31:19,933 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-07-25 13:31:19,934 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2018-07-25 13:31:20,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:20,331 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-07-25 13:31:20,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-25 13:31:20,331 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2018-07-25 13:31:20,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:20,332 INFO L225 Difference]: With dead ends: 22 [2018-07-25 13:31:20,332 INFO L226 Difference]: Without dead ends: 20 [2018-07-25 13:31:20,333 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=303, Invalid=753, Unknown=0, NotChecked=0, Total=1056 [2018-07-25 13:31:20,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-07-25 13:31:20,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-07-25 13:31:20,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-07-25 13:31:20,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-07-25 13:31:20,344 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2018-07-25 13:31:20,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:20,344 INFO L472 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-07-25 13:31:20,345 INFO L473 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-07-25 13:31:20,345 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-07-25 13:31:20,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-25 13:31:20,345 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:20,346 INFO L354 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2018-07-25 13:31:20,346 INFO L415 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:20,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1549632466, now seen corresponding path program 16 times [2018-07-25 13:31:20,346 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:20,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:20,471 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:31:20,472 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:20,472 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-07-25 13:31:20,472 INFO L451 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-07-25 13:31:20,472 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-07-25 13:31:20,473 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-07-25 13:31:20,473 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2018-07-25 13:31:20,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:20,892 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-07-25 13:31:20,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-25 13:31:20,893 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2018-07-25 13:31:20,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:20,893 INFO L225 Difference]: With dead ends: 23 [2018-07-25 13:31:20,894 INFO L226 Difference]: Without dead ends: 21 [2018-07-25 13:31:20,896 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=339, Invalid=851, Unknown=0, NotChecked=0, Total=1190 [2018-07-25 13:31:20,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-07-25 13:31:20,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-07-25 13:31:20,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-07-25 13:31:20,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-07-25 13:31:20,909 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2018-07-25 13:31:20,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:20,910 INFO L472 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-07-25 13:31:20,910 INFO L473 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-07-25 13:31:20,910 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-07-25 13:31:20,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 13:31:20,911 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:20,912 INFO L354 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2018-07-25 13:31:20,912 INFO L415 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:20,912 INFO L82 PathProgramCache]: Analyzing trace with hash -793950811, now seen corresponding path program 17 times [2018-07-25 13:31:20,912 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:20,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:21,075 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:31:21,076 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:21,076 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-07-25 13:31:21,076 INFO L451 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-07-25 13:31:21,077 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-07-25 13:31:21,077 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-07-25 13:31:21,081 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2018-07-25 13:31:21,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:21,599 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-07-25 13:31:21,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-25 13:31:21,600 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2018-07-25 13:31:21,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:21,600 INFO L225 Difference]: With dead ends: 24 [2018-07-25 13:31:21,600 INFO L226 Difference]: Without dead ends: 22 [2018-07-25 13:31:21,602 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=377, Invalid=955, Unknown=0, NotChecked=0, Total=1332 [2018-07-25 13:31:21,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-07-25 13:31:21,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-07-25 13:31:21,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-07-25 13:31:21,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-07-25 13:31:21,618 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2018-07-25 13:31:21,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:21,619 INFO L472 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-07-25 13:31:21,619 INFO L473 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-07-25 13:31:21,619 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-07-25 13:31:21,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-25 13:31:21,622 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:21,622 INFO L354 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2018-07-25 13:31:21,623 INFO L415 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:21,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1157344014, now seen corresponding path program 18 times [2018-07-25 13:31:21,623 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:21,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:21,819 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:31:21,819 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:21,820 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-07-25 13:31:21,820 INFO L451 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-07-25 13:31:21,821 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-07-25 13:31:21,822 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-07-25 13:31:21,822 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2018-07-25 13:31:22,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:22,368 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-07-25 13:31:22,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-25 13:31:22,369 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2018-07-25 13:31:22,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:22,369 INFO L225 Difference]: With dead ends: 25 [2018-07-25 13:31:22,369 INFO L226 Difference]: Without dead ends: 23 [2018-07-25 13:31:22,373 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=417, Invalid=1065, Unknown=0, NotChecked=0, Total=1482 [2018-07-25 13:31:22,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-07-25 13:31:22,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-07-25 13:31:22,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-07-25 13:31:22,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-07-25 13:31:22,396 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2018-07-25 13:31:22,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:22,397 INFO L472 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-07-25 13:31:22,397 INFO L473 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-07-25 13:31:22,397 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-07-25 13:31:22,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-25 13:31:22,397 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:22,398 INFO L354 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2018-07-25 13:31:22,398 INFO L415 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:22,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1517941445, now seen corresponding path program 19 times [2018-07-25 13:31:22,400 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:22,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:22,539 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:31:22,540 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:22,540 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-07-25 13:31:22,541 INFO L451 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-07-25 13:31:22,541 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-07-25 13:31:22,541 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-07-25 13:31:22,542 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2018-07-25 13:31:23,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:23,030 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-07-25 13:31:23,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-25 13:31:23,030 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2018-07-25 13:31:23,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:23,031 INFO L225 Difference]: With dead ends: 26 [2018-07-25 13:31:23,031 INFO L226 Difference]: Without dead ends: 24 [2018-07-25 13:31:23,035 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=459, Invalid=1181, Unknown=0, NotChecked=0, Total=1640 [2018-07-25 13:31:23,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-07-25 13:31:23,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-07-25 13:31:23,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-07-25 13:31:23,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-07-25 13:31:23,052 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2018-07-25 13:31:23,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:23,052 INFO L472 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-07-25 13:31:23,052 INFO L473 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-07-25 13:31:23,052 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-07-25 13:31:23,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-07-25 13:31:23,053 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:23,053 INFO L354 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2018-07-25 13:31:23,053 INFO L415 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:23,054 INFO L82 PathProgramCache]: Analyzing trace with hash -188440082, now seen corresponding path program 20 times [2018-07-25 13:31:23,054 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:23,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:23,216 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:31:23,216 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:23,217 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-07-25 13:31:23,217 INFO L451 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-07-25 13:31:23,219 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-07-25 13:31:23,219 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-07-25 13:31:23,220 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 23 states. [2018-07-25 13:31:23,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:23,759 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-07-25 13:31:23,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-25 13:31:23,759 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 23 [2018-07-25 13:31:23,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:23,759 INFO L225 Difference]: With dead ends: 27 [2018-07-25 13:31:23,760 INFO L226 Difference]: Without dead ends: 25 [2018-07-25 13:31:23,761 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=503, Invalid=1303, Unknown=0, NotChecked=0, Total=1806 [2018-07-25 13:31:23,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-07-25 13:31:23,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-07-25 13:31:23,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-07-25 13:31:23,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-07-25 13:31:23,776 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 23 [2018-07-25 13:31:23,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:23,776 INFO L472 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-07-25 13:31:23,776 INFO L473 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-07-25 13:31:23,776 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-07-25 13:31:23,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-07-25 13:31:23,777 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:23,777 INFO L354 BasicCegarLoop]: trace histogram [21, 1, 1, 1] [2018-07-25 13:31:23,777 INFO L415 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:23,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1546659867, now seen corresponding path program 21 times [2018-07-25 13:31:23,778 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:23,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:23,924 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:31:23,924 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:23,924 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-07-25 13:31:23,925 INFO L451 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-07-25 13:31:23,925 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-07-25 13:31:23,925 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-07-25 13:31:23,926 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 24 states. [2018-07-25 13:31:24,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:24,536 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-07-25 13:31:24,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 13:31:24,537 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 24 [2018-07-25 13:31:24,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:24,537 INFO L225 Difference]: With dead ends: 28 [2018-07-25 13:31:24,538 INFO L226 Difference]: Without dead ends: 26 [2018-07-25 13:31:24,539 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=549, Invalid=1431, Unknown=0, NotChecked=0, Total=1980 [2018-07-25 13:31:24,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-07-25 13:31:24,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-07-25 13:31:24,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-07-25 13:31:24,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-07-25 13:31:24,557 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 24 [2018-07-25 13:31:24,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:24,557 INFO L472 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-07-25 13:31:24,558 INFO L473 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-07-25 13:31:24,558 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-07-25 13:31:24,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-07-25 13:31:24,558 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:24,559 INFO L354 BasicCegarLoop]: trace histogram [22, 1, 1, 1] [2018-07-25 13:31:24,559 INFO L415 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:24,559 INFO L82 PathProgramCache]: Analyzing trace with hash -701800242, now seen corresponding path program 22 times [2018-07-25 13:31:24,559 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:24,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:24,749 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:31:24,749 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:24,750 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-07-25 13:31:24,750 INFO L451 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-07-25 13:31:24,750 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-07-25 13:31:24,751 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-07-25 13:31:24,751 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 25 states. [2018-07-25 13:31:25,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:25,370 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-07-25 13:31:25,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-07-25 13:31:25,370 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 25 [2018-07-25 13:31:25,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:25,371 INFO L225 Difference]: With dead ends: 29 [2018-07-25 13:31:25,371 INFO L226 Difference]: Without dead ends: 27 [2018-07-25 13:31:25,372 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=597, Invalid=1565, Unknown=0, NotChecked=0, Total=2162 [2018-07-25 13:31:25,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-07-25 13:31:25,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-07-25 13:31:25,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-07-25 13:31:25,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-07-25 13:31:25,392 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 25 [2018-07-25 13:31:25,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:25,392 INFO L472 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-07-25 13:31:25,392 INFO L473 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-07-25 13:31:25,394 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-07-25 13:31:25,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-07-25 13:31:25,395 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:25,395 INFO L354 BasicCegarLoop]: trace histogram [23, 1, 1, 1] [2018-07-25 13:31:25,395 INFO L415 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:25,396 INFO L82 PathProgramCache]: Analyzing trace with hash -280955643, now seen corresponding path program 23 times [2018-07-25 13:31:25,396 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:25,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:25,560 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:31:25,560 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:25,561 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-07-25 13:31:25,561 INFO L451 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-07-25 13:31:25,561 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-07-25 13:31:25,561 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-07-25 13:31:25,562 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 26 states. [2018-07-25 13:31:26,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:26,170 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-07-25 13:31:26,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-25 13:31:26,170 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 26 [2018-07-25 13:31:26,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:26,171 INFO L225 Difference]: With dead ends: 30 [2018-07-25 13:31:26,171 INFO L226 Difference]: Without dead ends: 28 [2018-07-25 13:31:26,172 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=647, Invalid=1705, Unknown=0, NotChecked=0, Total=2352 [2018-07-25 13:31:26,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-07-25 13:31:26,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-07-25 13:31:26,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-07-25 13:31:26,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2018-07-25 13:31:26,202 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 26 [2018-07-25 13:31:26,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:26,202 INFO L472 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2018-07-25 13:31:26,202 INFO L473 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-07-25 13:31:26,202 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2018-07-25 13:31:26,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-07-25 13:31:26,203 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:26,203 INFO L354 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2018-07-25 13:31:26,205 INFO L415 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:26,205 INFO L82 PathProgramCache]: Analyzing trace with hash -119674962, now seen corresponding path program 24 times [2018-07-25 13:31:26,205 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:26,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:26,367 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:31:26,368 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:26,368 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-07-25 13:31:26,368 INFO L451 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-07-25 13:31:26,368 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-07-25 13:31:26,369 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-07-25 13:31:26,369 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2018-07-25 13:31:27,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:27,059 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-07-25 13:31:27,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-25 13:31:27,059 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2018-07-25 13:31:27,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:27,060 INFO L225 Difference]: With dead ends: 31 [2018-07-25 13:31:27,060 INFO L226 Difference]: Without dead ends: 29 [2018-07-25 13:31:27,062 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=699, Invalid=1851, Unknown=0, NotChecked=0, Total=2550 [2018-07-25 13:31:27,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-07-25 13:31:27,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-07-25 13:31:27,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-07-25 13:31:27,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-07-25 13:31:27,083 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 27 [2018-07-25 13:31:27,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:27,083 INFO L472 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-07-25 13:31:27,083 INFO L473 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-07-25 13:31:27,084 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-07-25 13:31:27,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-07-25 13:31:27,084 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:27,084 INFO L354 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2018-07-25 13:31:27,085 INFO L415 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:27,085 INFO L82 PathProgramCache]: Analyzing trace with hash 585058853, now seen corresponding path program 25 times [2018-07-25 13:31:27,085 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:27,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:27,254 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:31:27,254 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:27,255 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-07-25 13:31:27,255 INFO L451 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-07-25 13:31:27,255 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-07-25 13:31:27,256 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-07-25 13:31:27,256 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2018-07-25 13:31:28,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:28,176 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-07-25 13:31:28,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-25 13:31:28,177 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2018-07-25 13:31:28,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:28,177 INFO L225 Difference]: With dead ends: 32 [2018-07-25 13:31:28,178 INFO L226 Difference]: Without dead ends: 30 [2018-07-25 13:31:28,179 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=753, Invalid=2003, Unknown=0, NotChecked=0, Total=2756 [2018-07-25 13:31:28,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-07-25 13:31:28,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-07-25 13:31:28,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-07-25 13:31:28,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2018-07-25 13:31:28,196 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 28 [2018-07-25 13:31:28,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:28,197 INFO L472 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2018-07-25 13:31:28,197 INFO L473 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-07-25 13:31:28,197 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2018-07-25 13:31:28,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-07-25 13:31:28,197 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:28,198 INFO L354 BasicCegarLoop]: trace histogram [26, 1, 1, 1] [2018-07-25 13:31:28,198 INFO L415 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:28,198 INFO L82 PathProgramCache]: Analyzing trace with hash 956970638, now seen corresponding path program 26 times [2018-07-25 13:31:28,198 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:28,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:28,362 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:31:28,363 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:28,363 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-07-25 13:31:28,363 INFO L451 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-07-25 13:31:28,364 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-07-25 13:31:28,364 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-07-25 13:31:28,364 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 29 states. [2018-07-25 13:31:29,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:29,074 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-07-25 13:31:29,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-25 13:31:29,074 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 29 [2018-07-25 13:31:29,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:29,075 INFO L225 Difference]: With dead ends: 33 [2018-07-25 13:31:29,075 INFO L226 Difference]: Without dead ends: 31 [2018-07-25 13:31:29,076 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=809, Invalid=2161, Unknown=0, NotChecked=0, Total=2970 [2018-07-25 13:31:29,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-07-25 13:31:29,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-07-25 13:31:29,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-07-25 13:31:29,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-07-25 13:31:29,094 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 29 [2018-07-25 13:31:29,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:29,094 INFO L472 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-07-25 13:31:29,094 INFO L473 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-07-25 13:31:29,095 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-07-25 13:31:29,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-07-25 13:31:29,095 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:29,095 INFO L354 BasicCegarLoop]: trace histogram [27, 1, 1, 1] [2018-07-25 13:31:29,095 INFO L415 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:29,096 INFO L82 PathProgramCache]: Analyzing trace with hash -398665915, now seen corresponding path program 27 times [2018-07-25 13:31:29,096 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:29,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:29,260 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:31:29,261 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:29,261 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-07-25 13:31:29,261 INFO L451 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-07-25 13:31:29,261 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-07-25 13:31:29,262 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-07-25 13:31:29,262 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 30 states. [2018-07-25 13:31:30,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:30,028 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-07-25 13:31:30,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-25 13:31:30,028 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 30 [2018-07-25 13:31:30,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:30,029 INFO L225 Difference]: With dead ends: 34 [2018-07-25 13:31:30,029 INFO L226 Difference]: Without dead ends: 32 [2018-07-25 13:31:30,031 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=867, Invalid=2325, Unknown=0, NotChecked=0, Total=3192 [2018-07-25 13:31:30,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-07-25 13:31:30,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-07-25 13:31:30,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-07-25 13:31:30,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-07-25 13:31:30,051 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 30 [2018-07-25 13:31:30,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:30,051 INFO L472 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-07-25 13:31:30,051 INFO L473 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-07-25 13:31:30,052 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-07-25 13:31:30,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-07-25 13:31:30,052 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:30,052 INFO L354 BasicCegarLoop]: trace histogram [28, 1, 1, 1] [2018-07-25 13:31:30,053 INFO L415 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:30,053 INFO L82 PathProgramCache]: Analyzing trace with hash 526273902, now seen corresponding path program 28 times [2018-07-25 13:31:30,053 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:30,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:30,239 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:31:30,239 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:30,240 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-07-25 13:31:30,240 INFO L451 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-07-25 13:31:30,240 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-07-25 13:31:30,241 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-07-25 13:31:30,241 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 31 states. [2018-07-25 13:31:31,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:31,204 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-07-25 13:31:31,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-25 13:31:31,204 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 31 [2018-07-25 13:31:31,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:31,205 INFO L225 Difference]: With dead ends: 35 [2018-07-25 13:31:31,205 INFO L226 Difference]: Without dead ends: 33 [2018-07-25 13:31:31,208 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=927, Invalid=2495, Unknown=0, NotChecked=0, Total=3422 [2018-07-25 13:31:31,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-07-25 13:31:31,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-07-25 13:31:31,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-07-25 13:31:31,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-07-25 13:31:31,231 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 31 [2018-07-25 13:31:31,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:31,231 INFO L472 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-07-25 13:31:31,231 INFO L473 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-07-25 13:31:31,232 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-07-25 13:31:31,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-07-25 13:31:31,232 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:31,232 INFO L354 BasicCegarLoop]: trace histogram [29, 1, 1, 1] [2018-07-25 13:31:31,232 INFO L415 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:31,233 INFO L82 PathProgramCache]: Analyzing trace with hash -865362843, now seen corresponding path program 29 times [2018-07-25 13:31:31,233 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:31,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:31,420 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:31:31,420 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:31,421 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-07-25 13:31:31,421 INFO L451 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-07-25 13:31:31,421 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-07-25 13:31:31,422 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-07-25 13:31:31,422 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 32 states. [2018-07-25 13:31:32,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:32,292 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-07-25 13:31:32,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-07-25 13:31:32,292 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 32 [2018-07-25 13:31:32,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:32,293 INFO L225 Difference]: With dead ends: 36 [2018-07-25 13:31:32,293 INFO L226 Difference]: Without dead ends: 34 [2018-07-25 13:31:32,295 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=989, Invalid=2671, Unknown=0, NotChecked=0, Total=3660 [2018-07-25 13:31:32,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-07-25 13:31:32,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-07-25 13:31:32,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-07-25 13:31:32,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-07-25 13:31:32,319 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 32 [2018-07-25 13:31:32,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:32,319 INFO L472 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-07-25 13:31:32,319 INFO L473 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-07-25 13:31:32,319 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-07-25 13:31:32,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-07-25 13:31:32,320 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:32,320 INFO L354 BasicCegarLoop]: trace histogram [30, 1, 1, 1] [2018-07-25 13:31:32,320 INFO L415 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:32,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1056428978, now seen corresponding path program 30 times [2018-07-25 13:31:32,321 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:32,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:32,529 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:31:32,529 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:32,529 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-07-25 13:31:32,530 INFO L451 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-07-25 13:31:32,530 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-07-25 13:31:32,530 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-07-25 13:31:32,531 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 33 states. [2018-07-25 13:31:33,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:33,600 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-07-25 13:31:33,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-07-25 13:31:33,600 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 33 [2018-07-25 13:31:33,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:33,601 INFO L225 Difference]: With dead ends: 37 [2018-07-25 13:31:33,601 INFO L226 Difference]: Without dead ends: 35 [2018-07-25 13:31:33,603 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1053, Invalid=2853, Unknown=0, NotChecked=0, Total=3906 [2018-07-25 13:31:33,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-07-25 13:31:33,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-07-25 13:31:33,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-07-25 13:31:33,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-07-25 13:31:33,632 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 33 [2018-07-25 13:31:33,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:33,632 INFO L472 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-07-25 13:31:33,632 INFO L473 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-07-25 13:31:33,633 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-07-25 13:31:33,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-07-25 13:31:33,633 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:33,633 INFO L354 BasicCegarLoop]: trace histogram [31, 1, 1, 1] [2018-07-25 13:31:33,636 INFO L415 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:33,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1610455429, now seen corresponding path program 31 times [2018-07-25 13:31:33,636 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:33,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:33,889 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:31:33,889 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:33,889 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-07-25 13:31:33,890 INFO L451 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-07-25 13:31:33,890 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-07-25 13:31:33,891 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-07-25 13:31:33,891 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 34 states. [2018-07-25 13:31:34,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:34,819 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-07-25 13:31:34,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-25 13:31:34,819 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 34 [2018-07-25 13:31:34,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:34,819 INFO L225 Difference]: With dead ends: 38 [2018-07-25 13:31:34,820 INFO L226 Difference]: Without dead ends: 36 [2018-07-25 13:31:34,821 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1119, Invalid=3041, Unknown=0, NotChecked=0, Total=4160 [2018-07-25 13:31:34,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-07-25 13:31:34,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-07-25 13:31:34,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-07-25 13:31:34,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-07-25 13:31:34,841 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 34 [2018-07-25 13:31:34,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:34,842 INFO L472 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-07-25 13:31:34,842 INFO L473 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-07-25 13:31:34,842 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-07-25 13:31:34,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-07-25 13:31:34,842 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:34,843 INFO L354 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2018-07-25 13:31:34,843 INFO L415 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:34,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1615473874, now seen corresponding path program 32 times [2018-07-25 13:31:34,843 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:34,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:34,998 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:31:34,999 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:34,999 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-07-25 13:31:34,999 INFO L451 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-07-25 13:31:34,999 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-07-25 13:31:35,000 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-07-25 13:31:35,000 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2018-07-25 13:31:35,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:35,924 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-07-25 13:31:35,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-07-25 13:31:35,924 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2018-07-25 13:31:35,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:35,924 INFO L225 Difference]: With dead ends: 39 [2018-07-25 13:31:35,924 INFO L226 Difference]: Without dead ends: 37 [2018-07-25 13:31:35,926 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1187, Invalid=3235, Unknown=0, NotChecked=0, Total=4422 [2018-07-25 13:31:35,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-07-25 13:31:35,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-07-25 13:31:35,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-07-25 13:31:35,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-07-25 13:31:35,944 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 35 [2018-07-25 13:31:35,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:35,944 INFO L472 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-07-25 13:31:35,945 INFO L473 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-07-25 13:31:35,945 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-07-25 13:31:35,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-07-25 13:31:35,945 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:35,945 INFO L354 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2018-07-25 13:31:35,946 INFO L415 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:35,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1459932837, now seen corresponding path program 33 times [2018-07-25 13:31:35,946 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:35,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:36,128 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:31:36,128 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:36,128 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-07-25 13:31:36,129 INFO L451 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-07-25 13:31:36,129 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-07-25 13:31:36,129 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-07-25 13:31:36,129 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2018-07-25 13:31:37,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:37,090 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-07-25 13:31:37,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-07-25 13:31:37,090 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2018-07-25 13:31:37,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:37,091 INFO L225 Difference]: With dead ends: 40 [2018-07-25 13:31:37,091 INFO L226 Difference]: Without dead ends: 38 [2018-07-25 13:31:37,092 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1257, Invalid=3435, Unknown=0, NotChecked=0, Total=4692 [2018-07-25 13:31:37,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-07-25 13:31:37,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-07-25 13:31:37,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-07-25 13:31:37,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-07-25 13:31:37,113 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 36 [2018-07-25 13:31:37,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:37,114 INFO L472 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-07-25 13:31:37,114 INFO L473 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-07-25 13:31:37,114 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-07-25 13:31:37,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-07-25 13:31:37,114 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:37,114 INFO L354 BasicCegarLoop]: trace histogram [34, 1, 1, 1] [2018-07-25 13:31:37,114 INFO L415 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:37,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1986706930, now seen corresponding path program 34 times [2018-07-25 13:31:37,115 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:37,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:37,302 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:31:37,302 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:37,302 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-07-25 13:31:37,302 INFO L451 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-07-25 13:31:37,303 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-07-25 13:31:37,303 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-07-25 13:31:37,303 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 37 states. [2018-07-25 13:31:38,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:38,352 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-07-25 13:31:38,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-07-25 13:31:38,352 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 37 [2018-07-25 13:31:38,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:38,352 INFO L225 Difference]: With dead ends: 41 [2018-07-25 13:31:38,352 INFO L226 Difference]: Without dead ends: 39 [2018-07-25 13:31:38,353 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1329, Invalid=3641, Unknown=0, NotChecked=0, Total=4970 [2018-07-25 13:31:38,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-07-25 13:31:38,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-07-25 13:31:38,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-07-25 13:31:38,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-07-25 13:31:38,373 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 37 [2018-07-25 13:31:38,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:38,373 INFO L472 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-07-25 13:31:38,374 INFO L473 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-07-25 13:31:38,374 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-07-25 13:31:38,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-07-25 13:31:38,374 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:38,374 INFO L354 BasicCegarLoop]: trace histogram [35, 1, 1, 1] [2018-07-25 13:31:38,374 INFO L415 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:38,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1458357307, now seen corresponding path program 35 times [2018-07-25 13:31:38,375 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:38,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:38,562 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:31:38,562 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:38,562 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-07-25 13:31:38,563 INFO L451 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-07-25 13:31:38,563 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-07-25 13:31:38,563 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-07-25 13:31:38,563 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 38 states. [2018-07-25 13:31:39,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:39,876 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-07-25 13:31:39,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-07-25 13:31:39,876 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 38 [2018-07-25 13:31:39,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:39,877 INFO L225 Difference]: With dead ends: 42 [2018-07-25 13:31:39,877 INFO L226 Difference]: Without dead ends: 40 [2018-07-25 13:31:39,877 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1403, Invalid=3853, Unknown=0, NotChecked=0, Total=5256 [2018-07-25 13:31:39,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-07-25 13:31:39,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-07-25 13:31:39,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-07-25 13:31:39,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-07-25 13:31:39,896 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 38 [2018-07-25 13:31:39,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:39,896 INFO L472 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-07-25 13:31:39,896 INFO L473 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-07-25 13:31:39,896 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-07-25 13:31:39,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-07-25 13:31:39,896 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:39,896 INFO L354 BasicCegarLoop]: trace histogram [36, 1, 1, 1] [2018-07-25 13:31:39,897 INFO L415 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:39,897 INFO L82 PathProgramCache]: Analyzing trace with hash 2035579118, now seen corresponding path program 36 times [2018-07-25 13:31:39,897 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:39,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:40,088 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:31:40,088 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:40,089 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-07-25 13:31:40,089 INFO L451 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-07-25 13:31:40,089 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-07-25 13:31:40,089 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-07-25 13:31:40,090 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 39 states. [2018-07-25 13:31:41,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:41,140 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-07-25 13:31:41,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-07-25 13:31:41,140 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 39 [2018-07-25 13:31:41,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:41,140 INFO L225 Difference]: With dead ends: 43 [2018-07-25 13:31:41,141 INFO L226 Difference]: Without dead ends: 41 [2018-07-25 13:31:41,142 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1479, Invalid=4071, Unknown=0, NotChecked=0, Total=5550 [2018-07-25 13:31:41,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-07-25 13:31:41,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-07-25 13:31:41,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-07-25 13:31:41,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-07-25 13:31:41,163 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 39 [2018-07-25 13:31:41,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:41,163 INFO L472 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-07-25 13:31:41,163 INFO L473 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-07-25 13:31:41,163 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-07-25 13:31:41,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-07-25 13:31:41,164 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:41,164 INFO L354 BasicCegarLoop]: trace histogram [37, 1, 1, 1] [2018-07-25 13:31:41,164 INFO L415 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:41,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1321541403, now seen corresponding path program 37 times [2018-07-25 13:31:41,164 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:41,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:41,348 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:31:41,348 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:41,348 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-07-25 13:31:41,349 INFO L451 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-07-25 13:31:41,349 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-07-25 13:31:41,349 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-07-25 13:31:41,349 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 40 states. [2018-07-25 13:31:42,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:42,661 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-07-25 13:31:42,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-07-25 13:31:42,661 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 40 [2018-07-25 13:31:42,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:42,662 INFO L225 Difference]: With dead ends: 44 [2018-07-25 13:31:42,662 INFO L226 Difference]: Without dead ends: 42 [2018-07-25 13:31:42,663 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1557, Invalid=4295, Unknown=0, NotChecked=0, Total=5852 [2018-07-25 13:31:42,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-07-25 13:31:42,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-07-25 13:31:42,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-07-25 13:31:42,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-07-25 13:31:42,683 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 40 [2018-07-25 13:31:42,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:42,683 INFO L472 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-07-25 13:31:42,683 INFO L473 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-07-25 13:31:42,683 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-07-25 13:31:42,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-07-25 13:31:42,684 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:42,684 INFO L354 BasicCegarLoop]: trace histogram [38, 1, 1, 1] [2018-07-25 13:31:42,684 INFO L415 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:42,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1981904846, now seen corresponding path program 38 times [2018-07-25 13:31:42,685 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:42,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:42,886 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:31:42,886 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:42,886 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-07-25 13:31:42,886 INFO L451 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-07-25 13:31:42,887 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-07-25 13:31:42,887 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-07-25 13:31:42,887 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 41 states. [2018-07-25 13:31:44,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:44,075 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-07-25 13:31:44,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-07-25 13:31:44,076 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 41 [2018-07-25 13:31:44,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:44,076 INFO L225 Difference]: With dead ends: 45 [2018-07-25 13:31:44,076 INFO L226 Difference]: Without dead ends: 43 [2018-07-25 13:31:44,077 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1637, Invalid=4525, Unknown=0, NotChecked=0, Total=6162 [2018-07-25 13:31:44,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-07-25 13:31:44,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-07-25 13:31:44,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-07-25 13:31:44,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-07-25 13:31:44,105 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 41 [2018-07-25 13:31:44,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:44,106 INFO L472 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-07-25 13:31:44,106 INFO L473 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-07-25 13:31:44,106 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-07-25 13:31:44,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-07-25 13:31:44,106 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:44,107 INFO L354 BasicCegarLoop]: trace histogram [39, 1, 1, 1] [2018-07-25 13:31:44,107 INFO L415 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:44,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1309523461, now seen corresponding path program 39 times [2018-07-25 13:31:44,107 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:44,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:44,312 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:31:44,312 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:44,312 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-07-25 13:31:44,312 INFO L451 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-07-25 13:31:44,313 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-07-25 13:31:44,313 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-07-25 13:31:44,313 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 42 states. [2018-07-25 13:31:45,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:45,932 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-07-25 13:31:45,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-07-25 13:31:45,932 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 42 [2018-07-25 13:31:45,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:45,933 INFO L225 Difference]: With dead ends: 46 [2018-07-25 13:31:45,933 INFO L226 Difference]: Without dead ends: 44 [2018-07-25 13:31:45,934 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1719, Invalid=4761, Unknown=0, NotChecked=0, Total=6480 [2018-07-25 13:31:45,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-07-25 13:31:45,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-07-25 13:31:45,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-07-25 13:31:45,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-07-25 13:31:45,962 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 42 [2018-07-25 13:31:45,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:45,963 INFO L472 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-07-25 13:31:45,963 INFO L473 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-07-25 13:31:45,963 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-07-25 13:31:45,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-07-25 13:31:45,963 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:45,963 INFO L354 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2018-07-25 13:31:45,964 INFO L415 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:45,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1940537006, now seen corresponding path program 40 times [2018-07-25 13:31:45,964 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:45,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:46,250 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:31:46,250 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:46,250 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-07-25 13:31:46,250 INFO L451 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-07-25 13:31:46,251 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-07-25 13:31:46,251 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-07-25 13:31:46,251 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2018-07-25 13:31:47,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:47,866 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-07-25 13:31:47,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-07-25 13:31:47,866 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2018-07-25 13:31:47,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:47,867 INFO L225 Difference]: With dead ends: 47 [2018-07-25 13:31:47,867 INFO L226 Difference]: Without dead ends: 45 [2018-07-25 13:31:47,867 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1803, Invalid=5003, Unknown=0, NotChecked=0, Total=6806 [2018-07-25 13:31:47,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-07-25 13:31:47,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-07-25 13:31:47,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-07-25 13:31:47,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-07-25 13:31:47,890 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 43 [2018-07-25 13:31:47,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:47,890 INFO L472 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-07-25 13:31:47,890 INFO L473 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-07-25 13:31:47,890 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-07-25 13:31:47,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-07-25 13:31:47,891 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:47,891 INFO L354 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2018-07-25 13:31:47,891 INFO L415 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:47,891 INFO L82 PathProgramCache]: Analyzing trace with hash 27120421, now seen corresponding path program 41 times [2018-07-25 13:31:47,891 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:47,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:48,205 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:31:48,206 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:48,206 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-07-25 13:31:48,206 INFO L451 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-07-25 13:31:48,206 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-07-25 13:31:48,207 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-07-25 13:31:48,207 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2018-07-25 13:31:49,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:49,839 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-07-25 13:31:49,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-07-25 13:31:49,839 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2018-07-25 13:31:49,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:49,840 INFO L225 Difference]: With dead ends: 48 [2018-07-25 13:31:49,840 INFO L226 Difference]: Without dead ends: 46 [2018-07-25 13:31:49,841 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1889, Invalid=5251, Unknown=0, NotChecked=0, Total=7140 [2018-07-25 13:31:49,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-07-25 13:31:49,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-07-25 13:31:49,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-07-25 13:31:49,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-07-25 13:31:49,865 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 44 [2018-07-25 13:31:49,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:49,866 INFO L472 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-07-25 13:31:49,866 INFO L473 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-07-25 13:31:49,866 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-07-25 13:31:49,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-07-25 13:31:49,866 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:49,866 INFO L354 BasicCegarLoop]: trace histogram [42, 1, 1, 1] [2018-07-25 13:31:49,866 INFO L415 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:49,867 INFO L82 PathProgramCache]: Analyzing trace with hash 840748430, now seen corresponding path program 42 times [2018-07-25 13:31:49,867 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:49,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:50,141 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:31:50,141 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:50,141 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-07-25 13:31:50,141 INFO L451 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-07-25 13:31:50,142 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-07-25 13:31:50,142 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-07-25 13:31:50,142 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 45 states. [2018-07-25 13:31:51,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:51,676 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-07-25 13:31:51,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-07-25 13:31:51,677 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 45 [2018-07-25 13:31:51,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:51,677 INFO L225 Difference]: With dead ends: 49 [2018-07-25 13:31:51,677 INFO L226 Difference]: Without dead ends: 47 [2018-07-25 13:31:51,678 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1977, Invalid=5505, Unknown=0, NotChecked=0, Total=7482 [2018-07-25 13:31:51,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-07-25 13:31:51,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-07-25 13:31:51,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-07-25 13:31:51,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-07-25 13:31:51,702 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 45 [2018-07-25 13:31:51,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:51,703 INFO L472 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-07-25 13:31:51,703 INFO L473 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-07-25 13:31:51,703 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-07-25 13:31:51,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-07-25 13:31:51,703 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:51,703 INFO L354 BasicCegarLoop]: trace histogram [43, 1, 1, 1] [2018-07-25 13:31:51,704 INFO L415 AbstractCegarLoop]: === Iteration 44 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:51,704 INFO L82 PathProgramCache]: Analyzing trace with hash 293412933, now seen corresponding path program 43 times [2018-07-25 13:31:51,704 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:51,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:52,034 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:31:52,034 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:52,034 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-07-25 13:31:52,034 INFO L451 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-07-25 13:31:52,035 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-07-25 13:31:52,035 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-07-25 13:31:52,035 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 46 states. [2018-07-25 13:31:53,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:53,930 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-07-25 13:31:53,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-07-25 13:31:53,930 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 46 [2018-07-25 13:31:53,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:53,930 INFO L225 Difference]: With dead ends: 50 [2018-07-25 13:31:53,931 INFO L226 Difference]: Without dead ends: 48 [2018-07-25 13:31:53,931 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2067, Invalid=5765, Unknown=0, NotChecked=0, Total=7832 [2018-07-25 13:31:53,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-07-25 13:31:53,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-07-25 13:31:53,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-07-25 13:31:53,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-07-25 13:31:53,957 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 46 [2018-07-25 13:31:53,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:53,958 INFO L472 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-07-25 13:31:53,958 INFO L473 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-07-25 13:31:53,958 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-07-25 13:31:53,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-07-25 13:31:53,958 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:53,958 INFO L354 BasicCegarLoop]: trace histogram [44, 1, 1, 1] [2018-07-25 13:31:53,958 INFO L415 AbstractCegarLoop]: === Iteration 45 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:53,958 INFO L82 PathProgramCache]: Analyzing trace with hash 505881710, now seen corresponding path program 44 times [2018-07-25 13:31:53,959 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:53,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:54,213 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:31:54,213 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:54,213 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-07-25 13:31:54,213 INFO L451 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-07-25 13:31:54,214 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-07-25 13:31:54,214 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-07-25 13:31:54,214 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 47 states. [2018-07-25 13:31:55,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:55,972 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-07-25 13:31:55,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-07-25 13:31:55,972 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 47 [2018-07-25 13:31:55,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:55,973 INFO L225 Difference]: With dead ends: 51 [2018-07-25 13:31:55,973 INFO L226 Difference]: Without dead ends: 49 [2018-07-25 13:31:55,974 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2159, Invalid=6031, Unknown=0, NotChecked=0, Total=8190 [2018-07-25 13:31:55,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-07-25 13:31:56,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-07-25 13:31:56,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-07-25 13:31:56,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-07-25 13:31:56,005 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 47 [2018-07-25 13:31:56,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:56,005 INFO L472 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-07-25 13:31:56,005 INFO L473 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-07-25 13:31:56,005 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-07-25 13:31:56,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-07-25 13:31:56,005 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:56,005 INFO L354 BasicCegarLoop]: trace histogram [45, 1, 1, 1] [2018-07-25 13:31:56,006 INFO L415 AbstractCegarLoop]: === Iteration 46 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:56,006 INFO L82 PathProgramCache]: Analyzing trace with hash -1497520795, now seen corresponding path program 45 times [2018-07-25 13:31:56,006 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:56,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:56,279 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:31:56,279 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:56,279 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-07-25 13:31:56,279 INFO L451 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-07-25 13:31:56,279 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-07-25 13:31:56,280 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-07-25 13:31:56,280 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 48 states. [2018-07-25 13:31:58,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:31:58,167 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-07-25 13:31:58,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-07-25 13:31:58,167 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 48 [2018-07-25 13:31:58,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:31:58,168 INFO L225 Difference]: With dead ends: 52 [2018-07-25 13:31:58,168 INFO L226 Difference]: Without dead ends: 50 [2018-07-25 13:31:58,168 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 990 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2253, Invalid=6303, Unknown=0, NotChecked=0, Total=8556 [2018-07-25 13:31:58,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-07-25 13:31:58,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-07-25 13:31:58,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-07-25 13:31:58,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-07-25 13:31:58,194 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 48 [2018-07-25 13:31:58,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:31:58,194 INFO L472 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-07-25 13:31:58,194 INFO L473 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-07-25 13:31:58,194 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-07-25 13:31:58,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-07-25 13:31:58,195 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:31:58,195 INFO L354 BasicCegarLoop]: trace histogram [46, 1, 1, 1] [2018-07-25 13:31:58,195 INFO L415 AbstractCegarLoop]: === Iteration 47 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:31:58,195 INFO L82 PathProgramCache]: Analyzing trace with hash 821510990, now seen corresponding path program 46 times [2018-07-25 13:31:58,195 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:31:58,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:31:58,470 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:31:58,471 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:31:58,471 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-07-25 13:31:58,471 INFO L451 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-07-25 13:31:58,471 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-07-25 13:31:58,471 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-07-25 13:31:58,471 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 49 states. [2018-07-25 13:32:00,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:00,498 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-07-25 13:32:00,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-07-25 13:32:00,498 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 49 [2018-07-25 13:32:00,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:00,499 INFO L225 Difference]: With dead ends: 53 [2018-07-25 13:32:00,499 INFO L226 Difference]: Without dead ends: 51 [2018-07-25 13:32:00,500 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2349, Invalid=6581, Unknown=0, NotChecked=0, Total=8930 [2018-07-25 13:32:00,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-07-25 13:32:00,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-07-25 13:32:00,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-07-25 13:32:00,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-07-25 13:32:00,526 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 49 [2018-07-25 13:32:00,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:00,527 INFO L472 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-07-25 13:32:00,527 INFO L473 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-07-25 13:32:00,527 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-07-25 13:32:00,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-07-25 13:32:00,527 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:00,527 INFO L354 BasicCegarLoop]: trace histogram [47, 1, 1, 1] [2018-07-25 13:32:00,527 INFO L415 AbstractCegarLoop]: === Iteration 48 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:00,528 INFO L82 PathProgramCache]: Analyzing trace with hash -302947707, now seen corresponding path program 47 times [2018-07-25 13:32:00,528 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:00,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:00,980 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:32:00,981 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:00,981 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-07-25 13:32:00,981 INFO L451 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-07-25 13:32:00,981 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-07-25 13:32:00,982 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-07-25 13:32:00,982 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 50 states. [2018-07-25 13:32:01,494 WARN L169 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 298 DAG size of output: 23 [2018-07-25 13:32:03,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:03,151 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-07-25 13:32:03,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-07-25 13:32:03,151 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 50 [2018-07-25 13:32:03,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:03,152 INFO L225 Difference]: With dead ends: 54 [2018-07-25 13:32:03,152 INFO L226 Difference]: Without dead ends: 52 [2018-07-25 13:32:03,152 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1081 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2447, Invalid=6865, Unknown=0, NotChecked=0, Total=9312 [2018-07-25 13:32:03,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-07-25 13:32:03,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-07-25 13:32:03,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-07-25 13:32:03,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-07-25 13:32:03,183 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 50 [2018-07-25 13:32:03,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:03,183 INFO L472 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-07-25 13:32:03,184 INFO L473 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-07-25 13:32:03,184 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-07-25 13:32:03,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-07-25 13:32:03,184 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:03,184 INFO L354 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2018-07-25 13:32:03,184 INFO L415 AbstractCegarLoop]: === Iteration 49 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:03,184 INFO L82 PathProgramCache]: Analyzing trace with hash -801428946, now seen corresponding path program 48 times [2018-07-25 13:32:03,185 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:03,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:03,514 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:32:03,514 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:03,514 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-07-25 13:32:03,514 INFO L451 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-07-25 13:32:03,515 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-07-25 13:32:03,515 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-07-25 13:32:03,515 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2018-07-25 13:32:05,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:05,871 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-07-25 13:32:05,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-07-25 13:32:05,872 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2018-07-25 13:32:05,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:05,872 INFO L225 Difference]: With dead ends: 55 [2018-07-25 13:32:05,872 INFO L226 Difference]: Without dead ends: 53 [2018-07-25 13:32:05,873 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2547, Invalid=7155, Unknown=0, NotChecked=0, Total=9702 [2018-07-25 13:32:05,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-07-25 13:32:05,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-07-25 13:32:05,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-07-25 13:32:05,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-07-25 13:32:05,904 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 51 [2018-07-25 13:32:05,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:05,904 INFO L472 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-07-25 13:32:05,904 INFO L473 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-07-25 13:32:05,904 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-07-25 13:32:05,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-07-25 13:32:05,905 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:05,905 INFO L354 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2018-07-25 13:32:05,905 INFO L415 AbstractCegarLoop]: === Iteration 50 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:05,905 INFO L82 PathProgramCache]: Analyzing trace with hash 925521829, now seen corresponding path program 49 times [2018-07-25 13:32:05,905 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:05,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:06,243 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:32:06,243 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:06,243 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-07-25 13:32:06,243 INFO L451 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-07-25 13:32:06,244 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-07-25 13:32:06,244 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-07-25 13:32:06,244 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2018-07-25 13:32:08,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:08,457 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-07-25 13:32:08,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-07-25 13:32:08,457 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2018-07-25 13:32:08,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:08,458 INFO L225 Difference]: With dead ends: 56 [2018-07-25 13:32:08,458 INFO L226 Difference]: Without dead ends: 54 [2018-07-25 13:32:08,459 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2649, Invalid=7451, Unknown=0, NotChecked=0, Total=10100 [2018-07-25 13:32:08,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-07-25 13:32:08,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-07-25 13:32:08,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-07-25 13:32:08,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-07-25 13:32:08,489 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 52 [2018-07-25 13:32:08,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:08,489 INFO L472 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-07-25 13:32:08,489 INFO L473 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-07-25 13:32:08,489 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-07-25 13:32:08,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-07-25 13:32:08,489 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:08,489 INFO L354 BasicCegarLoop]: trace histogram [50, 1, 1, 1] [2018-07-25 13:32:08,490 INFO L415 AbstractCegarLoop]: === Iteration 51 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:08,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1373578994, now seen corresponding path program 50 times [2018-07-25 13:32:08,490 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:08,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:08,836 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:32:08,836 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:08,836 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-07-25 13:32:08,836 INFO L451 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-07-25 13:32:08,836 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-07-25 13:32:08,837 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-07-25 13:32:08,837 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 53 states. [2018-07-25 13:32:11,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:11,515 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-07-25 13:32:11,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-07-25 13:32:11,515 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 53 [2018-07-25 13:32:11,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:11,516 INFO L225 Difference]: With dead ends: 57 [2018-07-25 13:32:11,516 INFO L226 Difference]: Without dead ends: 55 [2018-07-25 13:32:11,517 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2753, Invalid=7753, Unknown=0, NotChecked=0, Total=10506 [2018-07-25 13:32:11,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-07-25 13:32:11,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-07-25 13:32:11,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-07-25 13:32:11,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-07-25 13:32:11,553 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 53 [2018-07-25 13:32:11,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:11,553 INFO L472 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-07-25 13:32:11,553 INFO L473 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-07-25 13:32:11,553 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-07-25 13:32:11,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-07-25 13:32:11,554 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:11,554 INFO L354 BasicCegarLoop]: trace histogram [51, 1, 1, 1] [2018-07-25 13:32:11,554 INFO L415 AbstractCegarLoop]: === Iteration 52 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:11,554 INFO L82 PathProgramCache]: Analyzing trace with hash 368739525, now seen corresponding path program 51 times [2018-07-25 13:32:11,555 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:11,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:11,875 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:32:11,875 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:11,875 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-07-25 13:32:11,876 INFO L451 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-07-25 13:32:11,876 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-07-25 13:32:11,876 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2018-07-25 13:32:11,877 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 54 states. [2018-07-25 13:32:14,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:14,479 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-07-25 13:32:14,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-07-25 13:32:14,479 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 54 [2018-07-25 13:32:14,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:14,480 INFO L225 Difference]: With dead ends: 58 [2018-07-25 13:32:14,480 INFO L226 Difference]: Without dead ends: 56 [2018-07-25 13:32:14,481 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1275 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2859, Invalid=8061, Unknown=0, NotChecked=0, Total=10920 [2018-07-25 13:32:14,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-07-25 13:32:14,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-07-25 13:32:14,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-07-25 13:32:14,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-07-25 13:32:14,512 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 54 [2018-07-25 13:32:14,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:14,512 INFO L472 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-07-25 13:32:14,512 INFO L473 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-07-25 13:32:14,512 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-07-25 13:32:14,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-07-25 13:32:14,513 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:14,513 INFO L354 BasicCegarLoop]: trace histogram [52, 1, 1, 1] [2018-07-25 13:32:14,513 INFO L415 AbstractCegarLoop]: === Iteration 53 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:14,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1453961234, now seen corresponding path program 52 times [2018-07-25 13:32:14,513 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:14,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:14,905 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:32:14,905 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:14,905 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-07-25 13:32:14,905 INFO L451 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-07-25 13:32:14,906 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-07-25 13:32:14,906 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-07-25 13:32:14,906 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 55 states. [2018-07-25 13:32:17,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:17,529 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-07-25 13:32:17,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-07-25 13:32:17,529 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 55 [2018-07-25 13:32:17,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:17,530 INFO L225 Difference]: With dead ends: 59 [2018-07-25 13:32:17,530 INFO L226 Difference]: Without dead ends: 57 [2018-07-25 13:32:17,530 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1326 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2967, Invalid=8375, Unknown=0, NotChecked=0, Total=11342 [2018-07-25 13:32:17,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-07-25 13:32:17,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-07-25 13:32:17,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-07-25 13:32:17,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-07-25 13:32:17,562 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 55 [2018-07-25 13:32:17,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:17,562 INFO L472 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-07-25 13:32:17,562 INFO L473 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-07-25 13:32:17,562 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-07-25 13:32:17,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-07-25 13:32:17,563 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:17,563 INFO L354 BasicCegarLoop]: trace histogram [53, 1, 1, 1] [2018-07-25 13:32:17,563 INFO L415 AbstractCegarLoop]: === Iteration 54 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:17,563 INFO L82 PathProgramCache]: Analyzing trace with hash -2123109915, now seen corresponding path program 53 times [2018-07-25 13:32:17,563 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:17,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:17,887 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:32:17,887 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:17,887 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-07-25 13:32:17,887 INFO L451 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-07-25 13:32:17,887 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-07-25 13:32:17,888 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2018-07-25 13:32:17,888 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 56 states. [2018-07-25 13:32:20,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:20,870 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-07-25 13:32:20,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-07-25 13:32:20,870 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 56 [2018-07-25 13:32:20,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:20,871 INFO L225 Difference]: With dead ends: 60 [2018-07-25 13:32:20,871 INFO L226 Difference]: Without dead ends: 58 [2018-07-25 13:32:20,871 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1378 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3077, Invalid=8695, Unknown=0, NotChecked=0, Total=11772 [2018-07-25 13:32:20,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-07-25 13:32:20,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-07-25 13:32:20,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-07-25 13:32:20,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-07-25 13:32:20,904 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 56 [2018-07-25 13:32:20,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:20,904 INFO L472 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-07-25 13:32:20,904 INFO L473 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-07-25 13:32:20,904 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-07-25 13:32:20,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-07-25 13:32:20,904 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:20,905 INFO L354 BasicCegarLoop]: trace histogram [54, 1, 1, 1] [2018-07-25 13:32:20,905 INFO L415 AbstractCegarLoop]: === Iteration 55 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:20,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1391882546, now seen corresponding path program 54 times [2018-07-25 13:32:20,905 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:20,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:21,276 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:32:21,277 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:21,277 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-07-25 13:32:21,277 INFO L451 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-07-25 13:32:21,277 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-07-25 13:32:21,278 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-07-25 13:32:21,278 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 57 states. [2018-07-25 13:32:24,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:24,319 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-07-25 13:32:24,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-07-25 13:32:24,319 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 57 [2018-07-25 13:32:24,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:24,320 INFO L225 Difference]: With dead ends: 61 [2018-07-25 13:32:24,320 INFO L226 Difference]: Without dead ends: 59 [2018-07-25 13:32:24,320 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1431 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3189, Invalid=9021, Unknown=0, NotChecked=0, Total=12210 [2018-07-25 13:32:24,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-07-25 13:32:24,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-07-25 13:32:24,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-07-25 13:32:24,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-07-25 13:32:24,354 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 57 [2018-07-25 13:32:24,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:24,354 INFO L472 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-07-25 13:32:24,355 INFO L473 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-07-25 13:32:24,355 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-07-25 13:32:24,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-07-25 13:32:24,355 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:24,355 INFO L354 BasicCegarLoop]: trace histogram [55, 1, 1, 1] [2018-07-25 13:32:24,356 INFO L415 AbstractCegarLoop]: === Iteration 56 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:24,356 INFO L82 PathProgramCache]: Analyzing trace with hash -198670587, now seen corresponding path program 55 times [2018-07-25 13:32:24,356 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:24,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:24,686 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:32:24,687 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:24,687 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-07-25 13:32:24,687 INFO L451 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-07-25 13:32:24,687 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-07-25 13:32:24,688 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-07-25 13:32:24,688 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 58 states. [2018-07-25 13:32:27,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:27,818 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-07-25 13:32:27,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-07-25 13:32:27,818 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 58 [2018-07-25 13:32:27,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:27,818 INFO L225 Difference]: With dead ends: 62 [2018-07-25 13:32:27,818 INFO L226 Difference]: Without dead ends: 60 [2018-07-25 13:32:27,819 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1485 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3303, Invalid=9353, Unknown=0, NotChecked=0, Total=12656 [2018-07-25 13:32:27,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-07-25 13:32:27,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-07-25 13:32:27,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-07-25 13:32:27,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-07-25 13:32:27,854 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 58 [2018-07-25 13:32:27,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:27,854 INFO L472 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-07-25 13:32:27,855 INFO L473 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-07-25 13:32:27,855 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-07-25 13:32:27,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-07-25 13:32:27,855 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:27,855 INFO L354 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2018-07-25 13:32:27,855 INFO L415 AbstractCegarLoop]: === Iteration 57 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:27,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1863805522, now seen corresponding path program 56 times [2018-07-25 13:32:27,856 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:27,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:28,238 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:32:28,239 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:28,239 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-07-25 13:32:28,239 INFO L451 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-07-25 13:32:28,239 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-07-25 13:32:28,239 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-07-25 13:32:28,239 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2018-07-25 13:32:31,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:31,428 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-07-25 13:32:31,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-07-25 13:32:31,428 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2018-07-25 13:32:31,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:31,429 INFO L225 Difference]: With dead ends: 63 [2018-07-25 13:32:31,429 INFO L226 Difference]: Without dead ends: 61 [2018-07-25 13:32:31,430 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1540 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=3419, Invalid=9691, Unknown=0, NotChecked=0, Total=13110 [2018-07-25 13:32:31,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-07-25 13:32:31,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-07-25 13:32:31,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-07-25 13:32:31,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-07-25 13:32:31,466 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 59 [2018-07-25 13:32:31,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:31,466 INFO L472 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-07-25 13:32:31,466 INFO L473 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-07-25 13:32:31,466 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-07-25 13:32:31,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-07-25 13:32:31,467 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:31,467 INFO L354 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2018-07-25 13:32:31,467 INFO L415 AbstractCegarLoop]: === Iteration 58 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:31,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1943380955, now seen corresponding path program 57 times [2018-07-25 13:32:31,467 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:31,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:31,896 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:32:31,897 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:31,897 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-07-25 13:32:31,897 INFO L451 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-07-25 13:32:31,897 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-07-25 13:32:31,897 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2018-07-25 13:32:31,898 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2018-07-25 13:32:35,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:35,282 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-07-25 13:32:35,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-07-25 13:32:35,282 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2018-07-25 13:32:35,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:35,283 INFO L225 Difference]: With dead ends: 64 [2018-07-25 13:32:35,283 INFO L226 Difference]: Without dead ends: 62 [2018-07-25 13:32:35,284 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1596 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=3537, Invalid=10035, Unknown=0, NotChecked=0, Total=13572 [2018-07-25 13:32:35,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-07-25 13:32:35,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-07-25 13:32:35,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-07-25 13:32:35,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-07-25 13:32:35,326 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 60 [2018-07-25 13:32:35,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:35,326 INFO L472 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-07-25 13:32:35,326 INFO L473 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-07-25 13:32:35,326 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-07-25 13:32:35,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-07-25 13:32:35,327 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:35,327 INFO L354 BasicCegarLoop]: trace histogram [58, 1, 1, 1] [2018-07-25 13:32:35,327 INFO L415 AbstractCegarLoop]: === Iteration 59 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:35,328 INFO L82 PathProgramCache]: Analyzing trace with hash -115252082, now seen corresponding path program 58 times [2018-07-25 13:32:35,328 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:35,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:35,712 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:32:35,712 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:35,713 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-07-25 13:32:35,713 INFO L451 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-07-25 13:32:35,713 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-07-25 13:32:35,714 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-07-25 13:32:35,714 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 61 states. [2018-07-25 13:32:39,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:39,255 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-07-25 13:32:39,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-07-25 13:32:39,255 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 61 [2018-07-25 13:32:39,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:39,256 INFO L225 Difference]: With dead ends: 65 [2018-07-25 13:32:39,256 INFO L226 Difference]: Without dead ends: 63 [2018-07-25 13:32:39,257 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1653 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=3657, Invalid=10385, Unknown=0, NotChecked=0, Total=14042 [2018-07-25 13:32:39,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-07-25 13:32:39,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-07-25 13:32:39,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-07-25 13:32:39,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-07-25 13:32:39,310 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 61 [2018-07-25 13:32:39,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:39,310 INFO L472 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-07-25 13:32:39,311 INFO L473 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-07-25 13:32:39,311 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-07-25 13:32:39,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-07-25 13:32:39,311 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:39,311 INFO L354 BasicCegarLoop]: trace histogram [59, 1, 1, 1] [2018-07-25 13:32:39,312 INFO L415 AbstractCegarLoop]: === Iteration 60 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:39,312 INFO L82 PathProgramCache]: Analyzing trace with hash 722168133, now seen corresponding path program 59 times [2018-07-25 13:32:39,312 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:39,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:39,913 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:32:39,914 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:39,914 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-07-25 13:32:39,914 INFO L451 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-07-25 13:32:39,914 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-07-25 13:32:39,915 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2018-07-25 13:32:39,915 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 62 states. [2018-07-25 13:32:43,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:43,655 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-07-25 13:32:43,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-07-25 13:32:43,656 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 62 [2018-07-25 13:32:43,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:43,656 INFO L225 Difference]: With dead ends: 66 [2018-07-25 13:32:43,656 INFO L226 Difference]: Without dead ends: 64 [2018-07-25 13:32:43,657 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1711 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=3779, Invalid=10741, Unknown=0, NotChecked=0, Total=14520 [2018-07-25 13:32:43,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-07-25 13:32:43,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-07-25 13:32:43,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-07-25 13:32:43,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-07-25 13:32:43,702 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 62 [2018-07-25 13:32:43,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:43,702 INFO L472 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-07-25 13:32:43,702 INFO L473 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-07-25 13:32:43,702 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-07-25 13:32:43,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-07-25 13:32:43,703 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:43,703 INFO L354 BasicCegarLoop]: trace histogram [60, 1, 1, 1] [2018-07-25 13:32:43,703 INFO L415 AbstractCegarLoop]: === Iteration 61 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:43,704 INFO L82 PathProgramCache]: Analyzing trace with hash 912391022, now seen corresponding path program 60 times [2018-07-25 13:32:43,704 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:43,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:44,122 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:32:44,123 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:44,123 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-07-25 13:32:44,123 INFO L451 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-07-25 13:32:44,123 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-07-25 13:32:44,123 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-07-25 13:32:44,124 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 63 states. [2018-07-25 13:32:47,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:47,882 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-07-25 13:32:47,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-07-25 13:32:47,882 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 63 [2018-07-25 13:32:47,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:47,882 INFO L225 Difference]: With dead ends: 67 [2018-07-25 13:32:47,883 INFO L226 Difference]: Without dead ends: 65 [2018-07-25 13:32:47,883 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1770 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=3903, Invalid=11103, Unknown=0, NotChecked=0, Total=15006 [2018-07-25 13:32:47,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-07-25 13:32:47,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-07-25 13:32:47,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-07-25 13:32:47,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-07-25 13:32:47,923 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 63 [2018-07-25 13:32:47,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:47,924 INFO L472 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-07-25 13:32:47,924 INFO L473 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-07-25 13:32:47,924 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-07-25 13:32:47,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-07-25 13:32:47,924 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:47,925 INFO L354 BasicCegarLoop]: trace histogram [61, 1, 1, 1] [2018-07-25 13:32:47,925 INFO L415 AbstractCegarLoop]: === Iteration 62 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:47,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1780634011, now seen corresponding path program 61 times [2018-07-25 13:32:47,925 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:47,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:48,336 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:32:48,336 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:48,336 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-07-25 13:32:48,337 INFO L451 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-07-25 13:32:48,337 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-07-25 13:32:48,337 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2018-07-25 13:32:48,338 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 64 states. [2018-07-25 13:32:52,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:52,224 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-07-25 13:32:52,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-07-25 13:32:52,225 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 64 [2018-07-25 13:32:52,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:52,225 INFO L225 Difference]: With dead ends: 68 [2018-07-25 13:32:52,226 INFO L226 Difference]: Without dead ends: 66 [2018-07-25 13:32:52,226 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1830 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4029, Invalid=11471, Unknown=0, NotChecked=0, Total=15500 [2018-07-25 13:32:52,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-07-25 13:32:52,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-07-25 13:32:52,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-07-25 13:32:52,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-07-25 13:32:52,267 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 64 [2018-07-25 13:32:52,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:52,268 INFO L472 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-07-25 13:32:52,268 INFO L473 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-07-25 13:32:52,268 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-07-25 13:32:52,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-07-25 13:32:52,269 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:52,269 INFO L354 BasicCegarLoop]: trace histogram [62, 1, 1, 1] [2018-07-25 13:32:52,269 INFO L415 AbstractCegarLoop]: === Iteration 63 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:52,269 INFO L82 PathProgramCache]: Analyzing trace with hash 634935886, now seen corresponding path program 62 times [2018-07-25 13:32:52,270 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:52,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:52,688 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:32:52,688 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:52,688 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-07-25 13:32:52,689 INFO L451 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-07-25 13:32:52,689 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-07-25 13:32:52,689 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-07-25 13:32:52,689 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 65 states. [2018-07-25 13:32:56,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:32:56,796 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-07-25 13:32:56,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-07-25 13:32:56,796 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 65 [2018-07-25 13:32:56,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:32:56,797 INFO L225 Difference]: With dead ends: 69 [2018-07-25 13:32:56,797 INFO L226 Difference]: Without dead ends: 67 [2018-07-25 13:32:56,798 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1891 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=4157, Invalid=11845, Unknown=0, NotChecked=0, Total=16002 [2018-07-25 13:32:56,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-07-25 13:32:56,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-07-25 13:32:56,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-07-25 13:32:56,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-07-25 13:32:56,846 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 65 [2018-07-25 13:32:56,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:32:56,847 INFO L472 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-07-25 13:32:56,847 INFO L473 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-07-25 13:32:56,847 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-07-25 13:32:56,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-07-25 13:32:56,848 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:32:56,848 INFO L354 BasicCegarLoop]: trace histogram [63, 1, 1, 1] [2018-07-25 13:32:56,848 INFO L415 AbstractCegarLoop]: === Iteration 64 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:32:56,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1791808635, now seen corresponding path program 63 times [2018-07-25 13:32:56,848 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:32:56,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:32:57,279 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:32:57,280 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:32:57,280 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-07-25 13:32:57,281 INFO L451 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-07-25 13:32:57,281 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-07-25 13:32:57,281 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2018-07-25 13:32:57,281 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 66 states. [2018-07-25 13:33:01,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:01,552 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-07-25 13:33:01,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-07-25 13:33:01,552 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 66 [2018-07-25 13:33:01,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:01,552 INFO L225 Difference]: With dead ends: 70 [2018-07-25 13:33:01,553 INFO L226 Difference]: Without dead ends: 68 [2018-07-25 13:33:01,554 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1953 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=4287, Invalid=12225, Unknown=0, NotChecked=0, Total=16512 [2018-07-25 13:33:01,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-07-25 13:33:01,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2018-07-25 13:33:01,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-07-25 13:33:01,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-07-25 13:33:01,606 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 66 [2018-07-25 13:33:01,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:01,607 INFO L472 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-07-25 13:33:01,607 INFO L473 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-07-25 13:33:01,607 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-07-25 13:33:01,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-07-25 13:33:01,607 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:01,608 INFO L354 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2018-07-25 13:33:01,608 INFO L415 AbstractCegarLoop]: === Iteration 65 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:01,608 INFO L82 PathProgramCache]: Analyzing trace with hash 288522542, now seen corresponding path program 64 times [2018-07-25 13:33:01,608 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:01,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:02,059 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:33:02,060 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:02,060 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-07-25 13:33:02,060 INFO L451 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-07-25 13:33:02,060 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-07-25 13:33:02,061 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-07-25 13:33:02,061 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2018-07-25 13:33:06,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:06,428 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-07-25 13:33:06,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-07-25 13:33:06,429 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2018-07-25 13:33:06,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:06,429 INFO L225 Difference]: With dead ends: 71 [2018-07-25 13:33:06,429 INFO L226 Difference]: Without dead ends: 69 [2018-07-25 13:33:06,430 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=4419, Invalid=12611, Unknown=0, NotChecked=0, Total=17030 [2018-07-25 13:33:06,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-07-25 13:33:06,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-07-25 13:33:06,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-07-25 13:33:06,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-07-25 13:33:06,491 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 67 [2018-07-25 13:33:06,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:06,492 INFO L472 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-07-25 13:33:06,492 INFO L473 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-07-25 13:33:06,492 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-07-25 13:33:06,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-07-25 13:33:06,492 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:06,493 INFO L354 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2018-07-25 13:33:06,493 INFO L415 AbstractCegarLoop]: === Iteration 66 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:06,493 INFO L82 PathProgramCache]: Analyzing trace with hash 354279589, now seen corresponding path program 65 times [2018-07-25 13:33:06,493 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:06,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:06,952 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:33:06,952 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:06,952 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-07-25 13:33:06,953 INFO L451 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-07-25 13:33:06,953 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-07-25 13:33:06,953 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2018-07-25 13:33:06,953 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2018-07-25 13:33:11,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:11,203 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-07-25 13:33:11,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-07-25 13:33:11,203 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2018-07-25 13:33:11,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:11,204 INFO L225 Difference]: With dead ends: 72 [2018-07-25 13:33:11,204 INFO L226 Difference]: Without dead ends: 70 [2018-07-25 13:33:11,205 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2080 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=4553, Invalid=13003, Unknown=0, NotChecked=0, Total=17556 [2018-07-25 13:33:11,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-07-25 13:33:11,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-07-25 13:33:11,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-07-25 13:33:11,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-07-25 13:33:11,251 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 68 [2018-07-25 13:33:11,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:11,251 INFO L472 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-07-25 13:33:11,252 INFO L473 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-07-25 13:33:11,252 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-07-25 13:33:11,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-07-25 13:33:11,252 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:11,252 INFO L354 BasicCegarLoop]: trace histogram [66, 1, 1, 1] [2018-07-25 13:33:11,253 INFO L415 AbstractCegarLoop]: === Iteration 67 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:11,253 INFO L82 PathProgramCache]: Analyzing trace with hash -1902219250, now seen corresponding path program 66 times [2018-07-25 13:33:11,253 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:11,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:11,760 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:33:11,760 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:11,760 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-07-25 13:33:11,760 INFO L451 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-07-25 13:33:11,761 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-07-25 13:33:11,761 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-07-25 13:33:11,761 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 69 states. [2018-07-25 13:33:16,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:16,589 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-07-25 13:33:16,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-07-25 13:33:16,589 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 69 [2018-07-25 13:33:16,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:16,590 INFO L225 Difference]: With dead ends: 73 [2018-07-25 13:33:16,590 INFO L226 Difference]: Without dead ends: 71 [2018-07-25 13:33:16,591 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2145 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=4689, Invalid=13401, Unknown=0, NotChecked=0, Total=18090 [2018-07-25 13:33:16,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-07-25 13:33:16,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-07-25 13:33:16,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-07-25 13:33:16,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-07-25 13:33:16,650 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 69 [2018-07-25 13:33:16,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:16,650 INFO L472 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-07-25 13:33:16,650 INFO L473 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-07-25 13:33:16,650 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-07-25 13:33:16,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-07-25 13:33:16,651 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:16,651 INFO L354 BasicCegarLoop]: trace histogram [67, 1, 1, 1] [2018-07-25 13:33:16,651 INFO L415 AbstractCegarLoop]: === Iteration 68 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:16,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1160760773, now seen corresponding path program 67 times [2018-07-25 13:33:16,651 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:16,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:17,136 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:33:17,136 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:17,137 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-07-25 13:33:17,137 INFO L451 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-07-25 13:33:17,137 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-07-25 13:33:17,137 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2018-07-25 13:33:17,138 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 70 states. [2018-07-25 13:33:22,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:22,227 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-07-25 13:33:22,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-07-25 13:33:22,227 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 70 [2018-07-25 13:33:22,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:22,227 INFO L225 Difference]: With dead ends: 74 [2018-07-25 13:33:22,227 INFO L226 Difference]: Without dead ends: 72 [2018-07-25 13:33:22,228 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2211 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=4827, Invalid=13805, Unknown=0, NotChecked=0, Total=18632 [2018-07-25 13:33:22,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-07-25 13:33:22,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-07-25 13:33:22,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-07-25 13:33:22,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-07-25 13:33:22,277 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 70 [2018-07-25 13:33:22,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:22,277 INFO L472 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-07-25 13:33:22,277 INFO L473 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-07-25 13:33:22,277 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-07-25 13:33:22,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-07-25 13:33:22,278 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:22,278 INFO L354 BasicCegarLoop]: trace histogram [68, 1, 1, 1] [2018-07-25 13:33:22,278 INFO L415 AbstractCegarLoop]: === Iteration 69 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:22,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1623860974, now seen corresponding path program 68 times [2018-07-25 13:33:22,278 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:22,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:22,778 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:33:22,779 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:22,779 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-07-25 13:33:22,779 INFO L451 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-07-25 13:33:22,779 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-07-25 13:33:22,780 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-07-25 13:33:22,780 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 71 states. [2018-07-25 13:33:28,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:28,206 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-07-25 13:33:28,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-07-25 13:33:28,207 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 71 [2018-07-25 13:33:28,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:28,207 INFO L225 Difference]: With dead ends: 75 [2018-07-25 13:33:28,207 INFO L226 Difference]: Without dead ends: 73 [2018-07-25 13:33:28,209 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2278 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=4967, Invalid=14215, Unknown=0, NotChecked=0, Total=19182 [2018-07-25 13:33:28,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-07-25 13:33:28,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-07-25 13:33:28,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-07-25 13:33:28,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-07-25 13:33:28,278 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 71 [2018-07-25 13:33:28,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:28,279 INFO L472 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-07-25 13:33:28,279 INFO L473 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-07-25 13:33:28,279 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-07-25 13:33:28,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-07-25 13:33:28,279 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:28,279 INFO L354 BasicCegarLoop]: trace histogram [69, 1, 1, 1] [2018-07-25 13:33:28,280 INFO L415 AbstractCegarLoop]: === Iteration 70 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:28,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1199901979, now seen corresponding path program 69 times [2018-07-25 13:33:28,280 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:28,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:28,820 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:33:28,820 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:28,820 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-07-25 13:33:28,820 INFO L451 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-07-25 13:33:28,821 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-07-25 13:33:28,821 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2018-07-25 13:33:28,821 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 72 states. [2018-07-25 13:33:34,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:34,283 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-07-25 13:33:34,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-07-25 13:33:34,283 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 72 [2018-07-25 13:33:34,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:34,284 INFO L225 Difference]: With dead ends: 76 [2018-07-25 13:33:34,284 INFO L226 Difference]: Without dead ends: 74 [2018-07-25 13:33:34,285 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2346 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=5109, Invalid=14631, Unknown=0, NotChecked=0, Total=19740 [2018-07-25 13:33:34,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-07-25 13:33:34,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-07-25 13:33:34,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-07-25 13:33:34,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-07-25 13:33:34,336 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 72 [2018-07-25 13:33:34,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:34,337 INFO L472 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-07-25 13:33:34,337 INFO L473 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-07-25 13:33:34,337 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-07-25 13:33:34,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-07-25 13:33:34,338 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:34,338 INFO L354 BasicCegarLoop]: trace histogram [70, 1, 1, 1] [2018-07-25 13:33:34,338 INFO L415 AbstractCegarLoop]: === Iteration 71 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:34,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1457759694, now seen corresponding path program 70 times [2018-07-25 13:33:34,338 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:34,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:34,862 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:33:34,863 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:34,863 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-07-25 13:33:34,863 INFO L451 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-07-25 13:33:34,863 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-07-25 13:33:34,864 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-07-25 13:33:34,864 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 73 states. [2018-07-25 13:33:40,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:40,346 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-07-25 13:33:40,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-07-25 13:33:40,346 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 73 [2018-07-25 13:33:40,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:40,347 INFO L225 Difference]: With dead ends: 77 [2018-07-25 13:33:40,347 INFO L226 Difference]: Without dead ends: 75 [2018-07-25 13:33:40,348 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2415 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=5253, Invalid=15053, Unknown=0, NotChecked=0, Total=20306 [2018-07-25 13:33:40,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-07-25 13:33:40,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-07-25 13:33:40,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-07-25 13:33:40,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-07-25 13:33:40,399 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 73 [2018-07-25 13:33:40,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:40,399 INFO L472 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-07-25 13:33:40,399 INFO L473 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-07-25 13:33:40,399 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-07-25 13:33:40,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-07-25 13:33:40,400 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:40,400 INFO L354 BasicCegarLoop]: trace histogram [71, 1, 1, 1] [2018-07-25 13:33:40,400 INFO L415 AbstractCegarLoop]: === Iteration 72 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:40,401 INFO L82 PathProgramCache]: Analyzing trace with hash -2054074363, now seen corresponding path program 71 times [2018-07-25 13:33:40,401 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:40,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:41,163 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:33:41,164 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:41,164 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-07-25 13:33:41,164 INFO L451 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-07-25 13:33:41,164 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-07-25 13:33:41,165 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2018-07-25 13:33:41,165 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 74 states. [2018-07-25 13:33:46,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:46,925 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-07-25 13:33:46,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-07-25 13:33:46,925 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 74 [2018-07-25 13:33:46,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:46,926 INFO L225 Difference]: With dead ends: 78 [2018-07-25 13:33:46,926 INFO L226 Difference]: Without dead ends: 76 [2018-07-25 13:33:46,927 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2485 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=5399, Invalid=15481, Unknown=0, NotChecked=0, Total=20880 [2018-07-25 13:33:46,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-07-25 13:33:46,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-07-25 13:33:46,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-07-25 13:33:46,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-07-25 13:33:46,973 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 74 [2018-07-25 13:33:46,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:46,973 INFO L472 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-07-25 13:33:46,973 INFO L473 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-07-25 13:33:46,973 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-07-25 13:33:46,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-07-25 13:33:46,973 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:46,973 INFO L354 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2018-07-25 13:33:46,974 INFO L415 AbstractCegarLoop]: === Iteration 73 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:46,974 INFO L82 PathProgramCache]: Analyzing trace with hash 748219566, now seen corresponding path program 72 times [2018-07-25 13:33:46,974 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:47,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:47,535 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:33:47,535 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:47,535 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-07-25 13:33:47,536 INFO L451 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-07-25 13:33:47,536 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-07-25 13:33:47,536 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-07-25 13:33:47,537 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2018-07-25 13:33:53,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:33:53,463 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-07-25 13:33:53,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-07-25 13:33:53,464 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2018-07-25 13:33:53,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:33:53,464 INFO L225 Difference]: With dead ends: 79 [2018-07-25 13:33:53,464 INFO L226 Difference]: Without dead ends: 77 [2018-07-25 13:33:53,465 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2556 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=5547, Invalid=15915, Unknown=0, NotChecked=0, Total=21462 [2018-07-25 13:33:53,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-07-25 13:33:53,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-07-25 13:33:53,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-07-25 13:33:53,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-07-25 13:33:53,516 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 75 [2018-07-25 13:33:53,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:33:53,516 INFO L472 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-07-25 13:33:53,516 INFO L473 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-07-25 13:33:53,516 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-07-25 13:33:53,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-07-25 13:33:53,517 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:33:53,517 INFO L354 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2018-07-25 13:33:53,517 INFO L415 AbstractCegarLoop]: === Iteration 74 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:33:53,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1719985445, now seen corresponding path program 73 times [2018-07-25 13:33:53,517 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:33:53,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:33:54,086 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:33:54,086 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:33:54,086 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-07-25 13:33:54,086 INFO L451 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-07-25 13:33:54,087 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-07-25 13:33:54,087 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2018-07-25 13:33:54,087 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 76 states. [2018-07-25 13:33:55,044 WARN L169 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 445 DAG size of output: 23 [2018-07-25 13:34:00,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:00,280 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-07-25 13:34:00,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-07-25 13:34:00,280 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 76 [2018-07-25 13:34:00,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:00,281 INFO L225 Difference]: With dead ends: 80 [2018-07-25 13:34:00,281 INFO L226 Difference]: Without dead ends: 78 [2018-07-25 13:34:00,282 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2628 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=5697, Invalid=16355, Unknown=0, NotChecked=0, Total=22052 [2018-07-25 13:34:00,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-07-25 13:34:00,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-07-25 13:34:00,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-07-25 13:34:00,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-07-25 13:34:00,335 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 76 [2018-07-25 13:34:00,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:00,335 INFO L472 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-07-25 13:34:00,335 INFO L473 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-07-25 13:34:00,335 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-07-25 13:34:00,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-07-25 13:34:00,336 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:00,336 INFO L354 BasicCegarLoop]: trace histogram [74, 1, 1, 1] [2018-07-25 13:34:00,336 INFO L415 AbstractCegarLoop]: === Iteration 75 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:00,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1779956622, now seen corresponding path program 74 times [2018-07-25 13:34:00,336 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:00,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:00,921 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:34:00,922 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:00,922 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-07-25 13:34:00,922 INFO L451 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-07-25 13:34:00,922 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-07-25 13:34:00,923 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-07-25 13:34:00,923 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 77 states. [2018-07-25 13:34:07,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:07,227 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-07-25 13:34:07,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-07-25 13:34:07,227 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 77 [2018-07-25 13:34:07,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:07,228 INFO L225 Difference]: With dead ends: 81 [2018-07-25 13:34:07,228 INFO L226 Difference]: Without dead ends: 79 [2018-07-25 13:34:07,229 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2701 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=5849, Invalid=16801, Unknown=0, NotChecked=0, Total=22650 [2018-07-25 13:34:07,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-07-25 13:34:07,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-07-25 13:34:07,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-07-25 13:34:07,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-07-25 13:34:07,294 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 77 [2018-07-25 13:34:07,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:07,294 INFO L472 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-07-25 13:34:07,294 INFO L473 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-07-25 13:34:07,294 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-07-25 13:34:07,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-07-25 13:34:07,295 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:07,295 INFO L354 BasicCegarLoop]: trace histogram [75, 1, 1, 1] [2018-07-25 13:34:07,295 INFO L415 AbstractCegarLoop]: === Iteration 76 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:07,295 INFO L82 PathProgramCache]: Analyzing trace with hash -655904187, now seen corresponding path program 75 times [2018-07-25 13:34:07,295 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:07,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:07,948 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:34:07,948 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:07,948 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-07-25 13:34:07,949 INFO L451 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-07-25 13:34:07,949 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-07-25 13:34:07,949 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2018-07-25 13:34:07,949 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 78 states. [2018-07-25 13:34:14,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:14,536 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-07-25 13:34:14,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-07-25 13:34:14,536 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 78 [2018-07-25 13:34:14,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:14,537 INFO L225 Difference]: With dead ends: 82 [2018-07-25 13:34:14,537 INFO L226 Difference]: Without dead ends: 80 [2018-07-25 13:34:14,538 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2775 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=6003, Invalid=17253, Unknown=0, NotChecked=0, Total=23256 [2018-07-25 13:34:14,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-07-25 13:34:14,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-07-25 13:34:14,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-07-25 13:34:14,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-07-25 13:34:14,596 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 78 [2018-07-25 13:34:14,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:14,596 INFO L472 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-07-25 13:34:14,596 INFO L473 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-07-25 13:34:14,596 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-07-25 13:34:14,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-07-25 13:34:14,597 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:14,597 INFO L354 BasicCegarLoop]: trace histogram [76, 1, 1, 1] [2018-07-25 13:34:14,597 INFO L415 AbstractCegarLoop]: === Iteration 77 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:14,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1141822062, now seen corresponding path program 76 times [2018-07-25 13:34:14,597 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:14,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:15,213 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:34:15,214 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:15,214 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-07-25 13:34:15,214 INFO L451 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-07-25 13:34:15,214 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-07-25 13:34:15,215 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-07-25 13:34:15,215 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 79 states. [2018-07-25 13:34:21,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:21,824 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-07-25 13:34:21,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-07-25 13:34:21,825 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 79 [2018-07-25 13:34:21,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:21,825 INFO L225 Difference]: With dead ends: 83 [2018-07-25 13:34:21,825 INFO L226 Difference]: Without dead ends: 81 [2018-07-25 13:34:21,826 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2850 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=6159, Invalid=17711, Unknown=0, NotChecked=0, Total=23870 [2018-07-25 13:34:21,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-07-25 13:34:21,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-07-25 13:34:21,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-07-25 13:34:21,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-07-25 13:34:21,885 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 79 [2018-07-25 13:34:21,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:21,886 INFO L472 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-07-25 13:34:21,886 INFO L473 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-07-25 13:34:21,886 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-07-25 13:34:21,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-07-25 13:34:21,886 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:21,886 INFO L354 BasicCegarLoop]: trace histogram [77, 1, 1, 1] [2018-07-25 13:34:21,886 INFO L415 AbstractCegarLoop]: === Iteration 78 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:21,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1036760933, now seen corresponding path program 77 times [2018-07-25 13:34:21,887 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:21,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:22,539 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:34:22,539 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:22,539 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-07-25 13:34:22,540 INFO L451 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-07-25 13:34:22,540 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-07-25 13:34:22,540 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2018-07-25 13:34:22,540 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 80 states. [2018-07-25 13:34:29,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:29,733 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-07-25 13:34:29,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-07-25 13:34:29,734 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 80 [2018-07-25 13:34:29,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:29,734 INFO L225 Difference]: With dead ends: 84 [2018-07-25 13:34:29,734 INFO L226 Difference]: Without dead ends: 82 [2018-07-25 13:34:29,735 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2926 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=6317, Invalid=18175, Unknown=0, NotChecked=0, Total=24492 [2018-07-25 13:34:29,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-07-25 13:34:29,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-07-25 13:34:29,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-07-25 13:34:29,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-07-25 13:34:29,788 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 80 [2018-07-25 13:34:29,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:29,789 INFO L472 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-07-25 13:34:29,789 INFO L473 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-07-25 13:34:29,789 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-07-25 13:34:29,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-07-25 13:34:29,789 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:29,789 INFO L354 BasicCegarLoop]: trace histogram [78, 1, 1, 1] [2018-07-25 13:34:29,790 INFO L415 AbstractCegarLoop]: === Iteration 79 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:29,790 INFO L82 PathProgramCache]: Analyzing trace with hash 2074833230, now seen corresponding path program 78 times [2018-07-25 13:34:29,790 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:29,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:30,410 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:34:30,410 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:30,411 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-07-25 13:34:30,411 INFO L451 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-07-25 13:34:30,411 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-07-25 13:34:30,411 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-07-25 13:34:30,411 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 81 states. [2018-07-25 13:34:37,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:37,837 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-07-25 13:34:37,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-07-25 13:34:37,838 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 81 [2018-07-25 13:34:37,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:37,838 INFO L225 Difference]: With dead ends: 85 [2018-07-25 13:34:37,838 INFO L226 Difference]: Without dead ends: 83 [2018-07-25 13:34:37,839 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3003 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=6477, Invalid=18645, Unknown=0, NotChecked=0, Total=25122 [2018-07-25 13:34:37,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-07-25 13:34:37,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-07-25 13:34:37,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-07-25 13:34:37,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-07-25 13:34:37,903 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 81 [2018-07-25 13:34:37,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:37,903 INFO L472 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-07-25 13:34:37,903 INFO L473 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-07-25 13:34:37,903 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-07-25 13:34:37,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-07-25 13:34:37,904 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:37,904 INFO L354 BasicCegarLoop]: trace histogram [79, 1, 1, 1] [2018-07-25 13:34:37,904 INFO L415 AbstractCegarLoop]: === Iteration 80 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:37,904 INFO L82 PathProgramCache]: Analyzing trace with hash -104663931, now seen corresponding path program 79 times [2018-07-25 13:34:37,904 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:37,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:38,552 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:34:38,552 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:38,552 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-07-25 13:34:38,552 INFO L451 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-07-25 13:34:38,553 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-07-25 13:34:38,553 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2018-07-25 13:34:38,553 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 82 states. [2018-07-25 13:34:46,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:46,036 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-07-25 13:34:46,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-07-25 13:34:46,036 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 82 [2018-07-25 13:34:46,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:46,037 INFO L225 Difference]: With dead ends: 86 [2018-07-25 13:34:46,037 INFO L226 Difference]: Without dead ends: 84 [2018-07-25 13:34:46,037 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3081 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=6639, Invalid=19121, Unknown=0, NotChecked=0, Total=25760 [2018-07-25 13:34:46,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-07-25 13:34:46,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-07-25 13:34:46,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-07-25 13:34:46,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-07-25 13:34:46,093 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 82 [2018-07-25 13:34:46,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:46,094 INFO L472 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-07-25 13:34:46,094 INFO L473 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-07-25 13:34:46,094 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-07-25 13:34:46,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-07-25 13:34:46,094 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:46,094 INFO L354 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2018-07-25 13:34:46,095 INFO L415 AbstractCegarLoop]: === Iteration 81 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:46,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1050400814, now seen corresponding path program 80 times [2018-07-25 13:34:46,095 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:46,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:46,772 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:34:46,772 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:46,772 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-07-25 13:34:46,772 INFO L451 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-07-25 13:34:46,772 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-07-25 13:34:46,773 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2018-07-25 13:34:46,773 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2018-07-25 13:34:54,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:34:54,687 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-07-25 13:34:54,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-07-25 13:34:54,688 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2018-07-25 13:34:54,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:34:54,688 INFO L225 Difference]: With dead ends: 87 [2018-07-25 13:34:54,688 INFO L226 Difference]: Without dead ends: 85 [2018-07-25 13:34:54,690 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3160 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=6803, Invalid=19603, Unknown=0, NotChecked=0, Total=26406 [2018-07-25 13:34:54,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-07-25 13:34:54,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-07-25 13:34:54,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-07-25 13:34:54,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-07-25 13:34:54,785 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 83 [2018-07-25 13:34:54,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:34:54,785 INFO L472 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-07-25 13:34:54,785 INFO L473 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-07-25 13:34:54,786 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-07-25 13:34:54,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-07-25 13:34:54,786 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:34:54,786 INFO L354 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2018-07-25 13:34:54,787 INFO L415 AbstractCegarLoop]: === Iteration 82 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:34:54,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1797297755, now seen corresponding path program 81 times [2018-07-25 13:34:54,787 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:34:54,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:34:55,656 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:34:55,656 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:34:55,656 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-07-25 13:34:55,656 INFO L451 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-07-25 13:34:55,657 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-07-25 13:34:55,657 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2018-07-25 13:34:55,657 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 84 states. [2018-07-25 13:35:03,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:03,612 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-07-25 13:35:03,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-07-25 13:35:03,612 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 84 [2018-07-25 13:35:03,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:03,612 INFO L225 Difference]: With dead ends: 88 [2018-07-25 13:35:03,612 INFO L226 Difference]: Without dead ends: 86 [2018-07-25 13:35:03,613 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3240 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=6969, Invalid=20091, Unknown=0, NotChecked=0, Total=27060 [2018-07-25 13:35:03,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-07-25 13:35:03,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-07-25 13:35:03,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-07-25 13:35:03,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-07-25 13:35:03,684 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 84 [2018-07-25 13:35:03,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:03,685 INFO L472 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-07-25 13:35:03,685 INFO L473 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-07-25 13:35:03,685 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-07-25 13:35:03,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-07-25 13:35:03,685 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:03,685 INFO L354 BasicCegarLoop]: trace histogram [82, 1, 1, 1] [2018-07-25 13:35:03,685 INFO L415 AbstractCegarLoop]: === Iteration 83 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:03,686 INFO L82 PathProgramCache]: Analyzing trace with hash 118359822, now seen corresponding path program 82 times [2018-07-25 13:35:03,686 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:03,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:04,425 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:04,425 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:04,426 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-07-25 13:35:04,426 INFO L451 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-07-25 13:35:04,426 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-07-25 13:35:04,426 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2018-07-25 13:35:04,427 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 85 states. [2018-07-25 13:35:12,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:12,587 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-07-25 13:35:12,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-07-25 13:35:12,587 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 85 [2018-07-25 13:35:12,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:12,588 INFO L225 Difference]: With dead ends: 89 [2018-07-25 13:35:12,588 INFO L226 Difference]: Without dead ends: 87 [2018-07-25 13:35:12,589 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3321 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=7137, Invalid=20585, Unknown=0, NotChecked=0, Total=27722 [2018-07-25 13:35:12,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-07-25 13:35:12,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-07-25 13:35:12,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-07-25 13:35:12,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-07-25 13:35:12,668 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 85 [2018-07-25 13:35:12,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:12,668 INFO L472 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-07-25 13:35:12,668 INFO L473 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-07-25 13:35:12,668 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-07-25 13:35:12,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-07-25 13:35:12,669 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:12,669 INFO L354 BasicCegarLoop]: trace histogram [83, 1, 1, 1] [2018-07-25 13:35:12,669 INFO L415 AbstractCegarLoop]: === Iteration 84 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:12,669 INFO L82 PathProgramCache]: Analyzing trace with hash -625797435, now seen corresponding path program 83 times [2018-07-25 13:35:12,669 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:12,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:13,604 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:13,605 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:13,605 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-07-25 13:35:13,605 INFO L451 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-07-25 13:35:13,605 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-07-25 13:35:13,606 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2018-07-25 13:35:13,606 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 86 states. [2018-07-25 13:35:22,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:22,635 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-07-25 13:35:22,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-07-25 13:35:22,636 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 86 [2018-07-25 13:35:22,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:22,636 INFO L225 Difference]: With dead ends: 90 [2018-07-25 13:35:22,636 INFO L226 Difference]: Without dead ends: 88 [2018-07-25 13:35:22,638 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3403 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=7307, Invalid=21085, Unknown=0, NotChecked=0, Total=28392 [2018-07-25 13:35:22,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-07-25 13:35:22,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-07-25 13:35:22,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-07-25 13:35:22,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-07-25 13:35:22,707 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 86 [2018-07-25 13:35:22,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:22,708 INFO L472 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-07-25 13:35:22,708 INFO L473 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-07-25 13:35:22,708 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-07-25 13:35:22,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-07-25 13:35:22,708 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:22,708 INFO L354 BasicCegarLoop]: trace histogram [84, 1, 1, 1] [2018-07-25 13:35:22,708 INFO L415 AbstractCegarLoop]: === Iteration 85 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:22,709 INFO L82 PathProgramCache]: Analyzing trace with hash 2075131374, now seen corresponding path program 84 times [2018-07-25 13:35:22,709 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:22,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:23,570 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:23,571 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:23,571 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-07-25 13:35:23,571 INFO L451 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-07-25 13:35:23,571 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-07-25 13:35:23,571 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2018-07-25 13:35:23,572 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 87 states. [2018-07-25 13:35:32,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:35:32,805 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-07-25 13:35:32,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-07-25 13:35:32,805 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 87 [2018-07-25 13:35:32,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:35:32,806 INFO L225 Difference]: With dead ends: 91 [2018-07-25 13:35:32,806 INFO L226 Difference]: Without dead ends: 89 [2018-07-25 13:35:32,807 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3486 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=7479, Invalid=21591, Unknown=0, NotChecked=0, Total=29070 [2018-07-25 13:35:32,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-07-25 13:35:32,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-07-25 13:35:32,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-07-25 13:35:32,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-07-25 13:35:32,874 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 87 [2018-07-25 13:35:32,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:35:32,874 INFO L472 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-07-25 13:35:32,875 INFO L473 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-07-25 13:35:32,875 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-07-25 13:35:32,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-07-25 13:35:32,875 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:35:32,876 INFO L354 BasicCegarLoop]: trace histogram [85, 1, 1, 1] [2018-07-25 13:35:32,876 INFO L415 AbstractCegarLoop]: === Iteration 86 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:35:32,876 INFO L82 PathProgramCache]: Analyzing trace with hash -95421467, now seen corresponding path program 85 times [2018-07-25 13:35:32,876 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:35:32,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:35:33,660 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:33,661 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:35:33,661 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-07-25 13:35:33,662 INFO L451 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-07-25 13:35:33,662 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-07-25 13:35:33,662 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2018-07-25 13:35:33,663 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 88 states. Received shutdown request... [2018-07-25 13:35:35,172 WARN L177 SmtUtils]: Removed 62 from assertion stack [2018-07-25 13:35:35,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-25 13:35:35,172 WARN L541 AbstractCegarLoop]: Verification canceled [2018-07-25 13:35:35,178 WARN L202 ceAbstractionStarter]: Timeout [2018-07-25 13:35:35,178 INFO L202 PluginConnector]: Adding new model Luxembourg-ArraysIntegefied.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.07 01:35:35 BoogieIcfgContainer [2018-07-25 13:35:35,178 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-25 13:35:35,179 INFO L168 Benchmark]: Toolchain (without parser) took 260684.98 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: 209.7 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2018-07-25 13:35:35,180 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 13:35:35,180 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.68 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:35:35,181 INFO L168 Benchmark]: Boogie Preprocessor took 20.79 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:35:35,181 INFO L168 Benchmark]: RCFGBuilder took 316.34 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:35:35,182 INFO L168 Benchmark]: TraceAbstraction took 260308.81 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: 199.1 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. [2018-07-25 13:35:35,185 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 34.68 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 20.79 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 316.34 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 260308.81 ms. Allocated memory was 1.5 GB in the beginning and 3.6 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 1.3 GB in the end (delta: 199.1 MB). Peak memory consumption was 2.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 41]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 41). Cancelled while BasicCegarLoop was constructing difference of abstraction (89states) and interpolant automaton (currently 17 states, 88 states before enhancement), while PredicateUnifier was unifying predicates, while SimplifyDDAWithTimeout was simplifying term of DAG size 501. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 12 locations, 1 error locations. TIMEOUT Result, 260.2s OverallTime, 86 OverallIterations, 85 TraceHistogramMax, 228.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 258 SDtfs, 2 SDslu, 3657 SDs, 0 SdLazy, 7412 SolverSat, 3656 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7413 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 7326 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98890 ImplicationChecksByTransitivity, 241.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=89occurred in iteration=85, 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: 2.7s AutomataMinimizationTime, 85 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 25.4s InterpolantComputationTime, 3913 NumberOfCodeBlocks, 3913 NumberOfCodeBlocksAsserted, 86 NumberOfCheckSat, 3827 ConstructedInterpolants, 0 QuantifiedInterpolants, 3480930 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 86 InterpolantComputations, 1 PerfectInterpolantSequences, 0/105995 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/Luxembourg-ArraysIntegefied.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-07-25_13-35-35-196.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/Luxembourg-ArraysIntegefied.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-25_13-35-35-196.csv Completed graceful shutdown